{"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03132165,0.00006213598,0.95998585,0.00029023163,0.00005359108,0.00010183329,0.000073492,0.003894139,0.004217105],"genre_scores_gemma":[0.7075368,0.00006665939,0.28810552,0.00016925739,0.000041471307,0.00020987482,0.0001708019,0.0009324333,0.002767182],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9915283,0.0025944589,0.00047306743,0.0013662621,0.0032251924,0.0008128176],"domain_scores_gemma":[0.9868646,0.0060179005,0.00066869287,0.005429018,0.00078483234,0.00023499275],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0042579114,0.0009770031,0.001206719,0.00079013285,0.001103651,0.0017728801,0.0023956709,0.001034757,0.00382957],"category_scores_gemma":[0.016985724,0.0012285373,0.0023592936,0.00052090816,0.0034614592,0.005025073,0.006114552,0.0035703378,0.0008448401],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014913913,0.00044583692,0.0032809137,0.0007421501,0.00027839403,0.0007757029,0.0010027592,0.23945582,0.05329493,0.53436244,0.003712478,0.1611572],"study_design_scores_gemma":[0.00015869712,0.0001459497,0.00028517222,0.00007086019,0.00011495143,0.00016631569,0.00006255238,0.5057625,0.053886663,0.43483806,0.004463774,0.00004460495],"about_ca_topic_score_codex":0.0009996783,"about_ca_topic_score_gemma":0.001472247,"teacher_disagreement_score":0.0042579114,"about_ca_system_score_codex":0.0012254437,"about_ca_system_score_gemma":0.0025291978,"threshold_uncertainty_score":0.022518277},"labels":[],"label_agreement":null},{"id":"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008148692,0.000495405,0.95765746,0.00032778858,0.00019163897,0.00010219556,0.00010904649,0.0010647235,0.031903148],"genre_scores_gemma":[0.52466434,0.0011341738,0.4496519,0.0003358016,0.00044755082,0.00042634647,0.00058811804,0.00068661274,0.022065066],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99791604,0.00059376494,0.000150614,0.0002917079,0.000815409,0.00023252079],"domain_scores_gemma":[0.9966484,0.0018219362,0.00018860355,0.0007685289,0.00048578126,0.00008673823],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020857558,0.00093829347,0.0006666925,0.0015465396,0.00070484146,0.0016922744,0.0011855807,0.00083349436,0.009093189],"category_scores_gemma":[0.0057468372,0.0008629301,0.0012405448,0.0010343657,0.0032098896,0.0049943165,0.00209978,0.0031132365,0.0024065524],"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.000039126924,0.00001614891,0.00007232596,0.000095625546,0.000007795575,0.0000662873,0.00018239884,0.0034679566,0.0023409978,0.9646292,0.0015896894,0.0274926],"study_design_scores_gemma":[0.000026935499,0.000040178962,0.00011699255,0.00006673604,0.000031699416,0.00012577385,0.000042181266,0.021885823,0.005637656,0.9499218,0.022088148,0.000015988475],"about_ca_topic_score_codex":0.00060475664,"about_ca_topic_score_gemma":0.00064107386,"teacher_disagreement_score":0.009093189,"about_ca_system_score_codex":0.0013520528,"about_ca_system_score_gemma":0.0012635792,"threshold_uncertainty_score":0.030419767},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03313118,0.00010394988,0.96170217,0.0001991836,0.000033704226,0.00009025828,0.00003293578,0.0022389677,0.0024676537],"genre_scores_gemma":[0.6736315,0.0002145943,0.32261682,0.00013095474,0.000044574786,0.0001777672,0.00011340411,0.00033789474,0.0027323877],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9932348,0.0028480608,0.00046970937,0.0010498861,0.0019270438,0.0004705487],"domain_scores_gemma":[0.9922098,0.004139438,0.0007885153,0.0020882003,0.0006324,0.00014160873],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0045197434,0.000500898,0.0005131774,0.00069603825,0.0009122512,0.002029247,0.0017655881,0.0009183524,0.0015692136],"category_scores_gemma":[0.010280589,0.0005509182,0.00087127276,0.00042141599,0.0032424617,0.0038410968,0.002709294,0.0017303152,0.00027933874],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033813584,0.0001892322,0.00223635,0.00031101512,0.000070660215,0.00053547265,0.000970725,0.21082535,0.064207144,0.6080845,0.0013378419,0.11089367],"study_design_scores_gemma":[0.00008876563,0.00011666863,0.000455721,0.00008280765,0.0000463301,0.00028279907,0.00010318226,0.70295113,0.070525,0.21118866,0.014105652,0.000053404045],"about_ca_topic_score_codex":0.0016174889,"about_ca_topic_score_gemma":0.0016602476,"teacher_disagreement_score":0.0045197434,"about_ca_system_score_codex":0.001496746,"about_ca_system_score_gemma":0.0014343256,"threshold_uncertainty_score":0.023903012},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00033788243,0.0066999276,0.8730141,0.0018991788,0.00090911076,0.000111432004,0.0004135363,0.0023194232,0.1142953],"genre_scores_gemma":[0.05075459,0.022669079,0.7271862,0.001992298,0.0015212834,0.00072631665,0.0017905177,0.0039072456,0.18945245],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988446,0.0003990237,0.00008901698,0.00021342868,0.0003749489,0.00007893097],"domain_scores_gemma":[0.9990294,0.00051856297,0.000052295312,0.00022692597,0.00012646521,0.000046415505],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002167399,0.002249604,0.0010589578,0.0018417693,0.0012499618,0.0062829494,0.003384991,0.0028428556,0.03160077],"category_scores_gemma":[0.0029727872,0.0015102539,0.0017158386,0.0024676004,0.0038442984,0.009532763,0.002336437,0.0055249142,0.018971894],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009610857,0.0000090283065,0.000019785302,0.00016046794,0.0000072739153,0.000048235786,0.00012109165,0.0015995024,0.00028824765,0.946883,0.017310973,0.03354287],"study_design_scores_gemma":[0.000011172738,0.000007483729,0.00002629634,0.00023038444,0.000010040194,0.00019205954,0.000038894763,0.0065488336,0.0006957966,0.6727943,0.3194261,0.000018689732],"about_ca_topic_score_codex":0.0035240815,"about_ca_topic_score_gemma":0.0022096531,"teacher_disagreement_score":0.03160077,"about_ca_system_score_codex":0.002177072,"about_ca_system_score_gemma":0.0018872676,"threshold_uncertainty_score":0.105715096},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07095589,0.00058961945,0.8483362,0.001322629,0.00018993736,0.00026526247,0.002360613,0.0013178596,0.07466209],"genre_scores_gemma":[0.585604,0.00073362596,0.3924142,0.0004135124,0.00010359206,0.00026461686,0.0019241017,0.0006159243,0.017926462],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99856204,0.00050882547,0.000088692635,0.00018623061,0.00038392193,0.0002703393],"domain_scores_gemma":[0.995928,0.0026976084,0.00033112062,0.00057131547,0.00031425155,0.00015769736],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011695849,0.00054998614,0.0006654419,0.00090086804,0.0008306464,0.0025380226,0.0012732956,0.0011763788,0.0127572045],"category_scores_gemma":[0.00858247,0.00067164126,0.00057016057,0.0011827062,0.0011253378,0.0038227364,0.0013958346,0.0014118958,0.0019102751],"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.00046056128,0.00016355816,0.0011393192,0.0004293673,0.000045691286,0.00030749006,0.00018543661,0.11604079,0.00999894,0.7924302,0.012813664,0.06598505],"study_design_scores_gemma":[0.00008367198,0.00006716503,0.00033262564,0.00010801143,0.000037341317,0.00031017518,0.00016263654,0.1881397,0.0077868574,0.7853273,0.017613754,0.000030744235],"about_ca_topic_score_codex":0.0014036,"about_ca_topic_score_gemma":0.004182695,"teacher_disagreement_score":0.0127572045,"about_ca_system_score_codex":0.0014924144,"about_ca_system_score_gemma":0.0019405956,"threshold_uncertainty_score":0.042677104},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010911665,0.00024457872,0.9625624,0.0004069098,0.00014190313,0.00040932055,0.0004194131,0.0128766615,0.012027198],"genre_scores_gemma":[0.17261267,0.00027222134,0.8120479,0.00046403313,0.00009742845,0.000798324,0.00147966,0.0036639823,0.008563857],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9954477,0.0018133072,0.00033777097,0.00064962736,0.0012968994,0.00045468914],"domain_scores_gemma":[0.99619776,0.0019601942,0.00022783973,0.0010582823,0.0004317777,0.00012402041],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004569522,0.001184135,0.00094739516,0.001153859,0.00072317297,0.003983445,0.004349275,0.0017605829,0.019919295],"category_scores_gemma":[0.012436633,0.001358828,0.0021024314,0.0011531075,0.0015657276,0.0047657182,0.0030879094,0.0027234475,0.0053594997],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009468522,0.00046182756,0.0028080735,0.0008158278,0.000272067,0.00016272718,0.00027144732,0.17611924,0.015170765,0.42465279,0.037780043,0.34053832],"study_design_scores_gemma":[0.00018040383,0.00024649486,0.0002812194,0.000102383034,0.00008557621,0.00015894716,0.000042936263,0.8189465,0.018484272,0.1315288,0.0299079,0.000034552446],"about_ca_topic_score_codex":0.0009942416,"about_ca_topic_score_gemma":0.0020130419,"teacher_disagreement_score":0.019919295,"about_ca_system_score_codex":0.0022796297,"about_ca_system_score_gemma":0.0033517964,"threshold_uncertainty_score":0.06663674},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023577105,0.00028425158,0.9699791,0.0007816118,0.00010124695,0.00016831492,0.00036782643,0.0016786382,0.0030618594],"genre_scores_gemma":[0.56844115,0.00041098188,0.4213359,0.00065462675,0.00039721045,0.00041945546,0.0016449541,0.0010677106,0.005628031],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9887298,0.002801276,0.0010777427,0.0029151384,0.0031645186,0.0013115463],"domain_scores_gemma":[0.96149826,0.02199599,0.0026029379,0.00994789,0.0028202345,0.0011347581],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009203094,0.001967078,0.002444432,0.0041586384,0.0018985106,0.0052497173,0.005913547,0.0041972585,0.0033177936],"category_scores_gemma":[0.050077386,0.0011720089,0.0041462337,0.002452818,0.007913867,0.012293622,0.007415969,0.007968189,0.00090708974],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00065193826,0.00023123757,0.012720413,0.00047630235,0.00023796117,0.00076731766,0.0025647115,0.09511151,0.0054106945,0.6707953,0.009869082,0.20116346],"study_design_scores_gemma":[0.000029434543,0.00009520798,0.00089088,0.0001025003,0.000099934914,0.0002532877,0.00013990837,0.3216035,0.0032453244,0.67046124,0.0030268233,0.000051905357],"about_ca_topic_score_codex":0.004246143,"about_ca_topic_score_gemma":0.004368859,"teacher_disagreement_score":0.009203094,"about_ca_system_score_codex":0.0023482307,"about_ca_system_score_gemma":0.0027830456,"threshold_uncertainty_score":0.048671186},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008609922,0.0020774,0.9168664,0.0018178007,0.00028713275,0.000064276974,0.00025490907,0.0018585338,0.06816369],"genre_scores_gemma":[0.26347852,0.0038113284,0.7090305,0.001255471,0.00067960244,0.00020379617,0.0008611779,0.0016926253,0.018986901],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99849045,0.000595006,0.00007839019,0.00020226515,0.00047778164,0.0001560711],"domain_scores_gemma":[0.9958268,0.003141946,0.00012987903,0.00065660715,0.00017332826,0.000071489325],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020056493,0.0014069866,0.00087698636,0.0009902192,0.00074812456,0.0029078186,0.0022660096,0.0008579571,0.013042724],"category_scores_gemma":[0.008636466,0.0011811913,0.0015053047,0.0018223476,0.0018514856,0.0070270044,0.0037098727,0.005107316,0.0038781255],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023027322,0.0000979481,0.00034096514,0.00059938664,0.000106310195,0.00015504092,0.00019861454,0.064699285,0.0060268566,0.6846311,0.017492034,0.22542222],"study_design_scores_gemma":[0.0000448892,0.000034386343,0.000093353294,0.00012410805,0.000043083437,0.000112065514,0.000038043523,0.19611351,0.00482612,0.77378887,0.024758553,0.00002304705],"about_ca_topic_score_codex":0.00094806374,"about_ca_topic_score_gemma":0.0017658091,"teacher_disagreement_score":0.013042724,"about_ca_system_score_codex":0.0008132008,"about_ca_system_score_gemma":0.0011514385,"threshold_uncertainty_score":0.04363221},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007654755,0.000063311054,0.996552,0.00012258755,0.000027725257,0.0001845505,0.00007888743,0.0008720887,0.001333357],"genre_scores_gemma":[0.033478636,0.0002279925,0.96232754,0.00020382283,0.000045844463,0.0005616678,0.0003327531,0.00047023495,0.002351508],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9887707,0.0035407024,0.0014074972,0.002367571,0.0032225705,0.00069095806],"domain_scores_gemma":[0.984362,0.0065811393,0.0006768356,0.0059229685,0.0021413174,0.00031567723],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008239971,0.001756355,0.0014362746,0.0022825631,0.0011635998,0.0046413722,0.0054619033,0.002355279,0.012170147],"category_scores_gemma":[0.028760754,0.001958324,0.0038823574,0.0019144908,0.0032427607,0.0075767534,0.0057032946,0.005563302,0.0049616024],"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.00018108726,0.00017674296,0.0003515302,0.00063187315,0.00012377836,0.00025474516,0.0004731421,0.012871312,0.01110811,0.8194651,0.0042791185,0.15008342],"study_design_scores_gemma":[0.00038291956,0.00029019034,0.00026062678,0.00037301797,0.00030230757,0.0010515887,0.00015577614,0.16289859,0.04756993,0.7146046,0.071962565,0.00014795641],"about_ca_topic_score_codex":0.0011572642,"about_ca_topic_score_gemma":0.0013365969,"teacher_disagreement_score":0.012170147,"about_ca_system_score_codex":0.002018836,"about_ca_system_score_gemma":0.0034168602,"threshold_uncertainty_score":0.04357767},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026166597,0.00009990108,0.9796296,0.000048019767,0.000049295424,0.000090102694,0.0001444425,0.015256031,0.0020660218],"genre_scores_gemma":[0.13620947,0.0006103278,0.8401022,0.00017048976,0.000053677788,0.00036838572,0.0014194533,0.0080851875,0.012980813],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99895334,0.00018863041,0.000109064655,0.00020111723,0.00044847748,0.00009938532],"domain_scores_gemma":[0.9986771,0.00048003235,0.00007514592,0.000611398,0.00011894649,0.000037449456],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015576666,0.0015591808,0.0009918067,0.0006925783,0.00040342368,0.0016199782,0.003425934,0.0013168688,0.01052407],"category_scores_gemma":[0.0032084316,0.0015258489,0.0022668734,0.0006222296,0.0010721873,0.0031414814,0.0025788087,0.0025401963,0.0029908034],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006037265,0.00029819313,0.0012243069,0.001062996,0.00023862367,0.00094237586,0.0006864566,0.26500943,0.056077436,0.35391295,0.01665332,0.30329013],"study_design_scores_gemma":[0.00012024756,0.00008551105,0.00019889766,0.00017263777,0.00013252259,0.0003437299,0.000035065023,0.78418046,0.0356549,0.11655182,0.06246165,0.00006256456],"about_ca_topic_score_codex":0.0015442711,"about_ca_topic_score_gemma":0.002436801,"teacher_disagreement_score":0.01052407,"about_ca_system_score_codex":0.00064296485,"about_ca_system_score_gemma":0.0010353797,"threshold_uncertainty_score":0.035206497},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004545987,0.00026724098,0.98948425,0.00019592998,0.000042914035,0.00011203644,0.00007815335,0.00024153435,0.0050318674],"genre_scores_gemma":[0.1687251,0.0010135532,0.82422024,0.00018010485,0.00013802694,0.00053005124,0.00037275805,0.00013748003,0.004682667],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980179,0.00089610944,0.00015417584,0.00024776012,0.00055157836,0.0001325226],"domain_scores_gemma":[0.99798054,0.0011151164,0.00017436768,0.00035409862,0.00025892997,0.000116979434],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031886355,0.0007046091,0.0005661044,0.0013437535,0.0013355777,0.0019752542,0.0015762637,0.0010049993,0.0067099086],"category_scores_gemma":[0.00455967,0.00043161135,0.0021173824,0.001602355,0.002809572,0.005664913,0.002366259,0.0034061603,0.0010939732],"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.000017076973,0.000023403307,0.00011302512,0.00011226433,0.000017428156,0.000043808155,0.00013352472,0.007807035,0.0008784389,0.9722177,0.0007243476,0.017912013],"study_design_scores_gemma":[0.000014053318,0.000031435597,0.00006156382,0.000044888908,0.000021465548,0.000075395976,0.000059039918,0.043007206,0.0017467112,0.94407463,0.010840799,0.000022818753],"about_ca_topic_score_codex":0.0011113966,"about_ca_topic_score_gemma":0.0020087499,"teacher_disagreement_score":0.0067099086,"about_ca_system_score_codex":0.0012130014,"about_ca_system_score_gemma":0.0020663913,"threshold_uncertainty_score":0.02244687},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018169416,0.00032203546,0.9755195,0.00027215932,0.000041047064,0.00009831328,0.000077020304,0.0009637938,0.004536759],"genre_scores_gemma":[0.40806404,0.00031595997,0.5852894,0.0002502472,0.000054872315,0.00059954,0.00033410074,0.00044251807,0.00464936],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99799144,0.0008029565,0.00013983705,0.0003632459,0.00044347384,0.0002590306],"domain_scores_gemma":[0.98756135,0.011017809,0.00039277392,0.0005408007,0.0003311588,0.00015614709],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003515425,0.0012536645,0.0017631786,0.0016215815,0.0010090787,0.0019792533,0.0016385138,0.0018979784,0.005889469],"category_scores_gemma":[0.013472267,0.000952684,0.0014837154,0.0014614932,0.0026430225,0.0027212286,0.0022515259,0.0028789998,0.00063941994],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023650732,0.00012767913,0.00056862127,0.00023289144,0.000056571742,0.000112311136,0.00016161748,0.8571613,0.0015775991,0.06796994,0.0014550736,0.07033993],"study_design_scores_gemma":[0.00004491427,0.000034347984,0.000043678032,0.000017113996,0.000014451353,0.000014273377,0.000013935716,0.93917805,0.00072240166,0.05944834,0.00046096544,0.000007431999],"about_ca_topic_score_codex":0.0039525996,"about_ca_topic_score_gemma":0.004675722,"teacher_disagreement_score":0.005889469,"about_ca_system_score_codex":0.0021704836,"about_ca_system_score_gemma":0.002684752,"threshold_uncertainty_score":0.019702256},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013058462,0.00010473558,0.9804586,0.00032918036,0.00002464951,0.000058224683,0.000120344994,0.00058834744,0.0052574384],"genre_scores_gemma":[0.44059074,0.00028920663,0.553815,0.00033061992,0.000048808877,0.00022022439,0.00043434766,0.00016405253,0.004106932],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990127,0.00035838847,0.000043092397,0.00014644228,0.00034018114,0.000099249046],"domain_scores_gemma":[0.99866664,0.0007418738,0.00009045737,0.00027000636,0.0001923378,0.00003863657],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00088006683,0.0005044105,0.0005052451,0.00093624933,0.0004297839,0.0015425825,0.0011298099,0.0007902559,0.0050993245],"category_scores_gemma":[0.0044499086,0.00034426883,0.00074508647,0.0009746811,0.0013072249,0.0028184312,0.0016510896,0.0019448207,0.00071978814],"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.00017246102,0.00013313595,0.00045884858,0.00018985951,0.000028913739,0.0001859974,0.00014927804,0.20190322,0.014205786,0.5835615,0.00313419,0.19587676],"study_design_scores_gemma":[0.000038215498,0.00008134528,0.00008719945,0.000026855285,0.00002625243,0.000121081874,0.000033805365,0.6142397,0.0077869887,0.3696545,0.007889878,0.000014203688],"about_ca_topic_score_codex":0.0010449816,"about_ca_topic_score_gemma":0.0014274347,"teacher_disagreement_score":0.0050993245,"about_ca_system_score_codex":0.00092489476,"about_ca_system_score_gemma":0.0010458062,"threshold_uncertainty_score":0.017058969},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06444373,0.00055120117,0.9202427,0.0008244062,0.00016693931,0.00019354241,0.0013561875,0.0015325139,0.010688626],"genre_scores_gemma":[0.660889,0.00065865554,0.324228,0.00079777854,0.00018050139,0.00081406743,0.0030951542,0.00044249147,0.008894369],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963601,0.0007373915,0.00069720804,0.0008705914,0.0010911177,0.00024356629],"domain_scores_gemma":[0.9798003,0.009989959,0.0012515478,0.0058155605,0.0027974814,0.0003452345],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002854552,0.0006268047,0.0007365268,0.0010490243,0.0009880691,0.0024339478,0.0015051729,0.00115683,0.0044783307],"category_scores_gemma":[0.018126832,0.00076143065,0.0015381009,0.0014018234,0.001949354,0.007097195,0.0021852674,0.002351098,0.0010281977],"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.00036768397,0.00012384159,0.0029961579,0.00035851228,0.0000663972,0.00055177324,0.0011115427,0.032465577,0.017769957,0.8595307,0.002618392,0.08203945],"study_design_scores_gemma":[0.00006472026,0.000113030765,0.00046405147,0.00010233784,0.000068539295,0.00082521886,0.00013167511,0.18266515,0.014741045,0.7815136,0.019250456,0.000060221475],"about_ca_topic_score_codex":0.0013928947,"about_ca_topic_score_gemma":0.0015872024,"teacher_disagreement_score":0.0044783307,"about_ca_system_score_codex":0.0010420538,"about_ca_system_score_gemma":0.0012617349,"threshold_uncertainty_score":0.015096486},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010018425,0.000063373205,0.98759997,0.00007996972,0.000019125893,0.00007838229,0.000084973864,0.0010125141,0.0010431341],"genre_scores_gemma":[0.33057752,0.00016320564,0.6657483,0.00011842851,0.000023861772,0.00038023933,0.00051354885,0.00026567624,0.0022091686],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986582,0.00037140684,0.00007169019,0.0001667726,0.0006079764,0.00012397235],"domain_scores_gemma":[0.9986726,0.0007708301,0.00006836031,0.00033644048,0.00012818366,0.000023652081],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007864165,0.000789788,0.000803884,0.0012667895,0.00050484575,0.00088381185,0.0013215049,0.0006521085,0.0030676501],"category_scores_gemma":[0.0023858154,0.00050103193,0.00209198,0.0005931318,0.0011184232,0.0012432092,0.0014700602,0.0019990765,0.0005392992],"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.00028415807,0.00026776854,0.0014581982,0.00046949042,0.00020667865,0.0006548507,0.00043380843,0.5302155,0.05875903,0.23856977,0.0021733409,0.16650744],"study_design_scores_gemma":[0.000046649297,0.00009782613,0.0001609205,0.000028312938,0.00006757407,0.000118783064,0.000023714847,0.89016443,0.025462484,0.079412416,0.004393088,0.000023786535],"about_ca_topic_score_codex":0.0022524945,"about_ca_topic_score_gemma":0.002906134,"teacher_disagreement_score":0.0030676501,"about_ca_system_score_codex":0.00091182836,"about_ca_system_score_gemma":0.0011012817,"threshold_uncertainty_score":0.0102623105},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013754173,0.00012349825,0.9655147,0.00019278724,0.000062804465,0.00025211426,0.0011678122,0.0019135877,0.017018503],"genre_scores_gemma":[0.18687968,0.00028716194,0.7962323,0.00010004223,0.000026835456,0.00034002907,0.0025504152,0.00035432045,0.013229141],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99975675,0.000044164593,0.000018011147,0.000052149797,0.0000919804,0.000036981506],"domain_scores_gemma":[0.99970967,0.00010915556,0.00001588794,0.000083271865,0.00006132317,0.00002067086],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028927834,0.00037773603,0.0003773759,0.000892949,0.0006189661,0.0011863941,0.0008635391,0.000574107,0.010611381],"category_scores_gemma":[0.0010421531,0.00032987524,0.00061817584,0.0012882628,0.0003612827,0.0016356722,0.00092279894,0.0010241347,0.0019358994],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019085324,0.00026518194,0.0005425355,0.0005001745,0.000039045626,0.00035374536,0.00047215685,0.038308024,0.028452162,0.5038464,0.019479148,0.40755054],"study_design_scores_gemma":[0.00010316859,0.00012002329,0.00054691796,0.00016513311,0.00011504634,0.00067875633,0.000241815,0.3544472,0.02740517,0.51011026,0.10600392,0.00006259729],"about_ca_topic_score_codex":0.0014160824,"about_ca_topic_score_gemma":0.004148329,"teacher_disagreement_score":0.010611381,"about_ca_system_score_codex":0.0006430844,"about_ca_system_score_gemma":0.0010387839,"threshold_uncertainty_score":0.03549862},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012337783,0.059178594,0.3653236,0.13551147,0.009838288,0.00021680568,0.0014850441,0.008091941,0.4080164],"genre_scores_gemma":[0.38909227,0.0342403,0.30607504,0.03837946,0.0067121508,0.00060211157,0.0024392565,0.0065320088,0.2159275],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9935174,0.0022630491,0.00035416955,0.00051378587,0.0030147769,0.00033689165],"domain_scores_gemma":[0.95623404,0.033495776,0.0013737698,0.0038544678,0.0038127406,0.0012292702],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0070710494,0.0012361824,0.0013956178,0.0019181544,0.0008357223,0.0046856413,0.0019625793,0.0026651856,0.039406054],"category_scores_gemma":[0.05058906,0.0007244149,0.0007407509,0.0013537323,0.0035113983,0.014826571,0.0017709293,0.0033674529,0.014191012],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018374363,0.00012973456,0.0014743075,0.0007553113,0.000091341826,0.0001272835,0.00022467077,0.0018534926,0.0011594911,0.17044069,0.15058021,0.67297965],"study_design_scores_gemma":[0.00006745757,0.00010262536,0.0008311144,0.0008861637,0.00008321118,0.0004405693,0.00037731,0.0038271174,0.002283371,0.7233417,0.2677058,0.00005364602],"about_ca_topic_score_codex":0.001070386,"about_ca_topic_score_gemma":0.0016748018,"teacher_disagreement_score":0.039406054,"about_ca_system_score_codex":0.0009918753,"about_ca_system_score_gemma":0.0016264716,"threshold_uncertainty_score":0.1318264},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001311182,0.0005883322,0.9809692,0.00010092851,0.00014954896,0.00006786982,0.0003204251,0.0069665182,0.009525989],"genre_scores_gemma":[0.061516948,0.002094099,0.89765495,0.0001826374,0.00018393701,0.00032030029,0.0020327969,0.005422679,0.030591678],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983917,0.0002980655,0.00014082209,0.00029420463,0.00079391967,0.000081259655],"domain_scores_gemma":[0.9984276,0.0008575696,0.00008987591,0.0004001403,0.00019059509,0.00003425653],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014576223,0.0018539354,0.0008918462,0.0013051659,0.00052163657,0.0025808993,0.0021909694,0.0013263747,0.012926213],"category_scores_gemma":[0.0045790146,0.0017275318,0.0013417643,0.0015226528,0.0013687335,0.0035605123,0.0015975928,0.0021722533,0.0072583407],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014437734,0.00007177429,0.00040526246,0.001224236,0.00006646601,0.00049474434,0.0005181789,0.05605544,0.021162838,0.27684423,0.05139338,0.591619],"study_design_scores_gemma":[0.00008136314,0.00012246,0.00031918392,0.0005362838,0.00008170208,0.0011788529,0.00010690343,0.27278087,0.06432125,0.32458782,0.33577543,0.000107855485],"about_ca_topic_score_codex":0.001729463,"about_ca_topic_score_gemma":0.0019227014,"teacher_disagreement_score":0.012926213,"about_ca_system_score_codex":0.0007255991,"about_ca_system_score_gemma":0.0015831009,"threshold_uncertainty_score":0.043242514},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0080395145,0.010599531,0.80700004,0.0042283107,0.0005128442,0.00013529508,0.000316863,0.0011158073,0.16805182],"genre_scores_gemma":[0.3803013,0.021345178,0.48103723,0.0009688939,0.0006087328,0.0004277042,0.0008974795,0.00076195813,0.113651626],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99898237,0.00033966702,0.00005096048,0.00012629617,0.00044868985,0.000051961717],"domain_scores_gemma":[0.9974995,0.0016792981,0.000089346126,0.00048280027,0.00021694935,0.000032215383],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015183121,0.0010981854,0.0007350641,0.000954092,0.00063718937,0.003379815,0.0018340773,0.0015029896,0.006417367],"category_scores_gemma":[0.004336613,0.0009305737,0.0010495986,0.00074432965,0.003446928,0.004996305,0.0010468339,0.002949281,0.0015011901],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009245453,0.000019379051,0.00013455116,0.00014056612,0.000016615473,0.000048860657,0.00018421364,0.02966562,0.0007909843,0.93249774,0.005867178,0.030625079],"study_design_scores_gemma":[0.000008647985,0.0000148981535,0.00013405284,0.0002630566,0.000018440029,0.000085442705,0.000048309394,0.08552283,0.0022167047,0.8308225,0.08084802,0.000017091965],"about_ca_topic_score_codex":0.004706543,"about_ca_topic_score_gemma":0.0035056933,"teacher_disagreement_score":0.006417367,"about_ca_system_score_codex":0.001931846,"about_ca_system_score_gemma":0.0020534475,"threshold_uncertainty_score":0.021468222},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00796463,0.00017861232,0.97660214,0.0001719822,0.000079838326,0.00015246852,0.00019525361,0.011128888,0.0035262],"genre_scores_gemma":[0.47490147,0.000399007,0.50837076,0.00031491273,0.00010628325,0.0006502796,0.0014532001,0.0038527146,0.009951374],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99746037,0.00066298735,0.00015836034,0.00038680062,0.0010501805,0.000281267],"domain_scores_gemma":[0.99496305,0.0022303096,0.00020942723,0.0018614582,0.0006536074,0.00008206523],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020514433,0.0012986424,0.000995074,0.0009968845,0.0009780113,0.0015163501,0.0024396079,0.0008872688,0.009231595],"category_scores_gemma":[0.0073272204,0.00074124377,0.0016891998,0.00072353485,0.0016067254,0.002657751,0.002909993,0.0024339731,0.0017567539],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00089057046,0.0003878774,0.0020946236,0.001236841,0.00028408153,0.00073490146,0.0007795148,0.17810982,0.04066939,0.23736292,0.02459992,0.51284957],"study_design_scores_gemma":[0.00009217063,0.000111563284,0.0003699782,0.00010332432,0.0000773496,0.00020482209,0.00013600467,0.704725,0.056037996,0.22419153,0.013899469,0.00005064295],"about_ca_topic_score_codex":0.003980423,"about_ca_topic_score_gemma":0.005252659,"teacher_disagreement_score":0.009231595,"about_ca_system_score_codex":0.0013875148,"about_ca_system_score_gemma":0.0022960957,"threshold_uncertainty_score":0.030882776},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0067005325,0.00020300354,0.9852063,0.00013261772,0.000075030766,0.000046943118,0.000040888946,0.0005781973,0.0070165987],"genre_scores_gemma":[0.4173835,0.0010468769,0.55962265,0.00022168165,0.00016164532,0.00045912573,0.00027981235,0.0006794108,0.020145373],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986243,0.0004736033,0.00015735754,0.00025795057,0.00033042318,0.0001562566],"domain_scores_gemma":[0.9963211,0.0025092405,0.00023137688,0.00054518465,0.0002902105,0.000103017526],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018230035,0.0012577729,0.00066751515,0.0010310182,0.0011853916,0.0021730163,0.0016936718,0.0013166369,0.0062074345],"category_scores_gemma":[0.0052573895,0.0012861253,0.0015911305,0.0010408608,0.0037180786,0.0066284165,0.0023953028,0.0024485434,0.0012447069],"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.00008924719,0.00004943753,0.00045805032,0.00024380183,0.000025166124,0.00031139905,0.0008394859,0.043759905,0.00623442,0.9095869,0.001234617,0.037167568],"study_design_scores_gemma":[0.000033388587,0.000044157583,0.00010066771,0.0000615778,0.000057064484,0.00021602538,0.000104675055,0.1572379,0.008514176,0.81158316,0.022009214,0.00003799741],"about_ca_topic_score_codex":0.0025597725,"about_ca_topic_score_gemma":0.002796941,"teacher_disagreement_score":0.0062074345,"about_ca_system_score_codex":0.00082614506,"about_ca_system_score_gemma":0.0011431478,"threshold_uncertainty_score":0.02076596},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0038748279,0.00023661027,0.9818507,0.00019716902,0.00008060092,0.00012092422,0.000043724198,0.0018151698,0.011780347],"genre_scores_gemma":[0.31159177,0.00078850315,0.66627306,0.0003419266,0.00023091912,0.00036220296,0.0007474156,0.0021264069,0.017537724],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99261934,0.0025447195,0.00035667693,0.0011136305,0.0027967899,0.0005688232],"domain_scores_gemma":[0.99170214,0.0045750365,0.00018777067,0.0024490755,0.00093068933,0.00015522499],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00631821,0.0013757272,0.0017048257,0.0021044603,0.0010486975,0.0035030958,0.0029833196,0.0013241658,0.008997709],"category_scores_gemma":[0.013490494,0.0013097972,0.0020812626,0.0016104133,0.004417514,0.011190709,0.005692532,0.0042666476,0.0028104673],"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.00021138428,0.0002113746,0.0002541006,0.00040300618,0.000054238706,0.0001148928,0.00030510934,0.015375555,0.0060732374,0.65121853,0.0064235907,0.31935492],"study_design_scores_gemma":[0.00006449109,0.00007798149,0.00016395948,0.00010693851,0.000060419854,0.0001425381,0.00006277886,0.103352465,0.01898535,0.85662836,0.020311626,0.000043018055],"about_ca_topic_score_codex":0.0013627463,"about_ca_topic_score_gemma":0.0012989356,"teacher_disagreement_score":0.008997709,"about_ca_system_score_codex":0.0013558278,"about_ca_system_score_gemma":0.002215422,"threshold_uncertainty_score":0.033414304},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00072713924,0.0001650045,0.9980667,0.00005952093,0.000025405092,0.0000111869695,0.000011108076,0.000043210533,0.00089073594],"genre_scores_gemma":[0.17712834,0.0009874066,0.8186135,0.00015313765,0.00035468736,0.00016724544,0.00006308879,0.00010810839,0.0024244848],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99550617,0.0017744129,0.00035065343,0.0004981535,0.0016582322,0.00021238229],"domain_scores_gemma":[0.99341726,0.0044868807,0.00040654076,0.00082436966,0.0007101551,0.00015477],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006470163,0.0011554571,0.0012627689,0.003410725,0.00068683125,0.0020003754,0.001490126,0.00081793626,0.0018007407],"category_scores_gemma":[0.013292975,0.0005867833,0.0026514337,0.002373166,0.0021787311,0.003938472,0.0018499116,0.0035226769,0.00038233201],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002191814,0.00003284415,0.00025491323,0.00011896968,0.000056906116,0.00008139835,0.00014021464,0.040658113,0.0023748742,0.8921958,0.00073673704,0.06332728],"study_design_scores_gemma":[0.000009766461,0.000059942762,0.00022963226,0.00005356187,0.000066010216,0.00013143194,0.000024024288,0.27117267,0.0017930006,0.7203952,0.0060236976,0.000041084237],"about_ca_topic_score_codex":0.0014410437,"about_ca_topic_score_gemma":0.001241342,"teacher_disagreement_score":0.006470163,"about_ca_system_score_codex":0.0014600118,"about_ca_system_score_gemma":0.0014347811,"threshold_uncertainty_score":0.034217894},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042530924,0.00079524977,0.9410369,0.00042709644,0.00014549785,0.00005904558,0.0000409576,0.0007914128,0.014172994],"genre_scores_gemma":[0.62131286,0.0016190454,0.37006277,0.00017574347,0.000057666417,0.00015286458,0.0001019942,0.00027584354,0.00624128],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99963486,0.00011752364,0.000022863116,0.000059613656,0.0001220195,0.00004308483],"domain_scores_gemma":[0.9996469,0.00016459696,0.000021647284,0.00010246847,0.000043045224,0.000021339965],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005941063,0.00037604143,0.0003555535,0.00031193672,0.0003503626,0.000952077,0.00069629605,0.00055240496,0.002567775],"category_scores_gemma":[0.0009767268,0.00031991804,0.00057674834,0.00041641487,0.0011691299,0.0010180139,0.0009521441,0.0011623153,0.00039004665],"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.0001471641,0.0000785081,0.0008725394,0.00025522863,0.000056250738,0.00019295796,0.00042975775,0.53500015,0.03539686,0.34764698,0.00087043876,0.079053245],"study_design_scores_gemma":[0.00003408845,0.00009176686,0.00016895804,0.00004423599,0.000021029304,0.000052685366,0.00006771008,0.846444,0.01947847,0.12232365,0.011254379,0.000019045885],"about_ca_topic_score_codex":0.0033242095,"about_ca_topic_score_gemma":0.0028314379,"teacher_disagreement_score":0.0033242095,"about_ca_system_score_codex":0.00071825564,"about_ca_system_score_gemma":0.0010493966,"threshold_uncertainty_score":0.008590043},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023080608,0.00044611061,0.96461374,0.0006015545,0.000100506455,0.00026581614,0.000062743944,0.0017561668,0.009072636],"genre_scores_gemma":[0.41231087,0.00047328495,0.57706684,0.00025891382,0.00008023477,0.00081020413,0.00022797109,0.00017778517,0.008593929],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977216,0.0007372951,0.00013804041,0.0003289027,0.0009107479,0.00016343017],"domain_scores_gemma":[0.9977164,0.0006612863,0.0002618269,0.00074463314,0.00045232126,0.00016358729],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011747899,0.00068634737,0.00047260048,0.0006741597,0.00048022266,0.0014561462,0.001895653,0.0013415061,0.0040619522],"category_scores_gemma":[0.0034830703,0.000325175,0.00056153146,0.0006250881,0.0013515012,0.0017161776,0.0015457945,0.0014612025,0.0007873395],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037937728,0.0005756141,0.0038912082,0.00055665325,0.00006814858,0.0010134167,0.0010570246,0.16716032,0.043189388,0.58014846,0.005316729,0.19664364],"study_design_scores_gemma":[0.00036713286,0.00064140576,0.0021984759,0.00020099654,0.00008207026,0.001138762,0.00029193438,0.74684805,0.04328905,0.1553951,0.049441855,0.0001050568],"about_ca_topic_score_codex":0.0014270466,"about_ca_topic_score_gemma":0.0015846662,"teacher_disagreement_score":0.0040619522,"about_ca_system_score_codex":0.0013476689,"about_ca_system_score_gemma":0.0013087359,"threshold_uncertainty_score":0.013588607},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012691795,0.00006231652,0.9826559,0.00016430981,0.0000385799,0.00005776575,0.000049995717,0.0009453573,0.0033339567],"genre_scores_gemma":[0.7310223,0.00016878148,0.2603151,0.0001767459,0.00011956478,0.00019657834,0.0004068984,0.0006824424,0.006911628],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9967873,0.00067842694,0.00021380822,0.0008078659,0.0011411138,0.00037153432],"domain_scores_gemma":[0.9877615,0.007996131,0.00064260146,0.0020075857,0.0012698289,0.00032242783],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020126337,0.00087820133,0.0014303944,0.001577839,0.0007189716,0.0017783999,0.0023872512,0.0011815446,0.007590017],"category_scores_gemma":[0.017808376,0.0005707826,0.001262033,0.0012060399,0.0025452662,0.005510429,0.003506716,0.003610412,0.00072336046],"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.000459117,0.00032192998,0.0015816223,0.0002446867,0.000080036116,0.00017869203,0.00029512474,0.30122268,0.00838086,0.37630707,0.0042776517,0.30665046],"study_design_scores_gemma":[0.00002232582,0.000048515994,0.00014572681,0.0000189811,0.000014435542,0.00004315349,0.000025575157,0.7454635,0.0036119074,0.24947427,0.0011188687,0.000012829824],"about_ca_topic_score_codex":0.002065711,"about_ca_topic_score_gemma":0.0021694524,"teacher_disagreement_score":0.007590017,"about_ca_system_score_codex":0.0016550819,"about_ca_system_score_gemma":0.0015756884,"threshold_uncertainty_score":0.025391161},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016047226,0.000047395577,0.97673166,0.00018357938,0.000062756786,0.00016230655,0.000093593255,0.0021673972,0.0045041363],"genre_scores_gemma":[0.343503,0.00012542338,0.649211,0.00013856053,0.000034254426,0.0002584813,0.00027119924,0.00042301376,0.006035015],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986266,0.00043924773,0.00014296098,0.00020535986,0.00042704694,0.00015881864],"domain_scores_gemma":[0.99662673,0.002186379,0.00020646268,0.0005420552,0.0003326511,0.000105669984],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002086856,0.00054193026,0.00048369757,0.0008136519,0.0006905105,0.0022214002,0.0012964582,0.0012237787,0.0062040137],"category_scores_gemma":[0.006505508,0.0005922514,0.0008620683,0.00045281113,0.0024311556,0.002512319,0.0024192801,0.0016981483,0.0006604538],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040944747,0.00023543958,0.0014608866,0.00034561628,0.00007383762,0.0011902057,0.0008978654,0.18772046,0.015376253,0.68832386,0.0024680623,0.101498],"study_design_scores_gemma":[0.00017891846,0.00013564322,0.00031119297,0.000100976395,0.00009169025,0.00029271998,0.000100827834,0.655059,0.026875628,0.3006106,0.016193315,0.000049561062],"about_ca_topic_score_codex":0.0031002525,"about_ca_topic_score_gemma":0.0037187433,"teacher_disagreement_score":0.0062040137,"about_ca_system_score_codex":0.0009425679,"about_ca_system_score_gemma":0.0022910708,"threshold_uncertainty_score":0.020754457},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03334329,0.0005570105,0.91374004,0.0014616296,0.0007084938,0.00044136445,0.0009956276,0.01840341,0.030349107],"genre_scores_gemma":[0.39972025,0.0005220492,0.54868543,0.002129523,0.0005050197,0.0005351369,0.0028415187,0.005381639,0.039679393],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9900918,0.0024183008,0.00062333536,0.0020182426,0.0029929674,0.0018553945],"domain_scores_gemma":[0.9693019,0.01473134,0.0006184365,0.012052754,0.0027592173,0.0005363251],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0061475765,0.0029717698,0.002737822,0.002561837,0.002764894,0.003996983,0.0047927895,0.0028125248,0.029091297],"category_scores_gemma":[0.025986802,0.0021961294,0.0048656925,0.0025949478,0.005473081,0.014932195,0.009753557,0.0063495445,0.008907485],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0020849262,0.00055163336,0.0041606985,0.0010517815,0.0003091638,0.00097610336,0.0007407258,0.049901262,0.017903766,0.4099636,0.042010497,0.47034577],"study_design_scores_gemma":[0.00022379997,0.00020758527,0.00059789116,0.00019446213,0.00033514755,0.00027611098,0.00013858193,0.14618401,0.024094982,0.80920535,0.018442146,0.000099933604],"about_ca_topic_score_codex":0.0043812385,"about_ca_topic_score_gemma":0.0072525293,"teacher_disagreement_score":0.029091297,"about_ca_system_score_codex":0.0017722144,"about_ca_system_score_gemma":0.0051666554,"threshold_uncertainty_score":0.09732008},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11463347,0.0039786315,0.79756916,0.00048726084,0.00076034956,0.0002433433,0.00083927735,0.014006427,0.06748213],"genre_scores_gemma":[0.59960306,0.00084138993,0.37431467,0.00033860077,0.00008993675,0.00019519638,0.0011129504,0.0003093403,0.02319488],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997416,0.00006236659,0.00001757638,0.000038268034,0.00009825312,0.000042079908],"domain_scores_gemma":[0.9994867,0.00026276518,0.00003442662,0.00009175652,0.00009866163,0.000025661202],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002995652,0.0005051401,0.00039451188,0.00070159347,0.00031532295,0.00082809455,0.0012504094,0.00048083617,0.027209489],"category_scores_gemma":[0.00089727266,0.0003737582,0.00030900107,0.00088905654,0.00015132796,0.0008373588,0.00044394808,0.00073789497,0.0035090533],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0026984157,0.0003766345,0.0027874054,0.0008442974,0.0002190884,0.0006028641,0.00017871158,0.06853591,0.11947063,0.057471026,0.039077125,0.70773786],"study_design_scores_gemma":[0.00038266418,0.0011557337,0.0026144132,0.00018455922,0.0001764097,0.0008618255,0.00011830774,0.7569372,0.14708172,0.024881648,0.065533035,0.00007252299],"about_ca_topic_score_codex":0.000790917,"about_ca_topic_score_gemma":0.002218202,"teacher_disagreement_score":0.027209489,"about_ca_system_score_codex":0.0005139256,"about_ca_system_score_gemma":0.00054208934,"threshold_uncertainty_score":0.091024816},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030035786,0.23590827,0.5909734,0.041213114,0.000990858,0.00014075647,0.00015693043,0.00077633344,0.09980455],"genre_scores_gemma":[0.39328107,0.21565859,0.36511308,0.004702924,0.0022394557,0.00023314831,0.0005736348,0.0004177411,0.017780397],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9898371,0.005916516,0.0004824648,0.0007249531,0.0025803605,0.00045860783],"domain_scores_gemma":[0.9711158,0.01899288,0.0004403239,0.002437769,0.0057430407,0.0012701242],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.03474772,0.0016201894,0.0010100987,0.002329179,0.0010108463,0.006292588,0.004108015,0.003102843,0.0059354343],"category_scores_gemma":[0.026799643,0.0006998999,0.00074065593,0.0020162554,0.006515711,0.01404786,0.00336442,0.0048967497,0.0019193589],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00048493757,0.00061302027,0.002307947,0.0012992005,0.00007974484,0.00047379846,0.004751356,0.012746081,0.0030547322,0.43106142,0.015022082,0.52810574],"study_design_scores_gemma":[0.0002632258,0.0010072469,0.0011272752,0.002794784,0.000052483592,0.0013080115,0.0041093593,0.039832525,0.009937045,0.5017534,0.43758112,0.00023360246],"about_ca_topic_score_codex":0.003277296,"about_ca_topic_score_gemma":0.0014372735,"teacher_disagreement_score":0.03474772,"about_ca_system_score_codex":0.0032118596,"about_ca_system_score_gemma":0.0022209235,"threshold_uncertainty_score":0.18376571},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024488779,0.0021219216,0.94052833,0.0040942812,0.00019265451,0.000092571085,0.00022223363,0.00042299292,0.027836252],"genre_scores_gemma":[0.42031664,0.002659146,0.564643,0.0010320717,0.00051042746,0.0002418767,0.00053995964,0.00020161716,0.009855289],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99807274,0.0007631331,0.00010808773,0.0004243799,0.0004592736,0.00017239392],"domain_scores_gemma":[0.994584,0.0041789366,0.00022706685,0.00051053223,0.0003462267,0.00015320891],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017316937,0.0007495189,0.00082140736,0.0012940556,0.0013114217,0.0021992424,0.0019326186,0.0013520909,0.0041466295],"category_scores_gemma":[0.007989396,0.0007348155,0.0021961117,0.002243059,0.003131223,0.0051861936,0.00305177,0.0043622637,0.00066762906],"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.000049077098,0.00004166875,0.0004670973,0.00019541591,0.000043834036,0.0001751976,0.00040543688,0.023776822,0.0018408487,0.93165565,0.0030312524,0.038317837],"study_design_scores_gemma":[0.00002113389,0.000033116572,0.00015163455,0.000037148733,0.000027509535,0.00019625477,0.00009227719,0.107660174,0.0016519367,0.87880385,0.011311408,0.0000136346725],"about_ca_topic_score_codex":0.0041966345,"about_ca_topic_score_gemma":0.0035508976,"teacher_disagreement_score":0.0041966345,"about_ca_system_score_codex":0.0021587794,"about_ca_system_score_gemma":0.0011269952,"threshold_uncertainty_score":0.015663087},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001062386,0.000058528352,0.99774915,0.00006626858,0.000015393534,0.000034828994,0.000021847518,0.0002046018,0.00078701146],"genre_scores_gemma":[0.11841636,0.00028640183,0.8779218,0.000097135744,0.000039817696,0.00038579624,0.00015374685,0.00021820595,0.0024807332],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998085,0.0007220318,0.00014859767,0.00034465332,0.000545622,0.00015402983],"domain_scores_gemma":[0.9959046,0.0030168102,0.00033698662,0.00036184082,0.00028825254,0.00009152941],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030739536,0.0013481143,0.001022303,0.0008203549,0.0007072412,0.0020773218,0.002259699,0.0012678215,0.0067797587],"category_scores_gemma":[0.00823461,0.000732444,0.001947961,0.0008462847,0.002180135,0.0028830077,0.002184336,0.003330446,0.00083813514],"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.00010465393,0.00009338718,0.00028758816,0.00036263568,0.00005972346,0.00009691172,0.0002970986,0.43548295,0.0017746702,0.49263623,0.00095717335,0.06784707],"study_design_scores_gemma":[0.000057664354,0.000033285873,0.000023237351,0.000050992727,0.000025228645,0.00002607334,0.000030177865,0.79874265,0.0019665542,0.19501054,0.0040197135,0.000013806713],"about_ca_topic_score_codex":0.0027877223,"about_ca_topic_score_gemma":0.003996664,"teacher_disagreement_score":0.0067797587,"about_ca_system_score_codex":0.0020231225,"about_ca_system_score_gemma":0.0028084952,"threshold_uncertainty_score":0.02268058},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01410558,0.00023344328,0.9797902,0.0006070838,0.00008391064,0.0002049399,0.00014538835,0.0014084093,0.0034209874],"genre_scores_gemma":[0.1900684,0.00045865675,0.8038773,0.0004412912,0.00014718596,0.00027573272,0.0008293788,0.0004047707,0.0034973638],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9862785,0.004274607,0.0014748089,0.0022603613,0.0045948396,0.0011168187],"domain_scores_gemma":[0.9900366,0.0057802037,0.0010852388,0.0017563063,0.00092517387,0.00041646368],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011745337,0.0016874768,0.0012411884,0.002195232,0.0036674999,0.006680208,0.0037375127,0.0029000181,0.0036937443],"category_scores_gemma":[0.019285409,0.001986264,0.004585422,0.0012315108,0.004417569,0.014358016,0.007466737,0.0044019786,0.0006896086],"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.00023928535,0.00013677332,0.0023438556,0.00057219295,0.00035207722,0.0021723753,0.002574867,0.0625329,0.010629013,0.85972774,0.003116799,0.055602126],"study_design_scores_gemma":[0.00013995306,0.00008763686,0.00019387281,0.00018895112,0.00035322792,0.0006673222,0.0007870787,0.16845557,0.022356566,0.7659528,0.040733628,0.000083455096],"about_ca_topic_score_codex":0.0060723084,"about_ca_topic_score_gemma":0.006174566,"teacher_disagreement_score":0.011745337,"about_ca_system_score_codex":0.0022365958,"about_ca_system_score_gemma":0.0029897888,"threshold_uncertainty_score":0.062116027},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0080536185,0.0004009305,0.9257005,0.0005156096,0.00053370546,0.00009027847,0.0013770123,0.016891545,0.046436865],"genre_scores_gemma":[0.26604754,0.0005672929,0.6626729,0.0007143831,0.0004713427,0.00044463933,0.005648687,0.010149549,0.053283717],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989293,0.0002663943,0.00006771428,0.00023848025,0.00032960463,0.00016841094],"domain_scores_gemma":[0.998953,0.0004242293,0.00004434936,0.00035533734,0.00017932086,0.000043786175],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014633177,0.0009521142,0.0010147319,0.0010005187,0.0010307629,0.0016047225,0.0019081498,0.0008538589,0.040954646],"category_scores_gemma":[0.0038908806,0.00054306287,0.0015532922,0.0012916261,0.0012007464,0.0030140707,0.0025661953,0.0030013036,0.012658916],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00060092524,0.000120767436,0.00047345535,0.0005083937,0.00004619251,0.000110768226,0.00020146534,0.027343413,0.0049750814,0.5283311,0.05653084,0.3807576],"study_design_scores_gemma":[0.00011894408,0.00011093173,0.00023095687,0.00015556045,0.000040425904,0.000163535,0.0000798405,0.15541154,0.014921086,0.6879782,0.14072545,0.00006348356],"about_ca_topic_score_codex":0.0015370635,"about_ca_topic_score_gemma":0.002165557,"teacher_disagreement_score":0.040954646,"about_ca_system_score_codex":0.00095191284,"about_ca_system_score_gemma":0.0013348153,"threshold_uncertainty_score":0.13700694},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01923973,0.0005414462,0.94267726,0.0012653795,0.0003051173,0.00017607596,0.0002697884,0.007791552,0.027733574],"genre_scores_gemma":[0.29598588,0.0008278999,0.6872293,0.00045173077,0.00012459823,0.00031962385,0.00062587304,0.0015484372,0.01288665],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99807227,0.00055304065,0.00012085175,0.00026020544,0.00084120675,0.00015238737],"domain_scores_gemma":[0.99576545,0.0013775465,0.00019791753,0.0022419158,0.00036346755,0.000053751122],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025848832,0.00077166664,0.00090939517,0.00080167444,0.0007316832,0.002689067,0.0011974529,0.0007279238,0.012175698],"category_scores_gemma":[0.0052851457,0.0005692225,0.0014523074,0.00084195525,0.0017654796,0.004826798,0.0017840253,0.002554567,0.0025237435],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043323208,0.00017152874,0.0014900679,0.0008248336,0.00016318448,0.0003019041,0.0005920079,0.07898303,0.029912436,0.6116957,0.008957199,0.2664749],"study_design_scores_gemma":[0.00021303068,0.00017565506,0.0004802264,0.0002122119,0.00016943099,0.00027877628,0.00020979377,0.3215274,0.040040474,0.5395705,0.09703153,0.000090996386],"about_ca_topic_score_codex":0.002414808,"about_ca_topic_score_gemma":0.006291944,"teacher_disagreement_score":0.012175698,"about_ca_system_score_codex":0.0009126298,"about_ca_system_score_gemma":0.0019529448,"threshold_uncertainty_score":0.040731788},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10149475,0.00014587851,0.876518,0.00030160474,0.0001547923,0.00023896678,0.00019377089,0.0041409894,0.016811341],"genre_scores_gemma":[0.82401305,0.00017997564,0.16452461,0.00014013403,0.000033687284,0.0001611002,0.0002982337,0.00064672675,0.010002323],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989304,0.00025699523,0.00004363645,0.00013308637,0.0004892877,0.0001466541],"domain_scores_gemma":[0.9988651,0.00063222955,0.00006830883,0.00026841546,0.0001370264,0.000028794866],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010692654,0.00066193275,0.00052855216,0.0004997072,0.00077521964,0.0015728164,0.0009827268,0.0008480274,0.005200026],"category_scores_gemma":[0.0032441851,0.000534711,0.0011225989,0.00022833659,0.0014847734,0.0014549951,0.0017081529,0.00097454974,0.0006533521],"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.0007061872,0.00018525428,0.0011559373,0.00058852386,0.00010170138,0.0015347233,0.0010329915,0.30365047,0.1196007,0.47852683,0.00262763,0.09028897],"study_design_scores_gemma":[0.00014806005,0.00017165553,0.00045874232,0.00009808866,0.00010242028,0.00027318328,0.00013170189,0.6676729,0.10727087,0.20831834,0.015299504,0.000054566663],"about_ca_topic_score_codex":0.0031292005,"about_ca_topic_score_gemma":0.00385527,"teacher_disagreement_score":0.005200026,"about_ca_system_score_codex":0.0009253007,"about_ca_system_score_gemma":0.0012716377,"threshold_uncertainty_score":0.017395854},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009350109,0.00043148908,0.9854188,0.00012772359,0.000037571725,0.00010130358,0.000037670965,0.00090879726,0.0035865437],"genre_scores_gemma":[0.12539643,0.0005467503,0.8695605,0.00008621542,0.000031786254,0.00021598743,0.00015067631,0.00029135248,0.0037203778],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99868137,0.00042081068,0.00012119567,0.00013993894,0.000527364,0.00010927313],"domain_scores_gemma":[0.99402845,0.0041334466,0.0002291319,0.001207852,0.0003350034,0.00006610273],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019188677,0.00057239353,0.0005222069,0.0008025366,0.00036411456,0.00064539706,0.0012841901,0.000631927,0.0043138643],"category_scores_gemma":[0.0077519333,0.00071213103,0.0011266485,0.0009690607,0.0012457453,0.0021442468,0.0016999478,0.0011632766,0.0006407388],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029729123,0.00016256105,0.0012675386,0.0012520154,0.000115218194,0.0001268035,0.00058029103,0.031922016,0.016729098,0.18684202,0.005033851,0.75567144],"study_design_scores_gemma":[0.0003531215,0.0004366023,0.0012784781,0.00040760718,0.0004345994,0.0006291068,0.0003949647,0.4001953,0.041295063,0.52064425,0.033845592,0.00008524906],"about_ca_topic_score_codex":0.0006484409,"about_ca_topic_score_gemma":0.0032262835,"teacher_disagreement_score":0.0043138643,"about_ca_system_score_codex":0.00037454773,"about_ca_system_score_gemma":0.001615106,"threshold_uncertainty_score":0.014431298},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08922973,0.00023971009,0.90048844,0.00013689515,0.000042396736,0.00007121689,0.000059486178,0.00049455726,0.009237582],"genre_scores_gemma":[0.9056376,0.00018369714,0.08636743,0.000047495265,0.000043826432,0.000104857994,0.000095453164,0.00018386416,0.00733574],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99887294,0.00030856894,0.000058953898,0.00020853228,0.00041229112,0.00013881008],"domain_scores_gemma":[0.9971111,0.0020365433,0.00029224384,0.0002509619,0.00022827665,0.0000808509],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018518877,0.00073099916,0.0006295441,0.0008465225,0.0005836947,0.0012107106,0.0015564486,0.00053918146,0.0031513642],"category_scores_gemma":[0.0046452377,0.0004979952,0.0010983109,0.00055308116,0.0017769269,0.0015655153,0.0010366895,0.00088205107,0.00029286646],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003986314,0.0000709772,0.0019042293,0.00019630129,0.00008082261,0.00034564274,0.00029918505,0.705351,0.020955162,0.23148061,0.0006485467,0.038268868],"study_design_scores_gemma":[0.000024541605,0.000043910608,0.0003802777,0.000011998758,0.000024987057,0.000041139843,0.00003186763,0.93372375,0.0038808337,0.06095171,0.0008717112,0.000013281909],"about_ca_topic_score_codex":0.0028350549,"about_ca_topic_score_gemma":0.0026848195,"teacher_disagreement_score":0.0031513642,"about_ca_system_score_codex":0.0011310289,"about_ca_system_score_gemma":0.0010724554,"threshold_uncertainty_score":0.010542333},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024052752,0.000254613,0.92000407,0.00070762535,0.00059208047,0.00017839878,0.00015874274,0.0025656016,0.051486097],"genre_scores_gemma":[0.7830432,0.00028402067,0.18849732,0.0005519706,0.00021392277,0.00037590115,0.00029915056,0.0010410517,0.025693458],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963276,0.0009766971,0.00025634564,0.00060387823,0.0011945397,0.0006410405],"domain_scores_gemma":[0.9953981,0.0015703678,0.0001923155,0.0022687607,0.00042003085,0.00015039078],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031021792,0.0011119896,0.0014190503,0.0014501846,0.0019525236,0.0036523044,0.0024957268,0.0019172173,0.013799245],"category_scores_gemma":[0.009734211,0.00089035736,0.0021178296,0.001116772,0.004895602,0.010193811,0.0069322838,0.0041319192,0.0025765905],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000091043046,0.000022496772,0.000072040144,0.000049832837,0.00000879903,0.000056455243,0.0001245869,0.0025923857,0.0013240144,0.9792716,0.001753692,0.01463297],"study_design_scores_gemma":[0.000030259549,0.000027467708,0.000039900842,0.000026861348,0.000025182215,0.00009752963,0.000042530526,0.030743826,0.0053640455,0.9570685,0.006506473,0.000027359238],"about_ca_topic_score_codex":0.00055015204,"about_ca_topic_score_gemma":0.0004123895,"teacher_disagreement_score":0.013799245,"about_ca_system_score_codex":0.001336037,"about_ca_system_score_gemma":0.002087433,"threshold_uncertainty_score":0.046163082},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031165868,0.0006055147,0.94355386,0.0001564893,0.00008754319,0.00006656512,0.000113499525,0.0009314771,0.023319118],"genre_scores_gemma":[0.56239295,0.0018073323,0.40614846,0.00015530756,0.000107999964,0.00023026021,0.00068297476,0.00043988426,0.028034901],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99962246,0.000078687845,0.000031187654,0.00007324854,0.00011848967,0.00007589633],"domain_scores_gemma":[0.99939036,0.0003318962,0.000060326347,0.000100126286,0.000068950714,0.00004836986],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068350666,0.0003388775,0.00041694538,0.000584128,0.0006682691,0.0016934976,0.0006182772,0.0005299248,0.0035588886],"category_scores_gemma":[0.0013305056,0.0005542421,0.00062053825,0.0010100073,0.0014558323,0.0032287303,0.00091491215,0.0011566922,0.0007756175],"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.000055424443,0.000033463413,0.0004427121,0.00008181724,0.000007130678,0.0001293513,0.00027767883,0.01987291,0.002909823,0.9158153,0.0012603914,0.059113834],"study_design_scores_gemma":[0.000020697436,0.000035899466,0.00030171324,0.000040583014,0.000025298448,0.00009064925,0.00009552744,0.073214106,0.005326904,0.9055457,0.015286825,0.000016012174],"about_ca_topic_score_codex":0.0029612065,"about_ca_topic_score_gemma":0.0031029668,"teacher_disagreement_score":0.0035588886,"about_ca_system_score_codex":0.0010713689,"about_ca_system_score_gemma":0.0009885832,"threshold_uncertainty_score":0.011905611},"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":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0044089914,0.00021253375,0.9602387,0.00020429464,0.00017442097,0.00011527016,0.00060205976,0.03002555,0.0040181247],"genre_scores_gemma":[0.11209478,0.00044286912,0.8632348,0.00051695976,0.00009253537,0.00035789807,0.0023426234,0.0074320873,0.013485341],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9967135,0.00083828886,0.00025222558,0.00041357122,0.001500812,0.00028157528],"domain_scores_gemma":[0.99687517,0.0013049117,0.00022129719,0.0009948023,0.0005411871,0.00006258575],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002445204,0.001582281,0.0012170196,0.0016278017,0.0007224993,0.0017930936,0.0033984613,0.0016487766,0.009813528],"category_scores_gemma":[0.0071699983,0.0015562855,0.00201057,0.0010415327,0.0012426623,0.0039227232,0.0027490782,0.0026989896,0.004459927],"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.00093752175,0.0004692721,0.0025529924,0.0019457013,0.0004018731,0.0005836175,0.00042159157,0.105193205,0.06783504,0.2073427,0.09264856,0.51966786],"study_design_scores_gemma":[0.00039171975,0.00019643911,0.00066197524,0.00021551932,0.0003799373,0.00046822662,0.00006162737,0.63919127,0.13093214,0.12874308,0.09862808,0.00013000597],"about_ca_topic_score_codex":0.0022177051,"about_ca_topic_score_gemma":0.0041883034,"teacher_disagreement_score":0.009813528,"about_ca_system_score_codex":0.00082996837,"about_ca_system_score_gemma":0.002533578,"threshold_uncertainty_score":0.032829463},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0054283696,0.0001456904,0.99009925,0.000106359876,0.000042197473,0.00003006924,0.000053948905,0.00069118047,0.003402937],"genre_scores_gemma":[0.65464455,0.0005107264,0.33931035,0.00019650809,0.00008080774,0.00031811048,0.00032629387,0.0006265087,0.0039861654],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985605,0.0003152743,0.00011174666,0.00031071928,0.0005355258,0.0001662114],"domain_scores_gemma":[0.99704844,0.0018326662,0.00025677076,0.00049378583,0.00028696086,0.00008149148],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013486621,0.00095504103,0.0009311842,0.00049201044,0.0005046389,0.0012619735,0.0017281339,0.00095597183,0.003854618],"category_scores_gemma":[0.006075066,0.000855866,0.0008420323,0.00074885174,0.0019482883,0.0020929598,0.0025113355,0.0021993532,0.00080193527],"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.00028085892,0.0000680477,0.0003908323,0.00037076243,0.000046332287,0.00021091345,0.00018128895,0.68823844,0.01864524,0.18941128,0.0026356252,0.09952029],"study_design_scores_gemma":[0.00005245802,0.00006135375,0.00009897559,0.00003518109,0.00001572362,0.000037357044,0.00002041875,0.8794825,0.0090009915,0.10911469,0.0020642546,0.000016127686],"about_ca_topic_score_codex":0.0018044825,"about_ca_topic_score_gemma":0.0022967567,"teacher_disagreement_score":0.003854618,"about_ca_system_score_codex":0.000819205,"about_ca_system_score_gemma":0.0019600694,"threshold_uncertainty_score":0.012895048},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09283078,0.00074473803,0.83222306,0.00038610495,0.00024797698,0.00008651966,0.00029377083,0.0019344976,0.071252584],"genre_scores_gemma":[0.87725985,0.0012254554,0.08451578,0.0001431988,0.00014431532,0.00015791909,0.00028143774,0.0005338688,0.035738118],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99946326,0.000065517765,0.000027883925,0.00011237608,0.00020050746,0.00013050681],"domain_scores_gemma":[0.998429,0.0009322991,0.00015657417,0.0002731882,0.00014494518,0.00006388311],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004189111,0.0008724183,0.0004426917,0.0011797386,0.0008351814,0.0027605586,0.0006879843,0.00074783654,0.0080759525],"category_scores_gemma":[0.0029488588,0.0007662939,0.00063681696,0.00097325206,0.0016161151,0.004250829,0.0011945053,0.0025820092,0.0011091501],"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.00016097423,0.000028558872,0.0002580949,0.00011323565,0.00001294862,0.00015772888,0.00023054185,0.009692895,0.009644956,0.9502673,0.0014121033,0.028020734],"study_design_scores_gemma":[0.000027508902,0.000043503016,0.000195164,0.00005273749,0.00005507101,0.00032014374,0.00012202677,0.047378466,0.016530855,0.9223637,0.012874004,0.000036713514],"about_ca_topic_score_codex":0.00060369325,"about_ca_topic_score_gemma":0.00045827864,"teacher_disagreement_score":0.0080759525,"about_ca_system_score_codex":0.00076426537,"about_ca_system_score_gemma":0.00065812044,"threshold_uncertainty_score":0.027016759},"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":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.052793246,0.0052214134,0.108574376,0.041854788,0.0021719798,0.00007415999,0.0009746167,0.0012951561,0.7870402],"genre_scores_gemma":[0.9027296,0.0039338516,0.022077497,0.005079989,0.0011722189,0.00013142993,0.0009256175,0.0015062058,0.06244359],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99720085,0.0008860456,0.00017888809,0.0005756549,0.0007316157,0.00042699027],"domain_scores_gemma":[0.9948088,0.0027150763,0.0002910773,0.0011029358,0.00082341244,0.00025875325],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002620557,0.0005141816,0.001437706,0.0018333966,0.004209767,0.0073943366,0.002328088,0.0032019597,0.021547435],"category_scores_gemma":[0.014251195,0.0009010204,0.00087602093,0.0022577785,0.014369511,0.022202482,0.0040689916,0.005635773,0.004354887],"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.000010627848,0.000004841902,0.000077592136,0.000025049545,0.000003394403,0.00004290111,0.00043360167,0.00006256498,0.00007787147,0.99163544,0.003584905,0.0040411404],"study_design_scores_gemma":[0.0000030251078,0.0000017492893,0.000032074164,0.00002334284,0.000003694057,0.00007608157,0.00036330114,0.00014314518,0.000120381104,0.9890003,0.010226644,0.000006281263],"about_ca_topic_score_codex":0.0021833437,"about_ca_topic_score_gemma":0.0018667794,"teacher_disagreement_score":0.021547435,"about_ca_system_score_codex":0.002133308,"about_ca_system_score_gemma":0.0015574545,"threshold_uncertainty_score":0.072083354},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014328027,0.00043411745,0.91068035,0.0009038815,0.0007044634,0.00059036195,0.0032029252,0.02820874,0.04094716],"genre_scores_gemma":[0.16556834,0.0013442684,0.75251824,0.00089127256,0.00017190045,0.0007474802,0.0102170585,0.016746836,0.05179473],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99921334,0.00014576115,0.00007329303,0.00013164204,0.00034179297,0.00009421914],"domain_scores_gemma":[0.99885666,0.00028196097,0.000044061675,0.0003464047,0.00042772724,0.000043224612],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008451967,0.0008335313,0.00046577107,0.0010385489,0.00048261532,0.0018244315,0.0010028492,0.0006591593,0.0148422085],"category_scores_gemma":[0.003385186,0.0008251588,0.00076634716,0.0010013575,0.00054885185,0.0012095395,0.0016832302,0.0019886768,0.0104355095],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036834567,0.00051702844,0.0008990996,0.0019102261,0.0000974962,0.0015472964,0.00342099,0.017582864,0.104135565,0.20476437,0.101005115,0.5637517],"study_design_scores_gemma":[0.00014014625,0.00011534802,0.00096316554,0.00051335036,0.000110038454,0.00090424786,0.00060798717,0.045064207,0.13439631,0.07576087,0.74131185,0.00011238204],"about_ca_topic_score_codex":0.0021851656,"about_ca_topic_score_gemma":0.0022826076,"teacher_disagreement_score":0.0148422085,"about_ca_system_score_codex":0.0007166728,"about_ca_system_score_gemma":0.0015088028,"threshold_uncertainty_score":0.04965216},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009211405,0.0010528004,0.9830754,0.0010628011,0.00024238057,0.00004687215,0.000042504744,0.00087885576,0.004386895],"genre_scores_gemma":[0.43734407,0.0016173149,0.5499225,0.0008799891,0.00043926694,0.00023294409,0.0001759218,0.00043563574,0.008952362],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972995,0.0010134205,0.00015446915,0.0002630841,0.0011101519,0.00015941175],"domain_scores_gemma":[0.99163705,0.004092399,0.00056788104,0.0022342405,0.0012122816,0.0002560795],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004790286,0.0006191912,0.0007430766,0.0011561833,0.0005807904,0.0015594021,0.0014210138,0.0011983641,0.0041670236],"category_scores_gemma":[0.012704668,0.0009875449,0.00081006263,0.00041109772,0.002389419,0.0032070728,0.005434848,0.0028306933,0.0014010139],"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.00036589097,0.00006333123,0.0009387287,0.0008246015,0.000118320684,0.00037470786,0.0011116213,0.052830946,0.034039866,0.72261673,0.005792782,0.18092255],"study_design_scores_gemma":[0.00006659841,0.00031318903,0.00049048295,0.00024326549,0.00010769992,0.00040798695,0.00020854632,0.2320595,0.029712196,0.68585217,0.050492395,0.000045942408],"about_ca_topic_score_codex":0.000269845,"about_ca_topic_score_gemma":0.00028848404,"teacher_disagreement_score":0.004790286,"about_ca_system_score_codex":0.0005719319,"about_ca_system_score_gemma":0.0007652683,"threshold_uncertainty_score":0.025333762},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004730343,0.00016064585,0.8777662,0.00044125592,0.00025968708,0.00026858074,0.001343046,0.11048492,0.004545345],"genre_scores_gemma":[0.20371898,0.0005017026,0.7344719,0.0020678828,0.00023666749,0.0005503954,0.0066268714,0.028629696,0.023195883],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9937138,0.0014958729,0.00072563934,0.0010331119,0.0024653368,0.0005661672],"domain_scores_gemma":[0.99042964,0.005684879,0.00043877403,0.0020192093,0.0012106721,0.00021684876],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0062080193,0.0015624252,0.0015129923,0.0022045758,0.00097054365,0.0037429978,0.0054127136,0.002134045,0.028087983],"category_scores_gemma":[0.014497897,0.001937044,0.0021924993,0.0014100221,0.0020249304,0.008245318,0.0049060713,0.0031204028,0.00752411],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002565343,0.0007383609,0.0033531534,0.0018967335,0.00045266576,0.0009982728,0.0006967658,0.040395893,0.047931343,0.18616779,0.18532763,0.52947617],"study_design_scores_gemma":[0.0009980289,0.00030323816,0.0005408992,0.0002609461,0.00047046065,0.0006808573,0.00022638659,0.61575514,0.1481961,0.12153952,0.11083449,0.00019400746],"about_ca_topic_score_codex":0.0036510173,"about_ca_topic_score_gemma":0.0039522676,"teacher_disagreement_score":0.028087983,"about_ca_system_score_codex":0.001313757,"about_ca_system_score_gemma":0.0035751604,"threshold_uncertainty_score":0.09396362},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01178004,0.000116351286,0.96408594,0.00023499616,0.00009795285,0.00017636172,0.0003664656,0.013245149,0.009896762],"genre_scores_gemma":[0.30905765,0.00025737984,0.67662734,0.00032796577,0.000049929058,0.00045251593,0.0010645825,0.0025563568,0.009606326],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99759525,0.00084063754,0.00011457833,0.00036021866,0.00084909674,0.00024021449],"domain_scores_gemma":[0.99650574,0.0018979117,0.00012693375,0.0010418305,0.0003846705,0.000042853855],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022287702,0.000677868,0.0008398432,0.00088434,0.0006775784,0.0019728756,0.0024208885,0.0010746635,0.009876479],"category_scores_gemma":[0.007422152,0.0008597256,0.0011910286,0.00078207446,0.001112796,0.003337164,0.0016680738,0.0018963441,0.0020185383],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006273693,0.00034353646,0.001558965,0.0007206941,0.00011537958,0.00046997194,0.00048198408,0.24190496,0.019077979,0.44044885,0.019344369,0.2749059],"study_design_scores_gemma":[0.00012619147,0.00006903521,0.00009483881,0.000058140402,0.00005986996,0.00009172101,0.00002743311,0.8546275,0.031761106,0.09917123,0.013883844,0.000029176732],"about_ca_topic_score_codex":0.0033613932,"about_ca_topic_score_gemma":0.005834676,"teacher_disagreement_score":0.009876479,"about_ca_system_score_codex":0.0008942543,"about_ca_system_score_gemma":0.002182761,"threshold_uncertainty_score":0.033040166},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027468372,0.000056041943,0.9895356,0.00008830587,0.000084368265,0.0001600195,0.00007107936,0.0028106135,0.004447049],"genre_scores_gemma":[0.08597414,0.00012504047,0.9079269,0.00014407834,0.00008364739,0.00029377465,0.00026900598,0.0006211951,0.004562296],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99704593,0.00056103535,0.00024906077,0.00052076415,0.0013802187,0.00024309554],"domain_scores_gemma":[0.99301445,0.004579053,0.00015412671,0.0014123442,0.00070954167,0.00013043331],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018645009,0.00077198225,0.00067281246,0.0012877199,0.0009766049,0.0016883799,0.0031665298,0.0009769208,0.010995604],"category_scores_gemma":[0.009488357,0.0009008126,0.0020740703,0.0010061096,0.001807992,0.0038896424,0.0029858653,0.003320199,0.0027259118],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036563596,0.0003306968,0.0004780275,0.00046862653,0.000074125,0.00037044444,0.000590622,0.015245446,0.028229708,0.41887784,0.008828663,0.52614015],"study_design_scores_gemma":[0.00020479686,0.00031922653,0.00052052876,0.00019792232,0.0003602301,0.0008288995,0.00015689064,0.32443315,0.08076256,0.5213309,0.07074775,0.00013709979],"about_ca_topic_score_codex":0.0011147148,"about_ca_topic_score_gemma":0.002035519,"teacher_disagreement_score":0.010995604,"about_ca_system_score_codex":0.00068251626,"about_ca_system_score_gemma":0.00147387,"threshold_uncertainty_score":0.036783934},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02164476,0.006084934,0.66499275,0.03798565,0.0017682592,0.00009909769,0.00018444801,0.0015333795,0.26570672],"genre_scores_gemma":[0.7967963,0.004159952,0.13669822,0.0051329765,0.0013238442,0.00028321252,0.00023098184,0.0018729516,0.053501535],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99570966,0.002498435,0.00017111783,0.00039770702,0.0009719118,0.0002511118],"domain_scores_gemma":[0.98384297,0.010944606,0.0007267465,0.0032474494,0.00082581287,0.0004123964],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0061832014,0.00091422553,0.00094475946,0.0009765984,0.0013275873,0.004902225,0.0012684755,0.0023908175,0.011416241],"category_scores_gemma":[0.018172072,0.00071719,0.0008065366,0.0008817338,0.01623612,0.019986328,0.003903392,0.0041293614,0.0028882653],"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.00002591912,0.00001833739,0.00010285279,0.000093250965,0.000009778784,0.0000126425275,0.000589151,0.00068809267,0.00029396932,0.9822234,0.0024270322,0.013515594],"study_design_scores_gemma":[0.000013625396,0.000023466606,0.0000650865,0.00006609299,0.000011305323,0.000049168582,0.00019287711,0.0015626391,0.000541924,0.97696084,0.020502519,0.000010461618],"about_ca_topic_score_codex":0.000646037,"about_ca_topic_score_gemma":0.0009976127,"teacher_disagreement_score":0.011416241,"about_ca_system_score_codex":0.0018480662,"about_ca_system_score_gemma":0.0020125408,"threshold_uncertainty_score":0.03819108},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023474216,0.0007428101,0.96970797,0.0008699155,0.000055813656,0.000051612304,0.000060614857,0.0010078371,0.0040292693],"genre_scores_gemma":[0.647047,0.0031551605,0.34343648,0.00048807182,0.00017422398,0.00022162592,0.00032188403,0.0007507332,0.004404839],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9907617,0.0040065083,0.00048446585,0.0007217993,0.0033893057,0.00063615065],"domain_scores_gemma":[0.96668863,0.026638538,0.0012594445,0.0038786225,0.0013257209,0.00020903244],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006908433,0.0008969415,0.0008469647,0.0015271062,0.0011064078,0.0028983364,0.0017312709,0.00165431,0.002482351],"category_scores_gemma":[0.027513718,0.00072481023,0.0016662658,0.0014043481,0.005903721,0.0053001903,0.0024994193,0.0025363404,0.00077182514],"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.0003734914,0.00016126806,0.0025093555,0.00071248034,0.00011105069,0.00089994614,0.0015565371,0.32914692,0.027201483,0.5011973,0.0020821271,0.134048],"study_design_scores_gemma":[0.00009392162,0.00018031978,0.0007038112,0.0002955864,0.000081318205,0.0003175431,0.00018473259,0.6175365,0.030805143,0.33561254,0.014110366,0.00007820466],"about_ca_topic_score_codex":0.0076304586,"about_ca_topic_score_gemma":0.005224513,"teacher_disagreement_score":0.0076304586,"about_ca_system_score_codex":0.001644776,"about_ca_system_score_gemma":0.0029436469,"threshold_uncertainty_score":0.03653574},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014881098,0.00031167213,0.9712468,0.00021610073,0.00009008127,0.00014636353,0.00031563666,0.0030322901,0.009759988],"genre_scores_gemma":[0.36379233,0.0010515812,0.60609746,0.0002543114,0.00018221849,0.00077331223,0.0016111342,0.004018782,0.022218896],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965928,0.00074531976,0.0005223453,0.00045566913,0.0013238407,0.00035995347],"domain_scores_gemma":[0.9944352,0.0033161636,0.00033565832,0.0012235814,0.0005085991,0.00018085905],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033923313,0.001321819,0.0017085895,0.0018003793,0.0015307099,0.0050690495,0.002345318,0.0016058626,0.008993177],"category_scores_gemma":[0.007644177,0.0021476215,0.003083789,0.0020744987,0.0046997326,0.0072327023,0.0034556398,0.0046938276,0.0029017339],"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.000083512365,0.00003834981,0.00028612246,0.00017874376,0.000025474325,0.00020288926,0.0006626048,0.007791486,0.0028391655,0.9580651,0.0014492039,0.028377445],"study_design_scores_gemma":[0.00004454106,0.000021696856,0.00007470927,0.000054415217,0.000036163132,0.00010815527,0.00008678717,0.019506378,0.004619312,0.965393,0.010007842,0.000046839294],"about_ca_topic_score_codex":0.0016404086,"about_ca_topic_score_gemma":0.0027851295,"teacher_disagreement_score":0.008993177,"about_ca_system_score_codex":0.0025288332,"about_ca_system_score_gemma":0.0020928623,"threshold_uncertainty_score":0.030085206},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017346744,0.0003640815,0.9861842,0.00035370403,0.00017782657,0.000042971616,0.000026013517,0.00029120492,0.0108253965],"genre_scores_gemma":[0.24673572,0.0016787772,0.7176762,0.0007124528,0.0005494053,0.00020092321,0.00012602216,0.0005971211,0.0317234],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985002,0.00054367894,0.00012188728,0.00023909476,0.0004686443,0.00012653897],"domain_scores_gemma":[0.99826354,0.001010869,0.00010789025,0.0002985791,0.00023641279,0.000082646155],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023987577,0.0010997395,0.0008087804,0.00095037086,0.0010790938,0.0032968975,0.002309206,0.0028037454,0.010728784],"category_scores_gemma":[0.005386491,0.0008426693,0.0015617015,0.00091270934,0.0021388677,0.0029874796,0.0024181146,0.0037194516,0.001783842],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014032483,0.000051537663,0.00019226188,0.00019609822,0.00003418867,0.0007122382,0.00028928806,0.040760808,0.005717611,0.8881919,0.0033678408,0.06034585],"study_design_scores_gemma":[0.00008365118,0.00010543647,0.00021026697,0.00011571353,0.00008411484,0.0005799111,0.00011752443,0.35529354,0.00652583,0.58113056,0.055697393,0.000056087847],"about_ca_topic_score_codex":0.0020374039,"about_ca_topic_score_gemma":0.0013336093,"teacher_disagreement_score":0.010728784,"about_ca_system_score_codex":0.0009947194,"about_ca_system_score_gemma":0.0008927389,"threshold_uncertainty_score":0.035891354},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010671158,0.00009700035,0.9761619,0.00014006573,0.000066466186,0.00006665318,0.00009060071,0.007975349,0.004730818],"genre_scores_gemma":[0.40622672,0.00028969444,0.58034766,0.00020380091,0.00006537518,0.00020261346,0.00036827655,0.0021343543,0.0101615],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985177,0.00045977777,0.00012791711,0.0001653936,0.0005191856,0.00020995106],"domain_scores_gemma":[0.99540377,0.0030019467,0.00015291096,0.0010649428,0.0002999521,0.00007646872],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002229779,0.0009218213,0.00095740205,0.00080458797,0.0007745956,0.0019596284,0.0014046939,0.00092647487,0.010950763],"category_scores_gemma":[0.005170068,0.00096435274,0.0010629239,0.0005103932,0.0016281813,0.0032607596,0.0031403182,0.0021286872,0.0022091726],"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.00081416924,0.000281245,0.0015864118,0.0012804894,0.00014742558,0.0008608518,0.0007517812,0.13482562,0.04201423,0.43458405,0.011033809,0.37181994],"study_design_scores_gemma":[0.0002339178,0.00011529973,0.00024684577,0.00016929676,0.00009285522,0.00028086494,0.00009037043,0.547578,0.12095418,0.30020216,0.029972505,0.00006370766],"about_ca_topic_score_codex":0.0007296716,"about_ca_topic_score_gemma":0.0015111809,"teacher_disagreement_score":0.010950763,"about_ca_system_score_codex":0.0006817069,"about_ca_system_score_gemma":0.0010838964,"threshold_uncertainty_score":0.03663397},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0394098,0.00012530632,0.9547726,0.00035215393,0.00010903032,0.00020515644,0.000110907946,0.0026280505,0.0022871199],"genre_scores_gemma":[0.6890726,0.000320904,0.3062282,0.00022525742,0.00006726725,0.00043282332,0.00036503834,0.00048026786,0.002807587],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98727536,0.003292118,0.00092274754,0.00102899,0.0066997036,0.0007811267],"domain_scores_gemma":[0.980172,0.007929967,0.0016097889,0.0064901444,0.003553853,0.0002442279],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0073943324,0.00079102145,0.00072091946,0.00087716867,0.0012890551,0.0035520552,0.0024015573,0.001656734,0.0016390169],"category_scores_gemma":[0.027468104,0.0010802189,0.0015067339,0.00049765065,0.0046680905,0.0046160575,0.0024184678,0.0034087547,0.0004739964],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004724302,0.0002688472,0.006189695,0.0007978554,0.00025400263,0.0018095857,0.0016710775,0.24868855,0.090049975,0.5462434,0.0031569987,0.10039741],"study_design_scores_gemma":[0.00014812077,0.0002959686,0.00068052823,0.00017040956,0.00014851768,0.00055114005,0.00021628801,0.7468139,0.11667494,0.11952029,0.014683091,0.000096832795],"about_ca_topic_score_codex":0.005097743,"about_ca_topic_score_gemma":0.0029467638,"teacher_disagreement_score":0.0073943324,"about_ca_system_score_codex":0.0015808376,"about_ca_system_score_gemma":0.005912736,"threshold_uncertainty_score":0.039105415},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03494305,0.0005170915,0.869715,0.0019439831,0.00076344673,0.00027545745,0.00051688927,0.0054502287,0.085874826],"genre_scores_gemma":[0.55881834,0.0008626474,0.39185715,0.00095648854,0.0005478116,0.00020358856,0.0011127845,0.004249569,0.04139174],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99646336,0.0007828071,0.0002479245,0.0007824936,0.0011368289,0.0005866022],"domain_scores_gemma":[0.9879103,0.0058886763,0.0003175435,0.0039439863,0.0016798852,0.00025971205],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0047922647,0.0012028236,0.0015330915,0.0018836467,0.0025656987,0.0033664654,0.0050246003,0.0027136805,0.021990456],"category_scores_gemma":[0.02050078,0.0017363995,0.0028947694,0.0016985161,0.0060047624,0.011663368,0.0073409984,0.0059429617,0.0039122473],"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.0002737791,0.00008468964,0.00065821595,0.00048267056,0.00003593972,0.00085942284,0.0014123463,0.0072919917,0.00474682,0.899152,0.01057326,0.07442884],"study_design_scores_gemma":[0.00007415062,0.00004151903,0.00021303864,0.00020715455,0.00014525576,0.0005038593,0.00045760375,0.037639275,0.012384996,0.91361624,0.034652688,0.00006422295],"about_ca_topic_score_codex":0.0032556015,"about_ca_topic_score_gemma":0.0037808912,"teacher_disagreement_score":0.021990456,"about_ca_system_score_codex":0.0017179658,"about_ca_system_score_gemma":0.0023828072,"threshold_uncertainty_score":0.073565364},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019583115,0.000039590268,0.9925127,0.00008001543,0.00007171457,0.00006665397,0.00022403119,0.002086518,0.0029606053],"genre_scores_gemma":[0.13455683,0.0003102515,0.8542262,0.00016068634,0.00008038805,0.00025714314,0.0009178515,0.001131159,0.008359561],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99892896,0.0003129058,0.00011439675,0.00022871332,0.00028748153,0.00012747102],"domain_scores_gemma":[0.9983424,0.00089834264,0.00010644866,0.00039326795,0.00018857187,0.00007101926],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001442653,0.0007957694,0.0006240812,0.0009709159,0.00095962535,0.0027125967,0.001171303,0.0011217111,0.0155462315],"category_scores_gemma":[0.003067529,0.0006864272,0.0018566075,0.00096994004,0.0015556375,0.0030298366,0.001600181,0.0019267292,0.003347452],"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.00038714215,0.0001360566,0.00042016673,0.00036028604,0.000049970673,0.00044435027,0.00033282378,0.025620965,0.011837318,0.8766349,0.004656698,0.07911935],"study_design_scores_gemma":[0.00025260606,0.00012043279,0.00015653353,0.00016495974,0.000117400545,0.0004010818,0.00012930168,0.18585129,0.034580328,0.6858058,0.09232675,0.00009352002],"about_ca_topic_score_codex":0.002432257,"about_ca_topic_score_gemma":0.002052618,"teacher_disagreement_score":0.0155462315,"about_ca_system_score_codex":0.000647872,"about_ca_system_score_gemma":0.0013173172,"threshold_uncertainty_score":0.052007318},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02322689,0.00018257524,0.9488281,0.000812568,0.00008419146,0.00014387777,0.00014022499,0.00044078229,0.02614078],"genre_scores_gemma":[0.7283799,0.00046309872,0.25811225,0.000754868,0.00015123168,0.00038329783,0.00031596769,0.00024452977,0.011194813],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9948131,0.002198848,0.00030187817,0.0010937048,0.0010813319,0.00051110174],"domain_scores_gemma":[0.9888783,0.0059319786,0.0007786538,0.0032281566,0.00083122007,0.00035175183],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029555005,0.00067376305,0.00054031535,0.00074333657,0.0012534478,0.0024455995,0.0015893542,0.0013893917,0.008651438],"category_scores_gemma":[0.013603806,0.00051236316,0.0015287094,0.00069217617,0.004788459,0.008882434,0.0043762513,0.0032557577,0.0012147941],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002390962,0.00001996956,0.00033088314,0.00005375952,0.000017206647,0.00007261449,0.00020927291,0.009697353,0.0012486696,0.98067516,0.0003899522,0.0072612083],"study_design_scores_gemma":[0.000023342956,0.00005683523,0.00012128318,0.000029741146,0.00001962093,0.00016572844,0.00006789033,0.035929248,0.0032746508,0.9420932,0.018202363,0.000016050159],"about_ca_topic_score_codex":0.0008708868,"about_ca_topic_score_gemma":0.00087200105,"teacher_disagreement_score":0.008651438,"about_ca_system_score_codex":0.0015507014,"about_ca_system_score_gemma":0.0020247588,"threshold_uncertainty_score":0.02894193},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006413547,0.00016417481,0.98659605,0.00027811725,0.00010684057,0.00005692026,0.00003750764,0.00094762305,0.005399226],"genre_scores_gemma":[0.35044545,0.00069744,0.6367943,0.00035313057,0.00024583042,0.00045535027,0.0002595078,0.0009182083,0.009830778],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99778134,0.0007120508,0.00024069365,0.00025511257,0.0008028273,0.00020784898],"domain_scores_gemma":[0.99483794,0.002982863,0.00023150598,0.0013363146,0.00045570344,0.00015555907],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033558847,0.00096586905,0.0010350094,0.0007271975,0.0014451403,0.0030617483,0.0018754222,0.0013138214,0.003534457],"category_scores_gemma":[0.008376911,0.00100375,0.001499173,0.0009040715,0.0031086996,0.010521658,0.0032844297,0.0044252216,0.0008689819],"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.00015492103,0.00010020546,0.00019253076,0.00024166185,0.000037343907,0.00020937219,0.0007272836,0.030650606,0.0059229634,0.8686555,0.0024378614,0.090669736],"study_design_scores_gemma":[0.00007258157,0.00006071934,0.00004807993,0.000032470514,0.00004755378,0.000120468765,0.00006479902,0.08548123,0.0077677076,0.8948281,0.011450559,0.000025788202],"about_ca_topic_score_codex":0.0007420551,"about_ca_topic_score_gemma":0.0014867379,"teacher_disagreement_score":0.003534457,"about_ca_system_score_codex":0.00061431853,"about_ca_system_score_gemma":0.0016488353,"threshold_uncertainty_score":0.017747879},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016767798,0.015343069,0.5620503,0.036242258,0.0019084371,0.000047832727,0.00029663037,0.0005923779,0.36675137],"genre_scores_gemma":[0.6134542,0.011934374,0.20388854,0.009898424,0.005302951,0.00023886707,0.0006776135,0.0011706452,0.15343435],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9976496,0.0011027528,0.00012029566,0.00041070767,0.0005185779,0.000198199],"domain_scores_gemma":[0.99260277,0.0051789545,0.0003789463,0.00087573775,0.0008104887,0.0001529514],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003011845,0.0006074697,0.0006324943,0.0013373443,0.0022125198,0.0063533816,0.0018240311,0.0025809803,0.01408594],"category_scores_gemma":[0.012171317,0.0006191133,0.0009334138,0.0019068215,0.00848001,0.010926465,0.0029492544,0.004685726,0.0051050275],"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.00000850481,0.000006232984,0.00009570239,0.000046314326,0.000004102304,0.00005951359,0.00017923025,0.00031791945,0.00010108871,0.9833662,0.0052451664,0.010570059],"study_design_scores_gemma":[0.0000015495983,0.0000054318907,0.00006757594,0.00002875082,0.0000021173914,0.00006295551,0.00005668479,0.0011484869,0.00017820025,0.9835253,0.014917928,0.0000050255658],"about_ca_topic_score_codex":0.0018901468,"about_ca_topic_score_gemma":0.0017586915,"teacher_disagreement_score":0.01408594,"about_ca_system_score_codex":0.0025108065,"about_ca_system_score_gemma":0.0011024053,"threshold_uncertainty_score":0.04712218},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005074665,0.00007150698,0.99439186,0.000075275675,0.000024739857,0.00008836605,0.00005462636,0.0035380349,0.0012481045],"genre_scores_gemma":[0.027102293,0.00011428701,0.9694485,0.00008680876,0.000035615034,0.0002426719,0.00023745905,0.0009666265,0.0017657238],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9927269,0.0024280278,0.0005498624,0.0012828523,0.002415556,0.0005968304],"domain_scores_gemma":[0.98675066,0.008241115,0.0004273306,0.0030717873,0.0012764952,0.00023257882],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006217255,0.0026239592,0.0021087574,0.0043659313,0.0016686289,0.0043540727,0.005949394,0.0031471953,0.017406238],"category_scores_gemma":[0.02369451,0.00241758,0.0039569554,0.002682558,0.0037670187,0.00775721,0.0072687827,0.004080573,0.0050384197],"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.00040284827,0.0002647755,0.0006976889,0.00075180177,0.0001733756,0.0004398448,0.00064356,0.052686404,0.009566716,0.49962857,0.013371717,0.4213727],"study_design_scores_gemma":[0.00012405102,0.00007915178,0.00013736171,0.00019225458,0.00014217704,0.00039161547,0.00011736539,0.50150126,0.019292085,0.44669637,0.03123415,0.00009218117],"about_ca_topic_score_codex":0.0025409493,"about_ca_topic_score_gemma":0.0034539732,"teacher_disagreement_score":0.017406238,"about_ca_system_score_codex":0.0012351102,"about_ca_system_score_gemma":0.0025601343,"threshold_uncertainty_score":0.058229625},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011231151,0.00639699,0.5560007,0.0023140514,0.0020132025,0.0000652003,0.00042439133,0.0005552008,0.42099917],"genre_scores_gemma":[0.4736895,0.012666491,0.10501488,0.0017346092,0.002906944,0.00028235494,0.00074274075,0.0006870356,0.40227538],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995977,0.00004933735,0.000021448026,0.00012140246,0.00016241,0.000047711397],"domain_scores_gemma":[0.99929154,0.00037105044,0.000053219912,0.00013851709,0.00009512779,0.00005045766],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004261136,0.0006658559,0.00043877694,0.0006282808,0.00039151293,0.0019292028,0.0006231052,0.00077337754,0.019821934],"category_scores_gemma":[0.0019804405,0.00026327296,0.0004439955,0.0009860331,0.002580709,0.0038116176,0.0009345355,0.0022680978,0.0029509512],"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.000011401402,0.000005521466,0.000028402983,0.000059828588,0.000003204081,0.00004742518,0.00006001379,0.0005597943,0.0006491307,0.9787894,0.0038062874,0.015979644],"study_design_scores_gemma":[0.000010209646,0.000017446559,0.00011048807,0.000029204148,0.0000075719995,0.00022058567,0.00004477685,0.0037852458,0.0012267617,0.9076654,0.08687219,0.00001013519],"about_ca_topic_score_codex":0.00045612172,"about_ca_topic_score_gemma":0.00031234234,"teacher_disagreement_score":0.019821934,"about_ca_system_score_codex":0.0006559848,"about_ca_system_score_gemma":0.0005090577,"threshold_uncertainty_score":0.066311},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022898458,0.0017683302,0.9613692,0.00082604575,0.00019295134,0.0002639068,0.00035522875,0.0005882992,0.011737439],"genre_scores_gemma":[0.5475952,0.0031367268,0.43109357,0.0011436163,0.00051899604,0.00089449843,0.0013506921,0.00021514486,0.014051561],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9958872,0.0007992243,0.00035366658,0.0010601035,0.0015798163,0.00031994944],"domain_scores_gemma":[0.99107134,0.0061897812,0.0006061955,0.0011209492,0.0007494648,0.00026221343],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0048495107,0.0008312378,0.0006907415,0.0016801234,0.0011314481,0.0026903693,0.0021840264,0.0010118643,0.0043977764],"category_scores_gemma":[0.010065968,0.0007117206,0.002301806,0.0010294562,0.0038163662,0.008575397,0.0038316026,0.0046979287,0.0005450758],"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.000057135283,0.000033961413,0.0002960864,0.0001859714,0.000045516004,0.00023745805,0.00036974266,0.004308114,0.0024137408,0.97071844,0.0005458203,0.020788131],"study_design_scores_gemma":[0.000031578267,0.000044660726,0.000111848814,0.000059119207,0.000042787295,0.00018406754,0.00008845523,0.01957244,0.0043386286,0.95901775,0.016487328,0.000021310108],"about_ca_topic_score_codex":0.0015380635,"about_ca_topic_score_gemma":0.0012537851,"teacher_disagreement_score":0.0048495107,"about_ca_system_score_codex":0.0027456551,"about_ca_system_score_gemma":0.0014504195,"threshold_uncertainty_score":0.025646985},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0037709589,0.00008663156,0.9926394,0.0001721544,0.000042116135,0.000065807086,0.00015107602,0.0014781123,0.0015937532],"genre_scores_gemma":[0.17058104,0.0005420565,0.8222975,0.00052912196,0.000102726815,0.000418626,0.00085461244,0.00084504235,0.0038292476],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99527764,0.0013039957,0.00038114662,0.00071222,0.0018404585,0.00048462948],"domain_scores_gemma":[0.991642,0.0060621114,0.00043066125,0.0010170684,0.0007500122,0.00009814704],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004100712,0.00090804184,0.0008825332,0.0013187734,0.00068472704,0.002603294,0.0020054777,0.0009249596,0.004336982],"category_scores_gemma":[0.013857444,0.00068995636,0.0020631992,0.0008534615,0.0027012047,0.0032088934,0.0029858253,0.003085421,0.0016016802],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020782721,0.00016407813,0.0011147229,0.0007634971,0.00013611923,0.0004502576,0.0004204704,0.12573826,0.011709982,0.74104786,0.0039155055,0.11433139],"study_design_scores_gemma":[0.00017821795,0.00014102786,0.0002688343,0.00018236563,0.00010357293,0.00022031475,0.00008303307,0.49915802,0.04323548,0.43414298,0.022232499,0.00005367884],"about_ca_topic_score_codex":0.0021988458,"about_ca_topic_score_gemma":0.0019047845,"teacher_disagreement_score":0.004336982,"about_ca_system_score_codex":0.0019291075,"about_ca_system_score_gemma":0.0029611965,"threshold_uncertainty_score":0.021686912},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2327762,0.0001341085,0.7406664,0.0017756777,0.0004736949,0.0003141643,0.00047820024,0.0069608693,0.01642073],"genre_scores_gemma":[0.8956662,0.00016434165,0.096759714,0.00077185506,0.00009917732,0.00027937655,0.0007104744,0.0006930077,0.0048559196],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9916248,0.0028569356,0.0005552066,0.0011049239,0.0027049258,0.0011532214],"domain_scores_gemma":[0.96643984,0.023183208,0.0011434928,0.003908187,0.004645487,0.0006798997],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00861983,0.00077194255,0.0005058296,0.0011190355,0.0015845108,0.0018982884,0.002163911,0.0013834568,0.006654143],"category_scores_gemma":[0.03133252,0.0005289743,0.0014396461,0.000566449,0.0040171463,0.0044301087,0.0029062969,0.0021179626,0.000712575],"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.0014133207,0.000843203,0.017111974,0.0007315787,0.00022934256,0.0053381496,0.0041888524,0.06343556,0.07283196,0.6836221,0.010427401,0.13982645],"study_design_scores_gemma":[0.00024067672,0.0005963274,0.0026159505,0.00016185276,0.00025224473,0.00063207187,0.0012844866,0.27568808,0.17612796,0.5249617,0.017313842,0.00012482239],"about_ca_topic_score_codex":0.00430232,"about_ca_topic_score_gemma":0.0049971608,"teacher_disagreement_score":0.00861983,"about_ca_system_score_codex":0.0015221374,"about_ca_system_score_gemma":0.0017967785,"threshold_uncertainty_score":0.045586586},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21135804,0.00035766195,0.7739404,0.001079507,0.000048411304,0.00020748703,0.00037903766,0.0016992838,0.010930281],"genre_scores_gemma":[0.88311774,0.00014885118,0.11318681,0.00008843261,0.000053093554,0.00018297417,0.0004502192,0.00019759749,0.0025742697],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99624485,0.0010012342,0.00024122196,0.00072693767,0.0012980395,0.0004876346],"domain_scores_gemma":[0.94148976,0.04706747,0.0020768808,0.0071675763,0.0014769824,0.00072127196],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040264707,0.0009874363,0.0016551426,0.0013928157,0.0015598692,0.003143834,0.002371648,0.0017585277,0.0050329748],"category_scores_gemma":[0.044277076,0.0010419546,0.0015854691,0.001088724,0.004395699,0.00627381,0.0035591573,0.003935585,0.0003897599],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00058991584,0.00021520672,0.003998539,0.00026743536,0.000113253576,0.00029247295,0.00045972053,0.1383274,0.008792688,0.78927547,0.0020055398,0.05566244],"study_design_scores_gemma":[0.00007339541,0.00005109879,0.00059078814,0.000020530522,0.000030868618,0.00009017412,0.000045754667,0.35374266,0.0034942622,0.6408076,0.0010336193,0.000019258043],"about_ca_topic_score_codex":0.0011883813,"about_ca_topic_score_gemma":0.0019786318,"teacher_disagreement_score":0.0050329748,"about_ca_system_score_codex":0.0021908444,"about_ca_system_score_gemma":0.0024367212,"threshold_uncertainty_score":0.021294296},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005702219,0.0056313532,0.94407684,0.0015599327,0.00029397508,0.00007524108,0.00033902802,0.006120226,0.03620124],"genre_scores_gemma":[0.20354214,0.015053837,0.7314354,0.0013917058,0.001018585,0.0003408231,0.0013958036,0.003319977,0.042501792],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993605,0.00013551138,0.00007028469,0.000082574115,0.0003114324,0.00003976978],"domain_scores_gemma":[0.99908257,0.00048004228,0.00005836773,0.00013615498,0.00019803368,0.00004479214],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006545469,0.00058480236,0.00047876526,0.0010917677,0.0003543894,0.0026047865,0.0010312265,0.00075229903,0.0073372917],"category_scores_gemma":[0.0024479982,0.00041906626,0.00049470225,0.0019101631,0.0011019785,0.0026324452,0.0018090688,0.0019214144,0.0023987268],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000840116,0.000087870605,0.000464914,0.0006509931,0.000020940819,0.0002977696,0.0004719375,0.025514355,0.0052557583,0.34445566,0.028726215,0.5939696],"study_design_scores_gemma":[0.000071240815,0.00013690472,0.0002761535,0.00037412092,0.000037895585,0.0005857006,0.00016528608,0.19836904,0.016521811,0.3405754,0.44282937,0.000057041427],"about_ca_topic_score_codex":0.0018995508,"about_ca_topic_score_gemma":0.0025485975,"teacher_disagreement_score":0.0073372917,"about_ca_system_score_codex":0.0007318283,"about_ca_system_score_gemma":0.001004713,"threshold_uncertainty_score":0.02454573},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017369991,0.00045329376,0.9688292,0.0010734862,0.00010586677,0.000090194626,0.0002054521,0.00091165217,0.0109607745],"genre_scores_gemma":[0.58180815,0.0008510185,0.4071455,0.0005240309,0.00018113598,0.00015010287,0.0007938877,0.00030478075,0.008241326],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965429,0.0010192633,0.00032577768,0.0004515551,0.00128174,0.00037890926],"domain_scores_gemma":[0.99279684,0.0053685876,0.00038478937,0.0008454753,0.00049528945,0.00010906775],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005580214,0.0011945366,0.0007930245,0.0012372095,0.0011488326,0.0034347824,0.0025827067,0.0018371239,0.0032137],"category_scores_gemma":[0.012149779,0.001065396,0.0029373625,0.0009715659,0.0034276312,0.00957359,0.0027952432,0.0042851507,0.0004621009],"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.00019855672,0.000093286115,0.0010641622,0.00042209603,0.00011917409,0.001075042,0.0011827786,0.10602172,0.0038403096,0.8306161,0.0038933102,0.05147355],"study_design_scores_gemma":[0.000042259097,0.000021125872,0.00016822426,0.0000529681,0.000091181064,0.0002611847,0.00017213494,0.24739775,0.004867905,0.7405198,0.006377333,0.0000281658],"about_ca_topic_score_codex":0.0059430185,"about_ca_topic_score_gemma":0.005259979,"teacher_disagreement_score":0.0059430185,"about_ca_system_score_codex":0.0020851824,"about_ca_system_score_gemma":0.0014345851,"threshold_uncertainty_score":0.029511333},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10603396,0.00011132707,0.8843655,0.00075124466,0.00012475118,0.00017556232,0.000109118344,0.001994377,0.0063341437],"genre_scores_gemma":[0.860729,0.000049447295,0.13618404,0.00021743246,0.000059357928,0.00016117655,0.00028924123,0.00023163561,0.0020787588],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98951787,0.00424319,0.0004359624,0.0021128408,0.0027993866,0.00089068996],"domain_scores_gemma":[0.93416965,0.057084847,0.0018378632,0.0041131163,0.0019123282,0.00088219834],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006124888,0.0011827034,0.0014459264,0.00092115934,0.0006204235,0.0012914495,0.003426525,0.0018189965,0.0061813556],"category_scores_gemma":[0.055231772,0.00076246465,0.0015460124,0.00057330617,0.0036973383,0.005974245,0.0048033316,0.0036665294,0.00066804595],"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.0016076249,0.0012013365,0.007093688,0.00031916023,0.00020456169,0.0003085499,0.0002879278,0.5622704,0.007787289,0.13284273,0.0035680493,0.28250864],"study_design_scores_gemma":[0.000098564284,0.00013885867,0.00033711796,0.00001704802,0.000017873585,0.00004035272,0.00002713562,0.85774326,0.0030740802,0.13814226,0.00034931212,0.00001426789],"about_ca_topic_score_codex":0.002221232,"about_ca_topic_score_gemma":0.002313205,"teacher_disagreement_score":0.0061813556,"about_ca_system_score_codex":0.0015356841,"about_ca_system_score_gemma":0.0021605275,"threshold_uncertainty_score":0.032391846},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020379791,0.00020219931,0.9690017,0.00021862081,0.000046524427,0.00006259083,0.00008381036,0.00026974786,0.00973499],"genre_scores_gemma":[0.7372316,0.00059282494,0.24769828,0.00022430715,0.00011778027,0.00068122224,0.0003550363,0.0003079045,0.012791068],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996669,0.0013072515,0.00022504723,0.0005988488,0.0008195286,0.00038031235],"domain_scores_gemma":[0.992811,0.0053952616,0.0004476287,0.00058362976,0.0005485764,0.00021386119],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034590866,0.0009437671,0.00088674016,0.0010775293,0.0012908014,0.0022183415,0.0014270392,0.0011813573,0.005131435],"category_scores_gemma":[0.010647863,0.0007526266,0.0019144763,0.0010034048,0.002646236,0.0037778802,0.002220653,0.0030112122,0.00071356137],"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.000055896096,0.000019004581,0.00009009647,0.000038015125,0.000017461653,0.000039211085,0.00016877356,0.027339464,0.0008193096,0.96090597,0.0003403844,0.010166548],"study_design_scores_gemma":[0.000021602125,0.000025558289,0.000041311756,0.00002670515,0.000018659599,0.000028228002,0.000025785215,0.15159267,0.0011815836,0.84533906,0.0016835269,0.000015261608],"about_ca_topic_score_codex":0.0019340786,"about_ca_topic_score_gemma":0.0017023756,"teacher_disagreement_score":0.005131435,"about_ca_system_score_codex":0.002840795,"about_ca_system_score_gemma":0.0016804306,"threshold_uncertainty_score":0.020611584},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.093146466,0.00042569774,0.69546205,0.001608249,0.0004027,0.0001927582,0.00022979273,0.0005050833,0.2080272],"genre_scores_gemma":[0.6295339,0.00097616774,0.20356235,0.00041619304,0.0002801921,0.00037870565,0.00038475968,0.00031623399,0.16415152],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999734,0.00004851596,0.000017303519,0.000048041547,0.000112846246,0.000039270544],"domain_scores_gemma":[0.9994305,0.00032464718,0.000036469486,0.00009054934,0.000082795654,0.00003507427],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005332764,0.00056603615,0.00048422927,0.00048721395,0.0010710398,0.0010622446,0.001141564,0.0009026298,0.015209719],"category_scores_gemma":[0.003175966,0.0003525586,0.0008964442,0.0006514982,0.0014267293,0.0023600152,0.0024989187,0.002485716,0.0012622921],"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.000018003868,0.000012666023,0.00004101569,0.000031552634,0.0000044781846,0.00006532859,0.00012806877,0.003293077,0.0012112618,0.98427963,0.0011879392,0.009726916],"study_design_scores_gemma":[0.000041127078,0.00001815601,0.000049141057,0.000010923854,0.0000109907005,0.00009160415,0.000055718963,0.024797942,0.0017500275,0.96463627,0.008532163,0.0000058902015],"about_ca_topic_score_codex":0.0011510903,"about_ca_topic_score_gemma":0.0016770444,"teacher_disagreement_score":0.015209719,"about_ca_system_score_codex":0.00083299057,"about_ca_system_score_gemma":0.0008117526,"threshold_uncertainty_score":0.050881505},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008922374,0.0000426132,0.9858394,0.00009633292,0.000027694396,0.00010508085,0.000077605255,0.0018933023,0.0029956622],"genre_scores_gemma":[0.23378286,0.00020925494,0.75279003,0.00021220832,0.000048686252,0.0006130739,0.0007760337,0.0017185604,0.009849311],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976998,0.00053819525,0.00019828307,0.0003892582,0.00086127204,0.00031312995],"domain_scores_gemma":[0.99524575,0.0023681982,0.00014190286,0.0016755383,0.0004440446,0.000124475],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030040974,0.00082542974,0.0011302852,0.0008732704,0.000984543,0.0017637947,0.0022675842,0.0015652701,0.00608745],"category_scores_gemma":[0.006187358,0.001107495,0.0024484294,0.00093183084,0.0020357033,0.004469871,0.0051165465,0.00395095,0.0021416517],"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.00030006576,0.00018314099,0.000993164,0.000731559,0.000087469,0.0005951356,0.00084745005,0.01864403,0.038841687,0.73249245,0.0045845695,0.20169929],"study_design_scores_gemma":[0.00008406037,0.00018534146,0.00026766735,0.00012089834,0.000118901,0.0004407211,0.00015239959,0.09579519,0.09699467,0.78880566,0.016956082,0.00007842091],"about_ca_topic_score_codex":0.0004444225,"about_ca_topic_score_gemma":0.0005976822,"teacher_disagreement_score":0.00608745,"about_ca_system_score_codex":0.0007719991,"about_ca_system_score_gemma":0.0015756688,"threshold_uncertainty_score":0.020364583},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04025931,0.00012117674,0.9564502,0.00024409278,0.00004576737,0.0000905243,0.00004086052,0.0013211346,0.0014269383],"genre_scores_gemma":[0.6708486,0.0004986916,0.3252368,0.00029127992,0.0000870888,0.00022621345,0.00026212406,0.00029335625,0.002255815],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9947089,0.0013995671,0.00030778997,0.00071262056,0.0023830575,0.00048805427],"domain_scores_gemma":[0.9889768,0.0073413453,0.0006557851,0.0017747032,0.0010840025,0.00016734618],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040752883,0.00074211846,0.00065392244,0.00087612116,0.00091149233,0.0014138093,0.0016014032,0.001079953,0.0011555842],"category_scores_gemma":[0.022720082,0.00045967032,0.0012513573,0.001065765,0.0031501255,0.003446805,0.002388008,0.001679837,0.00028960008],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007510442,0.0005407487,0.0074227396,0.0008143215,0.00015931632,0.0019807979,0.0019995421,0.32684323,0.08238004,0.33877298,0.0023693258,0.23596591],"study_design_scores_gemma":[0.0001719137,0.00033867944,0.0012649373,0.00009801598,0.000093153634,0.00044540912,0.00023631554,0.7647572,0.06722911,0.15908402,0.006226727,0.000054601893],"about_ca_topic_score_codex":0.0055595445,"about_ca_topic_score_gemma":0.0032005203,"teacher_disagreement_score":0.0055595445,"about_ca_system_score_codex":0.000986651,"about_ca_system_score_gemma":0.0022798346,"threshold_uncertainty_score":0.021552444},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0091077015,0.00024023253,0.98528755,0.00028686202,0.000036490488,0.00006447213,0.00008620803,0.003797265,0.0010932691],"genre_scores_gemma":[0.3377937,0.00030656028,0.6571038,0.00031652374,0.00018072203,0.00034455437,0.00042686416,0.0009750166,0.0025523251],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9902366,0.0024098882,0.00092225085,0.0013805572,0.0040379106,0.0010127998],"domain_scores_gemma":[0.93710136,0.04563082,0.0032372014,0.010251499,0.0030451205,0.00073399406],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008626629,0.0019634706,0.0025576975,0.0018981501,0.0018135959,0.0032759286,0.00622325,0.0025075234,0.008804557],"category_scores_gemma":[0.043855384,0.0021316113,0.0024241495,0.0013840299,0.0035137516,0.009267751,0.0062502623,0.0066913045,0.002261098],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0046241027,0.0005641622,0.0049349307,0.000817198,0.00040139683,0.00026108758,0.0011226502,0.18405491,0.01893655,0.2159803,0.012888828,0.5554139],"study_design_scores_gemma":[0.00031686394,0.00021373921,0.0005873035,0.00006910317,0.00018623973,0.00016118011,0.000090915004,0.6989335,0.0173635,0.2797786,0.002242523,0.00005652087],"about_ca_topic_score_codex":0.0017101715,"about_ca_topic_score_gemma":0.003453522,"teacher_disagreement_score":0.008804557,"about_ca_system_score_codex":0.002318104,"about_ca_system_score_gemma":0.0034549846,"threshold_uncertainty_score":0.045622528},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006465247,0.00073145726,0.97078526,0.0007944817,0.00020294137,0.000037349222,0.000071978786,0.00050149305,0.026228527],"genre_scores_gemma":[0.14931248,0.004200835,0.7816135,0.0014684751,0.0013122039,0.00059255754,0.00034269688,0.0012009933,0.059956137],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983285,0.00039259737,0.00016330859,0.00025171318,0.00075430144,0.000109574874],"domain_scores_gemma":[0.9981268,0.0010758365,0.00012652566,0.0003728914,0.0002587171,0.00003930505],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016607344,0.0012685644,0.0009395043,0.0019452493,0.0012919232,0.0033959863,0.0027392441,0.0015929579,0.015042375],"category_scores_gemma":[0.0046640756,0.0014679065,0.002299142,0.0015405369,0.005266787,0.0081530325,0.0024767444,0.005723513,0.0054038316],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006162316,0.000010261739,0.000015874422,0.00008036504,0.0000071687077,0.000035587298,0.00008521031,0.0022288586,0.00056723534,0.9795694,0.002337171,0.015056669],"study_design_scores_gemma":[0.000008963669,0.00001057545,0.000020471016,0.00004267861,0.000012261772,0.000098636614,0.000015235111,0.0129181575,0.0011600868,0.9588963,0.026802449,0.000014063957],"about_ca_topic_score_codex":0.000869645,"about_ca_topic_score_gemma":0.0008718727,"teacher_disagreement_score":0.015042375,"about_ca_system_score_codex":0.002185127,"about_ca_system_score_gemma":0.0011627572,"threshold_uncertainty_score":0.0503217},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04263009,0.00012575793,0.94631153,0.00011600875,0.000049279224,0.00007202124,0.0001377182,0.0030486027,0.007508941],"genre_scores_gemma":[0.7355411,0.00028125828,0.2537227,0.00008557295,0.00012042083,0.00020846796,0.0006124699,0.00094718003,0.008480918],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99726593,0.00061344064,0.00017641614,0.00034704976,0.0011870385,0.00041007702],"domain_scores_gemma":[0.9964772,0.0019939847,0.00026038435,0.0007425311,0.0004466049,0.00007927593],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022153482,0.00080750015,0.0010338613,0.0022039132,0.0010582856,0.0016280317,0.0018700154,0.00069316535,0.0054449197],"category_scores_gemma":[0.005332486,0.0007019483,0.0018890288,0.00194569,0.0026490642,0.0049931887,0.0016843965,0.0015645749,0.0008108894],"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.00067456625,0.00021044943,0.0025601732,0.00035924886,0.00009423484,0.0003245133,0.00051698106,0.070755936,0.027410807,0.7281392,0.0027059184,0.16624786],"study_design_scores_gemma":[0.000051875235,0.00017118265,0.00080851594,0.00007153834,0.000108889726,0.0001655958,0.00013334707,0.27962217,0.04376112,0.6689924,0.006058011,0.00005546807],"about_ca_topic_score_codex":0.0016073548,"about_ca_topic_score_gemma":0.0016855611,"teacher_disagreement_score":0.0054449197,"about_ca_system_score_codex":0.0011374025,"about_ca_system_score_gemma":0.0016545564,"threshold_uncertainty_score":0.01821506},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003821144,0.018652925,0.5501751,0.0041646706,0.0034690548,0.0002208123,0.0023143634,0.001990742,0.41519126],"genre_scores_gemma":[0.17353632,0.028674308,0.26244465,0.0041793515,0.002890858,0.0007168889,0.004733988,0.001234799,0.5215889],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99876803,0.0003251475,0.00007484964,0.00028067586,0.00046451073,0.00008677577],"domain_scores_gemma":[0.998628,0.00074314163,0.000109908164,0.0002128436,0.00023914201,0.00006695295],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00074190454,0.0009677809,0.00062004157,0.0012409532,0.00087923,0.0033162723,0.00100609,0.0013732382,0.03340706],"category_scores_gemma":[0.0038311367,0.00059890933,0.001035651,0.0018179865,0.0020069326,0.005246939,0.0013595024,0.0025943026,0.009481449],"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.000011402243,0.000008915665,0.00005773338,0.00015486602,0.000013118907,0.00008791326,0.00018768264,0.001940981,0.00057774776,0.9444427,0.021737782,0.030779168],"study_design_scores_gemma":[0.000007620765,0.000014059507,0.00011623743,0.00011798394,0.000012029782,0.00022050395,0.000047158504,0.005024142,0.00048649625,0.6138078,0.3801295,0.000016475316],"about_ca_topic_score_codex":0.0012155599,"about_ca_topic_score_gemma":0.0015542055,"teacher_disagreement_score":0.03340706,"about_ca_system_score_codex":0.00170429,"about_ca_system_score_gemma":0.0011377747,"threshold_uncertainty_score":0.111757755},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008674162,0.000086410946,0.98636055,0.00026513432,0.00004212803,0.000054210537,0.00010011101,0.0026313118,0.0017860159],"genre_scores_gemma":[0.3066483,0.0003252783,0.6890085,0.00022989383,0.000080040096,0.0003391397,0.0005544789,0.000566208,0.002248091],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9898164,0.004086722,0.00042785495,0.0009887511,0.0041367747,0.00054348254],"domain_scores_gemma":[0.9760007,0.016255278,0.0011932683,0.004554349,0.0017882375,0.00020811318],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006264676,0.0012324912,0.001538703,0.0020260746,0.0015650219,0.0031187688,0.004087303,0.0021088086,0.0046128416],"category_scores_gemma":[0.023662433,0.0013138402,0.0026803266,0.0016745508,0.0029339097,0.0054700347,0.0039872853,0.0037702392,0.001013169],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034569032,0.0003746901,0.0013934032,0.00036272875,0.00026081435,0.0007441841,0.0003559797,0.39405966,0.012493316,0.45978168,0.0041438513,0.125684],"study_design_scores_gemma":[0.000112131784,0.000030394065,0.000053475364,0.000022068249,0.00003737236,0.00006932249,0.000023854254,0.763254,0.0067600203,0.22769174,0.0019248949,0.00002082455],"about_ca_topic_score_codex":0.0035990088,"about_ca_topic_score_gemma":0.006760261,"teacher_disagreement_score":0.006264676,"about_ca_system_score_codex":0.001817463,"about_ca_system_score_gemma":0.0037714124,"threshold_uncertainty_score":0.033131123},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011453503,0.00032896159,0.98184377,0.00011876592,0.0000306332,0.000082420825,0.000027055732,0.0010362619,0.005078708],"genre_scores_gemma":[0.41738614,0.00053338544,0.56823796,0.00017264893,0.000042907486,0.00023739692,0.00016092189,0.0006475857,0.012581092],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998226,0.00056009204,0.000092844195,0.00019539913,0.00077532773,0.00015039116],"domain_scores_gemma":[0.9976357,0.0010989234,0.000112036214,0.00076557376,0.00035032345,0.00003741604],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021207116,0.000772744,0.00069918326,0.00051521556,0.0006305309,0.002248628,0.0019743436,0.0011748278,0.0031233397],"category_scores_gemma":[0.0053038467,0.00078017486,0.00082482357,0.00032271174,0.0019966017,0.0021722154,0.0013386115,0.0020953922,0.0009571535],"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.00030913774,0.00012687204,0.0015746558,0.00083445467,0.00011300679,0.00035326113,0.0008677469,0.21517444,0.060833752,0.5082606,0.0034246738,0.20812738],"study_design_scores_gemma":[0.000054607863,0.0001721338,0.00050820265,0.00017474516,0.00006358676,0.00021109714,0.000054496017,0.7427896,0.06539772,0.16203508,0.028505497,0.000033189266],"about_ca_topic_score_codex":0.0014923455,"about_ca_topic_score_gemma":0.0014808176,"teacher_disagreement_score":0.0031233397,"about_ca_system_score_codex":0.001206987,"about_ca_system_score_gemma":0.0015477417,"threshold_uncertainty_score":0.011215568},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022786373,0.0001959308,0.96528274,0.00017326455,0.000089815454,0.0001834209,0.00013326845,0.004869835,0.006285366],"genre_scores_gemma":[0.602687,0.00033120383,0.3873961,0.00016237171,0.00007550727,0.00031992205,0.00034212237,0.0008663314,0.007819494],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9935548,0.002063992,0.00047206576,0.0008784682,0.0023853658,0.0006452079],"domain_scores_gemma":[0.9854101,0.009179075,0.0010201657,0.0030036687,0.0012122501,0.00017469765],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005366194,0.0012941703,0.0007328741,0.0010396874,0.00068511517,0.002654559,0.002647564,0.0013942529,0.006184274],"category_scores_gemma":[0.01489012,0.0011685364,0.0017943317,0.00072304066,0.0036952642,0.0066853995,0.003134073,0.0024800273,0.0010998228],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008546158,0.00031244467,0.0020665862,0.0010868273,0.00017891491,0.002354493,0.0022123184,0.116984665,0.042165477,0.6379397,0.0039380095,0.18990596],"study_design_scores_gemma":[0.00021908084,0.00020290265,0.0006763999,0.00032987128,0.00023840791,0.0009678112,0.00034147783,0.4730329,0.104959,0.37209675,0.04681865,0.00011682634],"about_ca_topic_score_codex":0.0016636971,"about_ca_topic_score_gemma":0.0017282376,"teacher_disagreement_score":0.006184274,"about_ca_system_score_codex":0.0009138681,"about_ca_system_score_gemma":0.0018715496,"threshold_uncertainty_score":0.0283795},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.077398635,0.0005480905,0.89626294,0.0012115933,0.00013559608,0.00053610327,0.00078151777,0.0048670536,0.018258467],"genre_scores_gemma":[0.33394754,0.00069838617,0.64963305,0.00034736466,0.000092094364,0.00040046932,0.002236706,0.000927312,0.011717047],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978241,0.0004893585,0.00022582758,0.00040887078,0.000777202,0.00027455954],"domain_scores_gemma":[0.9937163,0.0050576823,0.00021741402,0.00056163117,0.00036770146,0.000079345264],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021233854,0.0011944073,0.0014403948,0.0015901823,0.0010068787,0.0034521797,0.002258594,0.0026840868,0.010488561],"category_scores_gemma":[0.014665998,0.0010976065,0.002843675,0.0020802608,0.0017835585,0.005642786,0.003032831,0.0028388952,0.0016017159],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010264635,0.00044234254,0.0011896896,0.0013782567,0.00022701443,0.00065138895,0.0020494452,0.09871317,0.020941779,0.41176623,0.014637068,0.4469771],"study_design_scores_gemma":[0.00025975806,0.00021010626,0.0002537923,0.0001602539,0.00018925792,0.00026144032,0.0008340792,0.35624352,0.018784601,0.61351955,0.009229071,0.000054516782],"about_ca_topic_score_codex":0.0018662742,"about_ca_topic_score_gemma":0.0023528042,"teacher_disagreement_score":0.010488561,"about_ca_system_score_codex":0.0012883916,"about_ca_system_score_gemma":0.0018251305,"threshold_uncertainty_score":0.035087764},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02665897,0.00039705966,0.95386344,0.0008573029,0.00014274979,0.00019258022,0.0006401734,0.0019651419,0.01528253],"genre_scores_gemma":[0.5436504,0.0007361413,0.43749875,0.00045322147,0.00020430844,0.0007035978,0.0033745908,0.00231624,0.011062694],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98254657,0.0058716144,0.0015687762,0.0019179904,0.0072869244,0.00080809224],"domain_scores_gemma":[0.9641955,0.014528893,0.002439357,0.01263852,0.005784507,0.0004131153],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01220101,0.00072159857,0.0011890285,0.0021237745,0.0014309278,0.0059229136,0.003860986,0.0020222727,0.0054157744],"category_scores_gemma":[0.042141493,0.0020758733,0.0022711903,0.0019921523,0.0033464152,0.008384944,0.0040369,0.0036377094,0.001757946],"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.00027702615,0.00009291443,0.001844383,0.00037760413,0.00010050202,0.000461107,0.0015467731,0.04470313,0.0076604937,0.8659935,0.005323675,0.071618855],"study_design_scores_gemma":[0.00011785849,0.0000680439,0.00058437657,0.00021807046,0.00012400125,0.00029215708,0.00033334122,0.1646338,0.018377064,0.7906371,0.024563352,0.00005082846],"about_ca_topic_score_codex":0.003801831,"about_ca_topic_score_gemma":0.0027268012,"teacher_disagreement_score":0.01220101,"about_ca_system_score_codex":0.0021032828,"about_ca_system_score_gemma":0.0039927275,"threshold_uncertainty_score":0.0645259},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15477328,0.0049386844,0.7926058,0.0013633406,0.00058621785,0.00043405514,0.0012091437,0.011623731,0.032465708],"genre_scores_gemma":[0.7687735,0.0013513247,0.22271948,0.00021333034,0.00010512497,0.00029521092,0.0013796077,0.0014504968,0.0037118662],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9824232,0.008056556,0.0009449956,0.0007784116,0.006428434,0.001368423],"domain_scores_gemma":[0.91744554,0.063178144,0.0015001829,0.0120518375,0.00520248,0.0006217922],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010951852,0.0014309598,0.001822849,0.004315618,0.0010310713,0.0039034106,0.0033219194,0.0018080642,0.00961901],"category_scores_gemma":[0.049848128,0.0008887262,0.0023015342,0.0032512827,0.0018492662,0.00894929,0.0028591268,0.0023967538,0.0009400652],"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.005139678,0.00079027814,0.004565364,0.0014208222,0.0005368088,0.00012880474,0.0004953076,0.23974113,0.01060848,0.38154274,0.013673313,0.3413572],"study_design_scores_gemma":[0.00036395763,0.00053128117,0.001498651,0.00030024446,0.0003455092,0.00012067883,0.0002011848,0.7704628,0.020996919,0.19645268,0.008646538,0.00007967489],"about_ca_topic_score_codex":0.003438174,"about_ca_topic_score_gemma":0.004147703,"teacher_disagreement_score":0.010951852,"about_ca_system_score_codex":0.0030676955,"about_ca_system_score_gemma":0.00405615,"threshold_uncertainty_score":0.05791962},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00292592,0.00013300937,0.99336064,0.00006619201,0.00003437778,0.00009847666,0.000085741216,0.0019948299,0.0013008511],"genre_scores_gemma":[0.09289112,0.00040278237,0.9019886,0.00009876813,0.000038304286,0.0004270198,0.0005620215,0.001123833,0.0024674637],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9952933,0.001433894,0.00043170483,0.00060086,0.0017189335,0.0005211826],"domain_scores_gemma":[0.9915792,0.0039013566,0.0002932599,0.0033144946,0.00074950635,0.00016212581],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038770388,0.0015543901,0.001865678,0.0018800623,0.0014793475,0.0028244792,0.003706376,0.0014395617,0.0046320697],"category_scores_gemma":[0.012364344,0.0027429094,0.0040003466,0.0017756451,0.0031821325,0.005058515,0.0068204105,0.005877067,0.0022468762],"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.00025422985,0.00020105638,0.0012551987,0.0010931251,0.0001729105,0.0004668584,0.001219225,0.04731102,0.017849598,0.6778071,0.0076256962,0.24474396],"study_design_scores_gemma":[0.00007959784,0.00007517344,0.00024680694,0.00025517237,0.00018856798,0.00020821833,0.00012646268,0.123974785,0.022228923,0.82613873,0.026409207,0.0000683159],"about_ca_topic_score_codex":0.0015109342,"about_ca_topic_score_gemma":0.0023366283,"teacher_disagreement_score":0.0046320697,"about_ca_system_score_codex":0.0013030693,"about_ca_system_score_gemma":0.003413634,"threshold_uncertainty_score":0.020503998},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028886413,0.0014290627,0.51298404,0.0067124167,0.0014892743,0.0004540144,0.00067821,0.0038544035,0.44351226],"genre_scores_gemma":[0.5823701,0.0017585556,0.24144904,0.0030997503,0.00039433604,0.0010862867,0.0008758077,0.0016350386,0.16733108],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978662,0.0008905026,0.00012160885,0.0002967885,0.0006091836,0.00021578278],"domain_scores_gemma":[0.9921474,0.005604325,0.00016264812,0.0012722928,0.00063790125,0.00017555773],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016852114,0.001273449,0.0007735272,0.001430002,0.0019206629,0.0032004323,0.0016833071,0.0031608483,0.031202203],"category_scores_gemma":[0.013093743,0.00097062264,0.001199714,0.00147839,0.003077056,0.008119139,0.0034837339,0.0034178086,0.0060402206],"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.00006846441,0.000045424687,0.00008086497,0.00016411155,0.000011729592,0.00014229731,0.00023049077,0.001170281,0.0010425398,0.9711946,0.010716635,0.015132607],"study_design_scores_gemma":[0.00006384537,0.000028892418,0.00008330318,0.00011273146,0.000038407765,0.0006136472,0.00010436729,0.0095331855,0.0064521804,0.90438396,0.078559026,0.000026500358],"about_ca_topic_score_codex":0.00026517693,"about_ca_topic_score_gemma":0.0004139612,"teacher_disagreement_score":0.031202203,"about_ca_system_score_codex":0.0010523329,"about_ca_system_score_gemma":0.00067986036,"threshold_uncertainty_score":0.10438174},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024904054,0.000076644144,0.9699602,0.00012696168,0.00006378222,0.00009085778,0.000118639626,0.0013874287,0.003271384],"genre_scores_gemma":[0.71811336,0.00028180392,0.27385277,0.0001363197,0.00008022707,0.00029618345,0.0005167241,0.00038131233,0.006341299],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9961593,0.0010298779,0.00039013167,0.00056663353,0.0014326542,0.00042148444],"domain_scores_gemma":[0.99345595,0.0041073016,0.00026802748,0.001342377,0.00065569085,0.00017060486],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037615718,0.000857256,0.00106046,0.00091003696,0.0012614111,0.002958094,0.0018209076,0.0010751232,0.004939956],"category_scores_gemma":[0.007016857,0.0010226751,0.0023493536,0.000836431,0.0026373058,0.0074574803,0.00437106,0.00259128,0.00096714403],"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.0005188174,0.00013517418,0.0008157381,0.00031641472,0.000102565165,0.00047711175,0.0004512764,0.058497235,0.021735687,0.86889684,0.0013214296,0.046731703],"study_design_scores_gemma":[0.00012922702,0.000101672114,0.00015804531,0.0000541503,0.00006629232,0.00014377912,0.00008947897,0.2551738,0.039892428,0.69918364,0.004956342,0.00005123499],"about_ca_topic_score_codex":0.0013221671,"about_ca_topic_score_gemma":0.001235359,"teacher_disagreement_score":0.004939956,"about_ca_system_score_codex":0.0010085487,"about_ca_system_score_gemma":0.0018419938,"threshold_uncertainty_score":0.019893348},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016499214,0.0001227862,0.99102366,0.00013436809,0.000057393354,0.00004757341,0.00006563998,0.0008936086,0.0060050916],"genre_scores_gemma":[0.08636828,0.00030733753,0.8942012,0.00028998373,0.00015142195,0.0004369543,0.0004536641,0.001375209,0.01641591],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977633,0.0009641819,0.00012696009,0.00030329882,0.00067040266,0.00017199434],"domain_scores_gemma":[0.99744606,0.001609261,0.00010282959,0.0004731494,0.00028866704,0.0000799705],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028345264,0.0013447322,0.0012201924,0.0015977495,0.00087691325,0.0019624233,0.0038326853,0.0010969181,0.015945446],"category_scores_gemma":[0.007414635,0.0008477859,0.0017522031,0.002098932,0.0022164918,0.0043676374,0.0033754879,0.0036081346,0.0036252644],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011695513,0.00014311205,0.0003804424,0.00031860598,0.00006822036,0.000046519228,0.00033946946,0.051948763,0.0020795325,0.56326085,0.013243135,0.3680544],"study_design_scores_gemma":[0.0000680868,0.000025957517,0.00009261482,0.00006132837,0.000035971145,0.000035479385,0.000051663024,0.42730138,0.0016085841,0.55616593,0.014532785,0.00002018291],"about_ca_topic_score_codex":0.0015652396,"about_ca_topic_score_gemma":0.003998576,"teacher_disagreement_score":0.015945446,"about_ca_system_score_codex":0.0014366726,"about_ca_system_score_gemma":0.0015449073,"threshold_uncertainty_score":0.05334282},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0036685064,0.03819481,0.7861088,0.087894715,0.007030683,0.00015356496,0.00021944719,0.0007323192,0.07599711],"genre_scores_gemma":[0.4198793,0.027574763,0.4449825,0.03289497,0.01627477,0.0011979418,0.00039616716,0.0011761219,0.055623554],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9928833,0.0039523477,0.0002803801,0.00082543073,0.0017923332,0.00026621658],"domain_scores_gemma":[0.9831838,0.012429767,0.00036282034,0.002028647,0.0014642834,0.00053063396],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.013879565,0.0014833404,0.0016150668,0.0026199792,0.0027692267,0.007561416,0.0029509922,0.0053893453,0.0050341235],"category_scores_gemma":[0.019064695,0.0010743912,0.002049758,0.0010629816,0.036963116,0.02154586,0.003855611,0.012121248,0.0021518357],"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.000010868963,0.000009613273,0.000038217102,0.000060982347,0.0000074359614,0.000008803179,0.00019167065,0.00019129939,0.00006185561,0.9933015,0.0023202314,0.003797586],"study_design_scores_gemma":[0.000020120275,0.000009930449,0.00001962939,0.00007283396,0.0000043624377,0.000025072824,0.00005442628,0.0005532937,0.00010235426,0.9622615,0.036866587,0.000009841111],"about_ca_topic_score_codex":0.0022237762,"about_ca_topic_score_gemma":0.00090456347,"teacher_disagreement_score":0.013879565,"about_ca_system_score_codex":0.004037801,"about_ca_system_score_gemma":0.0038282403,"threshold_uncertainty_score":0.07340306},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009980964,0.00004283521,0.996209,0.000040297407,0.000025072251,0.000084030435,0.00006298537,0.0020346388,0.0005031101],"genre_scores_gemma":[0.026130093,0.00009424291,0.97180384,0.000042843792,0.000024239778,0.00033472895,0.00034182472,0.00037774447,0.00085047283],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971615,0.0006138006,0.00036149472,0.00077665923,0.00085766567,0.00022893265],"domain_scores_gemma":[0.99411786,0.0039723148,0.0002739956,0.0008060655,0.0007357026,0.00009404221],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023612338,0.002051416,0.0012332991,0.001841921,0.0013953388,0.0023379247,0.0026753347,0.0019865637,0.010672561],"category_scores_gemma":[0.009724342,0.0011811694,0.0019652497,0.0011745967,0.0016828681,0.0038142025,0.0027017184,0.00233186,0.0029058936],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009086535,0.00030727187,0.0013771049,0.0013677923,0.00025804457,0.0006523291,0.0005416489,0.11082414,0.032219104,0.2151152,0.011481689,0.624947],"study_design_scores_gemma":[0.0006620605,0.00024650205,0.00040634227,0.00020037303,0.00018773985,0.00061415305,0.00011590101,0.73272353,0.036326893,0.19278102,0.035609502,0.00012596903],"about_ca_topic_score_codex":0.002019259,"about_ca_topic_score_gemma":0.002068968,"teacher_disagreement_score":0.010672561,"about_ca_system_score_codex":0.0014872461,"about_ca_system_score_gemma":0.0027209246,"threshold_uncertainty_score":0.0357033},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011884644,0.00026741443,0.9748141,0.00031910712,0.00010835682,0.00009899677,0.0000650148,0.0006954921,0.011746946],"genre_scores_gemma":[0.5088626,0.0005365874,0.47870576,0.000273617,0.00024898502,0.0003744312,0.00028428066,0.00054893823,0.010164733],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9946188,0.0016206257,0.00038095753,0.0007468256,0.0022076964,0.00042504474],"domain_scores_gemma":[0.98824954,0.0072829444,0.00047132396,0.003029405,0.00080206303,0.00016477477],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037163093,0.00092143577,0.000964107,0.0012694891,0.0011127298,0.0020399205,0.0018928834,0.0013493398,0.006211006],"category_scores_gemma":[0.012912035,0.0012053755,0.0015617112,0.0013252251,0.005095555,0.012789537,0.0053080595,0.003826039,0.0015355262],"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.000121497615,0.000036058318,0.00018291644,0.00018946362,0.000028831277,0.00019888899,0.00034504748,0.007901,0.0042909314,0.9283557,0.0013461141,0.057003632],"study_design_scores_gemma":[0.000036522804,0.00006419262,0.00008498839,0.00007224953,0.00003944032,0.00014865358,0.000043586984,0.028884882,0.010557929,0.95195484,0.008088378,0.000024366005],"about_ca_topic_score_codex":0.0004028349,"about_ca_topic_score_gemma":0.0005949116,"teacher_disagreement_score":0.006211006,"about_ca_system_score_codex":0.0012020527,"about_ca_system_score_gemma":0.0015665592,"threshold_uncertainty_score":0.020777881},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016627926,0.0011560051,0.93341094,0.002160771,0.00038629002,0.00013393859,0.00085316953,0.0031810885,0.042089958],"genre_scores_gemma":[0.3447601,0.0015622576,0.60888535,0.0011118422,0.00038910776,0.0003971324,0.002799418,0.00216905,0.037925724],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99876875,0.00046106172,0.000072348514,0.00023456954,0.00037302164,0.000090166875],"domain_scores_gemma":[0.9967656,0.002524503,0.000094981944,0.00041572214,0.00015228878,0.000046830668],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014555743,0.0009388251,0.0007451739,0.0007327181,0.0005908771,0.0020322653,0.0024784717,0.00086696225,0.026817184],"category_scores_gemma":[0.007005656,0.00095044286,0.0012607967,0.0012398373,0.0016715251,0.009440498,0.0031339,0.004072953,0.0033769927],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026385023,0.00010994383,0.00036062073,0.0006951434,0.00007287678,0.00012117257,0.00025958588,0.043131247,0.002698638,0.63727057,0.019423673,0.29559276],"study_design_scores_gemma":[0.00005234849,0.000029421293,0.000085782725,0.00010244216,0.000030318255,0.000081661005,0.00005238115,0.09758695,0.00417803,0.8809904,0.016791636,0.000018591347],"about_ca_topic_score_codex":0.0007244566,"about_ca_topic_score_gemma":0.0018186892,"teacher_disagreement_score":0.026817184,"about_ca_system_score_codex":0.0011413138,"about_ca_system_score_gemma":0.000751117,"threshold_uncertainty_score":0.08971238},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036108147,0.0104014585,0.6615169,0.12933584,0.0076511786,0.00014139125,0.00046355277,0.0053849663,0.14899655],"genre_scores_gemma":[0.6462508,0.0070698387,0.20855162,0.028822757,0.0025685001,0.0003711776,0.00034130694,0.0036987972,0.10232522],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99389786,0.0014377203,0.00027787944,0.0006310116,0.0027466824,0.0010089694],"domain_scores_gemma":[0.98668647,0.0038598457,0.000651646,0.0062742964,0.0017091885,0.0008186023],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007952931,0.0010375585,0.0015593568,0.0012606219,0.0024996758,0.0042962106,0.0024745304,0.0029268542,0.01414541],"category_scores_gemma":[0.02824795,0.0010908102,0.001226202,0.0009777057,0.0122482935,0.023111982,0.0075601097,0.0086281495,0.0060175974],"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.000091868686,0.000038573155,0.00033779748,0.0002435951,0.00005249788,0.00014428432,0.0008136884,0.0015442469,0.0010491669,0.9266786,0.028079772,0.040925972],"study_design_scores_gemma":[0.000020587902,0.000029495646,0.00008570836,0.00011303808,0.00002987722,0.00013054191,0.0003015795,0.0009160094,0.0011183639,0.9283428,0.068892635,0.000019220568],"about_ca_topic_score_codex":0.0011303966,"about_ca_topic_score_gemma":0.0013076414,"teacher_disagreement_score":0.01414541,"about_ca_system_score_codex":0.0017042187,"about_ca_system_score_gemma":0.0025032167,"threshold_uncertainty_score":0.04732108},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022664357,0.0009091626,0.9165189,0.0012926718,0.00019481948,0.0002396428,0.000080125734,0.0050263205,0.053074062],"genre_scores_gemma":[0.30831742,0.0013651089,0.6479885,0.00078677793,0.00012601166,0.00018027713,0.00026234673,0.0008266159,0.040146973],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984835,0.00040385078,0.00009356564,0.00015337352,0.0006147615,0.00025099018],"domain_scores_gemma":[0.99881005,0.00045642885,0.000045370387,0.00035960274,0.0002833703,0.00004516119],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019207926,0.00046301738,0.00036186472,0.00048196022,0.000526646,0.0026809233,0.001958271,0.0009236675,0.01589623],"category_scores_gemma":[0.0030982045,0.0003908631,0.000620388,0.00033925442,0.00072974566,0.004354608,0.00078845216,0.0012733508,0.0045040315],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000510899,0.00018234836,0.00092677824,0.00044171233,0.000055500997,0.0007541153,0.0003666909,0.021460352,0.05764546,0.6417008,0.011715161,0.26424018],"study_design_scores_gemma":[0.00024908723,0.0014254247,0.00083663,0.0003836654,0.00014277273,0.0027461988,0.0004236385,0.20182775,0.19835192,0.17980975,0.41363305,0.00017009779],"about_ca_topic_score_codex":0.0014199339,"about_ca_topic_score_gemma":0.0029712261,"teacher_disagreement_score":0.01589623,"about_ca_system_score_codex":0.00077920425,"about_ca_system_score_gemma":0.0014924855,"threshold_uncertainty_score":0.05317819},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015266031,0.00006120311,0.97886854,0.000085635285,0.000056174915,0.000061882994,0.000057883088,0.0031873782,0.0023551479],"genre_scores_gemma":[0.24720804,0.0001599829,0.74801934,0.000113353155,0.0000751649,0.00016351443,0.00029558953,0.0010807104,0.0028843111],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986523,0.00030964412,0.00010719215,0.0002100128,0.00058459444,0.00013628545],"domain_scores_gemma":[0.9983992,0.0004986043,0.00014992633,0.0005509166,0.00032825494,0.000073085124],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013218933,0.0006315025,0.00044793202,0.00057073036,0.0002551312,0.00096542196,0.0008006266,0.00031675925,0.0027995368],"category_scores_gemma":[0.003057725,0.0002996572,0.0009788204,0.00046388415,0.00074956537,0.0011645477,0.0014153523,0.00083216984,0.00075977226],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007728002,0.00046723432,0.005997546,0.0011913566,0.00019531262,0.000977714,0.0009880157,0.23844638,0.19425882,0.16159108,0.0057929545,0.38932064],"study_design_scores_gemma":[0.00013742692,0.00036467388,0.0010991339,0.00015412147,0.00014853867,0.00043771233,0.00009262942,0.7375378,0.1530134,0.046063896,0.060899124,0.000051514216],"about_ca_topic_score_codex":0.0005646413,"about_ca_topic_score_gemma":0.0008610463,"teacher_disagreement_score":0.0027995368,"about_ca_system_score_codex":0.00052414177,"about_ca_system_score_gemma":0.0011044783,"threshold_uncertainty_score":0.00936538},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032769702,0.000023835024,0.96088153,0.00010691126,0.000018159866,0.00016086396,0.0001805831,0.0040523238,0.0018060668],"genre_scores_gemma":[0.5862776,0.00009092038,0.4081613,0.00014941239,0.000021223035,0.00045560274,0.0007339859,0.0009946103,0.0031153613],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99875975,0.00039407564,0.000098432225,0.00017519317,0.00045034796,0.00012227142],"domain_scores_gemma":[0.9955147,0.002933851,0.0004053331,0.00075627066,0.00033332987,0.00005652911],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010444013,0.0005457516,0.00027033454,0.0005661999,0.00023933084,0.0007921219,0.0007578224,0.0005905891,0.0037027574],"category_scores_gemma":[0.0061402246,0.00037693314,0.0006234635,0.00029678046,0.0009282809,0.0012174821,0.0009986731,0.0008418522,0.0005879323],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00075829297,0.0002854312,0.005923735,0.0007248632,0.00009169061,0.0012001514,0.0008196084,0.1751112,0.20499586,0.37230322,0.0041174493,0.23366846],"study_design_scores_gemma":[0.00016440998,0.0002895823,0.0009066928,0.000051165134,0.000083157465,0.00047638922,0.00008238657,0.6304185,0.25629315,0.09213021,0.019059876,0.00004450292],"about_ca_topic_score_codex":0.00047398033,"about_ca_topic_score_gemma":0.00088394363,"teacher_disagreement_score":0.0037027574,"about_ca_system_score_codex":0.00050652924,"about_ca_system_score_gemma":0.00064238947,"threshold_uncertainty_score":0.012386978},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007709743,0.0000642122,0.988612,0.000099087716,0.00004957909,0.000047850113,0.000026628433,0.00049241685,0.0028984295],"genre_scores_gemma":[0.1894102,0.00014531972,0.8066762,0.000115821305,0.00002479618,0.00009969463,0.00010338059,0.00006041863,0.003364152],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99971825,0.00004095282,0.000020013533,0.000065861466,0.00012354986,0.00003132783],"domain_scores_gemma":[0.99973136,0.00010080709,0.000023989016,0.000025179745,0.00010454156,0.000014111214],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042835766,0.00041029096,0.0003507235,0.0007156957,0.0006503366,0.00063720765,0.0008521467,0.0007115391,0.0023139832],"category_scores_gemma":[0.0010655117,0.00017134087,0.0003880966,0.00040274393,0.00043813832,0.00083406403,0.00043940355,0.0006196727,0.00034212822],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016518537,0.00016301447,0.00075506803,0.00013741982,0.0000504715,0.00016911406,0.00013887297,0.33071798,0.038803477,0.10239214,0.0045815166,0.52192575],"study_design_scores_gemma":[0.000040342005,0.000064782194,0.00011903468,0.000016534706,0.00002258921,0.000117238735,0.00001617343,0.9678533,0.010220178,0.015561478,0.0059496257,0.00001867525],"about_ca_topic_score_codex":0.0033132648,"about_ca_topic_score_gemma":0.0030348226,"teacher_disagreement_score":0.0033132648,"about_ca_system_score_codex":0.00086615264,"about_ca_system_score_gemma":0.0009804603,"threshold_uncertainty_score":0.007741034},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19177066,0.0012908347,0.7341655,0.0042370823,0.00080873526,0.0005589938,0.0038497078,0.003670918,0.05964765],"genre_scores_gemma":[0.6837462,0.0007844786,0.28862178,0.0006827821,0.00032938493,0.00048371637,0.0051685674,0.0009695936,0.019213533],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99764377,0.00039859948,0.00022005932,0.00046868977,0.0009384847,0.0003304591],"domain_scores_gemma":[0.9878154,0.008407206,0.0004490964,0.0017474078,0.0012408532,0.00034012608],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023514973,0.0008324835,0.0011081509,0.0013295315,0.0014720367,0.0028736645,0.002018211,0.0021782978,0.018414827],"category_scores_gemma":[0.018454062,0.0010760593,0.0014358254,0.0012762764,0.0016316894,0.0065922635,0.0033994124,0.003859684,0.0013887514],"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.0010330804,0.00022388448,0.0030582973,0.0013344558,0.00014752828,0.00086433446,0.0013135578,0.021479499,0.016076948,0.7336506,0.020952793,0.19986497],"study_design_scores_gemma":[0.00013224526,0.00008335659,0.00087512966,0.00020817327,0.00009008037,0.00047504684,0.00033422332,0.052636217,0.012535247,0.9135988,0.018982196,0.000049284947],"about_ca_topic_score_codex":0.0016893655,"about_ca_topic_score_gemma":0.0046003945,"teacher_disagreement_score":0.018414827,"about_ca_system_score_codex":0.0015427411,"about_ca_system_score_gemma":0.0014668697,"threshold_uncertainty_score":0.061603725},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024460565,0.00052894535,0.9477711,0.0021186508,0.00008123756,0.00012805789,0.0001514707,0.00022996168,0.024530021],"genre_scores_gemma":[0.6475734,0.0013368197,0.33321008,0.0012720698,0.0001615014,0.0010482237,0.0003865806,0.00025234354,0.014759027],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99342066,0.002813944,0.0004384594,0.00061459455,0.0020942478,0.00061816146],"domain_scores_gemma":[0.99247134,0.0048372988,0.0004698775,0.0010451186,0.0009212731,0.0002550624],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00472469,0.001021874,0.0008787161,0.0017325677,0.0009716724,0.0039057173,0.0021229237,0.0025012004,0.0047747735],"category_scores_gemma":[0.009896386,0.00089299586,0.0014580743,0.001445976,0.0061649703,0.0077315457,0.0035253274,0.0055545378,0.00085585704],"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.000029246488,0.000017559922,0.0001312215,0.00006359985,0.000008257206,0.00013146989,0.00037799307,0.013416664,0.0013199659,0.9809348,0.00032413675,0.0032451518],"study_design_scores_gemma":[0.000060682247,0.00006316753,0.00011747652,0.00005770039,0.000023670482,0.00008108466,0.00020389387,0.064300396,0.0022321655,0.92019093,0.012633923,0.00003490812],"about_ca_topic_score_codex":0.0038700267,"about_ca_topic_score_gemma":0.0021703877,"teacher_disagreement_score":0.0047747735,"about_ca_system_score_codex":0.0028412354,"about_ca_system_score_gemma":0.0025137581,"threshold_uncertainty_score":0.024986863},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015833352,0.00010498129,0.987328,0.0001144532,0.000044681132,0.00009417482,0.00017316281,0.008693413,0.0018639159],"genre_scores_gemma":[0.17017198,0.0005465416,0.81504595,0.00054720085,0.00012787934,0.00039268986,0.0010384072,0.0035840427,0.00854533],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983891,0.00046442618,0.00012353361,0.00023817542,0.00058559113,0.00019923107],"domain_scores_gemma":[0.9971945,0.0016390092,0.00016482337,0.00049443945,0.0004321992,0.00007493147],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027634862,0.0009878088,0.00066100346,0.001139821,0.0006472792,0.002173248,0.0017478167,0.00090960175,0.010044277],"category_scores_gemma":[0.004501755,0.0011056445,0.0013885703,0.00048033,0.0015060403,0.0024982078,0.001788529,0.0022732746,0.0027416795],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039390812,0.00028243556,0.0011378392,0.0014848921,0.00012140046,0.0009461191,0.00069964654,0.12800185,0.035283223,0.4851902,0.022564383,0.32389405],"study_design_scores_gemma":[0.0002505405,0.000258451,0.00049564015,0.00052946864,0.00016158188,0.0007843889,0.00013040115,0.51585364,0.048947796,0.29299167,0.13946132,0.00013509982],"about_ca_topic_score_codex":0.0040070033,"about_ca_topic_score_gemma":0.004918642,"teacher_disagreement_score":0.010044277,"about_ca_system_score_codex":0.0009699932,"about_ca_system_score_gemma":0.0027090027,"threshold_uncertainty_score":0.033601463},"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":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0057823732,0.18605796,0.632822,0.014932571,0.0070689693,0.00021488557,0.0014291746,0.003249063,0.14844315],"genre_scores_gemma":[0.1333581,0.18077374,0.4622201,0.0025978414,0.0062047015,0.00051842147,0.0058389422,0.0019101084,0.20657805],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99793756,0.00045993243,0.00013704807,0.00033813145,0.0009851018,0.00014227511],"domain_scores_gemma":[0.9962218,0.0019879118,0.00009493429,0.0004817351,0.0010378727,0.00017586778],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030125051,0.0015716074,0.0016867379,0.0033854174,0.0010884436,0.0058956253,0.0023810193,0.0014261112,0.022576023],"category_scores_gemma":[0.0063829804,0.0016897967,0.0010501031,0.0051100114,0.0038658013,0.0044448036,0.0017088741,0.00340018,0.0049053496],"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.000102239756,0.000099356286,0.00097588287,0.00081330194,0.000072147566,0.00011097808,0.00024482387,0.014675102,0.0019781056,0.21661353,0.2200587,0.5442558],"study_design_scores_gemma":[0.000052335898,0.000080096725,0.0018311649,0.00084243907,0.00009722345,0.00057302543,0.00020435349,0.07121189,0.0030223993,0.4181809,0.50384164,0.00006247571],"about_ca_topic_score_codex":0.018643154,"about_ca_topic_score_gemma":0.025048573,"teacher_disagreement_score":0.022576023,"about_ca_system_score_codex":0.00527732,"about_ca_system_score_gemma":0.005597843,"threshold_uncertainty_score":0.07552433},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013027007,0.00019751058,0.97840893,0.00010189912,0.00006007795,0.000050648734,0.000028327817,0.0017761635,0.006349419],"genre_scores_gemma":[0.2095492,0.00091553375,0.77975494,0.000095878735,0.000049149727,0.0002136576,0.00017959478,0.00051860185,0.008723512],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99954295,0.00017732778,0.00002365904,0.00007282648,0.00015385127,0.000029427756],"domain_scores_gemma":[0.99931216,0.0004733502,0.000051088853,0.00008579255,0.000046292906,0.00003120671],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008972723,0.0005206763,0.00034242548,0.0003645461,0.0003318843,0.00094879715,0.00087969465,0.00094352575,0.0052784216],"category_scores_gemma":[0.001930318,0.00040688523,0.0005297412,0.00020039945,0.000998244,0.0012572765,0.0012521442,0.0008130245,0.0008068755],"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.00027289524,0.00013473112,0.0009687611,0.0005222838,0.00007014521,0.0008158646,0.0020095923,0.30026796,0.10296962,0.44244337,0.0030136753,0.14651097],"study_design_scores_gemma":[0.00018503307,0.00021022196,0.00032883353,0.00010694655,0.00006226511,0.00051768654,0.00016522351,0.7463227,0.03619715,0.09697673,0.11887182,0.000055416087],"about_ca_topic_score_codex":0.0004318929,"about_ca_topic_score_gemma":0.0006075389,"teacher_disagreement_score":0.0052784216,"about_ca_system_score_codex":0.00027837366,"about_ca_system_score_gemma":0.00026133528,"threshold_uncertainty_score":0.017658055},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009504813,0.00003677902,0.9867993,0.000028000291,0.000011804487,0.00004124865,0.000027376198,0.002250362,0.0013002818],"genre_scores_gemma":[0.27230382,0.000104850595,0.72516954,0.00004564418,0.000011405986,0.00019055301,0.00012456755,0.0002755064,0.0017742118],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99827445,0.00034877702,0.00013375799,0.00032356614,0.0007494265,0.00017000303],"domain_scores_gemma":[0.9955491,0.002215142,0.00022281369,0.0016474038,0.00029997135,0.00006556436],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015813606,0.00064850244,0.000471335,0.0006675111,0.0006969317,0.0011555573,0.0019712548,0.0008855505,0.0054900525],"category_scores_gemma":[0.0033771838,0.00056286954,0.0012491649,0.00045255822,0.0019400599,0.002278162,0.0019215286,0.0013806906,0.0010030546],"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.00031727448,0.00024493854,0.002391619,0.000527837,0.00022972177,0.0011063707,0.0007230343,0.2170559,0.24960983,0.2916231,0.002427864,0.23374252],"study_design_scores_gemma":[0.00016856276,0.0003050803,0.0007102782,0.00006366277,0.00015583365,0.000799052,0.00009276306,0.6689131,0.19876474,0.11014225,0.019794984,0.000089656365],"about_ca_topic_score_codex":0.0015991437,"about_ca_topic_score_gemma":0.0019899001,"teacher_disagreement_score":0.0054900525,"about_ca_system_score_codex":0.0006767536,"about_ca_system_score_gemma":0.0011675067,"threshold_uncertainty_score":0.018366098},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03472856,0.00028059076,0.9026905,0.0013406896,0.000407071,0.00013454907,0.0005925554,0.004948628,0.054876763],"genre_scores_gemma":[0.6911499,0.0006333942,0.2751688,0.00063275546,0.00022173263,0.00024548013,0.0017356847,0.0026583835,0.027553886],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973341,0.000786773,0.0001687914,0.00030213737,0.0009951767,0.00041301298],"domain_scores_gemma":[0.9938651,0.00413232,0.00022960256,0.0010494606,0.0005587071,0.0001647742],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018055041,0.0011976201,0.0006985861,0.0017980823,0.0011656831,0.0033569564,0.002237393,0.0014353339,0.013883115],"category_scores_gemma":[0.011982226,0.0012149088,0.0017268164,0.0016120326,0.0035752316,0.0064774216,0.0052231005,0.0061250823,0.0025790047],"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.000050471073,0.000026366193,0.00015811375,0.000096969496,0.000011741969,0.00013218612,0.0003011072,0.012017757,0.0014650346,0.9658797,0.0023404686,0.017520169],"study_design_scores_gemma":[0.000018531506,0.000011430723,0.000048293638,0.00006194465,0.000022739276,0.000101124235,0.00008045706,0.047953077,0.0043775123,0.93788314,0.009425065,0.000016732929],"about_ca_topic_score_codex":0.0011478831,"about_ca_topic_score_gemma":0.0020488035,"teacher_disagreement_score":0.013883115,"about_ca_system_score_codex":0.0017891556,"about_ca_system_score_gemma":0.001262992,"threshold_uncertainty_score":0.04644364},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023084482,0.00012332946,0.97094125,0.0001825969,0.000057083143,0.00006352472,0.00013194776,0.003286254,0.0021295738],"genre_scores_gemma":[0.46435517,0.00012268072,0.53287727,0.000092738876,0.00003066673,0.00015927355,0.00030151784,0.0005461386,0.0015145993],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9935622,0.0023614522,0.00039117262,0.00072677137,0.0024173094,0.00054105645],"domain_scores_gemma":[0.98882246,0.0075636175,0.0005492087,0.0020369396,0.0008323213,0.00019546275],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003489098,0.0011924976,0.002162281,0.0016136381,0.0010611027,0.004368853,0.003336555,0.0013090688,0.004760863],"category_scores_gemma":[0.0143233845,0.0013267783,0.0025054466,0.0017753036,0.0024152363,0.008095108,0.0034988238,0.0035546538,0.0008767312],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00105423,0.0003552783,0.0013143586,0.0006331331,0.00020789333,0.00045363753,0.00038653056,0.36973968,0.024887158,0.37437814,0.003912473,0.2226774],"study_design_scores_gemma":[0.000099130004,0.000048865513,0.000051907646,0.000045597033,0.0000369324,0.00006266562,0.000052966378,0.7773232,0.015398235,0.2056405,0.0012043101,0.00003574228],"about_ca_topic_score_codex":0.0019507702,"about_ca_topic_score_gemma":0.004894592,"teacher_disagreement_score":0.004760863,"about_ca_system_score_codex":0.0017169325,"about_ca_system_score_gemma":0.0021576684,"threshold_uncertainty_score":0.018452287},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016813178,0.0001846082,0.9926543,0.0000934699,0.000071309296,0.000050902905,0.00006924003,0.0011223204,0.004072574],"genre_scores_gemma":[0.12874873,0.0014489038,0.8511529,0.00034206884,0.00015579553,0.00033357457,0.00054358854,0.0017872492,0.015487272],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99645555,0.0009990792,0.00030847045,0.000512898,0.0014462807,0.00027779356],"domain_scores_gemma":[0.9978048,0.0011564795,0.00012948854,0.000557839,0.0003152632,0.00003609414],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002174725,0.001872241,0.0014019348,0.0026821615,0.0012197369,0.0036784513,0.0022619576,0.0012992548,0.012693859],"category_scores_gemma":[0.0053380434,0.001570947,0.0027421347,0.0030250812,0.0031972604,0.0071032057,0.0029981493,0.003536881,0.0039445693],"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.00008853122,0.000031378884,0.0002855104,0.00034743498,0.000057558005,0.00008071583,0.00024710255,0.015970564,0.002146892,0.86790246,0.0025860146,0.11025586],"study_design_scores_gemma":[0.000036140853,0.000024694198,0.00007874549,0.0001284227,0.00006969342,0.00008106729,0.00008835071,0.047222193,0.0085048815,0.91641486,0.027318573,0.0000324213],"about_ca_topic_score_codex":0.0028346907,"about_ca_topic_score_gemma":0.0025438173,"teacher_disagreement_score":0.012693859,"about_ca_system_score_codex":0.0020206019,"about_ca_system_score_gemma":0.0014061173,"threshold_uncertainty_score":0.04246515},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17949443,0.0002459599,0.8095605,0.0006006584,0.00018059573,0.000197848,0.0001773131,0.0037583662,0.0057843067],"genre_scores_gemma":[0.74045,0.00009202138,0.25678393,0.00018414627,0.000029247385,0.00019087868,0.00026648585,0.0004454264,0.0015578506],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99449486,0.002137,0.0003510761,0.0007929767,0.0017042697,0.00051984447],"domain_scores_gemma":[0.9676444,0.027531367,0.0009754573,0.002627884,0.0009163079,0.00030461096],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033761454,0.0012473934,0.0013420404,0.0019740916,0.0009390586,0.0027997259,0.0024029,0.0024152615,0.0035421618],"category_scores_gemma":[0.026237639,0.0010707976,0.0020788813,0.0013403299,0.0025679267,0.0037530595,0.0037403263,0.002629097,0.0004564795],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0023422732,0.0009164333,0.007745075,0.0010268305,0.00038608312,0.0015424154,0.0013575598,0.32931134,0.04507749,0.41921127,0.004926505,0.18615681],"study_design_scores_gemma":[0.00014307779,0.000104986866,0.00025159307,0.00008132712,0.00009361069,0.00022008763,0.000081124315,0.80895656,0.029586652,0.15912151,0.0013211041,0.00003825221],"about_ca_topic_score_codex":0.00083711033,"about_ca_topic_score_gemma":0.0019248383,"teacher_disagreement_score":0.0035421618,"about_ca_system_score_codex":0.0014071574,"about_ca_system_score_gemma":0.0010611947,"threshold_uncertainty_score":0.017854929},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06334856,0.0004934103,0.919227,0.00021504884,0.00009746654,0.00010176,0.00024277717,0.00056115777,0.01571282],"genre_scores_gemma":[0.5349347,0.0013308186,0.44259557,0.0001109617,0.00007873565,0.00037024997,0.000622239,0.0005700698,0.019386657],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990619,0.00019500274,0.000090322974,0.00023024187,0.0002952034,0.00012733717],"domain_scores_gemma":[0.9980153,0.0013287922,0.00015370887,0.00018575661,0.00022011944,0.00009639776],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00089920656,0.00075243914,0.00091411144,0.0010717981,0.00084190554,0.001867206,0.001288993,0.00080434297,0.006131408],"category_scores_gemma":[0.0047245175,0.0010653762,0.0010102335,0.0018109934,0.0014358152,0.003852244,0.0015970537,0.0018189844,0.00057731755],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016114938,0.000051405394,0.00031977642,0.00025260908,0.000037163954,0.00010853408,0.00023533792,0.119369514,0.0045827245,0.8139658,0.0012312869,0.059684657],"study_design_scores_gemma":[0.000022090755,0.000026409183,0.00006695866,0.000027802827,0.00002498936,0.00003869107,0.00004343057,0.11998321,0.001991208,0.87542796,0.0023367929,0.000010458366],"about_ca_topic_score_codex":0.0020294308,"about_ca_topic_score_gemma":0.002926448,"teacher_disagreement_score":0.006131408,"about_ca_system_score_codex":0.0014536489,"about_ca_system_score_gemma":0.0012402188,"threshold_uncertainty_score":0.020511627},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028099434,0.00012773366,0.9605041,0.00010119684,0.000061453844,0.00019119872,0.00045670362,0.0061389203,0.004319163],"genre_scores_gemma":[0.3415426,0.00022408298,0.65247464,0.00014053493,0.000035022134,0.0003926614,0.0014288704,0.00055445975,0.0032071187],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987717,0.000360382,0.0001435841,0.00015429936,0.00042667784,0.0001433124],"domain_scores_gemma":[0.99511576,0.003155939,0.00043627428,0.00063710514,0.00059197,0.0000629561],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016431528,0.0008091434,0.00047459133,0.0011827152,0.00027902226,0.00088731654,0.0006691059,0.00064356875,0.004705996],"category_scores_gemma":[0.0072837244,0.0005256377,0.00082100794,0.0005371929,0.0005714328,0.00085722614,0.00059884426,0.0007894156,0.0010127728],"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.0005139395,0.00026366865,0.002844355,0.0012508534,0.00014128706,0.000999096,0.00049983966,0.37008023,0.08918896,0.17764577,0.0059039323,0.35066795],"study_design_scores_gemma":[0.00025608414,0.00025519184,0.0005827967,0.00016075405,0.00010837495,0.00024239431,0.00008915045,0.7911027,0.13312174,0.05484395,0.019200116,0.000036595615],"about_ca_topic_score_codex":0.00147183,"about_ca_topic_score_gemma":0.002515162,"teacher_disagreement_score":0.004705996,"about_ca_system_score_codex":0.0005837362,"about_ca_system_score_gemma":0.0014592669,"threshold_uncertainty_score":0.015743136},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0259696,0.00031104666,0.921961,0.00019750638,0.00027523536,0.00018262626,0.00018371543,0.0028329212,0.048086256],"genre_scores_gemma":[0.4546049,0.0010748187,0.46822035,0.00015613147,0.0001622749,0.00020830806,0.0011760985,0.0025037553,0.07189335],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988883,0.00017211605,0.00007350063,0.00019967067,0.00055492646,0.00011149184],"domain_scores_gemma":[0.9982508,0.00059747335,0.000076192155,0.00058238074,0.00043151886,0.00006164054],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084624346,0.00090443686,0.00055073155,0.0012785388,0.00073433627,0.0016487789,0.0009414976,0.00056939694,0.01730607],"category_scores_gemma":[0.0040335427,0.00074256165,0.001349942,0.0009065558,0.0012284385,0.0025949478,0.0022989232,0.0017212286,0.004318574],"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.00027952337,0.00009546533,0.00047621093,0.00032526892,0.00004274265,0.00048245105,0.00090747484,0.03019565,0.06448586,0.6250569,0.005299191,0.27235326],"study_design_scores_gemma":[0.00007539108,0.0001495375,0.00032977393,0.00016760732,0.0001423431,0.0004442751,0.00045410972,0.123356365,0.10639507,0.6568683,0.111561224,0.000055961966],"about_ca_topic_score_codex":0.0018146253,"about_ca_topic_score_gemma":0.0024991527,"teacher_disagreement_score":0.01730607,"about_ca_system_score_codex":0.0009212344,"about_ca_system_score_gemma":0.00090789265,"threshold_uncertainty_score":0.057894528},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013688225,0.00004652967,0.9946913,0.000066282584,0.000047681533,0.00011899377,0.0001247358,0.0021958507,0.0013398275],"genre_scores_gemma":[0.11032583,0.00017072272,0.8805496,0.00016633654,0.00007898495,0.0005865679,0.00051305036,0.0011589908,0.0064498913],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9959687,0.0013445036,0.00038899734,0.00077992055,0.0011904266,0.0003275992],"domain_scores_gemma":[0.99189997,0.005698107,0.00025284808,0.0010881496,0.0008890026,0.0001720524],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036702435,0.0015313188,0.0018266218,0.0015641564,0.001775318,0.0036564642,0.0032394626,0.001958257,0.013268274],"category_scores_gemma":[0.0110698845,0.001528973,0.0027346003,0.0012930356,0.0032277682,0.005300683,0.0023129454,0.0033383553,0.0035603684],"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.0005000031,0.00018529383,0.00074181537,0.0007890019,0.0001923285,0.0006127104,0.0012573937,0.044952266,0.017543813,0.7218541,0.011795075,0.19957623],"study_design_scores_gemma":[0.0002808221,0.00023309093,0.00027141522,0.00021637694,0.0002475808,0.00038258458,0.00021633062,0.36253348,0.030429464,0.56722355,0.03780531,0.00016003706],"about_ca_topic_score_codex":0.0065478766,"about_ca_topic_score_gemma":0.0050667915,"teacher_disagreement_score":0.013268274,"about_ca_system_score_codex":0.0021528075,"about_ca_system_score_gemma":0.0036627564,"threshold_uncertainty_score":0.044386744},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14363794,0.0002960252,0.8235304,0.0003928086,0.00016290155,0.00046675967,0.00058858725,0.004990588,0.025934068],"genre_scores_gemma":[0.837107,0.00021499634,0.14006162,0.000093099145,0.000034170895,0.00021816515,0.0003894139,0.0003517263,0.021529905],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993789,0.00015196097,0.000028784028,0.00009490711,0.0002613531,0.000083990635],"domain_scores_gemma":[0.9991586,0.00054472196,0.000062991734,0.000103326485,0.0001108948,0.0000193811],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006775209,0.00054890127,0.00035753995,0.0003213946,0.00051534624,0.0008884061,0.0006725291,0.00073497865,0.010339159],"category_scores_gemma":[0.0012671612,0.00040588842,0.0005532923,0.00013615261,0.0009079791,0.0008235466,0.0006183962,0.00055515603,0.001467124],"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.0018070447,0.00025566018,0.0019263355,0.0011214869,0.0001157331,0.0026471154,0.000848654,0.3244669,0.2531292,0.26490685,0.0059547117,0.14282028],"study_design_scores_gemma":[0.00048087217,0.0008017048,0.0012173698,0.00016643525,0.00015804097,0.00064529956,0.0000896117,0.6725915,0.22029361,0.046546098,0.05694134,0.000068069945],"about_ca_topic_score_codex":0.0060255746,"about_ca_topic_score_gemma":0.005258475,"teacher_disagreement_score":0.010339159,"about_ca_system_score_codex":0.0007930317,"about_ca_system_score_gemma":0.0013175029,"threshold_uncertainty_score":0.03458798},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016865542,0.00008372754,0.97295785,0.00015119328,0.00007160811,0.00009531767,0.00006487795,0.001197066,0.008512868],"genre_scores_gemma":[0.67392725,0.00027249756,0.31778526,0.00012917694,0.0000798912,0.00029335136,0.00029746475,0.00043241796,0.0067826738],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99518096,0.0013787015,0.0003059581,0.0003464664,0.0022908812,0.00049711345],"domain_scores_gemma":[0.9880233,0.008385887,0.0006652199,0.0019044399,0.0009119668,0.00010917983],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041621095,0.0007292791,0.00053103745,0.00076368736,0.00050290587,0.0017596654,0.0018744352,0.0011081521,0.004374251],"category_scores_gemma":[0.015038567,0.00079017313,0.0012514538,0.00039911055,0.002723326,0.0021893608,0.0014135842,0.0017621004,0.0008132081],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028190366,0.00014348746,0.0004891788,0.0004441636,0.00006410446,0.00045873312,0.0005431219,0.08919694,0.042258646,0.77554584,0.0018362227,0.08873764],"study_design_scores_gemma":[0.00036179996,0.00027499377,0.0004688163,0.00019405337,0.00010863066,0.00040571272,0.00010107256,0.43222496,0.1194558,0.42051265,0.025818737,0.000072796916],"about_ca_topic_score_codex":0.0013225179,"about_ca_topic_score_gemma":0.0010954186,"teacher_disagreement_score":0.004374251,"about_ca_system_score_codex":0.0009944907,"about_ca_system_score_gemma":0.0017273938,"threshold_uncertainty_score":0.022011578},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039020322,0.00008627099,0.9587877,0.0001229887,0.0000221879,0.000045075758,0.00006116597,0.00048255688,0.0013718315],"genre_scores_gemma":[0.69974625,0.00021143544,0.29795784,0.00008092139,0.000028537826,0.00024930795,0.00024255797,0.00017359098,0.0013094647],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.994395,0.0020936537,0.00033331904,0.0008614926,0.0019590845,0.00035736526],"domain_scores_gemma":[0.9882746,0.008758219,0.0009253575,0.0013040936,0.00060984405,0.00012787024],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0042018527,0.0008374091,0.0008807875,0.000812396,0.00063047383,0.0018002327,0.0018498659,0.0010801947,0.0014238321],"category_scores_gemma":[0.017568799,0.0007675945,0.0017812958,0.0007678896,0.0025494606,0.0024312239,0.0016915223,0.0020195981,0.00020058316],"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.00007214409,0.000045014804,0.0015058959,0.00009976928,0.00006277134,0.00009042823,0.00013315091,0.8097051,0.0041625574,0.16950405,0.00020032859,0.0144187575],"study_design_scores_gemma":[0.000017508566,0.000018373896,0.000083845625,0.000008065066,0.000012237109,0.000019026387,0.000010264759,0.9460207,0.0031352271,0.050218582,0.0004493803,0.0000066727466],"about_ca_topic_score_codex":0.0034887549,"about_ca_topic_score_gemma":0.0035652032,"teacher_disagreement_score":0.0042018527,"about_ca_system_score_codex":0.0017723461,"about_ca_system_score_gemma":0.0023562822,"threshold_uncertainty_score":0.022221804},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010901576,0.000033880668,0.98219,0.000032270727,0.000022987091,0.0000930482,0.00008285678,0.005022631,0.0016205931],"genre_scores_gemma":[0.24615702,0.000055950382,0.74667966,0.000110454515,0.000017200526,0.00045616843,0.00035670018,0.0010101291,0.005156643],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99826604,0.0005015612,0.00008686543,0.00031766482,0.0006831746,0.00014471146],"domain_scores_gemma":[0.99627566,0.0022057213,0.00018321216,0.0007744556,0.0004411507,0.00011977856],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009052611,0.0011514121,0.00081008347,0.00074965425,0.00039365664,0.0008213103,0.0021141344,0.0010435033,0.005056804],"category_scores_gemma":[0.0036213894,0.00058487424,0.0007674632,0.00058320316,0.0013555618,0.0012301462,0.0013321317,0.0009115531,0.001118768],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012390402,0.000549149,0.0026536945,0.0007687002,0.00018323051,0.00091170834,0.00071757555,0.062214866,0.15867332,0.087247476,0.009275616,0.6755657],"study_design_scores_gemma":[0.00048812985,0.0009361868,0.001215093,0.00015128509,0.00023601671,0.0010281991,0.0001780491,0.6223069,0.21842894,0.13054577,0.024354538,0.00013089686],"about_ca_topic_score_codex":0.0016300861,"about_ca_topic_score_gemma":0.0023145988,"teacher_disagreement_score":0.005056804,"about_ca_system_score_codex":0.00051411305,"about_ca_system_score_gemma":0.0012372467,"threshold_uncertainty_score":0.016916692},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005491211,0.0008727485,0.9597837,0.0012707798,0.0001506824,0.00011699477,0.00021520683,0.000958517,0.03114018],"genre_scores_gemma":[0.24647361,0.0019880298,0.72215205,0.00075280754,0.00026648052,0.00030790854,0.001264618,0.00064239174,0.026152018],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99669087,0.001313805,0.00022695209,0.00037122742,0.0011478995,0.00024928947],"domain_scores_gemma":[0.99619114,0.0029886256,0.00008405746,0.00037298404,0.00031083636,0.00005238285],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039960397,0.00075868267,0.0008475617,0.0014599584,0.001272884,0.0035227875,0.0026830826,0.0016584994,0.016638523],"category_scores_gemma":[0.008727079,0.0011687941,0.001788627,0.0023208172,0.003645767,0.010304171,0.0023582298,0.0043276623,0.002566891],"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.00004672317,0.000037954997,0.00007739541,0.00018264743,0.000015774418,0.00006272216,0.00021374166,0.0077903746,0.0007980014,0.93611866,0.004138512,0.050517548],"study_design_scores_gemma":[0.000028443272,0.000006737673,0.000032452892,0.00005234972,0.000016665932,0.00003667133,0.000039629955,0.028668426,0.0014707017,0.96072173,0.00891555,0.000010636271],"about_ca_topic_score_codex":0.005917649,"about_ca_topic_score_gemma":0.0048632873,"teacher_disagreement_score":0.016638523,"about_ca_system_score_codex":0.0027248934,"about_ca_system_score_gemma":0.0014490513,"threshold_uncertainty_score":0.05566138},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015086365,0.0006553028,0.6161645,0.00052869983,0.00055065105,0.00029145225,0.000518161,0.0031018774,0.36310306],"genre_scores_gemma":[0.44927132,0.0018758514,0.2287682,0.00030707708,0.00032058964,0.0006152214,0.0012063948,0.0015257372,0.3161096],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991345,0.00012399234,0.000052916665,0.00016281614,0.00040628974,0.00011956692],"domain_scores_gemma":[0.998865,0.0004164436,0.00006486009,0.00032703078,0.00023667571,0.00008991871],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005509778,0.0007541774,0.00033364497,0.0012904247,0.0009493686,0.0029097549,0.00097203767,0.00081514067,0.031092001],"category_scores_gemma":[0.0027869404,0.00049720024,0.0005773316,0.0012355568,0.0011973822,0.0033627606,0.0018232993,0.0012705565,0.0067108395],"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.00009707489,0.000051527386,0.00027261573,0.00013219987,0.000015300066,0.0008047842,0.0005577752,0.0035354274,0.0081337355,0.8554781,0.010762831,0.12015858],"study_design_scores_gemma":[0.000027408132,0.00006384419,0.00030554805,0.00009647517,0.0000470886,0.0013139696,0.00032881857,0.023269612,0.022862986,0.63977444,0.31187376,0.00003610143],"about_ca_topic_score_codex":0.0008140594,"about_ca_topic_score_gemma":0.0009371784,"teacher_disagreement_score":0.031092001,"about_ca_system_score_codex":0.0006528759,"about_ca_system_score_gemma":0.00073928403,"threshold_uncertainty_score":0.104013085},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2927091,0.007853806,0.25505874,0.017094327,0.0015138857,0.00056037516,0.005557983,0.0024362898,0.4172155],"genre_scores_gemma":[0.8188723,0.005068814,0.07090632,0.0022325336,0.00071684,0.0006803326,0.0047641736,0.0007634864,0.095995255],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99950016,0.000055936605,0.000020833582,0.00014256978,0.00014823202,0.00013222762],"domain_scores_gemma":[0.9983559,0.0012243903,0.000059163256,0.00015426366,0.00012725643,0.00007903159],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003588601,0.00071081327,0.0012344468,0.0007317056,0.0019438325,0.0028747825,0.0008974308,0.0012721646,0.011693373],"category_scores_gemma":[0.0026839809,0.0007495633,0.0014191511,0.0017687146,0.001337303,0.0040602265,0.001909028,0.0026184295,0.0020016723],"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.00072390813,0.0002347108,0.0022144974,0.0016442669,0.00018779952,0.00078226195,0.00091265613,0.058919724,0.013626142,0.5956564,0.11646289,0.20863481],"study_design_scores_gemma":[0.00013574547,0.00005891964,0.0009014757,0.00014235354,0.00010779516,0.0005101422,0.00035003125,0.07388899,0.0055010803,0.8389927,0.07937029,0.000040556057],"about_ca_topic_score_codex":0.0025685776,"about_ca_topic_score_gemma":0.0028986186,"teacher_disagreement_score":0.011693373,"about_ca_system_score_codex":0.0016692869,"about_ca_system_score_gemma":0.0013245486,"threshold_uncertainty_score":0.03911829},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04100046,0.0002608455,0.94586134,0.00020659961,0.00013229021,0.00020438434,0.00015782923,0.0016045914,0.010571632],"genre_scores_gemma":[0.6563847,0.00059141073,0.33220667,0.00028512152,0.0001117223,0.00028807117,0.0006133053,0.00086977193,0.008649297],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99595743,0.0009695732,0.00026182158,0.0005898629,0.0016968459,0.0005244601],"domain_scores_gemma":[0.97813237,0.015628548,0.0012467344,0.0030851266,0.0017476347,0.00015958397],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036593806,0.00074027776,0.0006053172,0.0018144638,0.0007614288,0.001753807,0.0021734352,0.0015385726,0.007143526],"category_scores_gemma":[0.021609737,0.0007454899,0.001607312,0.0012664607,0.0027221218,0.0058076177,0.0034231904,0.0024673222,0.0011949888],"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.00060877734,0.00025262748,0.0036540157,0.0009264134,0.00011163631,0.0013328164,0.0013012814,0.0754465,0.021944977,0.70443153,0.003565261,0.1864241],"study_design_scores_gemma":[0.0000585623,0.00023712486,0.0022378652,0.00019574419,0.00016425173,0.00073744374,0.0002884564,0.23037325,0.084672965,0.6724763,0.008482303,0.000075756056],"about_ca_topic_score_codex":0.0008357271,"about_ca_topic_score_gemma":0.0011419337,"teacher_disagreement_score":0.007143526,"about_ca_system_score_codex":0.00066672836,"about_ca_system_score_gemma":0.0014274496,"threshold_uncertainty_score":0.023897469},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.110723,0.000053675318,0.88306725,0.0001157001,0.000058030546,0.00010806736,0.00010141828,0.0025595257,0.0032134184],"genre_scores_gemma":[0.7144898,0.00008275966,0.27992898,0.00010563703,0.000018920866,0.00014103843,0.00017712718,0.0003418086,0.004713818],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976434,0.00040601005,0.00015772827,0.00044524108,0.0011636127,0.00018406867],"domain_scores_gemma":[0.9950459,0.002463059,0.0004984135,0.0012744811,0.0006248991,0.00009324609],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019498671,0.0003884753,0.0005222109,0.00043760796,0.0004237086,0.0008961632,0.0010435769,0.0008075297,0.0029935234],"category_scores_gemma":[0.0076470645,0.0005275973,0.00082829344,0.00019601511,0.0009924916,0.0017097164,0.0009714308,0.0007898731,0.00064013817],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009528473,0.00027500166,0.006660246,0.0005025613,0.00016856506,0.0015377539,0.0010606525,0.21474597,0.36713007,0.27780852,0.002798138,0.12635966],"study_design_scores_gemma":[0.0002691109,0.0005614287,0.0007825624,0.000049918643,0.00010418734,0.00064958737,0.000099479315,0.67491066,0.26722607,0.0399731,0.015314298,0.000059556212],"about_ca_topic_score_codex":0.0015831476,"about_ca_topic_score_gemma":0.0017678466,"teacher_disagreement_score":0.0029935234,"about_ca_system_score_codex":0.00069286913,"about_ca_system_score_gemma":0.0011527599,"threshold_uncertainty_score":0.010311961},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00712478,0.000141496,0.9893364,0.000066523455,0.000040150146,0.00002939423,0.000024555748,0.0018999422,0.0013367176],"genre_scores_gemma":[0.31079924,0.00065650546,0.68082273,0.00011880972,0.00006512993,0.00015336473,0.00018481033,0.0010834552,0.006115982],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99646795,0.0006840291,0.00022458575,0.00044994836,0.0019080832,0.00026529224],"domain_scores_gemma":[0.994759,0.0025300055,0.0002925672,0.0020609926,0.0003030866,0.000054303026],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031636339,0.0015987746,0.0012677291,0.0011334686,0.0006616423,0.0019623674,0.0024502082,0.0015015333,0.00250466],"category_scores_gemma":[0.009040331,0.0019868237,0.002342848,0.0011180472,0.0027224775,0.0054491404,0.003235371,0.0045445194,0.0006089584],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019147775,0.000063214844,0.0008639221,0.00055811624,0.00014688447,0.0002928767,0.0006913948,0.25323716,0.02731112,0.5764749,0.0021699094,0.13799903],"study_design_scores_gemma":[0.000069074005,0.000101346275,0.00023899914,0.00013187602,0.00017261562,0.00023281819,0.00005114102,0.45263463,0.049851812,0.4825387,0.013918241,0.000058745467],"about_ca_topic_score_codex":0.0010563723,"about_ca_topic_score_gemma":0.0014964816,"teacher_disagreement_score":0.0031636339,"about_ca_system_score_codex":0.0010176479,"about_ca_system_score_gemma":0.0013472107,"threshold_uncertainty_score":0.016731083},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.053788003,0.00012770412,0.9399938,0.0004672102,0.00005003889,0.00025270658,0.00014935406,0.0017746496,0.003396603],"genre_scores_gemma":[0.60581076,0.00016904155,0.39065158,0.00027143946,0.00006948376,0.00048334018,0.0007980363,0.0002742426,0.0014720835],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9856575,0.0047163586,0.00084291503,0.0030963896,0.004489349,0.0011974864],"domain_scores_gemma":[0.9720657,0.020361654,0.0013302403,0.0036895904,0.002286477,0.00026625744],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005537761,0.0010785814,0.0012574807,0.001954223,0.0008941738,0.0015495922,0.0020049622,0.0017147574,0.0027657105],"category_scores_gemma":[0.035056233,0.00060836494,0.0022143975,0.0011679055,0.0053104092,0.004479258,0.00284972,0.0027405,0.00053869036],"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.00075658807,0.0004115062,0.006885808,0.0005388901,0.00020552597,0.0014219374,0.0012864701,0.079138696,0.031050697,0.66222894,0.002786821,0.21328813],"study_design_scores_gemma":[0.00020641438,0.00030052997,0.0014597006,0.000057483318,0.0001500258,0.000716237,0.00021652093,0.35259086,0.054008234,0.584852,0.005370807,0.0000711727],"about_ca_topic_score_codex":0.0036177593,"about_ca_topic_score_gemma":0.001983118,"teacher_disagreement_score":0.005537761,"about_ca_system_score_codex":0.0013706896,"about_ca_system_score_gemma":0.002553752,"threshold_uncertainty_score":0.029286861},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026810208,0.01228887,0.72001576,0.01081712,0.0022523687,0.000106870895,0.001013189,0.0023091831,0.22438642],"genre_scores_gemma":[0.7778254,0.012007507,0.11742536,0.0022486844,0.0014682835,0.0004479124,0.0015209102,0.00054892775,0.08650704],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987839,0.00031889466,0.00008735106,0.00033938634,0.00034909617,0.0001213807],"domain_scores_gemma":[0.99699485,0.0019589646,0.00016397769,0.0004581548,0.00036421523,0.000059814287],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012942603,0.00064473087,0.00070950773,0.0010770449,0.0008143301,0.0046636527,0.0010607707,0.0018999858,0.011795921],"category_scores_gemma":[0.006510472,0.0008435626,0.000770345,0.0015332695,0.005324644,0.012763387,0.00094962644,0.0025187656,0.0031434365],"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.0000050654767,0.000003346438,0.000052975265,0.000028523038,0.000003562292,0.000013084142,0.00015018857,0.00038889897,0.00013002982,0.9881561,0.0014057955,0.009662508],"study_design_scores_gemma":[0.00000342632,0.0000029561581,0.000040157018,0.00002287622,0.0000051060592,0.000021757562,0.000040308267,0.0009853228,0.00026589993,0.9766402,0.021967614,0.000004367944],"about_ca_topic_score_codex":0.0018186434,"about_ca_topic_score_gemma":0.0008373161,"teacher_disagreement_score":0.011795921,"about_ca_system_score_codex":0.0014005703,"about_ca_system_score_gemma":0.0007766226,"threshold_uncertainty_score":0.039461255},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001179897,0.00005907012,0.99500257,0.000057301997,0.000041098137,0.00004084124,0.000050730407,0.0006375757,0.0029307802],"genre_scores_gemma":[0.09570634,0.0006353075,0.8883446,0.00023717165,0.00014886705,0.00041116803,0.0007465426,0.0012924256,0.012477503],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985877,0.00034985205,0.00012400559,0.00031266856,0.00049941475,0.00012632638],"domain_scores_gemma":[0.9976204,0.000800208,0.000075694355,0.0012334324,0.00022197815,0.000048315796],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016181676,0.0011947282,0.0011114051,0.0010726736,0.00097227853,0.0017924092,0.0024197935,0.0011917226,0.009071238],"category_scores_gemma":[0.0048733754,0.0011064142,0.0038730777,0.0012752241,0.002159777,0.0062583527,0.0048645586,0.0050081788,0.0036169172],"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.000057762703,0.0000768228,0.0003053759,0.0004085267,0.00008321185,0.00024977286,0.0005155955,0.025931748,0.009052193,0.80716884,0.004213102,0.15193708],"study_design_scores_gemma":[0.000019910798,0.00005257416,0.00013161784,0.00011237191,0.000071957744,0.00023016114,0.000050823015,0.08430908,0.010635749,0.86971956,0.034627266,0.000038903378],"about_ca_topic_score_codex":0.0009503455,"about_ca_topic_score_gemma":0.0014855673,"teacher_disagreement_score":0.009071238,"about_ca_system_score_codex":0.00068784395,"about_ca_system_score_gemma":0.0013000817,"threshold_uncertainty_score":0.030346274},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00470407,0.0001280848,0.96372896,0.00029590022,0.00034509212,0.00041838182,0.0018372479,0.017563934,0.0109784],"genre_scores_gemma":[0.117442094,0.0004570949,0.85136783,0.0005205999,0.0001307619,0.00065174425,0.00580442,0.009137893,0.014487447],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965737,0.000830594,0.0005134921,0.00070758583,0.00097053224,0.00040416038],"domain_scores_gemma":[0.99380684,0.0027394334,0.00020591955,0.0017541329,0.0013592052,0.0001344828],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026611355,0.0013499124,0.0010080525,0.0019456208,0.0010403278,0.0028574157,0.0015596494,0.0014138833,0.017499808],"category_scores_gemma":[0.00875794,0.0016271686,0.002056022,0.0014807697,0.0020068104,0.0028995837,0.004360036,0.0033331031,0.012458821],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008080467,0.00032321867,0.001589508,0.0017980336,0.0001640489,0.001034801,0.0013258563,0.011310018,0.03702522,0.41008684,0.06703231,0.467502],"study_design_scores_gemma":[0.00029870126,0.00015499981,0.0006134549,0.0004763452,0.0003222332,0.0008080009,0.0004946597,0.05845281,0.1194074,0.568384,0.25043124,0.00015613342],"about_ca_topic_score_codex":0.002972386,"about_ca_topic_score_gemma":0.0034316026,"teacher_disagreement_score":0.017499808,"about_ca_system_score_codex":0.00082662265,"about_ca_system_score_gemma":0.0028528895,"threshold_uncertainty_score":0.05854267},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029653331,0.00056149624,0.9621446,0.00043048538,0.00009828591,0.00008844201,0.00023154193,0.0027280485,0.0040637394],"genre_scores_gemma":[0.66868734,0.00063669536,0.32466257,0.0002963143,0.00009803573,0.00017425849,0.00057838246,0.0005841553,0.0042821905],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9934603,0.0021043497,0.0005196069,0.0010137778,0.002379651,0.000522412],"domain_scores_gemma":[0.9848914,0.011743268,0.000743792,0.0017338195,0.0006854662,0.00020227338],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0048341905,0.0014322305,0.0014426378,0.0018247867,0.0010942353,0.0042894194,0.0031903728,0.0014420211,0.003946953],"category_scores_gemma":[0.016175888,0.001850485,0.0033079344,0.0019389245,0.0030951325,0.010743612,0.003930584,0.003981693,0.00052464363],"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.00069085316,0.00016735945,0.0017234258,0.0008673669,0.000306723,0.00041156725,0.00044373915,0.21791294,0.014977847,0.6273283,0.0028217763,0.13234806],"study_design_scores_gemma":[0.00011806574,0.00005237882,0.00017208651,0.00011482023,0.00012473998,0.00012145685,0.00005883613,0.3771989,0.020460399,0.59873,0.0028087876,0.00003948941],"about_ca_topic_score_codex":0.0030051416,"about_ca_topic_score_gemma":0.004097455,"teacher_disagreement_score":0.0048341905,"about_ca_system_score_codex":0.0032574714,"about_ca_system_score_gemma":0.001975806,"threshold_uncertainty_score":0.025565922},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03626476,0.000054763343,0.94635767,0.00013542119,0.000045688896,0.00014649045,0.00014624157,0.012161761,0.004687263],"genre_scores_gemma":[0.58328027,0.000078630525,0.40632084,0.00013915326,0.000039145387,0.00035280138,0.0004906459,0.0026527392,0.0066457354],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984561,0.00053873734,0.0000787036,0.0002854505,0.0004562767,0.00018477709],"domain_scores_gemma":[0.9941697,0.0033995844,0.00043056573,0.0013585181,0.00051964633,0.00012192278],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011689266,0.0009432188,0.0007684189,0.00062692154,0.0005531911,0.0016147001,0.0017277532,0.0013220041,0.008566957],"category_scores_gemma":[0.006380571,0.0008218529,0.00090740353,0.00040410357,0.00095933594,0.0021581736,0.0023853693,0.0013611899,0.0024651086],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001968305,0.00072112604,0.0048188493,0.00093853293,0.0001939273,0.0012017329,0.0018784214,0.13482091,0.19726844,0.26147583,0.018071728,0.3766422],"study_design_scores_gemma":[0.00021613674,0.00022378998,0.00041373915,0.000047496058,0.00011479768,0.0002796352,0.00011701386,0.6840869,0.18384953,0.120530166,0.010079413,0.000041413132],"about_ca_topic_score_codex":0.00029125868,"about_ca_topic_score_gemma":0.000648767,"teacher_disagreement_score":0.008566957,"about_ca_system_score_codex":0.0006322291,"about_ca_system_score_gemma":0.00043963984,"threshold_uncertainty_score":0.028659284},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032621871,0.0037684974,0.68287575,0.0024746154,0.0004967462,0.00024611637,0.00029130955,0.000885065,0.30569965],"genre_scores_gemma":[0.2230541,0.014653913,0.41391113,0.0022092694,0.0007525763,0.0014979661,0.0024181355,0.0014899307,0.3400129],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975738,0.0006677045,0.00018225933,0.00020242203,0.0012779065,0.00009588815],"domain_scores_gemma":[0.99736613,0.0017160114,0.00009660922,0.00053398573,0.00024921252,0.000038051847],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001785202,0.0012694086,0.0006926909,0.0013883964,0.0004690033,0.002947945,0.0016194144,0.0018347176,0.017897395],"category_scores_gemma":[0.0055738455,0.0010002228,0.0008188955,0.0013040756,0.0033197654,0.0045178016,0.0015691962,0.0029847042,0.005482651],"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.000012158136,0.000019665991,0.00002422398,0.00020466399,0.000006135292,0.0000890242,0.00022771076,0.002208977,0.0011351289,0.928355,0.007124701,0.060592595],"study_design_scores_gemma":[0.000020114596,0.0000330859,0.000052226154,0.00021520675,0.000010640951,0.00023078933,0.000090810565,0.0055213664,0.0035116759,0.8392841,0.15101534,0.000014524425],"about_ca_topic_score_codex":0.0006209293,"about_ca_topic_score_gemma":0.0006088835,"teacher_disagreement_score":0.017897395,"about_ca_system_score_codex":0.0012096697,"about_ca_system_score_gemma":0.00088025985,"threshold_uncertainty_score":0.059872746},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008870086,0.000047689453,0.98808926,0.000057013913,0.000025806736,0.000028908458,0.000038556725,0.0016697698,0.0011730301],"genre_scores_gemma":[0.7782592,0.00023552049,0.2169844,0.000118019685,0.00009542798,0.00015481042,0.00021011913,0.00091638864,0.0030259492],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9955831,0.001211793,0.0003007837,0.0006755977,0.0017297618,0.0004989173],"domain_scores_gemma":[0.9825303,0.012694572,0.0009343534,0.0025658505,0.0011179626,0.00015702388],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0048586186,0.000984263,0.0013135661,0.001438321,0.00094486616,0.0027751524,0.0018723041,0.00097137527,0.0036312754],"category_scores_gemma":[0.01466626,0.0007333296,0.002132772,0.00087595836,0.0033172038,0.0045759664,0.002417135,0.0021188608,0.0007371356],"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.00054185576,0.00016606555,0.0023489525,0.0005345559,0.00017392289,0.0006564479,0.0003961233,0.23394446,0.022937832,0.60355735,0.0022825405,0.1324599],"study_design_scores_gemma":[0.00008149832,0.00008618033,0.00042559282,0.000056797355,0.00007009606,0.00023834534,0.000034386117,0.6782641,0.036826354,0.28087696,0.0029853506,0.00005445286],"about_ca_topic_score_codex":0.0015500741,"about_ca_topic_score_gemma":0.0014358965,"teacher_disagreement_score":0.0048586186,"about_ca_system_score_codex":0.001567441,"about_ca_system_score_gemma":0.002027038,"threshold_uncertainty_score":0.025695086},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009339961,0.00021376908,0.97407293,0.0003491843,0.00005607163,0.00008697117,0.00008896683,0.0010315507,0.0147605715],"genre_scores_gemma":[0.3713945,0.0008376831,0.61062455,0.00028162138,0.00008408971,0.00021174685,0.0005232532,0.00063602166,0.015406592],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990778,0.0004018009,0.000044639815,0.00011145962,0.0002616581,0.000102546765],"domain_scores_gemma":[0.9983498,0.0012273581,0.00005265656,0.00025904702,0.000086509855,0.000024677349],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009693487,0.0006994304,0.0005083055,0.0005925758,0.00056396256,0.0016933639,0.0014366214,0.0009866162,0.011146452],"category_scores_gemma":[0.0047587035,0.0005965198,0.001024324,0.0012847296,0.0012384387,0.0043435283,0.0016081624,0.002193189,0.0015163183],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014562828,0.00009812601,0.00014747043,0.00034757185,0.00003015979,0.000111713845,0.00027673712,0.06213902,0.0070696995,0.6777314,0.0046468643,0.24725562],"study_design_scores_gemma":[0.00004519503,0.00004140832,0.000048322938,0.00007288305,0.00003451957,0.00008237603,0.000068773945,0.1805874,0.006646737,0.7986978,0.013656075,0.000018496316],"about_ca_topic_score_codex":0.0014498926,"about_ca_topic_score_gemma":0.002243866,"teacher_disagreement_score":0.011146452,"about_ca_system_score_codex":0.00090382044,"about_ca_system_score_gemma":0.0008667137,"threshold_uncertainty_score":0.037288606},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037317064,0.0013505152,0.84553766,0.002901311,0.00048463236,0.0001527856,0.0009337133,0.0036188082,0.10770353],"genre_scores_gemma":[0.5366481,0.0017030672,0.3875841,0.00092558714,0.00046376334,0.00027519974,0.002918768,0.0031539486,0.066327535],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99617946,0.0005985837,0.00019321645,0.0010545452,0.0014143711,0.0005598656],"domain_scores_gemma":[0.9909642,0.00506399,0.00034642196,0.0027315,0.0006448814,0.00024912716],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022530463,0.0013272214,0.0015346089,0.0021514497,0.0018908799,0.0042550457,0.0032573703,0.0021694954,0.025963483],"category_scores_gemma":[0.016336542,0.0017632776,0.0021837584,0.0018821043,0.003209943,0.013323587,0.00649414,0.0067237252,0.005527574],"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.0002846109,0.0001236762,0.0010741963,0.00031847163,0.00006707986,0.00026116366,0.00050617516,0.013388909,0.003639786,0.8055191,0.016630853,0.15818599],"study_design_scores_gemma":[0.000023869006,0.00003686339,0.00026640669,0.00007870123,0.000051559855,0.00013290458,0.00020723349,0.029140636,0.0041836672,0.94493663,0.020917859,0.00002367657],"about_ca_topic_score_codex":0.0010100597,"about_ca_topic_score_gemma":0.0014963875,"teacher_disagreement_score":0.025963483,"about_ca_system_score_codex":0.0013909691,"about_ca_system_score_gemma":0.0015485672,"threshold_uncertainty_score":0.086856484},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.051606305,0.0010998338,0.511961,0.0025437772,0.0014759316,0.00017764997,0.0007373224,0.0039183167,0.42647985],"genre_scores_gemma":[0.6956959,0.0017080794,0.17145573,0.0012905445,0.0006831711,0.00024432226,0.0018212546,0.0030001567,0.124100745],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982967,0.00045086676,0.000109040164,0.00037064767,0.0005212359,0.00025160555],"domain_scores_gemma":[0.9978598,0.0005822326,0.00006656769,0.0010229324,0.00035416486,0.000114287715],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017875088,0.0008593824,0.0011532607,0.0017199371,0.002144357,0.0029488588,0.0020619202,0.0013050578,0.02248015],"category_scores_gemma":[0.004595988,0.0009747754,0.0019057193,0.0014952124,0.0041204668,0.011031093,0.008919882,0.00466061,0.0042103287],"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.00003105833,0.000023313472,0.0000811983,0.000060004877,0.000008540226,0.00011191256,0.00039076371,0.00048451714,0.00083719776,0.9805124,0.0026842472,0.01477489],"study_design_scores_gemma":[0.00001590723,0.000016700438,0.00007208926,0.00005426471,0.000023650357,0.0002051913,0.0001543907,0.0027695715,0.0015787197,0.9386374,0.056452397,0.000019683179],"about_ca_topic_score_codex":0.00068100425,"about_ca_topic_score_gemma":0.0008817843,"teacher_disagreement_score":0.02248015,"about_ca_system_score_codex":0.0011912561,"about_ca_system_score_gemma":0.0006965306,"threshold_uncertainty_score":0.0752036},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36802772,0.0001362752,0.6202145,0.00016962325,0.00006989236,0.00023318439,0.00025939502,0.003970775,0.0069187046],"genre_scores_gemma":[0.91191924,0.00007810128,0.08461482,0.000060101742,0.000011421454,0.00010322857,0.00018396656,0.00012777845,0.0029014815],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.99939907,0.000085789536,0.000031768628,0.000118370255,0.00029489127,0.0000701164],"domain_scores_gemma":[0.99938023,0.00022344195,0.00010876593,0.00013188872,0.00013367941,0.00002197259],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059350877,0.0002757104,0.00029959262,0.00023512148,0.00033293263,0.000623282,0.00095730403,0.00048078367,0.0016676362],"category_scores_gemma":[0.0010733539,0.00034537038,0.00040005406,0.00012247752,0.00067458896,0.0005040077,0.00050663156,0.0005673552,0.00028001016],"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.00034472684,0.0000915812,0.0037546773,0.00031248198,0.00008131648,0.00085918896,0.00024892026,0.20343329,0.7252151,0.030866848,0.0008366144,0.03395528],"study_design_scores_gemma":[0.00017162209,0.0007651866,0.0027832158,0.000035566434,0.0001024136,0.00053224,0.000060768103,0.43633252,0.54455096,0.0028314798,0.011791861,0.00004208043],"about_ca_topic_score_codex":0.0016131994,"about_ca_topic_score_gemma":0.0009764378,"teacher_disagreement_score":0.0016676362,"about_ca_system_score_codex":0.00068542996,"about_ca_system_score_gemma":0.0011240917,"threshold_uncertainty_score":0.005578816},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0049893106,0.0001522354,0.99061865,0.00022896826,0.000033920915,0.00019819559,0.0001422285,0.0010886276,0.0025478918],"genre_scores_gemma":[0.3755308,0.0003298414,0.6183867,0.00026842422,0.000055160235,0.000506767,0.0005692521,0.0002409741,0.0041120364],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99400055,0.0019897418,0.00036804524,0.0010966895,0.0019554389,0.000589624],"domain_scores_gemma":[0.98689353,0.008574086,0.0005831838,0.002460519,0.0012725769,0.00021610215],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0059797405,0.0010377275,0.0015217251,0.0037815752,0.0016119927,0.003584626,0.003330994,0.0014229299,0.0069928705],"category_scores_gemma":[0.020093145,0.0010251162,0.0021313487,0.0020677575,0.0029671239,0.006014863,0.004887518,0.0022292158,0.00079810567],"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.00046680312,0.00021390348,0.0021570094,0.00049683236,0.00017617234,0.00047760486,0.00050250744,0.15259491,0.005497954,0.62404436,0.0054272455,0.2079448],"study_design_scores_gemma":[0.00010199688,0.000033524582,0.0001009193,0.00005762357,0.000055697117,0.000091400296,0.000039499242,0.60288525,0.006151376,0.38664803,0.0038028965,0.000031788906],"about_ca_topic_score_codex":0.005757948,"about_ca_topic_score_gemma":0.005528811,"teacher_disagreement_score":0.0069928705,"about_ca_system_score_codex":0.0027331207,"about_ca_system_score_gemma":0.0035850196,"threshold_uncertainty_score":0.031624317},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0033201778,0.000284552,0.98871744,0.00027880992,0.000054388547,0.000083243256,0.00013078279,0.00169378,0.0054367553],"genre_scores_gemma":[0.31503132,0.0008194641,0.67207885,0.0004649428,0.000095562915,0.0005195108,0.0011197617,0.0012182669,0.008652287],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9892691,0.004415555,0.0005254426,0.0010494811,0.00402298,0.0007174713],"domain_scores_gemma":[0.983083,0.012394439,0.0003751541,0.0032401276,0.0007685647,0.00013874455],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005734821,0.0018132405,0.0021075516,0.00218173,0.0012239686,0.004276539,0.0061654644,0.0019277703,0.009838826],"category_scores_gemma":[0.01821029,0.0021541344,0.003971679,0.002176583,0.004751178,0.009680035,0.0064010546,0.0049284934,0.0018447654],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025210812,0.0001507974,0.00030054164,0.000532316,0.00014345725,0.00022492479,0.00022266291,0.14000513,0.0037059772,0.74276185,0.0049070152,0.106793255],"study_design_scores_gemma":[0.000071049566,0.000018402834,0.000041411196,0.000082751925,0.00005330458,0.000054025222,0.000027025222,0.3151806,0.008027051,0.6718184,0.004602846,0.000022965842],"about_ca_topic_score_codex":0.0032190108,"about_ca_topic_score_gemma":0.0033538581,"teacher_disagreement_score":0.009838826,"about_ca_system_score_codex":0.0029502558,"about_ca_system_score_gemma":0.0025953713,"threshold_uncertainty_score":0.032914102},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015540913,0.00090548344,0.99211144,0.0011716882,0.00023585516,0.00009868674,0.000041293737,0.00056363887,0.0033178427],"genre_scores_gemma":[0.021971459,0.0010192523,0.97046417,0.00044086133,0.00025198676,0.00019287468,0.00010683171,0.00039083805,0.005161725],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9962921,0.0015582562,0.0003110013,0.0006559899,0.0008970314,0.0002855531],"domain_scores_gemma":[0.9897774,0.0057622083,0.0004678675,0.0017861455,0.001940848,0.00026555368],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005825215,0.0011602268,0.0011108768,0.002096281,0.0013971373,0.0030593679,0.002902116,0.002417351,0.020516776],"category_scores_gemma":[0.023710417,0.0012879488,0.0018134285,0.0012976021,0.0033947115,0.009303884,0.0015765647,0.0034202943,0.0066793],"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.00034750978,0.00020414361,0.0016905606,0.0010859526,0.00009461888,0.00033753124,0.0007360638,0.01899766,0.015660793,0.5202826,0.019559179,0.4210034],"study_design_scores_gemma":[0.00012358832,0.0003155496,0.0011172534,0.0005497235,0.000067370325,0.0013131467,0.0006683088,0.14361824,0.025426589,0.65451384,0.17198515,0.00030127965],"about_ca_topic_score_codex":0.0028434047,"about_ca_topic_score_gemma":0.0035388512,"teacher_disagreement_score":0.020516776,"about_ca_system_score_codex":0.0019361711,"about_ca_system_score_gemma":0.0016882747,"threshold_uncertainty_score":0.06863546},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027987061,0.0023778034,0.9297296,0.00042777913,0.00010627974,0.00006183642,0.0001234709,0.0006702017,0.03851596],"genre_scores_gemma":[0.6586854,0.0035431804,0.3177631,0.00022275535,0.00024982414,0.00017065552,0.000337065,0.00047383519,0.018554185],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99867684,0.00040930512,0.000096375945,0.0002036566,0.00047199908,0.00014165901],"domain_scores_gemma":[0.9985453,0.00093262293,0.00007507291,0.00025759925,0.00012938016,0.000060011833],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015241615,0.00068449124,0.00072110904,0.0021981648,0.0017435845,0.0038534172,0.0014414075,0.00083794986,0.0037779862],"category_scores_gemma":[0.0036639106,0.0007444485,0.0019250088,0.0029364843,0.0037950343,0.006891126,0.0019338646,0.0037076967,0.0009334458],"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.000026284299,0.000016622766,0.00013472154,0.000043907734,0.000016283493,0.000091593734,0.00032254652,0.0025337422,0.0018277407,0.97857547,0.00030249133,0.016108628],"study_design_scores_gemma":[0.0000034726597,0.000014212006,0.0001404739,0.000023048,0.000018745006,0.00005916702,0.00006293439,0.011341125,0.002658198,0.97996956,0.005689988,0.000019173214],"about_ca_topic_score_codex":0.0014709773,"about_ca_topic_score_gemma":0.001452324,"teacher_disagreement_score":0.0038534172,"about_ca_system_score_codex":0.0012932387,"about_ca_system_score_gemma":0.0008461549,"threshold_uncertainty_score":0.0126386285},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024739092,0.00016371085,0.9927995,0.00024121813,0.00006782659,0.000090932,0.00016145797,0.0010149282,0.002986611],"genre_scores_gemma":[0.36535993,0.0008390315,0.6137418,0.0004250938,0.00042980287,0.0011791405,0.0010574982,0.00081695494,0.0161507],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9901335,0.0029710247,0.00070521265,0.0009984383,0.004536052,0.0006557348],"domain_scores_gemma":[0.98454607,0.008496937,0.0008130924,0.004125105,0.0017782213,0.00024055503],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0053568697,0.0018467184,0.0018383801,0.0017670745,0.0012044768,0.0036809773,0.005185446,0.0022775256,0.0105598755],"category_scores_gemma":[0.02205306,0.0020257805,0.0029679579,0.0015881956,0.0024872157,0.009074668,0.004351942,0.0061319633,0.003123797],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030455773,0.00012634847,0.00036559792,0.0002585887,0.00009439879,0.0002113974,0.00026531983,0.3599655,0.003581362,0.5810908,0.0047064666,0.049029693],"study_design_scores_gemma":[0.00004896333,0.00003947973,0.000063874664,0.000031108924,0.000051925766,0.000055878543,0.000013121017,0.7587367,0.0017846132,0.23525411,0.0038933617,0.000026854626],"about_ca_topic_score_codex":0.0036757085,"about_ca_topic_score_gemma":0.005251015,"teacher_disagreement_score":0.0105598755,"about_ca_system_score_codex":0.0029806008,"about_ca_system_score_gemma":0.0027876587,"threshold_uncertainty_score":0.03532636},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0071777604,0.00033053802,0.9806637,0.00028201513,0.00009899624,0.00014412001,0.00019649412,0.0038182053,0.007288097],"genre_scores_gemma":[0.23176652,0.00046764984,0.7491809,0.0003363609,0.000057131583,0.0005062121,0.0009543295,0.0015789664,0.015151934],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99394083,0.0024604925,0.00034708,0.0009266441,0.00160699,0.00071798137],"domain_scores_gemma":[0.989489,0.006948429,0.0002846866,0.0026116103,0.00052916014,0.00013715726],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033018072,0.0011655883,0.0019908226,0.0014104579,0.0015582994,0.0029705833,0.00315995,0.0020569789,0.012894652],"category_scores_gemma":[0.013662168,0.0015591385,0.0019846966,0.0025303673,0.0032152217,0.006364397,0.0045096795,0.0042488696,0.0029409048],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009942098,0.00032130466,0.0005388284,0.0006595985,0.00010275015,0.00017944397,0.00043382336,0.15344802,0.008950033,0.42033276,0.013367652,0.4006716],"study_design_scores_gemma":[0.00014214433,0.00008107726,0.000125214,0.00009355977,0.00007182279,0.00008918525,0.000065906104,0.5686444,0.0092626875,0.41308454,0.008291471,0.000048064274],"about_ca_topic_score_codex":0.0056389105,"about_ca_topic_score_gemma":0.009452273,"teacher_disagreement_score":0.012894652,"about_ca_system_score_codex":0.002591258,"about_ca_system_score_gemma":0.0044041816,"threshold_uncertainty_score":0.043136954},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.056103446,0.0010159139,0.68158853,0.0013766135,0.001343186,0.00041792545,0.0026912338,0.03507442,0.22038871],"genre_scores_gemma":[0.3118629,0.0013902672,0.46833545,0.00083249254,0.00095377956,0.00063763134,0.00970332,0.008848074,0.19743617],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99935395,0.00010597854,0.00005714688,0.000100596306,0.00031320401,0.0000691443],"domain_scores_gemma":[0.99909115,0.00021650844,0.00007067528,0.00021442177,0.00032021257,0.00008705704],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064320606,0.0005727032,0.00030365007,0.00093765487,0.0004300788,0.0011968696,0.0007479485,0.00067124394,0.017457714],"category_scores_gemma":[0.0020550124,0.00024081938,0.000471443,0.0009266964,0.00044684706,0.001159887,0.0012648616,0.0010223142,0.007838229],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009906632,0.00048807767,0.0014091728,0.0004945728,0.000033526616,0.00052830804,0.0006648283,0.008815338,0.03132619,0.27628338,0.08790134,0.5910646],"study_design_scores_gemma":[0.0001577494,0.0002685264,0.0008536176,0.00017611717,0.000059538062,0.0010079612,0.000097108954,0.03146809,0.028992023,0.053256404,0.8836124,0.00005040724],"about_ca_topic_score_codex":0.001399549,"about_ca_topic_score_gemma":0.0013811134,"teacher_disagreement_score":0.017457714,"about_ca_system_score_codex":0.0005268056,"about_ca_system_score_gemma":0.0009072769,"threshold_uncertainty_score":0.058401883},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036684543,0.000106893654,0.9365343,0.00026012282,0.00016401203,0.00010774631,0.00018928073,0.018401984,0.00755119],"genre_scores_gemma":[0.5678627,0.00014262917,0.42212418,0.00027846982,0.000037416343,0.00011998377,0.0005222789,0.0013176182,0.007594737],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99801135,0.00049492135,0.00014072441,0.0003234963,0.0007556225,0.00027392397],"domain_scores_gemma":[0.99612135,0.0022066492,0.0001939081,0.0009172118,0.0004578335,0.00010299668],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018030145,0.00080206443,0.0009508667,0.0010983256,0.00065972185,0.0031850534,0.002845478,0.0014780648,0.0069938176],"category_scores_gemma":[0.006505333,0.00082772225,0.0008997546,0.00078381365,0.0012157816,0.0040097255,0.0024995308,0.0015200018,0.0014384894],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017451744,0.0008313669,0.0055107703,0.0008677934,0.00034020765,0.001557221,0.0008864287,0.24620514,0.09628108,0.19888917,0.015326682,0.43155897],"study_design_scores_gemma":[0.00017984127,0.00014288086,0.00027330432,0.0000692714,0.00013354959,0.00018925968,0.000070393544,0.8657433,0.08081751,0.043944996,0.00838903,0.000046740945],"about_ca_topic_score_codex":0.0027304823,"about_ca_topic_score_gemma":0.004671455,"teacher_disagreement_score":0.0069938176,"about_ca_system_score_codex":0.000914401,"about_ca_system_score_gemma":0.0025047306,"threshold_uncertainty_score":0.02339667},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02619833,0.00013608803,0.9638894,0.0010526001,0.000093678864,0.0001155936,0.00017971621,0.0048249625,0.003509681],"genre_scores_gemma":[0.6171561,0.00022633736,0.3755057,0.0004975573,0.00023562356,0.0002547742,0.0008566814,0.0011124429,0.0041547953],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9841701,0.00424535,0.0010246537,0.0019648422,0.0069319173,0.0016631626],"domain_scores_gemma":[0.9433006,0.037887182,0.002395556,0.01262379,0.0030853844,0.00070746656],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0104811955,0.0015602093,0.001821458,0.0030185105,0.0020551533,0.00495604,0.0040486213,0.002641075,0.007685571],"category_scores_gemma":[0.046878755,0.001944444,0.0046104933,0.0018895826,0.005303995,0.019027708,0.009551484,0.0067750337,0.0015263945],"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.0013633395,0.0003714824,0.0044767833,0.0008820695,0.0003941283,0.000712832,0.0013794771,0.05015833,0.017809024,0.71527076,0.008002733,0.19917901],"study_design_scores_gemma":[0.00008432737,0.000086882814,0.00038994587,0.00007876465,0.00021934706,0.00013499024,0.00014651712,0.18372245,0.018724758,0.7923177,0.004053727,0.000040716764],"about_ca_topic_score_codex":0.0017123277,"about_ca_topic_score_gemma":0.002305066,"teacher_disagreement_score":0.0104811955,"about_ca_system_score_codex":0.0024236157,"about_ca_system_score_gemma":0.0025268449,"threshold_uncertainty_score":0.05543053},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009416035,0.002980779,0.9644564,0.0012781314,0.00036351918,0.000028475413,0.00012553055,0.00018771598,0.021163488],"genre_scores_gemma":[0.73790425,0.005340333,0.23542212,0.0006727487,0.0013321047,0.0002697368,0.00028923718,0.0002624431,0.018506873],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973115,0.0011196333,0.00020937232,0.0005376101,0.0006422833,0.00017968201],"domain_scores_gemma":[0.9927027,0.0058542676,0.0003174634,0.000685768,0.0003002128,0.00013946767],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028796855,0.0006814181,0.00092881924,0.000881704,0.00079470803,0.003548735,0.0014134484,0.0016474718,0.0032627736],"category_scores_gemma":[0.01015441,0.00094709604,0.0013920392,0.0011890619,0.0059291273,0.009609175,0.0026564924,0.0051530236,0.0006047379],"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.000017184071,0.000005498323,0.00008391649,0.00003856977,0.0000050657954,0.000032081854,0.00015030161,0.0028389655,0.0002858492,0.9886452,0.00029464162,0.0076027126],"study_design_scores_gemma":[0.000004803418,0.000010946294,0.00004953313,0.00001781724,0.000008184295,0.00004524108,0.000016710506,0.014521477,0.00030932296,0.98214334,0.0028648556,0.000007806121],"about_ca_topic_score_codex":0.00085719506,"about_ca_topic_score_gemma":0.0004820771,"teacher_disagreement_score":0.003548735,"about_ca_system_score_codex":0.001297864,"about_ca_system_score_gemma":0.00104683,"threshold_uncertainty_score":0.015229404},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007409723,0.00070651557,0.5542204,0.00063333457,0.00047179262,0.00029986876,0.0055146497,0.33662418,0.09411953],"genre_scores_gemma":[0.13791464,0.0010798125,0.51981354,0.0019623213,0.00032409106,0.0005309393,0.03159899,0.12653081,0.1802449],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99708337,0.0005327332,0.00020504584,0.0007534972,0.0011433704,0.00028200363],"domain_scores_gemma":[0.99736845,0.000697971,0.00009515031,0.001273154,0.0004980307,0.000067234905],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015101294,0.0017850746,0.0013925113,0.0022769808,0.0008792715,0.0037775554,0.0027359012,0.001386637,0.06724998],"category_scores_gemma":[0.005555473,0.0017517046,0.0018655448,0.0014924862,0.0007640185,0.006397686,0.0030142672,0.0023876058,0.061807487],"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.00090682524,0.00027395049,0.0021895992,0.0005923106,0.00015163317,0.00038892496,0.00032289693,0.0028977839,0.022743136,0.0994715,0.36989132,0.5001701],"study_design_scores_gemma":[0.00022541572,0.00013539765,0.001720369,0.00021342216,0.00022849366,0.0012048059,0.00020610933,0.06240632,0.10983448,0.11038107,0.71326363,0.00018045455],"about_ca_topic_score_codex":0.001595249,"about_ca_topic_score_gemma":0.0021383832,"teacher_disagreement_score":0.06724998,"about_ca_system_score_codex":0.0007075608,"about_ca_system_score_gemma":0.0017925747,"threshold_uncertainty_score":0.22497362},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014446529,0.00044674388,0.9775608,0.00030438742,0.00008494555,0.000045995526,0.000074149844,0.0006037456,0.006432701],"genre_scores_gemma":[0.48703596,0.0011601164,0.5003771,0.00029729016,0.0002075778,0.00041980846,0.00030911076,0.00026358073,0.009929482],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982614,0.0006899544,0.00015295194,0.0002905082,0.00043045564,0.00017480041],"domain_scores_gemma":[0.99682814,0.0016211817,0.0004542588,0.0005411001,0.0004438299,0.00011141735],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015957267,0.00063128705,0.00035829196,0.00076630776,0.00069811527,0.0018245052,0.0009060432,0.0011440417,0.0033831822],"category_scores_gemma":[0.0056084995,0.00040624515,0.0010344357,0.0009195866,0.0029273443,0.0045578056,0.0013476837,0.001662067,0.00059392804],"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.000025997104,0.000009025459,0.00016966247,0.000034711913,0.000009005213,0.000073850235,0.00022882548,0.026910676,0.0020571698,0.96092445,0.00041728708,0.009139198],"study_design_scores_gemma":[0.000037061618,0.000046444606,0.00012834852,0.00002838043,0.000023671548,0.00008255802,0.00004674856,0.13453205,0.0031101112,0.84360594,0.018327927,0.000030748724],"about_ca_topic_score_codex":0.0037435333,"about_ca_topic_score_gemma":0.003163772,"teacher_disagreement_score":0.0037435333,"about_ca_system_score_codex":0.0014209226,"about_ca_system_score_gemma":0.0011346748,"threshold_uncertainty_score":0.011317909},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05303508,0.00021584652,0.93977135,0.00012094897,0.000038019323,0.0001494391,0.00011650022,0.0023939188,0.004158811],"genre_scores_gemma":[0.54559654,0.00035175445,0.45032117,0.00011109032,0.000026231308,0.00033130829,0.00037393178,0.00033849257,0.0025494401],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9954308,0.0017923502,0.0005481418,0.0006173055,0.0013399257,0.0002714737],"domain_scores_gemma":[0.99162066,0.0061800014,0.0004641964,0.0009655171,0.00068946084,0.00008020866],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003517714,0.00063498784,0.000570503,0.0006476164,0.0005515305,0.0020741927,0.0014952259,0.000765203,0.001154192],"category_scores_gemma":[0.013995491,0.00063508167,0.0010683439,0.00055628846,0.0021624095,0.0021067064,0.0011429987,0.0009543875,0.00033472857],"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.0004047585,0.00016350579,0.0024441031,0.00051036366,0.00017991864,0.000965904,0.0012990806,0.26421463,0.06272932,0.5490979,0.0013434845,0.11664706],"study_design_scores_gemma":[0.00021538808,0.00013698317,0.00038036265,0.00007604481,0.000106763626,0.00023474506,0.00011758198,0.7194152,0.07857539,0.1904573,0.010228964,0.000055310906],"about_ca_topic_score_codex":0.0036803863,"about_ca_topic_score_gemma":0.003660596,"teacher_disagreement_score":0.0036803863,"about_ca_system_score_codex":0.0010696433,"about_ca_system_score_gemma":0.0017301142,"threshold_uncertainty_score":0.018603683},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013638925,0.00044271862,0.9530681,0.00064522005,0.00037633214,0.00012585153,0.00091180886,0.017373681,0.013417425],"genre_scores_gemma":[0.16572565,0.00028236018,0.8164405,0.0005807379,0.00029342575,0.00021682725,0.0021211184,0.0036558716,0.010683544],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99779713,0.00071204506,0.0001275699,0.0005746694,0.0005847284,0.00020388629],"domain_scores_gemma":[0.9927448,0.0039017322,0.00018885662,0.0026633574,0.00038036177,0.00012089302],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025028086,0.0010670603,0.001973963,0.0018130203,0.0011214777,0.0022844123,0.0033751188,0.0017974122,0.04018428],"category_scores_gemma":[0.01221454,0.0012261297,0.0024057396,0.002070278,0.0015308594,0.0075951293,0.0049156556,0.0032802834,0.0082686255],"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.0007064576,0.00016031183,0.0017683594,0.0009042804,0.00021573878,0.00034369284,0.00055112527,0.02888177,0.011589391,0.323277,0.033013567,0.5985882],"study_design_scores_gemma":[0.0002100611,0.00007525264,0.00062160986,0.00011521579,0.00016835237,0.00024516488,0.00012319825,0.17107986,0.008224947,0.7826464,0.03644569,0.000044203534],"about_ca_topic_score_codex":0.0019154387,"about_ca_topic_score_gemma":0.004457357,"teacher_disagreement_score":0.04018428,"about_ca_system_score_codex":0.0012547539,"about_ca_system_score_gemma":0.0012749692,"threshold_uncertainty_score":0.13442981},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0083302595,0.00028765236,0.9834419,0.00034837684,0.00009677739,0.00015622437,0.00035449158,0.001413473,0.0055707027],"genre_scores_gemma":[0.3372965,0.0006503941,0.6507885,0.00021873806,0.0001451019,0.00040148626,0.0015266321,0.0013163468,0.007656316],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9926622,0.0016556615,0.0010676692,0.00063833536,0.0035156915,0.00046049932],"domain_scores_gemma":[0.9901574,0.0042589447,0.00083798234,0.0024614148,0.00189875,0.00038553894],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008851834,0.0011819353,0.0011376446,0.0026471512,0.0009504007,0.005526607,0.002410591,0.0017479248,0.0052620554],"category_scores_gemma":[0.016424472,0.0012273776,0.0022691307,0.0022699158,0.0030785862,0.010292336,0.0037897306,0.0038998094,0.00118914],"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.000100404584,0.000039436316,0.0004768908,0.00029195345,0.000040465267,0.00009386274,0.0005244531,0.012331004,0.0018902769,0.9458406,0.0017070936,0.036663663],"study_design_scores_gemma":[0.000040380335,0.00005752299,0.00025640722,0.00017377993,0.00008849247,0.00017536788,0.00021345008,0.079849176,0.0067882445,0.88501096,0.02729267,0.0000536453],"about_ca_topic_score_codex":0.0011561795,"about_ca_topic_score_gemma":0.0015146695,"teacher_disagreement_score":0.008851834,"about_ca_system_score_codex":0.0019417133,"about_ca_system_score_gemma":0.0013159956,"threshold_uncertainty_score":0.046813548},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009943438,0.0001001755,0.9884371,0.000087288005,0.000015823543,0.000044243254,0.00003448114,0.00055729237,0.00078007346],"genre_scores_gemma":[0.41702673,0.00031599827,0.58046347,0.00013775523,0.000022269256,0.00029009584,0.00013211503,0.00012466671,0.0014869111],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99754333,0.0010440168,0.00016768402,0.00032401594,0.0007725696,0.00014833045],"domain_scores_gemma":[0.99592894,0.0027519083,0.00032463783,0.0006646465,0.00028008013,0.000049793944],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032309515,0.00081714365,0.000777212,0.00090637576,0.00040887544,0.0008865589,0.0010723436,0.0008658857,0.0015085306],"category_scores_gemma":[0.0067433957,0.00047002354,0.0010514511,0.0007588309,0.002080907,0.0018266957,0.0009827113,0.0014225501,0.00024139661],"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.00029212708,0.00007326512,0.0007529929,0.00027243898,0.00009302483,0.00035335144,0.00020553815,0.58429325,0.017663166,0.2381571,0.0008936109,0.15695013],"study_design_scores_gemma":[0.00006704236,0.000082622595,0.000077423574,0.00002266032,0.000035769666,0.000067999936,0.000011876019,0.90830815,0.017947003,0.0703224,0.0030387186,0.00001838843],"about_ca_topic_score_codex":0.0017603986,"about_ca_topic_score_gemma":0.0020065256,"teacher_disagreement_score":0.0032309515,"about_ca_system_score_codex":0.0010715899,"about_ca_system_score_gemma":0.0012514121,"threshold_uncertainty_score":0.017087042},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0761571,0.0025131842,0.82237124,0.01101187,0.00060872245,0.0003414988,0.0010508661,0.0047809957,0.08116444],"genre_scores_gemma":[0.69230527,0.001391819,0.27909592,0.0050399113,0.0008581145,0.00056313194,0.0010246034,0.0022173221,0.017503945],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98704535,0.0024366141,0.0007523835,0.0023178402,0.004467529,0.002980344],"domain_scores_gemma":[0.8847172,0.08112603,0.003965225,0.020616593,0.007925619,0.0016493773],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010390598,0.001780899,0.001367387,0.0031751266,0.002321248,0.0071595986,0.0042549144,0.0027601244,0.020146675],"category_scores_gemma":[0.060033377,0.0014093663,0.0040961225,0.0020296017,0.005980889,0.0234829,0.007935434,0.011511903,0.0045580845],"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.00053095975,0.00017019114,0.0027680947,0.000574674,0.00009599206,0.00027312234,0.00059016026,0.013849069,0.0101273265,0.90891105,0.009525669,0.052583616],"study_design_scores_gemma":[0.000036376034,0.000063320156,0.0005776345,0.00010080006,0.00007598651,0.00032330502,0.0001098396,0.029045159,0.010456269,0.9428831,0.016270068,0.000058204176],"about_ca_topic_score_codex":0.0014768302,"about_ca_topic_score_gemma":0.0020754721,"teacher_disagreement_score":0.020146675,"about_ca_system_score_codex":0.004835803,"about_ca_system_score_gemma":0.0028420233,"threshold_uncertainty_score":0.0673973},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009345193,0.0046670297,0.98115116,0.0016746396,0.00024968362,0.00013290806,0.00010803886,0.0010855019,0.009996469],"genre_scores_gemma":[0.0718745,0.010403008,0.90624416,0.0010780749,0.0007995894,0.0007851064,0.0005684404,0.00062534533,0.007621728],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9868722,0.007431611,0.0009531259,0.0012473965,0.0030733687,0.00042226593],"domain_scores_gemma":[0.9749553,0.019586671,0.0008874634,0.0030408436,0.0013322302,0.00019741892],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01671579,0.0021425427,0.0013554036,0.003861799,0.0014005209,0.005411751,0.0036279268,0.0024008262,0.0073662647],"category_scores_gemma":[0.022368498,0.0015953446,0.0027755098,0.0026179934,0.0085763745,0.007388564,0.0041477936,0.0065217237,0.002148166],"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.000030353862,0.000050354414,0.0002843648,0.00070630223,0.00006062178,0.00014066168,0.0006134658,0.025282858,0.00087097415,0.8717092,0.00610673,0.094144],"study_design_scores_gemma":[0.00004153715,0.000029851682,0.00008221502,0.00043660318,0.000026453681,0.00011545043,0.0000975301,0.052346397,0.0010302981,0.88740385,0.058354057,0.000035758494],"about_ca_topic_score_codex":0.003031381,"about_ca_topic_score_gemma":0.0019536891,"teacher_disagreement_score":0.01671579,"about_ca_system_score_codex":0.0037506286,"about_ca_system_score_gemma":0.0051679737,"threshold_uncertainty_score":0.08840263},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44205958,0.0009830187,0.4484755,0.0014404668,0.0006707964,0.0001198931,0.00024722083,0.0005557177,0.10544781],"genre_scores_gemma":[0.92988634,0.00052676914,0.058904614,0.00019958714,0.00016878868,0.00013782359,0.00015964411,0.00012161487,0.009894812],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990694,0.00023446142,0.000082685736,0.00013747175,0.00031713917,0.00015883998],"domain_scores_gemma":[0.9992053,0.00023956133,0.00008714715,0.0003024783,0.000100332254,0.00006516266],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010829902,0.00044875598,0.0004823382,0.00074891816,0.0011693911,0.0025000018,0.0006415252,0.0010067065,0.0035826885],"category_scores_gemma":[0.0019610082,0.00040089744,0.00072145206,0.0006222172,0.0030498176,0.0031327638,0.0010526322,0.0017810651,0.00076566613],"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.00002546224,0.000015463478,0.00007935484,0.000016070106,0.0000017571808,0.00007355533,0.0001246376,0.0011792363,0.003226004,0.98959726,0.00029147966,0.005369646],"study_design_scores_gemma":[0.000016771963,0.00003226452,0.00007870804,0.000009226783,0.000003683289,0.000118937096,0.000062743566,0.010304501,0.0025313753,0.9839061,0.0029246013,0.000011140425],"about_ca_topic_score_codex":0.0004685634,"about_ca_topic_score_gemma":0.00064620917,"teacher_disagreement_score":0.0035826885,"about_ca_system_score_codex":0.0007055918,"about_ca_system_score_gemma":0.00069641444,"threshold_uncertainty_score":0.011985302},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06273574,0.0019903977,0.91124856,0.0006689908,0.00007288603,0.00014381521,0.00024239083,0.0004992561,0.022398012],"genre_scores_gemma":[0.443361,0.00258127,0.54702115,0.0004934913,0.00021957266,0.00028683155,0.00078239955,0.00047249458,0.004781761],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9955878,0.001387939,0.00031530033,0.00079763116,0.001389652,0.00052160386],"domain_scores_gemma":[0.9730268,0.021643683,0.0018633001,0.0017218343,0.0013542564,0.00039012852],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039626975,0.001109222,0.0012625037,0.001962457,0.0011827614,0.0027865903,0.0010635316,0.00089216325,0.00488759],"category_scores_gemma":[0.018402996,0.0009218709,0.0008259703,0.0031200703,0.0027534282,0.0055519305,0.0017664102,0.0031111357,0.00064428494],"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.00052831066,0.00021226864,0.0021263284,0.0006619837,0.00008384238,0.0007615071,0.00051583326,0.1419712,0.015716108,0.6312776,0.004647904,0.2014972],"study_design_scores_gemma":[0.00008032567,0.00019699628,0.0009417676,0.00012625616,0.000096916294,0.00076695805,0.00016050562,0.16028623,0.008776621,0.8191262,0.009389276,0.000051999337],"about_ca_topic_score_codex":0.002096137,"about_ca_topic_score_gemma":0.0033089973,"teacher_disagreement_score":0.00488759,"about_ca_system_score_codex":0.0014498561,"about_ca_system_score_gemma":0.0009930922,"threshold_uncertainty_score":0.020956993},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012863931,0.093850456,0.6224842,0.073851235,0.025128929,0.00030083055,0.0033002328,0.0015487202,0.16667144],"genre_scores_gemma":[0.24183206,0.07843915,0.32531565,0.010428863,0.022551453,0.0010011117,0.013156041,0.002490756,0.30478483],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99495476,0.001701454,0.00042617155,0.00087472424,0.0017532908,0.00028962136],"domain_scores_gemma":[0.9918901,0.0045381403,0.00018359732,0.0015149727,0.0014274622,0.00044577895],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0070002875,0.0012800127,0.0014137479,0.0019276874,0.0014268768,0.007258726,0.0020248948,0.0017317646,0.034119718],"category_scores_gemma":[0.013138344,0.0009952594,0.0018232082,0.001509977,0.0031054975,0.007968152,0.004264369,0.008731312,0.005507939],"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.00020819575,0.00015113511,0.000636843,0.00072751736,0.0001646456,0.00023358002,0.0011516669,0.0044462746,0.002102236,0.5269863,0.27063516,0.19255646],"study_design_scores_gemma":[0.000043682383,0.00004695123,0.00065326603,0.00043796535,0.0000536428,0.00035552954,0.00015897748,0.0070329336,0.0015009122,0.41993943,0.5697296,0.000047039073],"about_ca_topic_score_codex":0.003323982,"about_ca_topic_score_gemma":0.0040890947,"teacher_disagreement_score":0.034119718,"about_ca_system_score_codex":0.005535372,"about_ca_system_score_gemma":0.0026334017,"threshold_uncertainty_score":0.11414188},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0412639,0.000497483,0.9024012,0.00054202985,0.00042819756,0.00008259137,0.00025995087,0.0047165425,0.04980818],"genre_scores_gemma":[0.62112194,0.001491274,0.29324463,0.00037148577,0.00036630308,0.00019305781,0.0014049119,0.0038997503,0.07790663],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99869555,0.00016175756,0.00013414842,0.00021465578,0.00055485696,0.00023894045],"domain_scores_gemma":[0.99763453,0.0010525101,0.00012828854,0.00071272656,0.00033639892,0.00013541881],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011589796,0.0007149741,0.0005994073,0.0010068518,0.001170307,0.0033648885,0.0016364495,0.00092741504,0.012071128],"category_scores_gemma":[0.0056319553,0.000746386,0.0012994107,0.0014824218,0.0018879324,0.00714853,0.0050112875,0.0033721977,0.0025029287],"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.0001193222,0.000044635013,0.0005669329,0.0002512884,0.000039500785,0.00083148055,0.0010798522,0.011086361,0.014315264,0.8554487,0.0053230287,0.11089355],"study_design_scores_gemma":[0.000020971516,0.00002102342,0.00015000372,0.00009532598,0.000053111977,0.00056902773,0.0002464935,0.03874075,0.016570376,0.88286155,0.060636282,0.000034996836],"about_ca_topic_score_codex":0.0011371402,"about_ca_topic_score_gemma":0.001057616,"teacher_disagreement_score":0.012071128,"about_ca_system_score_codex":0.00085308263,"about_ca_system_score_gemma":0.00080011104,"threshold_uncertainty_score":0.040381968},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014220822,0.014745417,0.53465736,0.0025483547,0.0010201427,0.0002906738,0.00017234408,0.0012370526,0.44390664],"genre_scores_gemma":[0.057140183,0.023750022,0.2403161,0.0014014608,0.00059162354,0.0005931474,0.0005667979,0.0010891085,0.67455155],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994748,0.000116832816,0.00002229043,0.00008271857,0.0002729137,0.000030455143],"domain_scores_gemma":[0.9994205,0.00027842305,0.00002565412,0.00008507465,0.00016616411,0.000024167342],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00078414346,0.0009167005,0.000303719,0.0018270896,0.0006843383,0.0016593041,0.0010725427,0.0006430452,0.024378637],"category_scores_gemma":[0.0014286538,0.00048898265,0.00034762605,0.00089410605,0.0013878094,0.0018673447,0.0009041801,0.001443217,0.008607235],"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.000009301931,0.000029826133,0.00008613679,0.0004357414,0.000010387925,0.0000663767,0.000405303,0.0018035625,0.0014949022,0.5520326,0.08747494,0.3561509],"study_design_scores_gemma":[0.0000065443082,0.000020314828,0.000103693645,0.00032650738,0.000008338501,0.0001774875,0.000070150454,0.0025168268,0.001953563,0.18879336,0.8060144,0.00000880214],"about_ca_topic_score_codex":0.0011519914,"about_ca_topic_score_gemma":0.0016114869,"teacher_disagreement_score":0.024378637,"about_ca_system_score_codex":0.0015721964,"about_ca_system_score_gemma":0.0019321459,"threshold_uncertainty_score":0.08155465},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0050960802,0.000024025023,0.98831475,0.000100949255,0.000029599007,0.00007930167,0.00010484207,0.004960474,0.0012900234],"genre_scores_gemma":[0.082558975,0.00006653245,0.9137969,0.00008596139,0.000021573409,0.00018872239,0.0003821636,0.0008111854,0.0020880683],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9957943,0.0014216485,0.0004316932,0.00059918116,0.0014999314,0.00025322931],"domain_scores_gemma":[0.9899436,0.0057026804,0.0006113566,0.0021914262,0.0012948517,0.00025607314],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006767796,0.00075638853,0.0006780625,0.0010639213,0.00045292138,0.0031669845,0.0020246818,0.0009012222,0.0063190274],"category_scores_gemma":[0.014082654,0.00069457915,0.0011392289,0.000717055,0.0008487824,0.0036958118,0.002046795,0.0013940027,0.0023802118],"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.00088560226,0.0004978323,0.0037546528,0.00077099976,0.00021261437,0.0008781537,0.0012741542,0.06790946,0.05897941,0.34809282,0.012578215,0.5041662],"study_design_scores_gemma":[0.00036784573,0.0005978859,0.00072840374,0.00021180075,0.00019186643,0.0006831026,0.00020388678,0.5657857,0.1457762,0.1547095,0.1305783,0.000165471],"about_ca_topic_score_codex":0.0007137202,"about_ca_topic_score_gemma":0.0008374617,"teacher_disagreement_score":0.006767796,"about_ca_system_score_codex":0.0007717134,"about_ca_system_score_gemma":0.0017700469,"threshold_uncertainty_score":0.035791934},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005724904,0.0002445845,0.98864436,0.00012308311,0.00006330545,0.000046637222,0.00006445402,0.0012696022,0.0038190056],"genre_scores_gemma":[0.4141171,0.00046699843,0.57836473,0.0002554506,0.000078269,0.0002303859,0.00026237004,0.0004914454,0.0057333205],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9946695,0.0014867805,0.0003081796,0.00082856906,0.0023318902,0.0003750878],"domain_scores_gemma":[0.99497664,0.0026864915,0.00023122512,0.001573714,0.00046307937,0.000069014575],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002977377,0.0012114593,0.0015200683,0.0015859228,0.0007949512,0.0030390238,0.0035601738,0.0011637267,0.0046442635],"category_scores_gemma":[0.00803413,0.0013042713,0.002844665,0.0015759674,0.0033105735,0.0071202484,0.0036927282,0.0039614383,0.00097473915],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025644575,0.0001390385,0.00038557878,0.00051090925,0.00020745778,0.00022070417,0.0002306576,0.10747322,0.011604396,0.74606293,0.0025832145,0.13032536],"study_design_scores_gemma":[0.000057837042,0.000038357153,0.00009606217,0.00006889226,0.000072923875,0.00010697394,0.000019254381,0.42364377,0.017296856,0.55556566,0.00300023,0.000033176297],"about_ca_topic_score_codex":0.001112663,"about_ca_topic_score_gemma":0.0017844212,"teacher_disagreement_score":0.0046442635,"about_ca_system_score_codex":0.0017728473,"about_ca_system_score_gemma":0.0014173796,"threshold_uncertainty_score":0.015746057},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008809875,0.00004187163,0.9958033,0.0001608734,0.000042764266,0.000064425345,0.00007053204,0.0011384115,0.0017967637],"genre_scores_gemma":[0.05839211,0.00018807562,0.93573314,0.0003280804,0.00011548193,0.0003041209,0.00044638873,0.0005369344,0.003955622],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99677867,0.0008645807,0.0003079205,0.00046231088,0.0013410613,0.00024556258],"domain_scores_gemma":[0.992446,0.0044714184,0.00027513705,0.0016445667,0.001013507,0.0001493223],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003366462,0.00084837334,0.00082081824,0.0022318105,0.0016167192,0.0042110267,0.00385664,0.0015330155,0.011280296],"category_scores_gemma":[0.01104096,0.001204256,0.002515259,0.001809099,0.004213667,0.006216612,0.00434961,0.0030211578,0.0032223924],"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.00017844803,0.00015315595,0.00050045695,0.0003433537,0.00005224309,0.00032540708,0.00033153413,0.030437902,0.011249099,0.7861324,0.007967659,0.16232844],"study_design_scores_gemma":[0.000058421436,0.00006860671,0.00007416682,0.00007966673,0.000078379424,0.00024246715,0.000085097585,0.2624685,0.024078447,0.68841225,0.024300197,0.000053797867],"about_ca_topic_score_codex":0.0016689515,"about_ca_topic_score_gemma":0.0022902556,"teacher_disagreement_score":0.011280296,"about_ca_system_score_codex":0.0013732447,"about_ca_system_score_gemma":0.0029840998,"threshold_uncertainty_score":0.037736356},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0057590576,0.000068303096,0.99053615,0.000077953344,0.000025306077,0.000058720118,0.000034090812,0.001658596,0.001781831],"genre_scores_gemma":[0.2604914,0.00023366066,0.7325137,0.000117617295,0.000046309156,0.00021942185,0.00033899266,0.0011139957,0.0049249227],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9929469,0.0028887885,0.00048562099,0.001033245,0.002222505,0.0004229659],"domain_scores_gemma":[0.9924091,0.0036811978,0.00041879134,0.002789845,0.0006292546,0.00007180862],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0048163855,0.0009902027,0.0010454372,0.0015423548,0.0009696789,0.002316793,0.0026706404,0.0013848158,0.004877317],"category_scores_gemma":[0.015118412,0.0015506446,0.0030505587,0.0013077429,0.0030684085,0.006224642,0.0029989649,0.0028776228,0.0010945512],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027697498,0.000153634,0.0020160833,0.0005836777,0.00017880044,0.0004214418,0.00079709926,0.14040875,0.017898083,0.51377296,0.002833994,0.3206585],"study_design_scores_gemma":[0.000056038927,0.000084869615,0.00033221743,0.00013046862,0.00010760977,0.00026658323,0.00010586225,0.36885887,0.035271656,0.5809776,0.013758133,0.00005009705],"about_ca_topic_score_codex":0.0019310098,"about_ca_topic_score_gemma":0.0023891872,"teacher_disagreement_score":0.004877317,"about_ca_system_score_codex":0.0011026826,"about_ca_system_score_gemma":0.0013204638,"threshold_uncertainty_score":0.025471747},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018456996,0.0014062428,0.9014352,0.0006882079,0.00041276705,0.000043606182,0.000109558,0.000888844,0.093169846],"genre_scores_gemma":[0.29474297,0.0074359872,0.46995977,0.0012027083,0.0007553437,0.00043542992,0.0011997493,0.0018716904,0.22239643],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994723,0.00013166574,0.000023776292,0.000078151366,0.0002397346,0.000054300468],"domain_scores_gemma":[0.9996923,0.00010576571,0.000016914315,0.00010926844,0.000060008275,0.000015682886],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061235554,0.0011098032,0.00065154204,0.00092893257,0.00090866286,0.0019301055,0.0014417775,0.0009518611,0.017271437],"category_scores_gemma":[0.0014064761,0.0005377231,0.0009738211,0.0007921423,0.00153453,0.0034442537,0.0021019792,0.0017380442,0.004801588],"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.000012606843,0.00001903967,0.000060217684,0.0000889337,0.000008345999,0.00005371965,0.00013606057,0.0059727337,0.0015312255,0.9406917,0.005298553,0.046126775],"study_design_scores_gemma":[0.000007623741,0.000024965788,0.0000657899,0.00011078498,0.000016459211,0.00018875663,0.00011128276,0.04732152,0.003220961,0.7840601,0.16485816,0.00001367441],"about_ca_topic_score_codex":0.0011144159,"about_ca_topic_score_gemma":0.0010608208,"teacher_disagreement_score":0.017271437,"about_ca_system_score_codex":0.000805042,"about_ca_system_score_gemma":0.00055512926,"threshold_uncertainty_score":0.057778716},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18110408,0.002711398,0.7436955,0.006124324,0.0008243863,0.0009489986,0.0036079418,0.006270542,0.054712817],"genre_scores_gemma":[0.70368344,0.0011425999,0.27033406,0.001481084,0.00040975382,0.00066525966,0.003718775,0.0016549748,0.01691006],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99470913,0.0020149697,0.00028421357,0.0011637319,0.001019792,0.0008081796],"domain_scores_gemma":[0.9707172,0.024132527,0.00082675955,0.0034642825,0.00041539985,0.0004437069],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034139955,0.0024977173,0.0034480055,0.0018795246,0.0018784004,0.005358968,0.0049010133,0.0035527996,0.024044348],"category_scores_gemma":[0.026001822,0.0028991136,0.004625121,0.0031224503,0.0044271084,0.012720635,0.007824913,0.009076949,0.003330785],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0027600306,0.0008528583,0.0031325095,0.0026614943,0.0007913244,0.000830053,0.0011089866,0.17624632,0.008719009,0.5161903,0.03808775,0.2486194],"study_design_scores_gemma":[0.0002948457,0.00016891437,0.0003477806,0.00017266678,0.00020132134,0.00031372768,0.00025309794,0.13890633,0.004371791,0.8495186,0.0053988174,0.00005209559],"about_ca_topic_score_codex":0.0011478377,"about_ca_topic_score_gemma":0.002033906,"teacher_disagreement_score":0.024044348,"about_ca_system_score_codex":0.002103615,"about_ca_system_score_gemma":0.0019161773,"threshold_uncertainty_score":0.08043629},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001550641,0.00006445471,0.994113,0.000090568705,0.000050888575,0.000073187985,0.00008522566,0.00067519775,0.0032969003],"genre_scores_gemma":[0.040572334,0.0001921869,0.950647,0.0001340196,0.000051216393,0.00023449167,0.00036152473,0.00042403612,0.007383261],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99772006,0.0005004266,0.00017763666,0.0006369618,0.0007881125,0.0001768058],"domain_scores_gemma":[0.9978727,0.0008975291,0.000091841044,0.00073012145,0.00028899134,0.00011885273],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001475456,0.0010881817,0.00087664556,0.0016484666,0.00141795,0.0026784053,0.0026623087,0.0010246412,0.010265108],"category_scores_gemma":[0.0036601597,0.0011484487,0.0025582497,0.0014492073,0.0019463402,0.004147514,0.003794115,0.0038465394,0.0034274405],"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.00009591943,0.0001595971,0.0004335734,0.00037573106,0.000091807575,0.00027239876,0.00052651425,0.014618532,0.013235248,0.73703945,0.0070607713,0.22609045],"study_design_scores_gemma":[0.000042325835,0.00008336498,0.0002373018,0.00010224695,0.00011303025,0.00036165884,0.00010966965,0.07497219,0.016964452,0.8251848,0.081762165,0.000066688925],"about_ca_topic_score_codex":0.0011466045,"about_ca_topic_score_gemma":0.0023269264,"teacher_disagreement_score":0.010265108,"about_ca_system_score_codex":0.001056851,"about_ca_system_score_gemma":0.001356737,"threshold_uncertainty_score":0.034340203},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0041650212,0.000093927134,0.9905785,0.00012237516,0.000043300835,0.00007202296,0.000022279797,0.0027255728,0.0021770059],"genre_scores_gemma":[0.15195256,0.0001763301,0.8435855,0.00024933732,0.000036318816,0.0001330989,0.00008492697,0.000541632,0.0032403332],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9942298,0.0020265384,0.00029985333,0.0009196853,0.0021142233,0.0004100036],"domain_scores_gemma":[0.99387807,0.0029291324,0.000237941,0.002285628,0.00053780916,0.00013152059],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002894263,0.0015367043,0.0012062881,0.0015835334,0.0008894959,0.0028180734,0.0046180733,0.0028224343,0.0048950263],"category_scores_gemma":[0.007548552,0.0012916722,0.0020199989,0.0011009234,0.0030531033,0.0051345425,0.0035861062,0.0048830924,0.0009959893],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005266819,0.0010027174,0.0020465015,0.0008298799,0.00041383243,0.0015093186,0.00093358953,0.09199634,0.08007626,0.50444263,0.0046588443,0.3115634],"study_design_scores_gemma":[0.0002180246,0.00036689063,0.00033374384,0.00017352506,0.0003820405,0.00097340735,0.00010264542,0.6159651,0.08830351,0.27865827,0.014411109,0.00011167373],"about_ca_topic_score_codex":0.0016640018,"about_ca_topic_score_gemma":0.0026758052,"teacher_disagreement_score":0.0048950263,"about_ca_system_score_codex":0.00078323344,"about_ca_system_score_gemma":0.0018932194,"threshold_uncertainty_score":0.016375482},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008868018,0.0003150498,0.9767975,0.00056047516,0.0001963847,0.000021812906,0.00009278007,0.00065252883,0.012495412],"genre_scores_gemma":[0.46548644,0.0012890028,0.48584616,0.0004480246,0.00023850455,0.00018516228,0.0007655107,0.0010528845,0.044688422],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990969,0.00034877588,0.000042760654,0.00013937503,0.00027992742,0.00009234425],"domain_scores_gemma":[0.99757093,0.0013429237,0.00009731637,0.00063756085,0.00026958206,0.00008175594],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001479282,0.00084746606,0.0009868292,0.00059688266,0.0005685328,0.0018505766,0.0012785193,0.0011705657,0.01192039],"category_scores_gemma":[0.008903411,0.00065866165,0.0011291153,0.0009165748,0.001300208,0.00459666,0.0022375975,0.0025612665,0.0022639139],"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.00012969399,0.000042524352,0.00042666675,0.000120048266,0.000030190855,0.00007614499,0.00017653915,0.17260855,0.0021707325,0.7514043,0.0050225467,0.06779209],"study_design_scores_gemma":[0.000010412045,0.000018699957,0.000070056165,0.000025761876,0.000010884042,0.00003623001,0.000029480336,0.38146064,0.0014504025,0.6100045,0.0068715904,0.00001142456],"about_ca_topic_score_codex":0.0035368456,"about_ca_topic_score_gemma":0.003173556,"teacher_disagreement_score":0.01192039,"about_ca_system_score_codex":0.0016695441,"about_ca_system_score_gemma":0.0008124591,"threshold_uncertainty_score":0.039877713},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009894884,0.00024372709,0.985285,0.00028447775,0.000021411513,0.00008298583,0.000052073094,0.00042254358,0.003712937],"genre_scores_gemma":[0.4030308,0.0005232057,0.5904996,0.00019672189,0.00006859137,0.0005033489,0.00027123097,0.00029951794,0.0046069487],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972339,0.0010653078,0.00016117598,0.00051400426,0.0006402428,0.00038523218],"domain_scores_gemma":[0.9861806,0.011322649,0.0006064761,0.00090959953,0.00069241953,0.0002881831],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00339212,0.0010672418,0.0014282464,0.00092651637,0.00093579135,0.0016002281,0.001789953,0.0016155705,0.004722603],"category_scores_gemma":[0.017882012,0.0007773945,0.001333913,0.0011541134,0.0029222185,0.0029739337,0.0028390249,0.0035264383,0.0009524753],"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.00017413753,0.00010877781,0.0006562587,0.00020529983,0.000042366984,0.00005692946,0.00025622742,0.6007173,0.0011040912,0.32135162,0.0022912386,0.073035814],"study_design_scores_gemma":[0.000041894586,0.000025102288,0.000043945027,0.000015497893,0.0000065845566,0.00001713031,0.000015631887,0.81147665,0.0006503849,0.18659832,0.0011004057,0.000008502493],"about_ca_topic_score_codex":0.0036198087,"about_ca_topic_score_gemma":0.004047203,"teacher_disagreement_score":0.004722603,"about_ca_system_score_codex":0.0026231431,"about_ca_system_score_gemma":0.002764188,"threshold_uncertainty_score":0.0190323},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015834996,0.0002385641,0.99017555,0.00011464369,0.00007658483,0.000048334576,0.000033909364,0.0010828755,0.006645983],"genre_scores_gemma":[0.107445665,0.0007767769,0.87996787,0.00018309816,0.00008997434,0.00013503116,0.00022386722,0.00045646308,0.0107212905],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99818736,0.00043648406,0.00010018913,0.00020280223,0.0009545415,0.00011863785],"domain_scores_gemma":[0.9979564,0.0011666156,0.00007009563,0.0005403267,0.00024427846,0.000022285662],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001802359,0.0010963707,0.00070814695,0.0009911025,0.00063705095,0.0020403487,0.0019455946,0.0013567003,0.011002067],"category_scores_gemma":[0.0037411351,0.00096589385,0.0015944828,0.0005621907,0.0018528961,0.0032706514,0.0022139563,0.0027658788,0.0035866923],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013756836,0.00012923634,0.00029164163,0.0007769482,0.00010357521,0.00028979362,0.00030597567,0.080619134,0.02742447,0.47873405,0.009256573,0.4019309],"study_design_scores_gemma":[0.00007577283,0.000119889504,0.00021631377,0.00026632627,0.00008677983,0.0003652435,0.000053089552,0.46405494,0.038122326,0.43584242,0.06075385,0.000043089076],"about_ca_topic_score_codex":0.0010249511,"about_ca_topic_score_gemma":0.0008964664,"teacher_disagreement_score":0.011002067,"about_ca_system_score_codex":0.00057132496,"about_ca_system_score_gemma":0.00096695556,"threshold_uncertainty_score":0.03680557},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011731859,0.000044772813,0.98616993,0.000039302686,0.000025986064,0.000040754057,0.00012096409,0.000908773,0.00091771304],"genre_scores_gemma":[0.266847,0.00024361597,0.7293761,0.00006071349,0.000029645627,0.00024039113,0.00073891476,0.00029277496,0.0021708938],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99938,0.00013173283,0.000051213643,0.00014515036,0.00022833441,0.00006353438],"domain_scores_gemma":[0.9993079,0.0002293493,0.00007630143,0.00026126104,0.00009609451,0.000029078294],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050419004,0.00082212157,0.0007247854,0.0005371576,0.00037758212,0.0009306321,0.0009107331,0.00044093461,0.002181263],"category_scores_gemma":[0.0014780619,0.00039947787,0.0020249633,0.0007929089,0.00074784656,0.001960786,0.0008150273,0.0014205978,0.00038371293],"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.00023726623,0.00013288768,0.0013096045,0.00036622284,0.0001142271,0.0005736605,0.00039125545,0.62600255,0.14253496,0.16116062,0.0012505085,0.065926276],"study_design_scores_gemma":[0.000039736155,0.00016386734,0.00044364898,0.00003175193,0.00011089183,0.00020876086,0.000053871412,0.89144313,0.036968302,0.058016475,0.012477432,0.000042069365],"about_ca_topic_score_codex":0.0025987185,"about_ca_topic_score_gemma":0.004012288,"teacher_disagreement_score":0.0025987185,"about_ca_system_score_codex":0.0008482315,"about_ca_system_score_gemma":0.0014022259,"threshold_uncertainty_score":0.007297039},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02474949,0.00025702192,0.9683894,0.000412794,0.00010273706,0.00006353329,0.00014763552,0.0013949958,0.0044823387],"genre_scores_gemma":[0.57130325,0.00032949957,0.42074105,0.00019323122,0.00011879055,0.000116202675,0.00055019365,0.0006264914,0.00602131],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971782,0.0010642662,0.00014016003,0.0003479816,0.0009049589,0.00036441427],"domain_scores_gemma":[0.994375,0.0031544454,0.00019357755,0.0015277574,0.0006206689,0.00012852614],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003400915,0.00064605894,0.0011142434,0.0011625843,0.0011207402,0.0022891685,0.0012628236,0.0011706867,0.005445702],"category_scores_gemma":[0.015905213,0.0007151275,0.0011990458,0.0014810644,0.0019610631,0.0057191835,0.0036386617,0.0025700734,0.0012203029],"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.00061208,0.0001391323,0.0010675811,0.00033845525,0.000049625523,0.0002616577,0.00047779529,0.09885396,0.011287486,0.6023439,0.0062921103,0.27827618],"study_design_scores_gemma":[0.000030284265,0.000044690023,0.00012415541,0.000042446693,0.00002457341,0.00010138904,0.000075938195,0.28401875,0.006967431,0.7025528,0.0059940433,0.000023404007],"about_ca_topic_score_codex":0.0020385212,"about_ca_topic_score_gemma":0.002374313,"teacher_disagreement_score":0.005445702,"about_ca_system_score_codex":0.0013053039,"about_ca_system_score_gemma":0.0018026077,"threshold_uncertainty_score":0.018217623},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007325367,0.00006898708,0.9858037,0.000072644936,0.000073656185,0.00012905704,0.00008632906,0.0044751577,0.0019651288],"genre_scores_gemma":[0.15496354,0.00012111382,0.8362041,0.00015130336,0.000053662556,0.00047355884,0.0004125629,0.001101873,0.0065182317],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99549073,0.0011814322,0.00030772976,0.0009498045,0.0018106025,0.00025970867],"domain_scores_gemma":[0.98997074,0.005997742,0.0005097708,0.002408399,0.0008758996,0.00023742658],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024312378,0.001228917,0.0010086198,0.0014282077,0.0006814678,0.0011797525,0.0021615617,0.0016454464,0.0075340765],"category_scores_gemma":[0.009470859,0.0008513396,0.0012811531,0.00087493734,0.0018158824,0.002844512,0.0017631499,0.0018514548,0.0020018723],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008655981,0.00066871394,0.0035536592,0.0010992734,0.00026799637,0.00076995,0.00091935496,0.020820169,0.12025096,0.11201036,0.012923962,0.72585005],"study_design_scores_gemma":[0.0007769324,0.0016580961,0.0034605477,0.00030346564,0.0004289693,0.0031698386,0.00040526327,0.4310426,0.2833078,0.20905307,0.06610685,0.00028651653],"about_ca_topic_score_codex":0.0008554636,"about_ca_topic_score_gemma":0.0010141844,"teacher_disagreement_score":0.0075340765,"about_ca_system_score_codex":0.0003967909,"about_ca_system_score_gemma":0.0009429052,"threshold_uncertainty_score":0.025204003},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012789976,0.000064596046,0.9964175,0.00003190036,0.000020462174,0.000028185874,0.000108520355,0.0008595735,0.0011902692],"genre_scores_gemma":[0.20261034,0.0006007841,0.7910731,0.000121116536,0.00005745861,0.00050345913,0.0009505254,0.00042788373,0.0036553177],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980223,0.00063750823,0.00022773258,0.0002971513,0.00069627806,0.00011905071],"domain_scores_gemma":[0.99840456,0.00073494087,0.00016527539,0.00047061293,0.0001958468,0.00002867061],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022026382,0.0008448947,0.00050171034,0.00078959996,0.00033888835,0.0014309033,0.0016134945,0.0006186745,0.0029380275],"category_scores_gemma":[0.0041870726,0.00058772357,0.0015804688,0.00057130784,0.0012472669,0.001773665,0.0018398874,0.0013452696,0.0008192078],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014594287,0.00006509575,0.0018547832,0.000776591,0.00013830024,0.00076847174,0.000329972,0.3225349,0.017338442,0.50732815,0.003581985,0.14513732],"study_design_scores_gemma":[0.000038531347,0.000053548352,0.0002239124,0.00009174924,0.000055741624,0.00031127772,0.000033892844,0.80126387,0.02032247,0.13828447,0.039298594,0.000021871785],"about_ca_topic_score_codex":0.0017211657,"about_ca_topic_score_gemma":0.0010293229,"teacher_disagreement_score":0.0029380275,"about_ca_system_score_codex":0.0005976329,"about_ca_system_score_gemma":0.0010797755,"threshold_uncertainty_score":0.011648834},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8961009,0.011546387,0.07686863,0.0008753117,0.00028608844,0.00032313584,0.0014389397,0.00041826858,0.01214238],"genre_scores_gemma":[0.9626547,0.001433482,0.03372949,0.00031044154,0.0000866102,0.00012232635,0.0005634656,0.000020329537,0.0010790987],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.99375147,0.0018481005,0.00071588345,0.0010893913,0.0021688577,0.00042633622],"domain_scores_gemma":[0.9743326,0.0149281565,0.0058139446,0.0022337588,0.0018991051,0.00079233176],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004911911,0.0010233519,0.000389449,0.0024839386,0.00053048047,0.0010937366,0.0006561883,0.0008831809,0.0034268461],"category_scores_gemma":[0.013954484,0.00059985655,0.00049327646,0.0013981934,0.0010729429,0.0010754802,0.0012136468,0.0009766457,0.0011629409],"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.0040310686,0.0005811247,0.25722715,0.0013857943,0.00060926116,0.0024901822,0.0012467599,0.0012421918,0.65682757,0.0033736196,0.0017504753,0.069234855],"study_design_scores_gemma":[0.00015852571,0.0033135316,0.4781271,0.0003050629,0.0008016714,0.032658927,0.0008412909,0.0100058755,0.45163265,0.005303094,0.016688816,0.00016340693],"about_ca_topic_score_codex":0.00043583865,"about_ca_topic_score_gemma":0.00050521834,"teacher_disagreement_score":0.004911911,"about_ca_system_score_codex":0.00030217433,"about_ca_system_score_gemma":0.00037781184,"threshold_uncertainty_score":0.025977015},"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":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26092878,0.0023859635,0.31556803,0.011381009,0.0003551317,0.00073739927,0.0005350855,0.0016249309,0.40648374],"genre_scores_gemma":[0.8627548,0.0014391482,0.083911665,0.0005704437,0.000079639634,0.0004447788,0.00038236944,0.00041633027,0.050000925],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971861,0.0017021593,0.000065882436,0.0001506842,0.00064455625,0.0002506026],"domain_scores_gemma":[0.9959831,0.0029678508,0.00010151252,0.00063893205,0.00022143911,0.00008715231],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021553277,0.00070067105,0.000578116,0.00091190793,0.0021908279,0.0023329218,0.001887132,0.0028217286,0.010111228],"category_scores_gemma":[0.0076976717,0.00034784584,0.001271891,0.001205824,0.0025699842,0.0029688978,0.0022896654,0.0029530704,0.0013603651],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024332083,0.0007926242,0.0006626439,0.00020018424,0.000023329023,0.0036384137,0.0017898835,0.01895103,0.0021862108,0.91496295,0.011686247,0.04486322],"study_design_scores_gemma":[0.0002483758,0.00053596246,0.0008901417,0.00017791786,0.00011535511,0.004209569,0.0045962525,0.091742866,0.011342972,0.7347636,0.15130739,0.00006955254],"about_ca_topic_score_codex":0.0032333988,"about_ca_topic_score_gemma":0.0039858124,"teacher_disagreement_score":0.010111228,"about_ca_system_score_codex":0.0012698137,"about_ca_system_score_gemma":0.000969309,"threshold_uncertainty_score":0.033825457},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037989005,0.00014985124,0.9511547,0.00010543252,0.00011661016,0.0002499719,0.00021448277,0.0036075271,0.006412385],"genre_scores_gemma":[0.7052403,0.00025261161,0.28894055,0.0001176262,0.000041280837,0.00036261533,0.0005891322,0.0005303485,0.0039255037],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99583095,0.0017017219,0.00022077863,0.00028500723,0.0015678448,0.00039374264],"domain_scores_gemma":[0.99424994,0.0035182366,0.00032390884,0.00090284034,0.00095762487,0.000047404486],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003403415,0.0007438666,0.00045784807,0.00090276956,0.00055192737,0.0014007337,0.0010040815,0.0008979967,0.0041955267],"category_scores_gemma":[0.0091194045,0.00040939508,0.001040492,0.0002955009,0.0016501672,0.0011920212,0.00067449966,0.0010126164,0.0008501354],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009031408,0.00028651423,0.0024562394,0.0013415422,0.0001599141,0.0007683021,0.0009564365,0.29626632,0.0925695,0.430123,0.0056188074,0.16855025],"study_design_scores_gemma":[0.00024407484,0.00039085338,0.00093290897,0.00030184176,0.00016143658,0.0002478237,0.00009321054,0.69404423,0.17335193,0.09740476,0.03274511,0.00008184672],"about_ca_topic_score_codex":0.006512422,"about_ca_topic_score_gemma":0.0045736493,"teacher_disagreement_score":0.006512422,"about_ca_system_score_codex":0.0010730742,"about_ca_system_score_gemma":0.0032986298,"threshold_uncertainty_score":0.017999172},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011694544,0.00030026786,0.97575164,0.00020171162,0.00007009185,0.00014597464,0.00013184892,0.001798493,0.0099053765],"genre_scores_gemma":[0.20167547,0.00033103244,0.78693503,0.00014928417,0.00004584721,0.00031718105,0.00073915854,0.00073229655,0.009074771],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99926263,0.00022508657,0.0000426145,0.00013196516,0.00019750482,0.00014017308],"domain_scores_gemma":[0.99919385,0.00047456648,0.000031037107,0.00017552757,0.00009799104,0.000026989357],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008153582,0.0009727682,0.0007835623,0.00078350626,0.0011310471,0.0008976049,0.0014487747,0.00083620544,0.013150386],"category_scores_gemma":[0.0025723553,0.00072254473,0.0010812028,0.0010219865,0.0011403587,0.0025229428,0.001999394,0.0018129685,0.0020873107],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043696983,0.00019615528,0.0005307113,0.00089288526,0.000060830425,0.00018485448,0.00075047556,0.098991916,0.020671193,0.27497584,0.014405553,0.5879027],"study_design_scores_gemma":[0.00014779407,0.00015832871,0.00031436534,0.00016696008,0.000089193,0.00018999081,0.00027314096,0.38180333,0.021132702,0.5651138,0.030568352,0.000042071042],"about_ca_topic_score_codex":0.0038956774,"about_ca_topic_score_gemma":0.006096719,"teacher_disagreement_score":0.013150386,"about_ca_system_score_codex":0.0011515833,"about_ca_system_score_gemma":0.00125514,"threshold_uncertainty_score":0.04399246},"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":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5711381,0.0011819863,0.4072203,0.0031004031,0.000082107035,0.00049018185,0.00014150287,0.0018385563,0.014806909],"genre_scores_gemma":[0.869045,0.0005206085,0.12697983,0.00016404781,0.000027465232,0.00015719766,0.00009618312,0.00025130535,0.0027584576],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98811054,0.006368101,0.0004664697,0.00057947583,0.003754044,0.0007213774],"domain_scores_gemma":[0.96295077,0.030904872,0.0010734681,0.0034346688,0.0013216935,0.00031454198],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011723191,0.0008448424,0.00089716667,0.0009866359,0.002251121,0.0024948248,0.001764595,0.003418481,0.0013935706],"category_scores_gemma":[0.027331242,0.00074970716,0.0011786395,0.001577957,0.004971195,0.0048032883,0.0024559163,0.0035479714,0.00015787447],"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.0014389039,0.0012605443,0.014369054,0.001187444,0.00032467756,0.01326329,0.012013335,0.41593924,0.033017416,0.37922817,0.004323685,0.12363416],"study_design_scores_gemma":[0.00039886878,0.00072260667,0.0015644263,0.00019929264,0.00024945813,0.0032813586,0.00228353,0.83032405,0.06184304,0.081562534,0.017460225,0.00011066757],"about_ca_topic_score_codex":0.011474231,"about_ca_topic_score_gemma":0.010632333,"teacher_disagreement_score":0.011723191,"about_ca_system_score_codex":0.0015294336,"about_ca_system_score_gemma":0.0025306067,"threshold_uncertainty_score":0.061998904},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.051665585,0.000548334,0.88784987,0.0025082426,0.000545622,0.00018860096,0.00038579528,0.006014084,0.050293807],"genre_scores_gemma":[0.7141605,0.0007580229,0.26225588,0.0006029378,0.00015708675,0.00019320284,0.00060076,0.0017237334,0.019547822],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998582,0.00043634442,0.000090581605,0.00027420346,0.000411927,0.00020503115],"domain_scores_gemma":[0.9882081,0.009641064,0.00036672494,0.0012152911,0.00045607676,0.00011264548],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017584062,0.0012892061,0.0007310675,0.0023383063,0.0013645906,0.00272211,0.0015774184,0.0025548064,0.022678778],"category_scores_gemma":[0.015221023,0.0009616439,0.0018350903,0.001494007,0.003107476,0.008268015,0.0029538933,0.0031779471,0.0015924672],"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.0001487157,0.00006671904,0.0010800705,0.00022331387,0.00003136691,0.0009811905,0.0009033084,0.0134006785,0.0027761504,0.9345152,0.0049159047,0.04095737],"study_design_scores_gemma":[0.00003926683,0.000026677786,0.00023297522,0.0001109761,0.0000660875,0.00053083274,0.00024243061,0.07656246,0.0076284115,0.89313275,0.021384887,0.000042129974],"about_ca_topic_score_codex":0.0016029151,"about_ca_topic_score_gemma":0.0016592512,"teacher_disagreement_score":0.022678778,"about_ca_system_score_codex":0.00086327054,"about_ca_system_score_gemma":0.0009100396,"threshold_uncertainty_score":0.07586801},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0077148355,0.000043112166,0.99034154,0.000044381417,0.0000073612728,0.000052516338,0.000025964888,0.00068705267,0.0010831428],"genre_scores_gemma":[0.29107717,0.00020593689,0.7066658,0.00006584449,0.000021177399,0.00020529254,0.00020175466,0.00017562114,0.0013813706],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981499,0.0008243245,0.00012223009,0.00018317683,0.00061367004,0.00010682634],"domain_scores_gemma":[0.99636877,0.002482196,0.00025943053,0.0006384575,0.00021397439,0.000037287788],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021041208,0.0009216053,0.00032578537,0.00061822153,0.00056439143,0.0010327371,0.0011090925,0.0006120694,0.0047434145],"category_scores_gemma":[0.005119127,0.0006492532,0.000977823,0.00022295522,0.0017411828,0.001200444,0.0012512226,0.0011918803,0.0005818357],"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.00039475033,0.00017864858,0.0029095535,0.0010600114,0.00016338425,0.00062703417,0.0009525753,0.36860338,0.11391783,0.2962899,0.0012061368,0.21369675],"study_design_scores_gemma":[0.00018431831,0.0004843306,0.00047671987,0.00019207918,0.000101838006,0.0005191784,0.0003069632,0.73974437,0.107825115,0.13147764,0.018641738,0.000045672215],"about_ca_topic_score_codex":0.00087115314,"about_ca_topic_score_gemma":0.0015046591,"teacher_disagreement_score":0.0047434145,"about_ca_system_score_codex":0.00074179214,"about_ca_system_score_gemma":0.0012777932,"threshold_uncertainty_score":0.015868366},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01736294,0.00050903583,0.86166555,0.0010350023,0.00019189689,0.0001539189,0.0001749055,0.001120779,0.11778592],"genre_scores_gemma":[0.47359842,0.00088738103,0.4709697,0.00042311152,0.00027411297,0.000538443,0.00076620345,0.0008497895,0.051692773],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99725384,0.0008458543,0.00024086461,0.00055543386,0.00087040133,0.0002335885],"domain_scores_gemma":[0.9966331,0.0013652225,0.00014167091,0.0013588784,0.0004061032,0.00009514836],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019154898,0.0007779989,0.0007321129,0.0013964004,0.0017449097,0.0039941687,0.0014935752,0.0013027367,0.015620352],"category_scores_gemma":[0.0069486406,0.0010786441,0.0015187019,0.0018468492,0.0048372974,0.011068788,0.0035409671,0.003190611,0.0031810408],"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.000014571933,0.000008748126,0.000055758002,0.000035642333,0.0000056690237,0.00003440823,0.00035038806,0.0004777438,0.000489288,0.9843485,0.0009064922,0.013272883],"study_design_scores_gemma":[0.000008607267,0.0000047695676,0.000025665326,0.000015114336,0.000008738068,0.000041165662,0.00007124119,0.0026320359,0.00077799795,0.9867035,0.009707073,0.0000039443144],"about_ca_topic_score_codex":0.0008157778,"about_ca_topic_score_gemma":0.0009415644,"teacher_disagreement_score":0.015620352,"about_ca_system_score_codex":0.0010324749,"about_ca_system_score_gemma":0.00082145754,"threshold_uncertainty_score":0.052255273},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02244904,0.0010661775,0.97341806,0.0003245407,0.00008432605,0.000054572763,0.00018911688,0.00014455608,0.0022695896],"genre_scores_gemma":[0.653842,0.0012779243,0.34134793,0.00019259218,0.00024554814,0.00044699048,0.0006831412,0.00015842202,0.0018054795],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.992187,0.0030982073,0.00090776244,0.0012037351,0.002265163,0.00033804396],"domain_scores_gemma":[0.9739891,0.015611566,0.0042322613,0.0020810894,0.0026714364,0.0014144848],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005204448,0.0014053676,0.001168375,0.0034614264,0.0010401203,0.002972314,0.0014544867,0.0016368484,0.0016746569],"category_scores_gemma":[0.036094226,0.00053797255,0.0011262568,0.0027313111,0.0030460896,0.0071292985,0.00325353,0.0026569471,0.00030867927],"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.00007003912,0.0000395678,0.00161687,0.00017135702,0.00007625548,0.00011417342,0.00027825078,0.119258344,0.0018571249,0.8453732,0.00071254926,0.030432206],"study_design_scores_gemma":[0.00000844938,0.000098401295,0.0005742005,0.000042402342,0.000017560882,0.000094420204,0.000048404127,0.3129175,0.0009841823,0.68180555,0.0033668296,0.000042046853],"about_ca_topic_score_codex":0.0013739811,"about_ca_topic_score_gemma":0.0007720315,"teacher_disagreement_score":0.005204448,"about_ca_system_score_codex":0.002608646,"about_ca_system_score_gemma":0.0012394701,"threshold_uncertainty_score":0.027524114},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18265502,0.00015034352,0.81080055,0.00051367417,0.000021150508,0.00028149705,0.00009196197,0.000829361,0.004656521],"genre_scores_gemma":[0.7093844,0.00019088804,0.28724965,0.00008750992,0.000016093994,0.00031743813,0.00015568035,0.00017845759,0.0024199174],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.993604,0.0033928335,0.0003288662,0.00045128158,0.0018061786,0.0004169022],"domain_scores_gemma":[0.9770542,0.01855616,0.00083052996,0.0016906752,0.0016417925,0.00022660042],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0075931353,0.0006217412,0.00052377145,0.00080253126,0.0011983732,0.0016184301,0.0013331178,0.0016956902,0.002075024],"category_scores_gemma":[0.01802723,0.0004535029,0.000955026,0.0007074367,0.0029415959,0.0026912251,0.001962274,0.002356699,0.0002623949],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00065981783,0.00075550325,0.0050025666,0.00059879816,0.00012573463,0.002894159,0.004474862,0.3939532,0.02691947,0.49011183,0.001118442,0.073385574],"study_design_scores_gemma":[0.00010409366,0.00018276274,0.00030103183,0.000049848706,0.000038674694,0.0003221218,0.00043333083,0.90932417,0.030102998,0.053689454,0.005420811,0.0000307899],"about_ca_topic_score_codex":0.0035262858,"about_ca_topic_score_gemma":0.0026591658,"teacher_disagreement_score":0.0075931353,"about_ca_system_score_codex":0.0021391658,"about_ca_system_score_gemma":0.0016377136,"threshold_uncertainty_score":0.04015684},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0025853864,0.028396918,0.8681452,0.033859503,0.001006188,0.0000811822,0.00006770425,0.00077900215,0.065078944],"genre_scores_gemma":[0.3113889,0.053249143,0.5829815,0.0086434195,0.002775118,0.00068991573,0.00026035457,0.000609088,0.039402526],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99512804,0.0027519315,0.0002697791,0.0004478402,0.0011873642,0.00021501814],"domain_scores_gemma":[0.9919071,0.006294497,0.0003692183,0.0006684523,0.0004901146,0.00027069208],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008913649,0.00093074027,0.00075803156,0.0014648534,0.0019293287,0.0060844156,0.0019654946,0.0034235937,0.0057068868],"category_scores_gemma":[0.013568964,0.00058853393,0.000808834,0.001172946,0.014658268,0.012352099,0.0025991707,0.006626263,0.0018729629],"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.000009982929,0.000015563543,0.000058904367,0.00010956562,0.000004075564,0.00002974599,0.0005793338,0.0010998391,0.00018241415,0.97311413,0.003732174,0.021064296],"study_design_scores_gemma":[0.000017936904,0.000017364264,0.000038532606,0.00021466608,0.000005005737,0.00006479311,0.00017044372,0.0030184097,0.00040627483,0.89914054,0.09688927,0.00001679446],"about_ca_topic_score_codex":0.0028346651,"about_ca_topic_score_gemma":0.0016139662,"teacher_disagreement_score":0.008913649,"about_ca_system_score_codex":0.0035362744,"about_ca_system_score_gemma":0.004027125,"threshold_uncertainty_score":0.04714048},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028765819,0.00010067914,0.9679949,0.0000974616,0.000063041014,0.00011743686,0.00034464197,0.026533475,0.0018716758],"genre_scores_gemma":[0.15805407,0.00041559312,0.82554317,0.00046859263,0.0000901449,0.0009903742,0.0028466028,0.006510351,0.0050811847],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974413,0.000711931,0.00018613516,0.00024421499,0.001269352,0.00014712937],"domain_scores_gemma":[0.997021,0.0016098039,0.00020641598,0.0006703043,0.00044622473,0.000046180652],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018713519,0.0015049508,0.00069405645,0.0016730416,0.00049545284,0.001049636,0.0021932402,0.00086759526,0.008910558],"category_scores_gemma":[0.0050675394,0.0010348901,0.0015579951,0.00070723076,0.0010462627,0.0023590422,0.0021429353,0.0025958242,0.0036284868],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012144152,0.00047997854,0.00251333,0.0020447955,0.00027948534,0.0010904011,0.00046632293,0.09921883,0.11095558,0.14475235,0.061757065,0.5752275],"study_design_scores_gemma":[0.00032148126,0.00047135726,0.0004657063,0.00020203168,0.0001182183,0.0012597668,0.00008725063,0.6288943,0.14622612,0.12927374,0.09256906,0.00011086291],"about_ca_topic_score_codex":0.0009208605,"about_ca_topic_score_gemma":0.0012125652,"teacher_disagreement_score":0.008910558,"about_ca_system_score_codex":0.0005730199,"about_ca_system_score_gemma":0.001354799,"threshold_uncertainty_score":0.02980882},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0025241438,0.000051385538,0.99631727,0.00003062246,0.000006514951,0.000026155065,0.000044716195,0.0003492254,0.00064998143],"genre_scores_gemma":[0.12042108,0.00035821417,0.87785935,0.000055123426,0.00002394337,0.00013736395,0.00019610835,0.000156795,0.00079198566],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99744225,0.0007100491,0.00016491086,0.00035814632,0.0011365565,0.00018801811],"domain_scores_gemma":[0.9963722,0.002286412,0.00043791148,0.00049583433,0.000352319,0.00005527461],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023651258,0.0009365197,0.0006936398,0.0010656274,0.00050867675,0.0020491604,0.0020023382,0.00074320444,0.0031013342],"category_scores_gemma":[0.0064407717,0.0005242854,0.0014211796,0.0012522712,0.0010970926,0.002765771,0.00091438973,0.0015553738,0.0005099178],"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.00016808794,0.000083281804,0.0009088694,0.00060777616,0.00013648365,0.00047521858,0.00023113457,0.49338612,0.036521025,0.3259661,0.0015298248,0.13998604],"study_design_scores_gemma":[0.000045086705,0.00008295855,0.00019847971,0.000058985563,0.000056619607,0.00016233017,0.000029980078,0.8985447,0.02440807,0.069710836,0.0066621853,0.000039791154],"about_ca_topic_score_codex":0.0034226552,"about_ca_topic_score_gemma":0.0036682787,"teacher_disagreement_score":0.0034226552,"about_ca_system_score_codex":0.0009309696,"about_ca_system_score_gemma":0.0018500799,"threshold_uncertainty_score":0.012508154},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.78938794,0.0005241941,0.18427366,0.0053096046,0.000076663106,0.00063164963,0.000297423,0.0010409694,0.01845778],"genre_scores_gemma":[0.916434,0.00019069598,0.08156408,0.000156279,0.00001835943,0.00021675082,0.00015468693,0.0001060963,0.0011591307],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.97820014,0.014577868,0.0007308643,0.00095490454,0.0046094134,0.00092685595],"domain_scores_gemma":[0.842523,0.14150302,0.002717878,0.008085774,0.0044687544,0.0007015465],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.017447053,0.00086907047,0.00061776297,0.0014285375,0.0022387241,0.0016916799,0.0022516577,0.004347746,0.0029529708],"category_scores_gemma":[0.07737719,0.0009645803,0.001591138,0.0012526988,0.003120824,0.004025245,0.0024860164,0.0027088095,0.00036610183],"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.00399928,0.003596955,0.05336324,0.0023360453,0.0003618757,0.04316806,0.023886222,0.31888267,0.045439493,0.24737956,0.011163729,0.24642284],"study_design_scores_gemma":[0.0011991977,0.002824455,0.0069410093,0.00059064414,0.00030895197,0.011769629,0.008286372,0.77996725,0.077123895,0.07525325,0.035513896,0.00022146104],"about_ca_topic_score_codex":0.006623473,"about_ca_topic_score_gemma":0.008763811,"teacher_disagreement_score":0.017447053,"about_ca_system_score_codex":0.0023284536,"about_ca_system_score_gemma":0.0027328455,"threshold_uncertainty_score":0.09226996},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042992875,0.0013467632,0.91352415,0.0007292447,0.00023078316,0.0003128147,0.0006746762,0.006544976,0.033643764],"genre_scores_gemma":[0.42512286,0.00064996094,0.5402473,0.0005677241,0.00022652757,0.0007793048,0.0019015532,0.0019392227,0.028565446],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99837035,0.0005355431,0.000068959474,0.00026508057,0.0005628199,0.00019727145],"domain_scores_gemma":[0.99664426,0.0021751132,0.00009253262,0.0007084652,0.00029333448,0.000086259424],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015766256,0.0009772838,0.0020848538,0.0018517985,0.00092181476,0.0013799927,0.003504729,0.0013157437,0.027725482],"category_scores_gemma":[0.0071946355,0.0006872614,0.0015871819,0.0024137683,0.0015582569,0.0031503758,0.0034202116,0.003070371,0.003255428],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013870191,0.00048873195,0.0006892771,0.0011079434,0.00014569775,0.00019469664,0.00034508453,0.22370654,0.01393164,0.23013216,0.03199401,0.4958772],"study_design_scores_gemma":[0.00025864798,0.00014896155,0.0002500999,0.00007119586,0.000093376315,0.00007874886,0.00006277765,0.8010999,0.004710548,0.18623659,0.0069544287,0.000034686116],"about_ca_topic_score_codex":0.0032196091,"about_ca_topic_score_gemma":0.007126721,"teacher_disagreement_score":0.027725482,"about_ca_system_score_codex":0.0021647525,"about_ca_system_score_gemma":0.001565367,"threshold_uncertainty_score":0.092751026},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028853372,0.0003652178,0.98577094,0.00035469272,0.00010502846,0.0000239282,0.00010557838,0.00023310317,0.010156347],"genre_scores_gemma":[0.4798433,0.00203707,0.48834097,0.0005621919,0.00080316095,0.00036611492,0.00063041813,0.000514161,0.026902677],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979013,0.00063099194,0.00015259409,0.00038422336,0.000779437,0.0001513995],"domain_scores_gemma":[0.99543154,0.0031685256,0.0002362834,0.00048650615,0.00052060117,0.00015659003],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025787998,0.00081123953,0.00070673955,0.0013037197,0.0005424349,0.0028017436,0.0017586398,0.0009885705,0.009663095],"category_scores_gemma":[0.00796866,0.0006300375,0.0013859412,0.0010600312,0.0033113144,0.0043429304,0.0018965104,0.0037409447,0.0012503178],"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.00000685362,0.000008377218,0.00003560846,0.000036254023,0.000004830925,0.000027432447,0.00007049003,0.0040229904,0.0003852993,0.98798615,0.0005720061,0.006843755],"study_design_scores_gemma":[0.0000143225325,0.000015494092,0.00007361013,0.000035263634,0.000009382167,0.00009472311,0.00002502083,0.048345726,0.0009849203,0.9402041,0.010185466,0.000011983827],"about_ca_topic_score_codex":0.000935602,"about_ca_topic_score_gemma":0.0006583874,"teacher_disagreement_score":0.009663095,"about_ca_system_score_codex":0.0017338878,"about_ca_system_score_gemma":0.0011659553,"threshold_uncertainty_score":0.03232628},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018819501,0.00006513115,0.91668165,0.0001526111,0.00036431177,0.0001300155,0.0011516017,0.0660345,0.013538214],"genre_scores_gemma":[0.12410079,0.00079761125,0.70423406,0.0007371315,0.00029548793,0.0011188162,0.007199021,0.059482083,0.102035046],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991947,0.00016483659,0.00007793536,0.0001791275,0.00030986578,0.00007364324],"domain_scores_gemma":[0.9988508,0.00051215827,0.000059472448,0.0002933647,0.00023464608,0.000049477494],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010635407,0.0012080877,0.0006865178,0.0010097005,0.0005158259,0.0020910932,0.0012924605,0.0009920539,0.04232607],"category_scores_gemma":[0.0031543467,0.0010295213,0.0012730677,0.0007377597,0.0009886831,0.0029679097,0.0022910926,0.0019704623,0.018260842],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006610695,0.00024686195,0.00056644547,0.001325996,0.00010876117,0.0008264244,0.0016764511,0.011250037,0.05038255,0.25730675,0.17163453,0.5040141],"study_design_scores_gemma":[0.00023585303,0.00018296503,0.00032169998,0.00033126233,0.00017331884,0.0007054122,0.00021139995,0.07670194,0.12380866,0.14246917,0.654733,0.00012528402],"about_ca_topic_score_codex":0.0005716654,"about_ca_topic_score_gemma":0.00076428184,"teacher_disagreement_score":0.04232607,"about_ca_system_score_codex":0.00051968516,"about_ca_system_score_gemma":0.0010421785,"threshold_uncertainty_score":0.14159477},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2802086,0.0015471515,0.6492897,0.00039138805,0.00023653418,0.00014995062,0.00045064645,0.0007035692,0.067022465],"genre_scores_gemma":[0.9414735,0.0006287332,0.045602426,0.00006952344,0.00021623044,0.00011924172,0.00022787011,0.000120374934,0.011542012],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99916005,0.0001857988,0.000076965596,0.0002046564,0.0002715796,0.0001009453],"domain_scores_gemma":[0.9969103,0.0017836178,0.00040418355,0.0004131502,0.000340481,0.00014835174],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014912303,0.00030713223,0.00036100848,0.00090113713,0.0006415604,0.0018906728,0.0007860209,0.00040347787,0.0028365124],"category_scores_gemma":[0.0031999866,0.00043046783,0.00064848544,0.0006750321,0.0018524677,0.0038288312,0.00061213353,0.0009532466,0.00029685008],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000080156555,0.000017198872,0.00016929572,0.000055931352,0.0000105609415,0.00009926618,0.0002720655,0.0029442047,0.004919369,0.9847248,0.00034352718,0.0063634897],"study_design_scores_gemma":[0.00005386624,0.00008103333,0.0004722055,0.000024478431,0.000041881794,0.00026425262,0.000120126344,0.024988081,0.010871676,0.9529659,0.010094601,0.00002205431],"about_ca_topic_score_codex":0.00045946465,"about_ca_topic_score_gemma":0.00036822035,"teacher_disagreement_score":0.0028365124,"about_ca_system_score_codex":0.0007534196,"about_ca_system_score_gemma":0.00040966764,"threshold_uncertainty_score":0.009489119},"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":"commentary","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023036385,0.09219302,0.25032142,0.42056644,0.023267549,0.00095977506,0.0012118417,0.00512288,0.18332073],"genre_scores_gemma":[0.27156696,0.06621115,0.35061124,0.10446646,0.013387729,0.0020344602,0.0023560033,0.008438697,0.18092732],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98128617,0.008458948,0.0019411304,0.0016191375,0.0057471986,0.00094747427],"domain_scores_gemma":[0.8927252,0.046540823,0.0069992393,0.010510519,0.037517734,0.0057064705],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.034004655,0.0011918157,0.0016290809,0.0033713356,0.002074701,0.009301563,0.0023727606,0.0034545755,0.015834553],"category_scores_gemma":[0.14048229,0.0011042425,0.0011266082,0.0015976279,0.004021632,0.022647357,0.0049328897,0.003821698,0.0083092805],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016685485,0.00018756311,0.005105223,0.0036147237,0.00033366276,0.00045042433,0.0052923453,0.0010332266,0.0035297077,0.14642961,0.43580073,0.398056],"study_design_scores_gemma":[0.000055341352,0.0001194137,0.0034589325,0.0045414544,0.0003114794,0.0009314395,0.0037160525,0.00091686414,0.002528586,0.19376849,0.78954905,0.000102980324],"about_ca_topic_score_codex":0.0019211456,"about_ca_topic_score_gemma":0.0035779118,"teacher_disagreement_score":0.034004655,"about_ca_system_score_codex":0.0024428733,"about_ca_system_score_gemma":0.0076355194,"threshold_uncertainty_score":0.17983598},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030188244,0.000057350077,0.9912732,0.00020536696,0.000038748643,0.00016188454,0.00004128597,0.0012894154,0.0039139],"genre_scores_gemma":[0.097293586,0.00012530385,0.8924142,0.00033648434,0.000035022003,0.00045239253,0.00016023319,0.0003077933,0.008875067],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99290305,0.0024105622,0.0003959483,0.0011792874,0.0027078935,0.00040325685],"domain_scores_gemma":[0.9925506,0.0034556335,0.00030897174,0.0025160525,0.0009666752,0.00020210563],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039404626,0.0017479014,0.00095886266,0.001667957,0.001077803,0.002434932,0.0048347,0.0029719437,0.006753691],"category_scores_gemma":[0.007991249,0.0011189987,0.0016681071,0.0011196448,0.003951177,0.0067111542,0.0039571077,0.0038557407,0.0020334425],"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.0003283382,0.0007602753,0.0018997459,0.000700137,0.00020487086,0.00077176525,0.0014275004,0.032589342,0.053863555,0.5429885,0.008890762,0.35557526],"study_design_scores_gemma":[0.00019003394,0.00066705834,0.00063961913,0.00019432518,0.0003560064,0.0017310166,0.0005681086,0.34419864,0.08329937,0.51836294,0.049662303,0.00013069401],"about_ca_topic_score_codex":0.0019411978,"about_ca_topic_score_gemma":0.0025201892,"teacher_disagreement_score":0.006753691,"about_ca_system_score_codex":0.0011821003,"about_ca_system_score_gemma":0.0023976353,"threshold_uncertainty_score":0.02259332},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011003683,0.00006688879,0.9862228,0.00010085516,0.000023198543,0.000066192595,0.0000501581,0.0006673288,0.0017988073],"genre_scores_gemma":[0.48095837,0.00044518418,0.514419,0.00016728496,0.00006282251,0.00038591685,0.0002532311,0.00038141318,0.0029267413],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99625945,0.0010539985,0.00031635968,0.000512036,0.001502922,0.0003551894],"domain_scores_gemma":[0.99117017,0.0063695726,0.00047858595,0.0012949967,0.00061913754,0.00006757774],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034791513,0.0007766907,0.0005020129,0.0007086216,0.0006848573,0.0013564593,0.0022265965,0.0008795664,0.0025061734],"category_scores_gemma":[0.012162766,0.0006831816,0.001374796,0.00043353913,0.003485615,0.004275228,0.0018772449,0.0025668996,0.00040605853],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016656372,0.00011938664,0.00083517766,0.000481314,0.00007190237,0.00049385265,0.00072862307,0.13111949,0.040739875,0.73883396,0.0013352251,0.08507466],"study_design_scores_gemma":[0.00010872315,0.00014414759,0.0003468612,0.00012022143,0.000107243744,0.00040431088,0.00011126303,0.39394087,0.09592859,0.4953454,0.013373361,0.00006901327],"about_ca_topic_score_codex":0.001281695,"about_ca_topic_score_gemma":0.0012928926,"teacher_disagreement_score":0.0034791513,"about_ca_system_score_codex":0.0011274823,"about_ca_system_score_gemma":0.0015570668,"threshold_uncertainty_score":0.018399715},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009696891,0.00017072214,0.9868786,0.00008056034,0.000035090114,0.00004333108,0.00013597235,0.0010825366,0.0018762914],"genre_scores_gemma":[0.5743165,0.00061144494,0.4200669,0.00016960943,0.000075022435,0.00030763185,0.00068948965,0.00034893982,0.0034145121],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99745315,0.0007327994,0.00021795768,0.00037973872,0.0010480428,0.00016827886],"domain_scores_gemma":[0.9950547,0.0031260299,0.00032492378,0.0008857075,0.00053542986,0.00007320025],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026931264,0.0006609468,0.00071309437,0.0008894899,0.0004686489,0.0011640043,0.0012515504,0.00064422726,0.0021431942],"category_scores_gemma":[0.006574749,0.00046465133,0.0017962131,0.00055656105,0.0021214494,0.0016395679,0.0018786873,0.0010129107,0.00037860379],"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.0003281306,0.00007482384,0.0024969468,0.0006984975,0.00016138275,0.0010770928,0.00047633826,0.34048808,0.04156127,0.5421274,0.0015386788,0.068971425],"study_design_scores_gemma":[0.000054316813,0.0000787473,0.00028852542,0.0000850881,0.000045382138,0.00026854058,0.00003807582,0.85998875,0.024746612,0.10276104,0.011619057,0.000025836369],"about_ca_topic_score_codex":0.0025106787,"about_ca_topic_score_gemma":0.0015256339,"teacher_disagreement_score":0.0026931264,"about_ca_system_score_codex":0.0009148825,"about_ca_system_score_gemma":0.0011696077,"threshold_uncertainty_score":0.014242828},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07460313,0.014459956,0.5902364,0.14529732,0.010028172,0.0007821065,0.0153025,0.015648842,0.13364154],"genre_scores_gemma":[0.53319216,0.005184337,0.3872071,0.016302612,0.004246695,0.00077080674,0.020902561,0.0044406173,0.027753187],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99333984,0.0026378215,0.00025944452,0.0014817496,0.0018076496,0.00047354322],"domain_scores_gemma":[0.9685971,0.023016838,0.0005969106,0.0049328813,0.0018794595,0.0009767985],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005603467,0.00134448,0.0017601028,0.0008638992,0.0017452751,0.0054556252,0.004856703,0.004953271,0.026534023],"category_scores_gemma":[0.03761911,0.0009907009,0.0018084061,0.0020434153,0.0034373165,0.0062355357,0.00547053,0.0098663,0.0063430555],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005533268,0.00023200201,0.0010159442,0.0015098,0.00016320882,0.0004416153,0.00029559544,0.054273736,0.002256016,0.42794523,0.35920647,0.15210696],"study_design_scores_gemma":[0.00028349427,0.00007276817,0.00047615496,0.00028471992,0.00005611148,0.00029478926,0.00018050463,0.13912101,0.0036390615,0.7649072,0.09062708,0.000057038935],"about_ca_topic_score_codex":0.0050195376,"about_ca_topic_score_gemma":0.008124997,"teacher_disagreement_score":0.026534023,"about_ca_system_score_codex":0.0027184698,"about_ca_system_score_gemma":0.006386487,"threshold_uncertainty_score":0.088765144},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00076661067,0.000024935684,0.9945372,0.00002934518,0.000031013788,0.00004241553,0.00003417088,0.0034050893,0.0011292922],"genre_scores_gemma":[0.046660077,0.000059541147,0.94644064,0.00010194187,0.000023695491,0.00019267762,0.0002763124,0.0018816553,0.004363436],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978551,0.00051569723,0.00015350082,0.00046883375,0.000765549,0.00024131114],"domain_scores_gemma":[0.9976077,0.0010813534,0.00009823808,0.00073530275,0.00040242518,0.00007492699],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022422075,0.0015850088,0.0012886126,0.0017517821,0.0013756859,0.0016980214,0.0035124295,0.0017530534,0.023519415],"category_scores_gemma":[0.006243602,0.0013213111,0.0022763514,0.001358678,0.0019339767,0.0037576729,0.0050577545,0.00325121,0.006001806],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00073096453,0.00016140867,0.0005921937,0.0005250114,0.00012130988,0.00016778197,0.00031624624,0.04516004,0.014984437,0.17570178,0.013669597,0.7478692],"study_design_scores_gemma":[0.0001812255,0.00018633186,0.0002598985,0.00013961749,0.000098983226,0.00023866462,0.000121074096,0.6607681,0.04049724,0.25605056,0.04137191,0.00008647974],"about_ca_topic_score_codex":0.001965722,"about_ca_topic_score_gemma":0.0028550497,"teacher_disagreement_score":0.023519415,"about_ca_system_score_codex":0.00093704887,"about_ca_system_score_gemma":0.0017628545,"threshold_uncertainty_score":0.07868034},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05028763,0.00017764738,0.9404581,0.000085373795,0.000024848081,0.00012322795,0.0003043726,0.003938223,0.004600514],"genre_scores_gemma":[0.34739557,0.00041519702,0.64349467,0.00009402447,0.0000137278885,0.0001799291,0.0009585504,0.0018995277,0.005548791],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982157,0.0004528261,0.00015933711,0.00018724558,0.0007561016,0.00022885735],"domain_scores_gemma":[0.9966775,0.0021527666,0.0002828502,0.0004612661,0.00038457653,0.000040934345],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017841052,0.00096134935,0.0005814717,0.0010714807,0.0007456871,0.0023617786,0.0014393965,0.0009656174,0.004068588],"category_scores_gemma":[0.004741704,0.0011110986,0.0017476636,0.0011788611,0.0018147064,0.0027596832,0.0015411371,0.0013095895,0.0009339027],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004558445,0.00017590416,0.006332934,0.0017201997,0.00018085008,0.0015624315,0.0035781863,0.33445477,0.07594323,0.38164923,0.0029756972,0.1909707],"study_design_scores_gemma":[0.00007279598,0.0001252874,0.00079295394,0.00019533117,0.00015402562,0.0005882946,0.0009035222,0.7183545,0.089364745,0.17165485,0.017701367,0.0000923313],"about_ca_topic_score_codex":0.0050706947,"about_ca_topic_score_gemma":0.008800758,"teacher_disagreement_score":0.0050706947,"about_ca_system_score_codex":0.000904595,"about_ca_system_score_gemma":0.0013423043,"threshold_uncertainty_score":0.01361078},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019838473,0.00010129394,0.97358096,0.00026662266,0.000037918413,0.00007441688,0.00013853665,0.0025089185,0.0034527497],"genre_scores_gemma":[0.6758862,0.00024132799,0.31848824,0.00018359211,0.000044542907,0.00041275268,0.0005352084,0.00047652744,0.003731494],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99332315,0.0025702696,0.0003307567,0.0006797485,0.0025325108,0.0005635651],"domain_scores_gemma":[0.9848498,0.0110915685,0.000979955,0.0020468812,0.0008674752,0.00016431772],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035595652,0.00094270264,0.0013438194,0.0013211664,0.0011619964,0.0030552142,0.0025806513,0.0013785331,0.004745407],"category_scores_gemma":[0.018251603,0.0007740816,0.0018124614,0.0011915234,0.0034907963,0.004437075,0.0037387153,0.002587615,0.0006455816],"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.00026129044,0.000101699006,0.0014117584,0.00034891005,0.00014996849,0.0004542736,0.00056140043,0.49392578,0.007848351,0.45599627,0.0016307463,0.037309628],"study_design_scores_gemma":[0.000062899235,0.000027373935,0.00006420351,0.000033005068,0.000032980464,0.000043699936,0.00004313397,0.84793603,0.0060461108,0.14347789,0.002217239,0.000015368483],"about_ca_topic_score_codex":0.0071879495,"about_ca_topic_score_gemma":0.0084061185,"teacher_disagreement_score":0.0071879495,"about_ca_system_score_codex":0.0026931302,"about_ca_system_score_gemma":0.0041489657,"threshold_uncertainty_score":0.019540131},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041050494,0.00041169638,0.9362182,0.00009420234,0.00014931872,0.00009227164,0.00014963718,0.002584229,0.01924984],"genre_scores_gemma":[0.8525431,0.00021841172,0.14089604,0.000067569556,0.000019761317,0.00009617418,0.0001619012,0.00020787615,0.0057891677],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997392,0.00004260743,0.000018486506,0.000049523245,0.00009478635,0.000055381955],"domain_scores_gemma":[0.9997311,0.00008961547,0.000033291217,0.00006996013,0.00006270037,0.000013365221],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031793438,0.00057520735,0.00051862915,0.00050188013,0.00032359533,0.00072992296,0.00088572217,0.00051073066,0.0059802844],"category_scores_gemma":[0.0006796638,0.00028979313,0.00045590068,0.00027980172,0.0004024841,0.0006099749,0.00086507463,0.00055715314,0.0009569086],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00075695413,0.00014474793,0.0005192947,0.00079291494,0.0000755239,0.00035770715,0.0003894417,0.41465548,0.17456901,0.18826713,0.003475029,0.21599682],"study_design_scores_gemma":[0.000100681624,0.00034929538,0.0002588537,0.00007689887,0.00009151347,0.00018568903,0.000056941568,0.8158348,0.1076593,0.05969445,0.015649777,0.000041771968],"about_ca_topic_score_codex":0.0010820306,"about_ca_topic_score_gemma":0.0019368541,"teacher_disagreement_score":0.0059802844,"about_ca_system_score_codex":0.0005134903,"about_ca_system_score_gemma":0.0006056859,"threshold_uncertainty_score":0.02000606},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00066295813,0.00023691966,0.99179924,0.00028372207,0.00009940347,0.00012575931,0.0006258089,0.0033262037,0.0028400754],"genre_scores_gemma":[0.03796858,0.0019378726,0.9438388,0.0006367348,0.00020617964,0.0012066907,0.0043248897,0.0019141525,0.0079660285],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982822,0.000543041,0.00021150788,0.00018814107,0.0006721681,0.000103058],"domain_scores_gemma":[0.99751544,0.0013620914,0.0002693399,0.00034192586,0.00038433162,0.00012686489],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025160222,0.0010844346,0.0006205909,0.0013010745,0.0006155948,0.0025452382,0.0017280853,0.0013288612,0.008135025],"category_scores_gemma":[0.0056462977,0.0009884655,0.0013583143,0.0013592953,0.0014809578,0.0040396582,0.0016054101,0.002824005,0.002133584],"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.0001187313,0.0000796407,0.0005358733,0.00093392696,0.00007824501,0.0005055586,0.0009346153,0.02970098,0.012633826,0.7744378,0.046078525,0.13396223],"study_design_scores_gemma":[0.00012727789,0.000115509814,0.00033427984,0.0003864993,0.00006637157,0.00062561856,0.00014024595,0.113291316,0.012583222,0.29183698,0.58038914,0.0001035207],"about_ca_topic_score_codex":0.0036025841,"about_ca_topic_score_gemma":0.0045468495,"teacher_disagreement_score":0.008135025,"about_ca_system_score_codex":0.0008901113,"about_ca_system_score_gemma":0.003142098,"threshold_uncertainty_score":0.027214348},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00019918059,0.00003844859,0.9948671,0.00011270663,0.00005475451,0.00009726098,0.00011759829,0.0027200198,0.0017928152],"genre_scores_gemma":[0.011637648,0.0002105577,0.9722197,0.00040203024,0.00005696181,0.00064020493,0.0010171881,0.002717895,0.011097845],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9950782,0.0013663657,0.0006588141,0.0008229971,0.0017480685,0.0003255816],"domain_scores_gemma":[0.9950919,0.0023861392,0.00022862403,0.001051059,0.0010542895,0.00018795845],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005830876,0.0015754034,0.0008486668,0.0025612144,0.001097663,0.0030622361,0.002878875,0.0020226827,0.026724193],"category_scores_gemma":[0.010780595,0.0014400814,0.0024879163,0.0012649911,0.002067008,0.0052421573,0.0033806635,0.0032751972,0.01386331],"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.00012333354,0.00012946485,0.000436014,0.00061501906,0.000072364084,0.000710523,0.0010517201,0.0057884534,0.014466642,0.6912779,0.03440929,0.25091922],"study_design_scores_gemma":[0.00013470383,0.00012926018,0.00016681281,0.0003108889,0.00008099896,0.0013373526,0.00021148802,0.07351519,0.034581255,0.1910126,0.6983281,0.00019137954],"about_ca_topic_score_codex":0.0028221954,"about_ca_topic_score_gemma":0.002684272,"teacher_disagreement_score":0.026724193,"about_ca_system_score_codex":0.0011689132,"about_ca_system_score_gemma":0.003237106,"threshold_uncertainty_score":0.089401305},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16443387,0.00006410523,0.83222705,0.00018250426,0.000014679201,0.0001118095,0.00007857634,0.0013964904,0.0014909151],"genre_scores_gemma":[0.9094742,0.000048523136,0.08969504,0.000043605258,0.000006763637,0.0001095376,0.00010053605,0.000099248646,0.000422493],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9933664,0.0033329434,0.0004888797,0.0006763828,0.0016387082,0.0004967101],"domain_scores_gemma":[0.98021436,0.013062371,0.0015838097,0.0037036052,0.0012055897,0.00023031817],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0050673448,0.00058668375,0.00071554095,0.0006211095,0.00085125974,0.001488303,0.0017815643,0.00076798873,0.0014194734],"category_scores_gemma":[0.019268507,0.0008395871,0.0012534879,0.0005923618,0.003583509,0.0029300526,0.0023400679,0.0016593413,0.00016163701],"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.00063155714,0.00023290781,0.0069782846,0.00029980086,0.00019736792,0.0008140507,0.0010448323,0.69088095,0.0510541,0.20144111,0.00056348834,0.045861594],"study_design_scores_gemma":[0.0000793322,0.00014586026,0.00048576755,0.00004011777,0.00005678318,0.00011808814,0.00010653479,0.8859438,0.041926872,0.069673054,0.0013911609,0.000032712305],"about_ca_topic_score_codex":0.0037504735,"about_ca_topic_score_gemma":0.0032493607,"teacher_disagreement_score":0.0050673448,"about_ca_system_score_codex":0.0017702517,"about_ca_system_score_gemma":0.002762459,"threshold_uncertainty_score":0.026799023},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017278895,0.00013815334,0.97946155,0.00020770464,0.000025928057,0.000121170946,0.00009698559,0.0012063142,0.0014632975],"genre_scores_gemma":[0.39945388,0.00023344203,0.59718525,0.00016571603,0.000029071358,0.0005494897,0.0004212336,0.00041141495,0.0015504961],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99547535,0.0024874494,0.0001870875,0.0004245445,0.0011256102,0.0002999314],"domain_scores_gemma":[0.9943263,0.0042645494,0.00027045162,0.0008218061,0.00025466425,0.000062194915],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003512236,0.0010207843,0.0010126106,0.0014853842,0.0007340019,0.001520145,0.0016247566,0.0010699542,0.0020698218],"category_scores_gemma":[0.009657466,0.0010139515,0.0021725118,0.00086432777,0.0031137944,0.002505672,0.0024097678,0.002800413,0.000410614],"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.00023802047,0.00010937872,0.001126966,0.00019853261,0.00011509368,0.00022133977,0.00025104248,0.7574349,0.0051991097,0.1806963,0.0008270118,0.053582314],"study_design_scores_gemma":[0.000039666465,0.000035211484,0.000074999065,0.000022226526,0.000030129697,0.000026806776,0.000019821993,0.87106067,0.0054625776,0.12151375,0.0017009901,0.000013126287],"about_ca_topic_score_codex":0.0047622775,"about_ca_topic_score_gemma":0.0060201483,"teacher_disagreement_score":0.0047622775,"about_ca_system_score_codex":0.0018445791,"about_ca_system_score_gemma":0.0018108264,"threshold_uncertainty_score":0.018574715},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1767298,0.0026913453,0.70112735,0.01926305,0.0006092565,0.0010392682,0.008651773,0.0027514007,0.087136745],"genre_scores_gemma":[0.6679019,0.0019287114,0.28462124,0.0028458142,0.00077293714,0.0008824602,0.008045335,0.00077798223,0.032223597],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99668807,0.0008840036,0.00017250645,0.001061172,0.0006699328,0.000524396],"domain_scores_gemma":[0.98556674,0.012038677,0.0006400382,0.00086892,0.0005363297,0.00034920315],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017975662,0.0013838414,0.0014574385,0.0010765715,0.0016565354,0.004152322,0.003661885,0.0027740558,0.022419859],"category_scores_gemma":[0.014287339,0.00071352336,0.0023141406,0.0019927174,0.002103336,0.00828633,0.002424934,0.004542921,0.0021965434],"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.0010916274,0.00069438276,0.00353701,0.0019508585,0.00042747584,0.0006512286,0.00059602654,0.1644274,0.007965756,0.58652234,0.05949955,0.17263642],"study_design_scores_gemma":[0.00025227456,0.0001813918,0.0009788672,0.000092736285,0.00018761566,0.00069475925,0.00023342934,0.26655573,0.005992258,0.70210975,0.022670321,0.00005090522],"about_ca_topic_score_codex":0.0026629192,"about_ca_topic_score_gemma":0.002336944,"teacher_disagreement_score":0.022419859,"about_ca_system_score_codex":0.0025900358,"about_ca_system_score_gemma":0.002268511,"threshold_uncertainty_score":0.075001955},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16011216,0.00012593388,0.817626,0.00018325768,0.000060194412,0.00016466137,0.00017639996,0.014387237,0.00716408],"genre_scores_gemma":[0.814808,0.000067748646,0.1801115,0.00015412207,0.000025011148,0.000121890014,0.000305577,0.0010669642,0.0033392627],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99944943,0.00009554645,0.000029271958,0.00009596451,0.00022153501,0.00010819761],"domain_scores_gemma":[0.99893624,0.0005419777,0.00015338806,0.00017379089,0.00014238938,0.000052145373],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043366582,0.00089236133,0.00035207812,0.00048555693,0.00031394043,0.00040292807,0.0009440455,0.00034603995,0.0043067713],"category_scores_gemma":[0.0017030004,0.00028105057,0.00034799994,0.00030979986,0.00056349003,0.000746201,0.00067104626,0.00054402504,0.00068682566],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016724912,0.00052091415,0.004585984,0.00041723915,0.000054184766,0.00059668365,0.00046785153,0.1451429,0.24430338,0.02121436,0.009608267,0.5714158],"study_design_scores_gemma":[0.0001795729,0.00033489865,0.0013543484,0.00002733418,0.00004487726,0.00021360697,0.00008091361,0.72020656,0.25369692,0.015706146,0.0081128115,0.00004204213],"about_ca_topic_score_codex":0.0009521881,"about_ca_topic_score_gemma":0.0017251602,"teacher_disagreement_score":0.0043067713,"about_ca_system_score_codex":0.00039555106,"about_ca_system_score_gemma":0.00051966484,"threshold_uncertainty_score":0.014407575},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04505431,0.00026263634,0.94762236,0.0003254795,0.00005148213,0.00020588649,0.00022734095,0.0014107812,0.00483987],"genre_scores_gemma":[0.60880625,0.00052595936,0.38424456,0.000094181574,0.000033675507,0.0005835586,0.00060661626,0.00024093957,0.004864338],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988213,0.00034992356,0.00007980097,0.00013996389,0.0005342683,0.00007470359],"domain_scores_gemma":[0.99857545,0.0008139201,0.0001351335,0.00024828417,0.00019800982,0.000029223556],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011420203,0.0005943856,0.0002826737,0.00042345602,0.0004210353,0.00096172903,0.0010792038,0.00080461096,0.001979012],"category_scores_gemma":[0.0034641577,0.00035708584,0.00061654835,0.00025710522,0.0012584764,0.0009378551,0.00052289275,0.0008119998,0.00040306908],"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.00014359683,0.00015115384,0.0015534449,0.0004937028,0.00004664819,0.00076265767,0.00071380445,0.5768948,0.051538356,0.31925085,0.0020138684,0.046437092],"study_design_scores_gemma":[0.00006435736,0.0001392048,0.00042902722,0.00007748867,0.000047893198,0.00021968914,0.00006633421,0.8918417,0.034175046,0.053397477,0.019516405,0.000025277639],"about_ca_topic_score_codex":0.005199816,"about_ca_topic_score_gemma":0.0039769323,"teacher_disagreement_score":0.005199816,"about_ca_system_score_codex":0.0012168364,"about_ca_system_score_gemma":0.0018517158,"threshold_uncertainty_score":0.010339081},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015232371,0.00009583189,0.9973061,0.0001300566,0.000023511462,0.000034153007,0.0000184539,0.00036598812,0.0005026339],"genre_scores_gemma":[0.08276661,0.00065524876,0.9144967,0.00023867162,0.000038715647,0.00032162908,0.00017325568,0.00019776837,0.0011114583],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9952178,0.0022635814,0.00022251344,0.00042856837,0.001651637,0.00021581474],"domain_scores_gemma":[0.9946854,0.0035232012,0.00029786862,0.0008037292,0.0005818718,0.00010793025],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0059834067,0.0012786589,0.0011422884,0.0018837049,0.00062965177,0.0026312312,0.0023190835,0.0019601113,0.0022398545],"category_scores_gemma":[0.014047887,0.0010423637,0.0018476817,0.0010593695,0.0027179632,0.002852408,0.0035360188,0.004539483,0.0007189377],"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.00009824803,0.00007298612,0.000658423,0.00031631367,0.00011722205,0.00022270337,0.0002873987,0.5560791,0.0046876413,0.38986966,0.0009155152,0.046674807],"study_design_scores_gemma":[0.00003592413,0.0000363736,0.00003939099,0.00007853162,0.000030516836,0.000037190748,0.00003015331,0.7928325,0.003791265,0.19552907,0.007543139,0.000015872047],"about_ca_topic_score_codex":0.003230006,"about_ca_topic_score_gemma":0.002573906,"teacher_disagreement_score":0.0059834067,"about_ca_system_score_codex":0.0012461423,"about_ca_system_score_gemma":0.0025291652,"threshold_uncertainty_score":0.03164369},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015211779,0.00007120094,0.99574006,0.000036264857,0.000015091441,0.000050633156,0.000017856242,0.0005383881,0.0020093177],"genre_scores_gemma":[0.056512766,0.00029626337,0.93915707,0.00005453107,0.000016608466,0.00023214336,0.00009342152,0.00019061987,0.0034467378],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998836,0.00035358383,0.000060594815,0.00014226297,0.0005487304,0.000058858743],"domain_scores_gemma":[0.99863166,0.0007900409,0.00007001848,0.00021312732,0.00027460154,0.000020506373],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016383225,0.000885853,0.00078926637,0.00062072783,0.0005074404,0.0016191925,0.0015000362,0.001281972,0.005943131],"category_scores_gemma":[0.0030814162,0.000859925,0.0011973183,0.0003688645,0.0012402188,0.0007897173,0.0009462589,0.0014857316,0.0015840521],"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.000134862,0.00009175002,0.000328952,0.0006566074,0.000086178676,0.0001742834,0.00039725317,0.5847994,0.031834938,0.18396966,0.0023043363,0.19522175],"study_design_scores_gemma":[0.00008352681,0.00012859724,0.00012901648,0.00013408787,0.00006297759,0.00012646534,0.000045774155,0.89371556,0.022695776,0.045163248,0.03768809,0.000026872642],"about_ca_topic_score_codex":0.0019919616,"about_ca_topic_score_gemma":0.0029643646,"teacher_disagreement_score":0.005943131,"about_ca_system_score_codex":0.0006055503,"about_ca_system_score_gemma":0.0015739653,"threshold_uncertainty_score":0.019881725},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03067648,0.00023415261,0.9609624,0.00036850097,0.0001030214,0.0003503972,0.00031925063,0.002879345,0.0041064485],"genre_scores_gemma":[0.5640489,0.0004609906,0.42639735,0.00062515924,0.00011670867,0.0012096465,0.0022987241,0.0015961048,0.0032465036],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9527993,0.020617992,0.003210906,0.0037862523,0.018033238,0.0015523344],"domain_scores_gemma":[0.88022864,0.059502188,0.0061411946,0.036050633,0.017580386,0.0004969325],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.020762557,0.0010685979,0.0009276403,0.0020595803,0.0007856405,0.0031780575,0.0031255048,0.0020834992,0.0034957295],"category_scores_gemma":[0.08164948,0.0008072032,0.0024258222,0.0009556691,0.0024985846,0.0038828275,0.0032692386,0.0021491866,0.0015929481],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012225246,0.00058046135,0.012539702,0.0026032873,0.0005261918,0.0016148632,0.0026215191,0.21316843,0.124559045,0.27364886,0.008700509,0.3582147],"study_design_scores_gemma":[0.0003333512,0.0007283824,0.00442251,0.0007832451,0.00021165491,0.00089739123,0.00042017284,0.57963574,0.2217495,0.1432313,0.047420893,0.00016586999],"about_ca_topic_score_codex":0.0013960758,"about_ca_topic_score_gemma":0.0008678781,"teacher_disagreement_score":0.020762557,"about_ca_system_score_codex":0.0017106557,"about_ca_system_score_gemma":0.0038484512,"threshold_uncertainty_score":0.10980421},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024352185,0.000069562186,0.99272585,0.000068494635,0.000024748511,0.000140627,0.00004537939,0.0006569737,0.0038332855],"genre_scores_gemma":[0.11742297,0.00043010156,0.8751577,0.00014331675,0.00003541646,0.0007465284,0.00036607406,0.00029506948,0.0054028844],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970471,0.0010246417,0.00026905327,0.0002832251,0.0011547497,0.0002212368],"domain_scores_gemma":[0.99749184,0.0010827965,0.00016209333,0.0004827298,0.00071137014,0.000069238486],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002988066,0.00069589436,0.0004527589,0.0009034657,0.00046286802,0.0020355599,0.0013041054,0.00088169443,0.0049446863],"category_scores_gemma":[0.0048418837,0.00046149277,0.00092495524,0.0004276465,0.0012150453,0.0016187308,0.0011749297,0.0009392376,0.001339359],"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.00014483872,0.000104129685,0.0008978685,0.0008574706,0.00008646232,0.00042837337,0.00091494893,0.09769213,0.036885843,0.73362285,0.0029873145,0.1253778],"study_design_scores_gemma":[0.00025312693,0.00074467424,0.00055155373,0.0004729814,0.00019733822,0.00053091825,0.00023699588,0.5538224,0.07234981,0.20340505,0.16735075,0.00008440216],"about_ca_topic_score_codex":0.0011202974,"about_ca_topic_score_gemma":0.001184786,"teacher_disagreement_score":0.0049446863,"about_ca_system_score_codex":0.0006313836,"about_ca_system_score_gemma":0.0018409132,"threshold_uncertainty_score":0.0165416},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2016989,0.00012465999,0.791564,0.00018992178,0.000056470366,0.00008208675,0.00027527811,0.00356779,0.0024409138],"genre_scores_gemma":[0.89234644,0.00010465988,0.10494989,0.0000685378,0.000018869949,0.00010651343,0.00025263222,0.0001971918,0.0019552528],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987122,0.00038890739,0.000085598396,0.0001811762,0.00046620352,0.00016595943],"domain_scores_gemma":[0.9963031,0.0023682849,0.0003390689,0.00063657266,0.00028471762,0.00006823989],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019988546,0.00064356264,0.00042936477,0.0006360866,0.0006932565,0.0013786644,0.0011113542,0.0005186615,0.0026889585],"category_scores_gemma":[0.006344829,0.0004416792,0.0012790096,0.0002324644,0.0024565367,0.001804121,0.00093267194,0.00084572926,0.0002053802],"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.00047520283,0.00013223199,0.0035279354,0.00028474804,0.000076039665,0.00038987203,0.0004837731,0.7982505,0.038492117,0.1295966,0.0009779178,0.027313065],"study_design_scores_gemma":[0.00015389196,0.0002077921,0.00046078186,0.00004670859,0.000067744404,0.00010488837,0.000057146637,0.86819303,0.0710481,0.055372585,0.004244788,0.000042465428],"about_ca_topic_score_codex":0.006693466,"about_ca_topic_score_gemma":0.0061162063,"teacher_disagreement_score":0.006693466,"about_ca_system_score_codex":0.0018325713,"about_ca_system_score_gemma":0.0022260945,"threshold_uncertainty_score":0.013309002},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14651479,0.008963033,0.676444,0.01926684,0.00084209495,0.00036475528,0.0024939352,0.0027262648,0.14238426],"genre_scores_gemma":[0.81825554,0.004917121,0.14521685,0.0031871907,0.0019507429,0.0006399446,0.002013058,0.0013644797,0.022455078],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9873325,0.002389636,0.0006399046,0.0026689174,0.004733777,0.0022353122],"domain_scores_gemma":[0.95320976,0.036941305,0.0014587347,0.0046594734,0.0026448315,0.0010858658],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004116582,0.0014716008,0.00176562,0.0025693497,0.0032213752,0.0076581165,0.0037545396,0.002046124,0.01821668],"category_scores_gemma":[0.028257003,0.00095853885,0.004355104,0.0033407963,0.006491833,0.021841561,0.008527018,0.01116402,0.0022801645],"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.0001622682,0.00006229991,0.0009331152,0.0004133343,0.00006558342,0.0001357002,0.0006916807,0.009641955,0.0019858626,0.9583592,0.0072442424,0.0203048],"study_design_scores_gemma":[0.000034011984,0.000036974205,0.0004632821,0.000050768456,0.000059998685,0.00013146638,0.00008427445,0.030493518,0.0015203515,0.9564933,0.010604553,0.000027504868],"about_ca_topic_score_codex":0.0042696614,"about_ca_topic_score_gemma":0.003117236,"teacher_disagreement_score":0.01821668,"about_ca_system_score_codex":0.0062067835,"about_ca_system_score_gemma":0.0031120603,"threshold_uncertainty_score":0.060940802},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008479187,0.0016407372,0.9534953,0.0012485702,0.00029211445,0.00006503549,0.00012757302,0.00024558514,0.034405876],"genre_scores_gemma":[0.55270714,0.0041355398,0.42300475,0.0013887376,0.0014487458,0.0005365561,0.00060183083,0.00027186493,0.015904883],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9962937,0.00092979573,0.00027697132,0.000771469,0.0014194549,0.00030853122],"domain_scores_gemma":[0.997542,0.0010412215,0.00022533654,0.0004826013,0.0005090101,0.00019988477],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031115455,0.0008702679,0.0008269969,0.0024717976,0.0023225038,0.0046727317,0.0020017847,0.0014353901,0.0058887904],"category_scores_gemma":[0.0041225725,0.0005668827,0.002072253,0.002361809,0.008153159,0.011818371,0.003763032,0.004949874,0.0013077155],"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.0000025488876,0.000004141761,0.000017239081,0.000017604523,0.000002896383,0.000015245169,0.000064241016,0.00049012835,0.00016724401,0.9978021,0.00011639759,0.0013002463],"study_design_scores_gemma":[0.000008767125,0.000020566633,0.00004352682,0.000022957396,0.000011653319,0.00007442156,0.00006716878,0.005784248,0.00056883757,0.9774884,0.015897494,0.000011925449],"about_ca_topic_score_codex":0.0012918618,"about_ca_topic_score_gemma":0.0008437049,"teacher_disagreement_score":0.0058887904,"about_ca_system_score_codex":0.0028101262,"about_ca_system_score_gemma":0.0013281779,"threshold_uncertainty_score":0.02038896},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028689848,0.0006547693,0.96442276,0.0006637349,0.00012166634,0.000051267794,0.00009054521,0.00042778347,0.004877594],"genre_scores_gemma":[0.46418592,0.0008925634,0.5251107,0.0004356998,0.0002654084,0.00017451434,0.0003193123,0.00056601374,0.008049793],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9931767,0.0020903936,0.00041813633,0.0012323929,0.002577636,0.00050475943],"domain_scores_gemma":[0.9807997,0.011715975,0.0015685192,0.00420064,0.001163066,0.00055210077],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008388572,0.0011177761,0.0014765426,0.0014616026,0.0008574193,0.0043557184,0.0022385165,0.0019644764,0.006577515],"category_scores_gemma":[0.03181913,0.0008944555,0.0021483982,0.0012293169,0.00307185,0.010661218,0.0050058714,0.005808587,0.0010698258],"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.00024639687,0.00004628808,0.0006565256,0.00015987072,0.00005537634,0.00010288771,0.0006314043,0.07059638,0.004240515,0.8982076,0.00064696814,0.024409821],"study_design_scores_gemma":[0.000044249973,0.00007284735,0.00019629975,0.00006764937,0.000047156216,0.00009669131,0.00012237646,0.45198083,0.003201889,0.5375645,0.0065718396,0.00003356954],"about_ca_topic_score_codex":0.0025765295,"about_ca_topic_score_gemma":0.002201135,"teacher_disagreement_score":0.008388572,"about_ca_system_score_codex":0.0027868634,"about_ca_system_score_gemma":0.0014774618,"threshold_uncertainty_score":0.04436356},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05539265,0.0026490595,0.82350445,0.0029235145,0.0004561403,0.00021223564,0.00041881268,0.00050016434,0.11394298],"genre_scores_gemma":[0.80540144,0.002415522,0.15692696,0.0015034442,0.0011179294,0.0005324893,0.0008956929,0.0004991837,0.03070734],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9930521,0.0016534758,0.0005631374,0.0015956146,0.0021215463,0.0010141487],"domain_scores_gemma":[0.9828126,0.006376565,0.0014596295,0.004045292,0.003909287,0.0013966656],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0049050543,0.0015232837,0.001102369,0.004968335,0.0021437216,0.009357556,0.004071174,0.0037635237,0.012173273],"category_scores_gemma":[0.021947537,0.0006283841,0.0020912823,0.005940411,0.009998781,0.020140566,0.008163767,0.0052210046,0.001812085],"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.000047869074,0.000022651442,0.00046616886,0.00004746631,0.000015310094,0.00013376011,0.00053102995,0.0009484815,0.0004334262,0.9897681,0.0006594593,0.0069262274],"study_design_scores_gemma":[0.000033101103,0.00008696711,0.00042977452,0.00012658854,0.000042053667,0.00030320423,0.0006818105,0.016016515,0.0012269974,0.9617226,0.019275399,0.00005495015],"about_ca_topic_score_codex":0.001725593,"about_ca_topic_score_gemma":0.0014292294,"teacher_disagreement_score":0.012173273,"about_ca_system_score_codex":0.002198872,"about_ca_system_score_gemma":0.0015282729,"threshold_uncertainty_score":0.04072362},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023303807,0.000094130424,0.9680038,0.0001948825,0.000033473956,0.00007568037,0.00008175822,0.0037574244,0.0044548893],"genre_scores_gemma":[0.5304363,0.0001820005,0.46407145,0.00007938723,0.000036266694,0.00011194305,0.00017137392,0.00071770645,0.0041935914],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99809796,0.0006154937,0.00010009574,0.00025126894,0.0006908424,0.0002444625],"domain_scores_gemma":[0.99398994,0.0048014163,0.00018625509,0.0006790045,0.00023714198,0.00010627911],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019056585,0.0008809957,0.0011202359,0.00061394856,0.0013281242,0.0020565866,0.0018540545,0.0009704104,0.006942388],"category_scores_gemma":[0.0071179504,0.00083610386,0.0011243969,0.0012067443,0.0031806054,0.003771995,0.002894709,0.0022845436,0.0009162491],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00048018282,0.00017647358,0.00071606826,0.0004021631,0.000068118425,0.00034793065,0.0007414172,0.22656633,0.019790577,0.5952081,0.0029060896,0.15259647],"study_design_scores_gemma":[0.00008065511,0.000059102087,0.00013366017,0.000036753987,0.00005416808,0.00006505553,0.000085217376,0.64757925,0.021530727,0.3261667,0.0041755484,0.00003330128],"about_ca_topic_score_codex":0.0035883475,"about_ca_topic_score_gemma":0.0058258916,"teacher_disagreement_score":0.006942388,"about_ca_system_score_codex":0.0013110696,"about_ca_system_score_gemma":0.0022788348,"threshold_uncertainty_score":0.023224592},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010336935,0.00013709352,0.98302126,0.00018620548,0.00007875779,0.000069444664,0.00008949688,0.003180094,0.002900626],"genre_scores_gemma":[0.39003283,0.00027878446,0.6015845,0.00027379542,0.00013526165,0.00042401956,0.00075348985,0.0011006347,0.0054167546],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99324256,0.002582911,0.00038719154,0.0008410648,0.0023980304,0.0005482083],"domain_scores_gemma":[0.9927921,0.0052152076,0.0003073469,0.0011377749,0.00046510837,0.00008236517],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003385728,0.0016128992,0.0021010772,0.0016365609,0.0008362353,0.0030675684,0.0036782327,0.0022641628,0.0048531964],"category_scores_gemma":[0.011957644,0.0013532696,0.0029599594,0.0014476804,0.0031282145,0.00651124,0.0036954489,0.004654328,0.0012184702],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00060784124,0.00024753393,0.00075828243,0.000591124,0.00023767314,0.00025555718,0.00053509924,0.26203564,0.014724797,0.57691884,0.005438787,0.13764876],"study_design_scores_gemma":[0.00008435384,0.000076942284,0.00006891566,0.000046207984,0.00006821612,0.000051672178,0.000033644126,0.48062506,0.01284127,0.50301343,0.0030625002,0.000027763354],"about_ca_topic_score_codex":0.0011004511,"about_ca_topic_score_gemma":0.0013476805,"teacher_disagreement_score":0.0048531964,"about_ca_system_score_codex":0.0011199324,"about_ca_system_score_gemma":0.0010620954,"threshold_uncertainty_score":0.017905653},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.054397132,0.005450334,0.707181,0.0013685134,0.00054666377,0.00012322766,0.00044048243,0.000649808,0.22984287],"genre_scores_gemma":[0.8161385,0.0044309557,0.12205133,0.00080262026,0.0013522309,0.00048536976,0.00085248024,0.00053289393,0.053353585],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99871254,0.00035834502,0.00010700854,0.0003042772,0.00038341302,0.00013445668],"domain_scores_gemma":[0.9982998,0.0010499792,0.000062784726,0.00036259796,0.00017220422,0.000052605286],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001906727,0.0005807381,0.0009212392,0.0011602018,0.0010201625,0.0018709619,0.0010218506,0.0006506394,0.004965938],"category_scores_gemma":[0.0035441972,0.0006370015,0.0013553307,0.0015597875,0.0035495867,0.005625934,0.0020466626,0.0036896716,0.0008212552],"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.000018610168,0.000007905044,0.000059553273,0.000042311305,0.000006571399,0.000025599844,0.00011394371,0.0005578915,0.0005236367,0.98291045,0.00094712985,0.014786503],"study_design_scores_gemma":[0.000009886397,0.000010796831,0.000110404544,0.000014459803,0.000011109927,0.00006956424,0.00001583122,0.0014385681,0.00066804053,0.98953843,0.00810593,0.0000068811155],"about_ca_topic_score_codex":0.00043722833,"about_ca_topic_score_gemma":0.00042058446,"teacher_disagreement_score":0.004965938,"about_ca_system_score_codex":0.0013965108,"about_ca_system_score_gemma":0.00046463162,"threshold_uncertainty_score":0.016612709},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17721516,0.0010457131,0.76264745,0.00050023146,0.00032023023,0.00021665714,0.0005035268,0.021749921,0.035801124],"genre_scores_gemma":[0.6224104,0.00026375594,0.37038147,0.00023250844,0.000053894255,0.00009368388,0.0006909263,0.0002218207,0.0056515425],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99965227,0.00006482838,0.000025229165,0.0000583019,0.00013979085,0.000059513695],"domain_scores_gemma":[0.99961483,0.00014308949,0.000038652972,0.000074179006,0.000109226115,0.000020022553],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020720532,0.0005922616,0.0002665541,0.0005033418,0.00019944861,0.00055458455,0.0010518528,0.0002722932,0.010683764],"category_scores_gemma":[0.00071886304,0.00028645233,0.00029622414,0.0005664231,0.00015940392,0.0005896838,0.00028604816,0.00053048524,0.0013310608],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010796528,0.0003685037,0.0035715362,0.00074879563,0.00015825727,0.0007032721,0.000122069425,0.12587145,0.19426575,0.022803962,0.019360177,0.6309466],"study_design_scores_gemma":[0.00023745168,0.0007715095,0.0021721916,0.0000410001,0.00009552165,0.00044739156,0.00002800068,0.839711,0.12904064,0.0025039257,0.024910407,0.000040859697],"about_ca_topic_score_codex":0.0027455143,"about_ca_topic_score_gemma":0.0053367238,"teacher_disagreement_score":0.010683764,"about_ca_system_score_codex":0.0005273548,"about_ca_system_score_gemma":0.0006485055,"threshold_uncertainty_score":0.035740793},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28730676,0.011201502,0.51690686,0.048005328,0.0007858751,0.0001691373,0.0018640241,0.0012266061,0.13253395],"genre_scores_gemma":[0.9492985,0.0025076158,0.036425523,0.0009010686,0.0013100086,0.0001547018,0.00057165313,0.00025650128,0.008574462],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99111056,0.003365231,0.000432348,0.0010698808,0.0031684241,0.00085357815],"domain_scores_gemma":[0.9081988,0.08108294,0.0019313663,0.005094805,0.002332071,0.0013600392],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005319368,0.0007041737,0.0018235779,0.0021110214,0.0024270895,0.008533891,0.0028468447,0.0021119828,0.012261344],"category_scores_gemma":[0.03758774,0.0013760182,0.0018900846,0.0025303396,0.0060099815,0.02807445,0.0032352235,0.0088194,0.0010574638],"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.00014224267,0.000071687384,0.0007451163,0.00014529916,0.000049113605,0.00004666682,0.00035141295,0.00828471,0.00056738197,0.97176456,0.0036248243,0.014206955],"study_design_scores_gemma":[0.00001795111,0.00000807495,0.00019285794,0.000012124016,0.000015944364,0.000022208855,0.000027983258,0.017129276,0.00027977323,0.9809668,0.0013160389,0.000010978611],"about_ca_topic_score_codex":0.002352126,"about_ca_topic_score_gemma":0.001925585,"teacher_disagreement_score":0.012261344,"about_ca_system_score_codex":0.005158889,"about_ca_system_score_gemma":0.0038028609,"threshold_uncertainty_score":0.041018248},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019109639,0.000054174805,0.99581945,0.00010954148,0.000019689684,0.000057708614,0.00006414927,0.00041492784,0.0015493333],"genre_scores_gemma":[0.18648306,0.00054160383,0.8090438,0.00029127861,0.00014816527,0.00054574263,0.00036617246,0.00028544912,0.0022946822],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.991734,0.0028917058,0.00078303897,0.00091197924,0.0030814267,0.000597907],"domain_scores_gemma":[0.9824782,0.012300644,0.0009541871,0.0025917008,0.0014981552,0.00017707048],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0097185075,0.0011599273,0.0008420604,0.0017246831,0.00093185925,0.0038616995,0.0031169443,0.001260197,0.004657627],"category_scores_gemma":[0.014444655,0.00061021536,0.0027278503,0.0011276922,0.005069869,0.004283442,0.0026850011,0.0028484548,0.0011149575],"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.000045451656,0.00010319747,0.00039821604,0.00029712892,0.000047512385,0.00038175765,0.00035569016,0.06200632,0.0054381425,0.9032948,0.0010310672,0.02660082],"study_design_scores_gemma":[0.000085623484,0.00009061229,0.00019691102,0.00013652121,0.0000669972,0.00025992576,0.000064956905,0.3335108,0.019130135,0.6330665,0.013341018,0.000049934974],"about_ca_topic_score_codex":0.0013770465,"about_ca_topic_score_gemma":0.0009233113,"teacher_disagreement_score":0.0097185075,"about_ca_system_score_codex":0.0018074405,"about_ca_system_score_gemma":0.0029275666,"threshold_uncertainty_score":0.051396966},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0072118724,0.00009641485,0.9869065,0.0003714606,0.00004241147,0.0001011988,0.00008304879,0.00033876815,0.0048481706],"genre_scores_gemma":[0.12299634,0.00027439554,0.86835057,0.0002693997,0.00007021226,0.00046131358,0.0003079374,0.00026705835,0.0070026764],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99877566,0.00025079964,0.00011081784,0.00024349846,0.00045813416,0.00016097535],"domain_scores_gemma":[0.9980186,0.0013883468,0.000131331,0.00014450269,0.00028368685,0.00003351041],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017252784,0.0010228953,0.0007250527,0.00071741897,0.0008917387,0.0015512296,0.0011793509,0.0013018872,0.006380722],"category_scores_gemma":[0.007425546,0.00062162115,0.0016920617,0.00076075905,0.0019238492,0.002351467,0.0021664216,0.002470635,0.0008254935],"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.00007082742,0.00006673867,0.00030050092,0.00030275038,0.000035668065,0.00017281793,0.00037059732,0.23642407,0.005503232,0.7042116,0.0026715575,0.04986967],"study_design_scores_gemma":[0.000072518655,0.000023147453,0.000035610905,0.00004046022,0.000017112747,0.00005088272,0.000065955304,0.4627355,0.003977524,0.52664256,0.0063200053,0.000018683982],"about_ca_topic_score_codex":0.0026731205,"about_ca_topic_score_gemma":0.003488909,"teacher_disagreement_score":0.006380722,"about_ca_system_score_codex":0.0018885138,"about_ca_system_score_gemma":0.0027380981,"threshold_uncertainty_score":0.021345615},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12231682,0.00012327376,0.871603,0.00031187126,0.000043619704,0.00009234758,0.00015685635,0.0004736638,0.004878597],"genre_scores_gemma":[0.93674463,0.00014949647,0.060155846,0.00021182442,0.00009071051,0.00020257158,0.0003048169,0.0001838829,0.001956368],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99276406,0.0016973518,0.0005931239,0.0017865336,0.0020096377,0.001149326],"domain_scores_gemma":[0.9554441,0.02957427,0.005953718,0.0027575206,0.004080769,0.0021897242],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0058091073,0.0012410394,0.0015350239,0.0030269672,0.0017791044,0.006022177,0.0028247933,0.0019879974,0.0031694933],"category_scores_gemma":[0.030922487,0.0013264031,0.0034523834,0.0018212828,0.00514541,0.008285371,0.00411228,0.004127009,0.00049019064],"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.00023297903,0.0001272008,0.0018491895,0.000081904866,0.00010018956,0.00029107442,0.0005373822,0.048936818,0.0036386754,0.9379146,0.00024601625,0.0060439794],"study_design_scores_gemma":[0.000050741535,0.00007169098,0.00032820628,0.000022982334,0.000056965535,0.00010325746,0.00008586417,0.33343652,0.0027781844,0.6625801,0.00044863776,0.000036925638],"about_ca_topic_score_codex":0.0034596126,"about_ca_topic_score_gemma":0.0026862156,"teacher_disagreement_score":0.006022177,"about_ca_system_score_codex":0.0038922522,"about_ca_system_score_gemma":0.0032617315,"threshold_uncertainty_score":0.030721903},"labels":[],"label_agreement":null},{"id":"W1971059059","doi":"10.1007/s10703-012-0182-0","title":"Time-triggered runtime verification","year":2013,"lang":"en","type":"article","venue":"Formal Methods in System Design","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Runtime verification; Computer science; Overhead (engineering); Benchmark (surveying); Disjoint sets; Set (abstract data type); Formal verification; Event (particle physics); Model checking; Bounded function; Distributed computing; Real-time computing; Embedded system; Programming language","score_opus":0.04806893277459231,"score_gpt":0.3334275702699164,"score_spread":0.2853586374953241,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1971059059","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00993693,0.00014557972,0.97487396,0.00015989522,0.00019479493,0.00010144985,0.00011188714,0.005419352,0.009056124],"genre_scores_gemma":[0.67635226,0.00025472397,0.30684838,0.00032401647,0.00014001464,0.00030735874,0.00039275602,0.0019405702,0.013439842],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99337405,0.0017792947,0.00037118624,0.0011327459,0.0026664895,0.0006762425],"domain_scores_gemma":[0.9916435,0.003799257,0.00046800965,0.00287278,0.000975949,0.00024041899],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034618867,0.001202075,0.0008792388,0.0010428593,0.00067559397,0.0020753448,0.0021228895,0.0013576263,0.009938914],"category_scores_gemma":[0.010695907,0.00073856936,0.0017186988,0.0005353255,0.0017548457,0.0032626681,0.0024582937,0.0026057062,0.0025152268],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014528363,0.00023208135,0.0009667373,0.00074180943,0.00017897975,0.0010358316,0.00066005526,0.06765895,0.09817053,0.66981864,0.007762469,0.15132105],"study_design_scores_gemma":[0.00027264445,0.0002642176,0.0004412809,0.00014854457,0.00019975269,0.0004988693,0.00008631052,0.48217458,0.15931705,0.32242373,0.034064095,0.000108951484],"about_ca_topic_score_codex":0.0006354786,"about_ca_topic_score_gemma":0.00075328967,"teacher_disagreement_score":0.009938914,"about_ca_system_score_codex":0.0010259828,"about_ca_system_score_gemma":0.0015224585,"threshold_uncertainty_score":0.03324902},"labels":[],"label_agreement":null},{"id":"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0116909025,0.0002677649,0.98416024,0.00018980623,0.00006434993,0.00002583979,0.000056245743,0.00022185623,0.0033230467],"genre_scores_gemma":[0.45001525,0.0010256226,0.54155314,0.0003391041,0.0002785461,0.00018991536,0.00021584914,0.00028529117,0.0060973894],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979962,0.0005111228,0.00018986125,0.00047030114,0.0006522116,0.00018034564],"domain_scores_gemma":[0.9959126,0.002457519,0.00027663287,0.00064356247,0.0005551724,0.00015453646],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037111598,0.0005208277,0.00081315427,0.0012917091,0.0010746383,0.0020361606,0.0012459678,0.00084770995,0.0035226871],"category_scores_gemma":[0.006690632,0.00042250103,0.0015073947,0.0014181222,0.0044142795,0.007011444,0.0015563812,0.0019677437,0.00069629605],"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.000024688909,0.000012319869,0.00020609373,0.00004226303,0.000010764782,0.000056661615,0.00014644327,0.0062675374,0.0013231139,0.97554034,0.00043972905,0.015930042],"study_design_scores_gemma":[0.000012995495,0.000028359174,0.0001050217,0.000019067176,0.00001533013,0.0000899966,0.00002803934,0.058789033,0.0039314,0.9332394,0.0037212186,0.00002013037],"about_ca_topic_score_codex":0.0022514467,"about_ca_topic_score_gemma":0.0016385987,"teacher_disagreement_score":0.0037111598,"about_ca_system_score_codex":0.0013300919,"about_ca_system_score_gemma":0.0013665069,"threshold_uncertainty_score":0.019626737},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32537654,0.0043117623,0.6043215,0.00080349465,0.0005869672,0.00041685312,0.00066162605,0.019248074,0.044273127],"genre_scores_gemma":[0.9212441,0.0005908127,0.0739753,0.000106925894,0.00004467693,0.00010112174,0.00031326327,0.00045049502,0.003173373],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9952969,0.0021639743,0.00020719525,0.00028582066,0.001675805,0.0003704234],"domain_scores_gemma":[0.9779333,0.013826242,0.0009398912,0.0047520706,0.0021715667,0.00037708305],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005613618,0.00091206864,0.001189139,0.0021877454,0.00087933434,0.002306592,0.0017049896,0.0011004532,0.008346822],"category_scores_gemma":[0.022209609,0.0004596215,0.000628394,0.0010975495,0.001382592,0.004771032,0.0015617105,0.0011687061,0.0009241527],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.012067119,0.00074164907,0.010064096,0.0016661789,0.0005799383,0.000212413,0.00038943146,0.14852953,0.016358111,0.22235368,0.006468273,0.5805695],"study_design_scores_gemma":[0.00040665394,0.001254757,0.0027883584,0.0001785455,0.00029776755,0.00020461479,0.0004348072,0.88115776,0.023793496,0.08239777,0.0070107076,0.00007468651],"about_ca_topic_score_codex":0.0023411757,"about_ca_topic_score_gemma":0.0055733807,"teacher_disagreement_score":0.008346822,"about_ca_system_score_codex":0.0013987628,"about_ca_system_score_gemma":0.0023510442,"threshold_uncertainty_score":0.02968806},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012465727,0.000051565745,0.982599,0.0004253383,0.000056188823,0.00006570756,0.00020256074,0.0022898938,0.0018439451],"genre_scores_gemma":[0.39505452,0.000191154,0.6001292,0.00055768713,0.00019834645,0.00012181675,0.00060915464,0.0006088558,0.0025292258],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99025005,0.003438858,0.00086169847,0.0013458673,0.0032129032,0.0008906021],"domain_scores_gemma":[0.9427005,0.050719846,0.0012618345,0.0029465233,0.0018810023,0.0004904127],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012512704,0.0011773187,0.0018580183,0.0028123027,0.0018816073,0.0057796165,0.0047184364,0.0022807927,0.009558126],"category_scores_gemma":[0.040216345,0.0018008428,0.004284343,0.0018270565,0.0038198212,0.011031239,0.0052196626,0.0041235923,0.001420564],"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.00039026194,0.00024068897,0.0032020663,0.00051685976,0.0003102198,0.0010891033,0.00073539186,0.07271471,0.006021401,0.8548964,0.0041482775,0.055734534],"study_design_scores_gemma":[0.00013569897,0.00003765623,0.00022355317,0.00003638979,0.00015543771,0.00022064653,0.000058096728,0.34584135,0.01061056,0.6399473,0.0026895313,0.000043772026],"about_ca_topic_score_codex":0.003107835,"about_ca_topic_score_gemma":0.0048155626,"teacher_disagreement_score":0.012512704,"about_ca_system_score_codex":0.0025099542,"about_ca_system_score_gemma":0.003115032,"threshold_uncertainty_score":0.06617427},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0062774024,0.000058346966,0.99130565,0.0002838574,0.00004165823,0.000114482435,0.00009515488,0.00074106234,0.0010823796],"genre_scores_gemma":[0.19120398,0.00025779722,0.8055013,0.0003050166,0.00005638114,0.00039647493,0.00030768928,0.00029321972,0.0016781688],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99216473,0.0028696,0.00074444426,0.0008958285,0.0030091966,0.0003162446],"domain_scores_gemma":[0.9782602,0.012777047,0.001958019,0.00414238,0.0025601343,0.0003022186],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0064005577,0.0011055608,0.000631998,0.0020664465,0.0012718854,0.0022638084,0.0026041314,0.001671405,0.0027764102],"category_scores_gemma":[0.023867613,0.00091583014,0.0022240004,0.00083583425,0.0031346586,0.006171226,0.0026994287,0.0032578397,0.0012331647],"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.0006924584,0.00048652585,0.007992553,0.001637788,0.0002562794,0.0026863178,0.002976039,0.030699113,0.13500932,0.6649412,0.0038172028,0.14880522],"study_design_scores_gemma":[0.00024215232,0.0006402849,0.0011309723,0.0004524031,0.00030168117,0.0023942578,0.00068111194,0.40134883,0.22748607,0.33256647,0.032576002,0.00017983172],"about_ca_topic_score_codex":0.0020314434,"about_ca_topic_score_gemma":0.0019225505,"teacher_disagreement_score":0.0064005577,"about_ca_system_score_codex":0.0007343625,"about_ca_system_score_gemma":0.0031549896,"threshold_uncertainty_score":0.033849776},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018591538,0.019845683,0.9154721,0.014927036,0.00079765846,0.00010368552,0.00015799949,0.001589352,0.028514996],"genre_scores_gemma":[0.5128636,0.025470896,0.44256368,0.0032633462,0.0017038458,0.00027177503,0.00088365783,0.0010032635,0.011976008],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99290484,0.003013559,0.0006601438,0.00071001024,0.002192327,0.00051911286],"domain_scores_gemma":[0.98587453,0.008515944,0.00068072247,0.0020066248,0.0023484768,0.0005736879],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.013432407,0.0009937789,0.001362193,0.001914091,0.0011067694,0.01027007,0.0034478516,0.0025281985,0.004100554],"category_scores_gemma":[0.013289861,0.0009190194,0.0010345081,0.0021882942,0.008717691,0.018205069,0.0028093609,0.0047656777,0.0011787736],"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.00006359335,0.00009431278,0.00023244316,0.0002894684,0.000012797816,0.00003035456,0.00025785118,0.00516348,0.0006000591,0.94749403,0.0015925083,0.04416911],"study_design_scores_gemma":[0.00008419523,0.00009570861,0.00013796768,0.00045988944,0.000024125924,0.00013597489,0.0003319918,0.051547542,0.0036347664,0.8819817,0.06151856,0.000047701185],"about_ca_topic_score_codex":0.004627956,"about_ca_topic_score_gemma":0.0026001623,"teacher_disagreement_score":0.013432407,"about_ca_system_score_codex":0.004702109,"about_ca_system_score_gemma":0.0058248565,"threshold_uncertainty_score":0.071038246},"labels":[],"label_agreement":null},{"id":"W1973223152","doi":"10.1007/s10703-014-0215-y","title":"Runtime enforcement of timed properties revisited","year":2014,"lang":"en","type":"article","venue":"Formal Methods in System Design","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":49,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Computer Research Institute of Montréal","funders":"","keywords":"Enforcement; Computer science; Soundness; Correctness; Context (archaeology); Sequence (biology); Property (philosophy); Programming language","score_opus":0.07481876807600887,"score_gpt":0.337618955834488,"score_spread":0.26280018775847913,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1973223152","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028345421,0.00072698086,0.95413834,0.0013388484,0.00047884815,0.00007230194,0.00004571818,0.0030549094,0.011798619],"genre_scores_gemma":[0.74888,0.00072318537,0.2411907,0.0004933048,0.00032128376,0.00016879068,0.00010583927,0.0013214924,0.006795369],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9870798,0.0052846232,0.00084656803,0.0013692512,0.0040228507,0.0013969118],"domain_scores_gemma":[0.9557035,0.025856066,0.001806135,0.013371431,0.0026359556,0.0006269464],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012741007,0.00076655427,0.0014455299,0.0010746906,0.0013183018,0.0042830314,0.0033190064,0.0019107288,0.004706726],"category_scores_gemma":[0.036835115,0.0011358929,0.0016445537,0.0008764538,0.0052674916,0.00625377,0.0036909555,0.006894028,0.00071432104],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00047127198,0.0001874519,0.0008403671,0.0003832978,0.00010333967,0.0005573303,0.0011319284,0.035280056,0.01343526,0.86323863,0.0026084902,0.081762485],"study_design_scores_gemma":[0.00034771994,0.00023113361,0.00044476945,0.00030423838,0.0002473429,0.00035205073,0.00034713402,0.3333853,0.040843222,0.5953755,0.02801935,0.000102269165],"about_ca_topic_score_codex":0.0021797628,"about_ca_topic_score_gemma":0.0025603315,"teacher_disagreement_score":0.012741007,"about_ca_system_score_codex":0.001569836,"about_ca_system_score_gemma":0.0029095032,"threshold_uncertainty_score":0.06738174},"labels":[],"label_agreement":null},{"id":"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0070543624,0.00012796801,0.9865724,0.00013774565,0.000016713566,0.0000651361,0.000034190263,0.0053251786,0.0006662339],"genre_scores_gemma":[0.14190894,0.00014432304,0.85592216,0.00013281607,0.00002887408,0.00012849807,0.00012263065,0.00096336566,0.00064843445],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99332196,0.0033325413,0.0004488547,0.000656323,0.0019069586,0.00033330484],"domain_scores_gemma":[0.9536895,0.034969885,0.002291989,0.006589267,0.0021607066,0.00029871726],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005879229,0.0010668992,0.00092330325,0.0021563363,0.0009917241,0.0019488705,0.0025375772,0.0013065309,0.005158101],"category_scores_gemma":[0.04073914,0.0011751535,0.001510886,0.0011846054,0.0026330762,0.0045039905,0.0037380366,0.0027778812,0.0011533716],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00078174117,0.0003064747,0.0044096806,0.0013679992,0.00025009253,0.0011136322,0.0017091251,0.1388243,0.09112188,0.2189869,0.006086624,0.5350416],"study_design_scores_gemma":[0.00022382908,0.00016592894,0.00040672353,0.00015945699,0.00011317854,0.0007432683,0.000109323555,0.7734081,0.121676855,0.09226739,0.010629631,0.00009632343],"about_ca_topic_score_codex":0.0013579173,"about_ca_topic_score_gemma":0.0021613745,"teacher_disagreement_score":0.005879229,"about_ca_system_score_codex":0.0010057675,"about_ca_system_score_gemma":0.0019800202,"threshold_uncertainty_score":0.031092703},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023836017,0.0003557074,0.9679267,0.00036121527,0.000047215097,0.00007211213,0.00018985233,0.0010541821,0.006157085],"genre_scores_gemma":[0.41803682,0.0010867079,0.57243896,0.00030343444,0.00019383316,0.00016157371,0.0010461077,0.00037778533,0.0063547418],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967981,0.0007120604,0.00031573843,0.00044367832,0.0013716375,0.00035885838],"domain_scores_gemma":[0.99646676,0.0023070248,0.00030151726,0.000416023,0.0004359736,0.00007276393],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032282271,0.00095533184,0.0007480868,0.0023052262,0.0012287537,0.00402129,0.0019314885,0.0010252154,0.0019523603],"category_scores_gemma":[0.0064898925,0.00092455465,0.0030710497,0.0013162388,0.002862093,0.006222242,0.0024533782,0.0016874501,0.0006423805],"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.000056164878,0.000052117197,0.0011009262,0.00015353826,0.000058209065,0.00068046025,0.0012758843,0.049413897,0.005374251,0.9133048,0.0009383619,0.027591381],"study_design_scores_gemma":[0.000036256773,0.000081584905,0.0004937605,0.00009282734,0.00018789948,0.00035901088,0.00047012986,0.29524064,0.017487016,0.6583613,0.027120482,0.00006902343],"about_ca_topic_score_codex":0.010280525,"about_ca_topic_score_gemma":0.010423162,"teacher_disagreement_score":0.010280525,"about_ca_system_score_codex":0.0019997442,"about_ca_system_score_gemma":0.0018586027,"threshold_uncertainty_score":0.020441353},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038506947,0.00024147466,0.9588416,0.00006621166,0.000015765014,0.000029709416,0.00003343608,0.00021456588,0.0020502282],"genre_scores_gemma":[0.9331686,0.000244879,0.06555484,0.000025000032,0.000027255186,0.00006305937,0.000047009413,0.000051373703,0.0008180082],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99842846,0.0006065527,0.00006770189,0.0001785898,0.0006354454,0.00008318887],"domain_scores_gemma":[0.99817336,0.0012186615,0.00022887906,0.00012907518,0.00021759605,0.00003246118],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017253967,0.0007629436,0.00047539413,0.0011319213,0.00023396936,0.0010998972,0.0008514394,0.00051648467,0.001322142],"category_scores_gemma":[0.006009401,0.00021558857,0.0005519231,0.0005701328,0.0007928881,0.0015148268,0.00082071737,0.0006398719,0.00016654714],"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.00015085946,0.000031456668,0.00072935387,0.00017248139,0.000071084956,0.0001661728,0.0001080296,0.79125303,0.022637414,0.12869418,0.0002796007,0.05570638],"study_design_scores_gemma":[0.000006510437,0.000063916086,0.00012429061,0.000012749746,0.000014973368,0.00006186634,0.000014441446,0.9455542,0.007144663,0.046616264,0.00037341935,0.000012721993],"about_ca_topic_score_codex":0.00058096764,"about_ca_topic_score_gemma":0.00033103742,"teacher_disagreement_score":0.0017253967,"about_ca_system_score_codex":0.00091048796,"about_ca_system_score_gemma":0.0004638627,"threshold_uncertainty_score":0.009124875},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09982711,0.0007487554,0.8706175,0.00027605644,0.00014553826,0.00010670088,0.00010633488,0.0020709112,0.026101049],"genre_scores_gemma":[0.7401076,0.00024249121,0.25612032,0.00012695862,0.000027772563,0.00006729122,0.00019085575,0.00006837659,0.0030483366],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996309,0.00008323062,0.000020614445,0.000086188506,0.000104595085,0.00007437003],"domain_scores_gemma":[0.99975926,0.00007764398,0.000022865852,0.000077095676,0.00004435706,0.000018805404],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024054744,0.00045660025,0.00035773666,0.00044081465,0.0005390579,0.00084227184,0.0010509093,0.00033400464,0.004418611],"category_scores_gemma":[0.0006330419,0.00020067135,0.00042048222,0.0007344017,0.00036668062,0.00091514277,0.0006251578,0.00046492158,0.0005626836],"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.00065072207,0.00022511795,0.0026126748,0.00024132914,0.0001563941,0.00082517916,0.00012728984,0.42432275,0.063389264,0.085928775,0.0069233943,0.4145971],"study_design_scores_gemma":[0.00008137296,0.00022472764,0.00048989395,0.000025208166,0.000051248844,0.00018413101,0.000053796397,0.9411951,0.030559571,0.018021144,0.0090913605,0.000022584756],"about_ca_topic_score_codex":0.002346443,"about_ca_topic_score_gemma":0.004300668,"teacher_disagreement_score":0.004418611,"about_ca_system_score_codex":0.000592656,"about_ca_system_score_gemma":0.00055346056,"threshold_uncertainty_score":0.0147817135},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046386622,0.0002442661,0.9371178,0.0005416847,0.0001282379,0.00017667102,0.00005362561,0.004116966,0.011234173],"genre_scores_gemma":[0.3837157,0.0002840742,0.60173917,0.00032169276,0.00013112216,0.00027282193,0.00024292144,0.0017239653,0.011568552],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9914848,0.0020446477,0.0006584483,0.0017231228,0.002975356,0.0011137036],"domain_scores_gemma":[0.9880447,0.0045976,0.00085164077,0.004925237,0.0011195835,0.00046120497],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0059419395,0.0013157524,0.0010368223,0.0012481706,0.001937281,0.00334089,0.0029798879,0.0022185082,0.0048062936],"category_scores_gemma":[0.019108783,0.0014375144,0.0013602918,0.00083867763,0.0045029093,0.008927448,0.0073796236,0.0031886569,0.0012382169],"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.0004192673,0.00026848004,0.007947537,0.0005724625,0.00018126577,0.003990594,0.008668592,0.046037298,0.05297144,0.48450157,0.006691906,0.38774958],"study_design_scores_gemma":[0.00010285018,0.00030433713,0.0015694111,0.00020294907,0.00029083536,0.0015276186,0.0013558918,0.13631186,0.06483605,0.67608845,0.11724662,0.00016316547],"about_ca_topic_score_codex":0.0019084376,"about_ca_topic_score_gemma":0.0020231688,"teacher_disagreement_score":0.0059419395,"about_ca_system_score_codex":0.0009895293,"about_ca_system_score_gemma":0.0016853984,"threshold_uncertainty_score":0.031424344},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008069041,0.00003181044,0.9982161,0.000033974862,0.000015194035,0.000021542275,0.000017789394,0.0002679616,0.0005887051],"genre_scores_gemma":[0.0496505,0.0001923309,0.9475699,0.000096186406,0.000057044675,0.00015731655,0.00016562118,0.00018999285,0.0019210938],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99762934,0.00033250375,0.00016107546,0.00055511785,0.0011595209,0.00016248996],"domain_scores_gemma":[0.99816364,0.00074070325,0.0001144602,0.00053346326,0.0003843999,0.000063295316],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020971498,0.0010148924,0.0010814654,0.0024466815,0.0011691639,0.002130199,0.0027281397,0.0010714178,0.004337408],"category_scores_gemma":[0.004591958,0.0007324775,0.0024294702,0.0011595418,0.002288144,0.0046147252,0.0028137057,0.0036738776,0.0010874837],"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.00009395213,0.00014075733,0.00074192684,0.00025524615,0.00010980146,0.00023822025,0.00047281716,0.080858864,0.029630557,0.7415468,0.0016226283,0.14428851],"study_design_scores_gemma":[0.000057657795,0.00012325235,0.00024935108,0.00010183492,0.00011379721,0.00032562276,0.00007287815,0.5593809,0.02469718,0.37637717,0.038424943,0.00007543848],"about_ca_topic_score_codex":0.0026368906,"about_ca_topic_score_gemma":0.0022406122,"teacher_disagreement_score":0.004337408,"about_ca_system_score_codex":0.001378918,"about_ca_system_score_gemma":0.0021892919,"threshold_uncertainty_score":0.0145100355},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004421407,0.00003804739,0.99345523,0.000083794475,0.000009967191,0.00006479953,0.00004071361,0.0015343501,0.00035156505],"genre_scores_gemma":[0.09154802,0.00013160381,0.90685105,0.00010188086,0.000018922605,0.00023339517,0.00024473696,0.00032986852,0.000540514],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98827577,0.005286272,0.0006883322,0.0007013506,0.004598745,0.00044946236],"domain_scores_gemma":[0.9867295,0.007215583,0.0009547765,0.0029913366,0.0019975859,0.00011118298],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006802008,0.0011042119,0.00078309316,0.0016373853,0.00070939114,0.0019476746,0.001609266,0.0014404326,0.0024371326],"category_scores_gemma":[0.016217433,0.0009065835,0.0016316056,0.000800938,0.0017507917,0.002917285,0.0019180924,0.0019519755,0.0014703423],"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.00046806762,0.0003440302,0.003961696,0.0013598396,0.00020917633,0.00089629326,0.0008298537,0.32144445,0.14984022,0.22368594,0.0040894384,0.292871],"study_design_scores_gemma":[0.000113100185,0.00015148106,0.0003081873,0.00014874722,0.00007237755,0.00029048178,0.00005040591,0.8834812,0.07113444,0.034130964,0.0100811105,0.00003752936],"about_ca_topic_score_codex":0.0022588961,"about_ca_topic_score_gemma":0.0020438938,"teacher_disagreement_score":0.006802008,"about_ca_system_score_codex":0.0007710878,"about_ca_system_score_gemma":0.0026713614,"threshold_uncertainty_score":0.035972893},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0717787,0.00047915414,0.91090274,0.0015544313,0.00011232709,0.00015292283,0.00010711796,0.0010636939,0.0138489995],"genre_scores_gemma":[0.8001617,0.0004600144,0.19036056,0.0004576877,0.00008332997,0.00039045862,0.00030211738,0.00044698472,0.0073371907],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9923626,0.003846774,0.00038115913,0.0005887588,0.0019625807,0.0008581251],"domain_scores_gemma":[0.92848897,0.060424708,0.0014349186,0.0059506195,0.0029238048,0.00077691197],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009855806,0.00061940576,0.0017626254,0.0011847075,0.0013692525,0.002204948,0.0021063967,0.001837926,0.0044405204],"category_scores_gemma":[0.052861862,0.0006625758,0.0013472589,0.0011048906,0.004326185,0.00498988,0.005044208,0.0044121407,0.00059902866],"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.0009828476,0.00018166483,0.0027597272,0.00030918856,0.00007987351,0.00030267125,0.0008114426,0.21521874,0.005610898,0.6788709,0.0023869798,0.092485085],"study_design_scores_gemma":[0.00006741264,0.0000833312,0.00021781334,0.00004768525,0.00003151024,0.000053575433,0.000050399827,0.61771315,0.0028050698,0.3775956,0.0013196566,0.000014824858],"about_ca_topic_score_codex":0.002157073,"about_ca_topic_score_gemma":0.0023985272,"teacher_disagreement_score":0.009855806,"about_ca_system_score_codex":0.0015186794,"about_ca_system_score_gemma":0.0025553133,"threshold_uncertainty_score":0.05212313},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.052108563,0.0016377964,0.85087585,0.00938705,0.00056599703,0.0001374957,0.0005536667,0.0036070044,0.081126586],"genre_scores_gemma":[0.77625483,0.001290997,0.19924338,0.001772063,0.00023594922,0.00022571684,0.00052805804,0.0011084804,0.019340497],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9922685,0.0040832683,0.00034773827,0.0011369764,0.0016646481,0.000498887],"domain_scores_gemma":[0.98453647,0.0070104506,0.0009104005,0.0052427542,0.001672066,0.0006278214],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0090534715,0.0004388242,0.00048424496,0.0010060132,0.0010977121,0.00506435,0.0015184213,0.0014079952,0.0068419757],"category_scores_gemma":[0.026044631,0.00047028862,0.00061522936,0.0008315231,0.0045766984,0.016219305,0.0031295563,0.0017661436,0.0016853046],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000108920125,0.000016502121,0.0007025843,0.000110737754,0.000024315976,0.000036747067,0.00068403914,0.0022552283,0.0012329404,0.9474958,0.0029887138,0.044343553],"study_design_scores_gemma":[0.00005025595,0.00007477553,0.00063523144,0.00015094085,0.000095504554,0.00016165816,0.00041829108,0.013902121,0.0058281273,0.9237132,0.054931346,0.000038556173],"about_ca_topic_score_codex":0.0027196761,"about_ca_topic_score_gemma":0.0025340104,"teacher_disagreement_score":0.0090534715,"about_ca_system_score_codex":0.0016442351,"about_ca_system_score_gemma":0.00224795,"threshold_uncertainty_score":0.047879875},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.048061363,0.000032749696,0.9393679,0.00010361306,0.000036276757,0.000088054265,0.00011118201,0.0011438194,0.011055007],"genre_scores_gemma":[0.65212804,0.000066589244,0.34107742,0.00004408867,0.000019333937,0.00019795196,0.0002941613,0.00026421534,0.0059081423],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988242,0.0002880952,0.00008295259,0.00022336193,0.00042843976,0.00015296739],"domain_scores_gemma":[0.99848986,0.00063994544,0.00012153733,0.00038561766,0.0002724872,0.00009053196],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008578459,0.00045629678,0.0005061583,0.0007079628,0.00058789924,0.0014656787,0.0015362017,0.00080759096,0.0067575756],"category_scores_gemma":[0.0037073744,0.00053598307,0.0012554611,0.00048543798,0.0014081047,0.0024175397,0.0020753597,0.0013193701,0.0010928947],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023132053,0.00012646016,0.00085933955,0.0001224013,0.000057802623,0.00065097446,0.00083075935,0.13875416,0.021560557,0.80703366,0.00065807375,0.02911465],"study_design_scores_gemma":[0.000056996872,0.00008506265,0.00021378938,0.000036166108,0.000089859066,0.00017980665,0.00011685745,0.65090877,0.014783352,0.32307997,0.010415179,0.000034156128],"about_ca_topic_score_codex":0.002208225,"about_ca_topic_score_gemma":0.0024007966,"teacher_disagreement_score":0.0067575756,"about_ca_system_score_codex":0.0006791448,"about_ca_system_score_gemma":0.00088549097,"threshold_uncertainty_score":0.022606373},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.066847935,0.00040232713,0.9172683,0.00046568149,0.00012229815,0.00013403673,0.00030670047,0.012110556,0.0023423005],"genre_scores_gemma":[0.57605964,0.00034250863,0.41935775,0.00025639383,0.000045411663,0.00016187297,0.00070133957,0.001281914,0.0017931986],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9863209,0.0058933576,0.00094699836,0.0015398099,0.0045928583,0.00070613064],"domain_scores_gemma":[0.92813814,0.047564417,0.004488653,0.014933637,0.0044943285,0.00038082752],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009283315,0.0017026999,0.0013371896,0.002250441,0.0009794608,0.0020247935,0.0030644014,0.0015804606,0.004347869],"category_scores_gemma":[0.051147774,0.0012935165,0.0012707392,0.000827555,0.0017852419,0.0048552654,0.0030932084,0.0021292607,0.0011611482],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0019918003,0.0005132819,0.027795337,0.0021156683,0.00034100242,0.004402796,0.0035378372,0.16177835,0.0724933,0.11769458,0.011624096,0.595712],"study_design_scores_gemma":[0.00026735786,0.0006343511,0.0031487467,0.000849702,0.0003213742,0.0021744913,0.00059697573,0.64705056,0.17765531,0.12993936,0.037173446,0.00018826962],"about_ca_topic_score_codex":0.00096858665,"about_ca_topic_score_gemma":0.0014519824,"teacher_disagreement_score":0.009283315,"about_ca_system_score_codex":0.0010486022,"about_ca_system_score_gemma":0.0023855667,"threshold_uncertainty_score":0.04909545},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24544962,0.00029010704,0.71287227,0.0009315547,0.00016971312,0.00018022314,0.0005182312,0.0011428667,0.038445495],"genre_scores_gemma":[0.94054353,0.00025743165,0.049478017,0.0002577053,0.00022919364,0.00016132416,0.0007087843,0.00037505396,0.007988997],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9950303,0.00072948175,0.0004570713,0.0010255936,0.0019764819,0.0007810188],"domain_scores_gemma":[0.9887227,0.005117361,0.001403424,0.00188792,0.0021059592,0.000762582],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002219093,0.00065125455,0.0010157073,0.0027438055,0.0018028892,0.0056890724,0.0021880777,0.0019426385,0.0071525956],"category_scores_gemma":[0.013546148,0.0008586498,0.0017060505,0.00266646,0.004824208,0.01399074,0.0047337892,0.004596302,0.00064118596],"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.000066516215,0.000057771384,0.000491016,0.000041334897,0.000012633968,0.00014054596,0.00049142004,0.0021170059,0.0015444221,0.9877335,0.00030804693,0.0069958335],"study_design_scores_gemma":[0.000020437397,0.000042719355,0.00027988892,0.000019489527,0.000025591544,0.00019523638,0.0002233564,0.014270524,0.0019533893,0.98053795,0.002409581,0.000021858503],"about_ca_topic_score_codex":0.0009016383,"about_ca_topic_score_gemma":0.00082007935,"teacher_disagreement_score":0.0071525956,"about_ca_system_score_codex":0.0016278187,"about_ca_system_score_gemma":0.0012243645,"threshold_uncertainty_score":0.023927808},"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":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033392783,0.003658926,0.54489726,0.0012157199,0.0011922899,0.0007879773,0.017055536,0.3266084,0.07119118],"genre_scores_gemma":[0.32878157,0.002791378,0.47372967,0.0011096448,0.0001947061,0.0018690493,0.08491301,0.08540942,0.021201575],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9892959,0.0041229203,0.0011491742,0.0010884542,0.003502498,0.0008411002],"domain_scores_gemma":[0.99202615,0.0031090034,0.00035676273,0.0025143728,0.0015279821,0.00046560614],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0070283655,0.001814658,0.0013095052,0.0031616825,0.0007579593,0.0035232226,0.005240604,0.0013586481,0.014545472],"category_scores_gemma":[0.019873833,0.00111742,0.0014062264,0.0026766758,0.001096402,0.004179526,0.005243197,0.003314498,0.007293443],"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.0021115188,0.0011381988,0.010430086,0.0045844815,0.0006004711,0.00067477,0.0010238446,0.14350338,0.01006298,0.18921095,0.30645025,0.3302091],"study_design_scores_gemma":[0.00053976005,0.00044250107,0.0032603708,0.00084109,0.000121654375,0.000525226,0.0003762276,0.37362233,0.02416371,0.10107146,0.49475303,0.00028269092],"about_ca_topic_score_codex":0.003347312,"about_ca_topic_score_gemma":0.0029517259,"teacher_disagreement_score":0.014545472,"about_ca_system_score_codex":0.0012310891,"about_ca_system_score_gemma":0.0026658906,"threshold_uncertainty_score":0.048659444},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.107624665,0.00006064288,0.8882801,0.00009323415,0.00003085039,0.000068607835,0.00009979554,0.0010959979,0.002646216],"genre_scores_gemma":[0.8990574,0.00010821723,0.098472536,0.000057576326,0.000020679005,0.00015637201,0.00015388193,0.00009416882,0.0018791372],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988576,0.0002953176,0.000107006934,0.00023994065,0.0003587599,0.00014125575],"domain_scores_gemma":[0.9976921,0.0015194839,0.00023097474,0.00022713264,0.00022666891,0.000103679056],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012642394,0.0005067144,0.000630738,0.0005714976,0.00054070354,0.0010847951,0.0010620716,0.00065284886,0.002193242],"category_scores_gemma":[0.00380912,0.00032688485,0.0013115067,0.00044549734,0.0017537101,0.0021738985,0.0009550087,0.0009043993,0.00022768982],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039799087,0.00010056232,0.001338567,0.00010723543,0.000052063435,0.00021623359,0.00028038575,0.581968,0.018003227,0.3812331,0.0003623202,0.015940255],"study_design_scores_gemma":[0.000033846893,0.00006758357,0.00010235702,0.000009802945,0.000014986656,0.000029787052,0.000014942787,0.8954327,0.012369691,0.09114674,0.0007623246,0.000015124366],"about_ca_topic_score_codex":0.002032621,"about_ca_topic_score_gemma":0.0014808367,"teacher_disagreement_score":0.002193242,"about_ca_system_score_codex":0.0012083391,"about_ca_system_score_gemma":0.0009793241,"threshold_uncertainty_score":0.008767128},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006868801,0.001857046,0.9675909,0.0005651768,0.0003009046,0.0001824426,0.00031692753,0.00053205417,0.021785617],"genre_scores_gemma":[0.29568744,0.0048750904,0.67232066,0.0008141858,0.0009366272,0.0013505644,0.0013223912,0.0007264192,0.021966636],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971307,0.0008105605,0.00024588205,0.00045611052,0.0011602065,0.00019652302],"domain_scores_gemma":[0.9948019,0.003735047,0.00037644256,0.00045516356,0.00045266192,0.00017890608],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023955626,0.0016471643,0.0009747776,0.0032134326,0.0011053986,0.0028817013,0.0016446908,0.0014381423,0.009787304],"category_scores_gemma":[0.0071002967,0.00072066905,0.0022650084,0.0018842708,0.002843344,0.00464944,0.0023831145,0.0053027854,0.0025931997],"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.000022980968,0.000018250976,0.00007514043,0.00013009191,0.000015149173,0.00021030768,0.0002106419,0.0086452225,0.0017139419,0.97539604,0.0007487719,0.012813404],"study_design_scores_gemma":[0.000014126858,0.000018116167,0.000060036717,0.000057072742,0.0000130194485,0.00012343441,0.000036347872,0.03265122,0.001181195,0.95379466,0.012033704,0.00001702587],"about_ca_topic_score_codex":0.0012342575,"about_ca_topic_score_gemma":0.0017437123,"teacher_disagreement_score":0.009787304,"about_ca_system_score_codex":0.0025732534,"about_ca_system_score_gemma":0.0015178191,"threshold_uncertainty_score":0.032741725},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023128402,0.00008794988,0.99621046,0.00011244906,0.000017643519,0.000029096458,0.000070845774,0.00015451046,0.0010040777],"genre_scores_gemma":[0.36685747,0.00055843306,0.6271933,0.00021275133,0.00006679952,0.00043692495,0.00036283786,0.000151098,0.004160421],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99723923,0.0011159828,0.00017354547,0.00057997974,0.0007027787,0.00018842153],"domain_scores_gemma":[0.9956025,0.0026649951,0.00049653044,0.0007186681,0.0003776731,0.00013967151],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002431121,0.001051708,0.0008052618,0.00067106646,0.00038561504,0.001537161,0.0015409323,0.0010613373,0.0048092846],"category_scores_gemma":[0.008455648,0.0006834226,0.001287235,0.0007802842,0.0024732805,0.0036913184,0.0021774066,0.0027841786,0.0005480136],"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.000041162333,0.000023153108,0.0002840992,0.00012509327,0.000035290635,0.000101469814,0.00009934991,0.4104879,0.00094398664,0.5720398,0.00065243966,0.0151662985],"study_design_scores_gemma":[0.000011854312,0.000027479768,0.00005321466,0.000020170462,0.000011203631,0.000036710357,0.000019318655,0.7105904,0.0009234182,0.28454965,0.003743998,0.00001255693],"about_ca_topic_score_codex":0.0024103092,"about_ca_topic_score_gemma":0.0022292275,"teacher_disagreement_score":0.0048092846,"about_ca_system_score_codex":0.0016655474,"about_ca_system_score_gemma":0.0018772369,"threshold_uncertainty_score":0.016088665},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13419065,0.00011733502,0.8570452,0.00022202406,0.000099899305,0.00020604998,0.000219643,0.0043108375,0.0035883652],"genre_scores_gemma":[0.7274046,0.00020029405,0.26830795,0.00019047012,0.0000561959,0.00041619723,0.00059699407,0.00087773864,0.0019495456],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9803422,0.005743573,0.0017580386,0.0021332079,0.008352718,0.0016702084],"domain_scores_gemma":[0.9333877,0.033435505,0.006468837,0.018130187,0.007832012,0.0007458933],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.013486591,0.0009789258,0.0011862213,0.0018351357,0.0014486547,0.004250874,0.0026040445,0.0023863656,0.0021455705],"category_scores_gemma":[0.050942656,0.0015645764,0.0026634575,0.0010395235,0.004835239,0.0065843207,0.004306115,0.0021007792,0.0007597585],"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.0012100411,0.00054307905,0.030602392,0.00090623915,0.0004442385,0.0031275153,0.004303634,0.23410112,0.13526003,0.48285654,0.0022787403,0.10436639],"study_design_scores_gemma":[0.00021072147,0.00046698886,0.0022998836,0.00021345359,0.00024776827,0.0008052063,0.00049376494,0.5655861,0.2578129,0.15736821,0.014330722,0.0001642364],"about_ca_topic_score_codex":0.0038148349,"about_ca_topic_score_gemma":0.002837647,"teacher_disagreement_score":0.013486591,"about_ca_system_score_codex":0.0020567207,"about_ca_system_score_gemma":0.0040357616,"threshold_uncertainty_score":0.071324766},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017947776,0.00031955956,0.9764615,0.00023633531,0.00008962461,0.00019785651,0.00016063392,0.0013060299,0.0032806718],"genre_scores_gemma":[0.36259028,0.00095099275,0.6299428,0.00024367723,0.000073078736,0.00075715233,0.00058292795,0.00029951564,0.0045594876],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98981476,0.0028441055,0.0009801259,0.0008309348,0.0049339384,0.00059615204],"domain_scores_gemma":[0.99299145,0.0035475953,0.0005750756,0.0014843104,0.001223997,0.00017761947],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0055180984,0.0007359918,0.00063475437,0.0011778573,0.0009643298,0.00272964,0.0020311214,0.0019064512,0.0014633483],"category_scores_gemma":[0.013457105,0.0010010559,0.0018458264,0.0009738272,0.003008688,0.002527084,0.002255539,0.0020304024,0.00053412106],"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.0001642286,0.00015730066,0.0014956756,0.00056798826,0.00012512298,0.0013540658,0.00096695626,0.15182567,0.0305259,0.75650537,0.0017477816,0.05456395],"study_design_scores_gemma":[0.00017817692,0.00011981575,0.0005314057,0.00022337484,0.000118456905,0.0004925237,0.00021465572,0.6794486,0.06410652,0.21254683,0.041943334,0.00007631082],"about_ca_topic_score_codex":0.0058266157,"about_ca_topic_score_gemma":0.004705158,"teacher_disagreement_score":0.0058266157,"about_ca_system_score_codex":0.0015033573,"about_ca_system_score_gemma":0.0047418857,"threshold_uncertainty_score":0.029182792},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012970105,0.00007962625,0.97680795,0.00020369026,0.00003604176,0.00008572028,0.00018996814,0.0085467,0.0010802593],"genre_scores_gemma":[0.25672528,0.00014864742,0.7393508,0.00026635424,0.00005159752,0.00046453316,0.0005648391,0.0012280617,0.0011998237],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98649406,0.005268722,0.0011644375,0.002396762,0.0034344045,0.0012415847],"domain_scores_gemma":[0.96393704,0.025431698,0.0024799092,0.0064165792,0.0014159789,0.0003188918],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008666357,0.0011270038,0.0016805034,0.0016852338,0.0010675539,0.0023135396,0.0036107718,0.0017187864,0.0053092483],"category_scores_gemma":[0.037704453,0.0013285195,0.0025064885,0.0015931702,0.0027744728,0.006478296,0.0034742714,0.0028151283,0.000979339],"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.0012020263,0.0005141304,0.0035597307,0.0006370801,0.00029258474,0.00030967672,0.00025520413,0.61718816,0.013093454,0.20493668,0.004985916,0.1530253],"study_design_scores_gemma":[0.00029344836,0.00009905361,0.00014557382,0.000042238287,0.000050191462,0.000079304795,0.000014551253,0.90297276,0.0094900355,0.08441717,0.0023503567,0.000045315457],"about_ca_topic_score_codex":0.006095115,"about_ca_topic_score_gemma":0.009378714,"teacher_disagreement_score":0.008666357,"about_ca_system_score_codex":0.0026799506,"about_ca_system_score_gemma":0.0052861655,"threshold_uncertainty_score":0.045832574},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33125487,0.0028568206,0.60441595,0.012203058,0.00020495834,0.00035647527,0.0015782715,0.0007166983,0.04641292],"genre_scores_gemma":[0.87687,0.0026750697,0.1120054,0.0006424019,0.00042591253,0.00040999742,0.0016505619,0.00029679827,0.0050239014],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9945721,0.002231083,0.00029349726,0.0008948638,0.001404912,0.00060351315],"domain_scores_gemma":[0.87712175,0.11753934,0.001678817,0.0018894338,0.0012697162,0.0005010382],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0047304877,0.00085176155,0.0013237258,0.0012485321,0.0016103343,0.00512824,0.0017919273,0.0017062486,0.0062323636],"category_scores_gemma":[0.04298159,0.00077449484,0.0022625055,0.0018783584,0.0038871032,0.010573816,0.0025843128,0.0046763415,0.00049156044],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008507824,0.0003222502,0.0034455832,0.0008437583,0.00015828143,0.0005122936,0.00096490985,0.58457005,0.0040721637,0.34200612,0.0056916573,0.05656226],"study_design_scores_gemma":[0.000085829226,0.00004408787,0.0008813661,0.00007699679,0.00006617074,0.0001154475,0.00015079524,0.49794108,0.0017628381,0.4972165,0.0016223153,0.000036623263],"about_ca_topic_score_codex":0.0069951224,"about_ca_topic_score_gemma":0.006329069,"teacher_disagreement_score":0.0069951224,"about_ca_system_score_codex":0.0041155308,"about_ca_system_score_gemma":0.0026277732,"threshold_uncertainty_score":0.029860437},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036602706,0.00005314432,0.9605004,0.00012003173,0.000015407728,0.00011531257,0.00009877506,0.00097013236,0.0015240354],"genre_scores_gemma":[0.39471945,0.0001322053,0.60127467,0.00011092108,0.000017524573,0.00028726403,0.00057784235,0.00029939867,0.0025807822],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99439573,0.0018794325,0.00057118444,0.0008441873,0.0018462606,0.00046323825],"domain_scores_gemma":[0.9872285,0.005640464,0.00090724364,0.004245615,0.0016653015,0.0003128934],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004931708,0.00078713585,0.000840826,0.0015940989,0.0011328431,0.00214246,0.002451977,0.0011165102,0.0024831034],"category_scores_gemma":[0.016458848,0.00094432884,0.002671444,0.0010041604,0.002195061,0.0048691593,0.0049718013,0.0019408208,0.0005151603],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005860697,0.00025274535,0.008190339,0.00059727853,0.00024970787,0.0012610072,0.004370173,0.428552,0.04776376,0.36652547,0.0013627193,0.14028876],"study_design_scores_gemma":[0.00003626349,0.00021041559,0.00064061757,0.000088274,0.00016238613,0.00020941005,0.0005015284,0.7514014,0.035468712,0.20261613,0.008603143,0.00006171552],"about_ca_topic_score_codex":0.0043023797,"about_ca_topic_score_gemma":0.006044613,"teacher_disagreement_score":0.004931708,"about_ca_system_score_codex":0.0015173359,"about_ca_system_score_gemma":0.002760039,"threshold_uncertainty_score":0.026081622},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026283678,0.001544959,0.9488677,0.0059935935,0.00020325648,0.0003540715,0.00079942174,0.00045253432,0.015500824],"genre_scores_gemma":[0.34577468,0.004590786,0.6335754,0.0017991335,0.0007950734,0.00090810185,0.0022117894,0.0005062023,0.009838897],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9844358,0.007217756,0.0013927424,0.0021302993,0.0037524514,0.0010707997],"domain_scores_gemma":[0.8988146,0.08855272,0.0039684926,0.00428781,0.0035736808,0.00080266385],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009825457,0.0016266234,0.0018243636,0.0021777807,0.0030714076,0.006614729,0.002854351,0.0030758407,0.006121113],"category_scores_gemma":[0.055076636,0.001943924,0.002345143,0.0056263,0.005850296,0.021089496,0.0051499032,0.0070961127,0.0010454875],"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.00016710575,0.00011081268,0.00071058056,0.00052115205,0.000058755322,0.00094392383,0.00061548274,0.16103682,0.0021593778,0.79088753,0.0038596564,0.03892882],"study_design_scores_gemma":[0.00009012471,0.00007219196,0.0002242516,0.00020317723,0.000053768777,0.0005661089,0.00029325945,0.24417333,0.004473339,0.73110414,0.018690027,0.00005634661],"about_ca_topic_score_codex":0.011298701,"about_ca_topic_score_gemma":0.00974946,"teacher_disagreement_score":0.011298701,"about_ca_system_score_codex":0.0048763086,"about_ca_system_score_gemma":0.0039324104,"threshold_uncertainty_score":0.051962554},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014831751,0.00006553858,0.97561467,0.00010222489,0.000036134552,0.00012623811,0.00012523327,0.0012691332,0.007829065],"genre_scores_gemma":[0.3243844,0.00026324147,0.6641281,0.00013639645,0.000020628933,0.00037924893,0.0004332635,0.00083375775,0.0094209425],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981248,0.0005409066,0.00014576576,0.00046247983,0.00042486872,0.00030114633],"domain_scores_gemma":[0.99591917,0.0020974984,0.0004175629,0.0009814197,0.00041228865,0.00017203801],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019076277,0.0011278861,0.0009124511,0.001112981,0.0009962275,0.0036300146,0.002713691,0.001979943,0.008400873],"category_scores_gemma":[0.006354854,0.0013951296,0.0022459999,0.0012775254,0.0022258656,0.005186937,0.0023681936,0.0022374133,0.0016473422],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022867009,0.00015340402,0.0014088904,0.00024961605,0.00007073493,0.0007748938,0.0006578571,0.3316738,0.014328134,0.6190818,0.0010962867,0.030275831],"study_design_scores_gemma":[0.0000736373,0.000048595775,0.00017568756,0.0000545636,0.00007680588,0.00016733476,0.00013935962,0.82605743,0.013487471,0.14462838,0.0150311515,0.00005965128],"about_ca_topic_score_codex":0.009677315,"about_ca_topic_score_gemma":0.016230837,"teacher_disagreement_score":0.009677315,"about_ca_system_score_codex":0.0011723874,"about_ca_system_score_gemma":0.0019270814,"threshold_uncertainty_score":0.028103769},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3226745,0.00020666668,0.63547766,0.0024890762,0.0001321542,0.0003428061,0.0015075667,0.0014843637,0.035685074],"genre_scores_gemma":[0.9304809,0.00011077576,0.06271195,0.00023761675,0.00010529288,0.00015106477,0.0011170259,0.00030171507,0.004783765],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979231,0.00054131384,0.00017062071,0.00047662275,0.00051436416,0.00037400474],"domain_scores_gemma":[0.9869183,0.008797992,0.0012295513,0.0015222819,0.0010263877,0.0005055191],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020526855,0.0008448553,0.0011534233,0.0017534666,0.0014911026,0.0045984117,0.0024055382,0.001429998,0.008885084],"category_scores_gemma":[0.013992122,0.0010047624,0.00162704,0.0019564359,0.0036112438,0.009996331,0.0028277377,0.0041888505,0.0005556009],"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.00022207103,0.00010879069,0.0015250425,0.00020221321,0.00004065281,0.00035145704,0.0007610123,0.034278445,0.0030912608,0.94364184,0.002611136,0.013166042],"study_design_scores_gemma":[0.000030184581,0.000034510886,0.0002693362,0.000031251067,0.000029573166,0.00015570495,0.00023710584,0.1537082,0.0021540476,0.84160197,0.0017216733,0.000026398258],"about_ca_topic_score_codex":0.0021173086,"about_ca_topic_score_gemma":0.0029221547,"teacher_disagreement_score":0.008885084,"about_ca_system_score_codex":0.0018375228,"about_ca_system_score_gemma":0.0012100413,"threshold_uncertainty_score":0.029723585},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010894614,0.0001554074,0.9724166,0.00030894074,0.000110699206,0.00011181305,0.00062531576,0.012752214,0.0026244305],"genre_scores_gemma":[0.30532452,0.00046041934,0.68490934,0.0006012295,0.000094051255,0.00030618403,0.0022166113,0.0013044965,0.0047830697],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9948566,0.0015911661,0.0004796264,0.0007208609,0.001991072,0.0003606024],"domain_scores_gemma":[0.99183005,0.0039869705,0.00062523806,0.0023226368,0.0010598918,0.0001752126],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039458172,0.00073262065,0.00080971763,0.0016970622,0.00074200355,0.0024324222,0.002025134,0.0010898676,0.0036676337],"category_scores_gemma":[0.013715778,0.00072162715,0.0014487319,0.0010641803,0.0016503966,0.0035794484,0.00225576,0.002476837,0.000776223],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009771868,0.0005186663,0.01115743,0.0015856876,0.00046909798,0.0017709271,0.0009124406,0.25822878,0.06481721,0.33128473,0.041764837,0.28651312],"study_design_scores_gemma":[0.0003351346,0.00028818214,0.0010058497,0.00017000477,0.00028735813,0.00064859726,0.00009416559,0.8107324,0.06859154,0.07249948,0.045255978,0.00009130167],"about_ca_topic_score_codex":0.0048714653,"about_ca_topic_score_gemma":0.0049651633,"teacher_disagreement_score":0.0048714653,"about_ca_system_score_codex":0.0013158552,"about_ca_system_score_gemma":0.0031467478,"threshold_uncertainty_score":0.020867705},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018434514,0.00005727575,0.9931242,0.00007261479,0.000020334048,0.00014303932,0.00016648421,0.0038895446,0.00068318186],"genre_scores_gemma":[0.064025074,0.00013211076,0.93313307,0.00010459944,0.000023139075,0.0004456311,0.0006637751,0.00045783774,0.0010147921],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967603,0.0014257364,0.00019761916,0.00040461018,0.0010061843,0.00020552514],"domain_scores_gemma":[0.9953607,0.002984319,0.00033385467,0.0008519637,0.00040543624,0.00006371376],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030660057,0.0014607558,0.0010262091,0.0022600966,0.00087825453,0.0016220132,0.0029582714,0.0012148891,0.0068770754],"category_scores_gemma":[0.007494408,0.0011086572,0.0020754011,0.0011102136,0.001804292,0.002292992,0.002406724,0.0019986862,0.0015400331],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003133032,0.00040857392,0.0032546704,0.0012830843,0.0003415331,0.0007160896,0.00038957276,0.3005301,0.029222678,0.18640977,0.012871845,0.46425876],"study_design_scores_gemma":[0.000120416305,0.0001139444,0.00025271112,0.000091110924,0.00006109441,0.0002804758,0.000041376374,0.8929367,0.022673508,0.06794439,0.015444356,0.000039963394],"about_ca_topic_score_codex":0.0027155406,"about_ca_topic_score_gemma":0.0041970233,"teacher_disagreement_score":0.0068770754,"about_ca_system_score_codex":0.0012436126,"about_ca_system_score_gemma":0.0034202472,"threshold_uncertainty_score":0.023006082},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032844853,0.000058120946,0.9602982,0.00014447697,0.000052511507,0.00013168948,0.00012476521,0.004643016,0.0017023718],"genre_scores_gemma":[0.5754927,0.00011834688,0.41915363,0.00017859894,0.00005786217,0.0003814821,0.0006745096,0.0021446228,0.0017982901],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99167436,0.0026803985,0.00057568814,0.0011681011,0.0026988138,0.0012027184],"domain_scores_gemma":[0.9526463,0.034377053,0.0019081491,0.00801938,0.002556136,0.0004930842],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006569622,0.0014395487,0.0016787769,0.00235592,0.001742554,0.00312718,0.0036728368,0.001763145,0.006071902],"category_scores_gemma":[0.028422205,0.0017490383,0.004391899,0.0015872681,0.0034849294,0.006583129,0.006020439,0.0046366802,0.0011495332],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013953184,0.00056180736,0.006737729,0.000656427,0.00024832832,0.0005523106,0.0013263061,0.39990526,0.025924925,0.362185,0.0036715567,0.19683501],"study_design_scores_gemma":[0.000119547534,0.00010184266,0.00029005995,0.00006644748,0.00012567869,0.000059043898,0.00007642604,0.84855145,0.021793764,0.12668154,0.002074643,0.000059473117],"about_ca_topic_score_codex":0.005752826,"about_ca_topic_score_gemma":0.007040136,"teacher_disagreement_score":0.006569622,"about_ca_system_score_codex":0.0029172364,"about_ca_system_score_gemma":0.0037287837,"threshold_uncertainty_score":0.034743905},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006569308,0.000059495807,0.9870301,0.00021378665,0.000055842065,0.00025806343,0.00018281068,0.001686303,0.003944242],"genre_scores_gemma":[0.16436327,0.00021900122,0.82902795,0.0002155893,0.00005176196,0.00064890954,0.0007936754,0.0006955174,0.0039843423],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98879623,0.0037433275,0.0022689817,0.0012167533,0.0034232843,0.00055150036],"domain_scores_gemma":[0.9781075,0.0106198825,0.001498888,0.0052425885,0.004129627,0.00040154482],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0069895,0.0008241027,0.0005817572,0.0015295445,0.0009874898,0.0020173956,0.0014265684,0.001542614,0.0060567204],"category_scores_gemma":[0.02157836,0.0009491552,0.0018810764,0.0012206767,0.0035143094,0.0045195566,0.0029009779,0.0026870319,0.0016471816],"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.00017105686,0.00007191279,0.0020918588,0.00040810806,0.000044349672,0.00072238955,0.0017007479,0.015620691,0.010714695,0.88100594,0.003253192,0.084195085],"study_design_scores_gemma":[0.00016084152,0.00021541431,0.0005865741,0.00028706426,0.00010474885,0.0010787994,0.00053813873,0.10724279,0.029432602,0.72606426,0.13419922,0.000089530324],"about_ca_topic_score_codex":0.002566311,"about_ca_topic_score_gemma":0.0026430818,"teacher_disagreement_score":0.0069895,"about_ca_system_score_codex":0.0011312842,"about_ca_system_score_gemma":0.0018312791,"threshold_uncertainty_score":0.036964417},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0201959,0.000051756924,0.974685,0.000081884675,0.000023799137,0.00006973761,0.00016110914,0.0021479805,0.0025827885],"genre_scores_gemma":[0.5487088,0.0001888753,0.4440518,0.00016770688,0.000026379052,0.00026103063,0.00056475255,0.0006019433,0.005428739],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990865,0.00026996434,0.00010246378,0.00011942363,0.00031660305,0.000105116545],"domain_scores_gemma":[0.9983431,0.0010763579,0.00015328529,0.00024509736,0.00014924942,0.00003292769],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010378718,0.00040830267,0.00028928468,0.00062311505,0.00027815186,0.0014926362,0.00068138534,0.00064929895,0.006104276],"category_scores_gemma":[0.0026488488,0.0005569405,0.0005375074,0.00043184985,0.001047643,0.0014773492,0.00075479614,0.0010027736,0.0011792599],"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.0004478378,0.00013961566,0.0013379126,0.0005197373,0.000048421818,0.0007137078,0.00080560235,0.07500237,0.051055476,0.7764531,0.0020408903,0.091435276],"study_design_scores_gemma":[0.0003663684,0.00031363041,0.00065428804,0.00024248174,0.00018190102,0.00037629905,0.000120309,0.44935796,0.16373235,0.35706076,0.02750821,0.00008548549],"about_ca_topic_score_codex":0.0017316806,"about_ca_topic_score_gemma":0.0018071247,"teacher_disagreement_score":0.006104276,"about_ca_system_score_codex":0.00052578654,"about_ca_system_score_gemma":0.0007455432,"threshold_uncertainty_score":0.020420909},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00059278467,0.00007770761,0.9958331,0.00006407275,0.00023741479,0.00007773926,0.0000646734,0.0013277214,0.0017246912],"genre_scores_gemma":[0.023922158,0.00029514421,0.9650584,0.00021357728,0.00017333218,0.0005369804,0.00032757202,0.0010363299,0.008436519],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970107,0.00043184063,0.00028236845,0.00087294285,0.0012646593,0.00013736784],"domain_scores_gemma":[0.9973985,0.00093311275,0.0001541244,0.00081411604,0.0006147492,0.00008545612],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016921794,0.0011800465,0.0008343057,0.0017530759,0.00093027257,0.0017016885,0.0015895442,0.0010990865,0.008646065],"category_scores_gemma":[0.0052784616,0.000868736,0.0025855396,0.0010866745,0.0016303034,0.0026064236,0.0020161632,0.0034380644,0.0031420742],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025186007,0.00019435101,0.0006985655,0.0006017384,0.00017162968,0.0007125334,0.00095754565,0.015106709,0.06687482,0.3377012,0.015141098,0.561588],"study_design_scores_gemma":[0.00025070616,0.00041046026,0.00048613493,0.00018862239,0.00027764484,0.0031085007,0.00022785012,0.17138146,0.108121455,0.26543754,0.44989842,0.0002113204],"about_ca_topic_score_codex":0.0010349498,"about_ca_topic_score_gemma":0.00092631154,"teacher_disagreement_score":0.008646065,"about_ca_system_score_codex":0.0006995132,"about_ca_system_score_gemma":0.0013018599,"threshold_uncertainty_score":0.028923988},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00343847,0.000054970384,0.9939984,0.00009447324,0.000020134532,0.000047861005,0.00006738305,0.0010269531,0.0012512901],"genre_scores_gemma":[0.1714889,0.00027208307,0.8249847,0.00020662778,0.000039271257,0.00020062819,0.00026715483,0.00035554243,0.002185137],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99686617,0.00111408,0.00020642545,0.00044328038,0.001065749,0.00030437406],"domain_scores_gemma":[0.9944938,0.0044429875,0.00023940351,0.0004996295,0.0002594946,0.00006467875],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034833564,0.0006992392,0.0007046309,0.0015992001,0.0006659812,0.0018954924,0.0014985572,0.00062820147,0.0035108095],"category_scores_gemma":[0.005733328,0.00049747777,0.0015115336,0.0007922854,0.0020430603,0.0032645515,0.002488844,0.0020208796,0.0007085429],"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.00021671582,0.00012548793,0.0008061474,0.00046985893,0.00008339814,0.0006197293,0.00054520916,0.0889579,0.010971924,0.7842718,0.0020147832,0.11091705],"study_design_scores_gemma":[0.0001015612,0.00008183531,0.00016692872,0.000107620544,0.0000891862,0.0001745803,0.00008669717,0.38551855,0.035443004,0.56572366,0.012451424,0.00005493156],"about_ca_topic_score_codex":0.0016204772,"about_ca_topic_score_gemma":0.0023652157,"teacher_disagreement_score":0.0035108095,"about_ca_system_score_codex":0.0013217322,"about_ca_system_score_gemma":0.0018509165,"threshold_uncertainty_score":0.018421948},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02239731,0.00015909663,0.9658521,0.000115412826,0.00002497718,0.00014888542,0.00037401656,0.010213729,0.0007145454],"genre_scores_gemma":[0.3719326,0.00013202152,0.623518,0.00008251152,0.000026430125,0.00021804617,0.0018358686,0.0007530618,0.0015016086],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997656,0.00041987214,0.00018755617,0.00055071467,0.00097594806,0.00020985332],"domain_scores_gemma":[0.9942464,0.0017277484,0.0010233812,0.0016603452,0.0011776816,0.00016454294],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001795243,0.0013494085,0.0012134215,0.0046051457,0.0010581097,0.0011856931,0.0022638503,0.0011634916,0.0025750557],"category_scores_gemma":[0.009319372,0.0005378592,0.001256688,0.0021398244,0.00085704203,0.0017819436,0.0016339943,0.0014054492,0.0012855093],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005249583,0.00033349657,0.017952178,0.00041025164,0.0002059309,0.000438885,0.0009155815,0.31830665,0.028729444,0.018703775,0.011231548,0.6022473],"study_design_scores_gemma":[0.0000163804,0.00008622844,0.0017022385,0.000031948246,0.000028465185,0.000192477,0.00010074571,0.9660307,0.018418565,0.009918545,0.0034411307,0.000032517997],"about_ca_topic_score_codex":0.005006563,"about_ca_topic_score_gemma":0.008926924,"teacher_disagreement_score":0.005006563,"about_ca_system_score_codex":0.0013116179,"about_ca_system_score_gemma":0.0017561796,"threshold_uncertainty_score":0.00995481},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007486146,0.000121327226,0.99031115,0.00009415933,0.000017636085,0.00005226182,0.000016031123,0.00024177654,0.0016594342],"genre_scores_gemma":[0.26158816,0.0004174108,0.73587805,0.00013759683,0.00004140881,0.00037767118,0.000101386926,0.000099663455,0.0013586823],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99543935,0.0020756598,0.00032832066,0.00040708124,0.0014809943,0.00026868092],"domain_scores_gemma":[0.99348664,0.0044486374,0.000535011,0.0007911415,0.00063163246,0.00010694904],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005258764,0.00078627,0.0005648163,0.0023670695,0.0012768594,0.0020284797,0.0014038933,0.001120869,0.0009506407],"category_scores_gemma":[0.0072827456,0.000521734,0.001668833,0.0012157282,0.0047119716,0.0041642347,0.002469809,0.0015800701,0.00018960294],"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.000062072744,0.000046027304,0.001327622,0.00019948704,0.000058855334,0.00029232036,0.001039238,0.050069753,0.0054022805,0.89968026,0.0003911,0.041430898],"study_design_scores_gemma":[0.000058183414,0.00025833747,0.0005226086,0.00021530093,0.00011881172,0.00042745488,0.00034244545,0.3436354,0.02319816,0.60066104,0.030462379,0.00009983258],"about_ca_topic_score_codex":0.0038293754,"about_ca_topic_score_gemma":0.0028556243,"teacher_disagreement_score":0.005258764,"about_ca_system_score_codex":0.0013027188,"about_ca_system_score_gemma":0.0030146656,"threshold_uncertainty_score":0.027811348},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017583165,0.00006802863,0.9778782,0.000085463515,0.000029178053,0.00017674993,0.00011701256,0.0020786675,0.0019834598],"genre_scores_gemma":[0.49068102,0.000106046864,0.50408334,0.00020048762,0.00005431981,0.00038169333,0.0003738712,0.00037546427,0.0037436697],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974353,0.0005119182,0.0001703179,0.00053733255,0.0011122647,0.00023295241],"domain_scores_gemma":[0.9942842,0.0025962295,0.00057401,0.0012508064,0.0011006959,0.0001940915],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017466872,0.0013120995,0.0015255088,0.0036456855,0.0011400274,0.0018844778,0.0029208253,0.0015762129,0.0048707672],"category_scores_gemma":[0.0061017075,0.00075242086,0.0018000441,0.0012786832,0.0018166889,0.0040202285,0.0021817114,0.0013702309,0.0012172846],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002242316,0.000831946,0.018670056,0.001022952,0.0004417621,0.0011949568,0.0007634176,0.10702069,0.116269276,0.14007176,0.0068439855,0.6046269],"study_design_scores_gemma":[0.000064015025,0.00025488914,0.0018003016,0.000051625044,0.00010303217,0.00046060845,0.00012375493,0.8856217,0.045282967,0.063069716,0.003088456,0.00007896813],"about_ca_topic_score_codex":0.0011622249,"about_ca_topic_score_gemma":0.0020426577,"teacher_disagreement_score":0.0048707672,"about_ca_system_score_codex":0.00081030774,"about_ca_system_score_gemma":0.0010310335,"threshold_uncertainty_score":0.01629436},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007718243,0.00016879008,0.98500896,0.0002566014,0.000096964424,0.00011561773,0.00017704256,0.0022023104,0.0042554103],"genre_scores_gemma":[0.3545472,0.00051910296,0.6325975,0.00051398156,0.00031049433,0.00045763276,0.00067618897,0.0010024705,0.0093754465],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99343973,0.0020190843,0.0005084312,0.0010698892,0.0024779066,0.0004850213],"domain_scores_gemma":[0.9955179,0.0021229438,0.00041363807,0.00091174594,0.0008479175,0.00018588825],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003482827,0.0006979692,0.0009237274,0.0012348867,0.0007868726,0.0019113809,0.0018458528,0.0010336156,0.0045254705],"category_scores_gemma":[0.007418166,0.00053259445,0.002943129,0.0009838049,0.0037888703,0.0029225035,0.0019648916,0.0027157215,0.0018678496],"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.00021846428,0.00015379107,0.0008106434,0.00039146177,0.000114449685,0.00084248977,0.0005940137,0.07002414,0.015507978,0.8250031,0.0030268738,0.083312675],"study_design_scores_gemma":[0.00011647618,0.00018697204,0.00022462744,0.00008086002,0.00012121521,0.00057686545,0.00008196968,0.30053067,0.025281124,0.64808744,0.024611434,0.00010036165],"about_ca_topic_score_codex":0.0028860772,"about_ca_topic_score_gemma":0.0014296678,"teacher_disagreement_score":0.0045254705,"about_ca_system_score_codex":0.0010040164,"about_ca_system_score_gemma":0.0019244261,"threshold_uncertainty_score":0.018419206},"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":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015181799,0.0003269234,0.30257815,0.004536621,0.0012389611,0.0004936782,0.13804479,0.21299094,0.3382719],"genre_scores_gemma":[0.021792568,0.0011609768,0.19270475,0.0023828764,0.0006108474,0.0009486168,0.22893037,0.120061934,0.43140712],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99924904,0.00015389462,0.000087217144,0.000098033284,0.00033694075,0.00007481288],"domain_scores_gemma":[0.9975108,0.00068725966,0.00017070938,0.0006725371,0.0007494276,0.00020925405],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0011804692,0.0014950495,0.0009478241,0.0023358124,0.00095728436,0.005406967,0.0028745732,0.0022524954,0.50413173],"category_scores_gemma":[0.0044731554,0.0012785424,0.0009026083,0.0029674075,0.0006951579,0.004576957,0.001973717,0.0026928,0.42707],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010258401,0.00004736834,0.0001509077,0.0002533208,0.000012627986,0.00006749898,0.00009682522,0.00077046466,0.002284096,0.03225199,0.9082212,0.055741116],"study_design_scores_gemma":[0.000046043257,0.000016547727,0.00037185778,0.00006630412,0.000007896177,0.00010931858,0.00003919595,0.0035047545,0.0069783637,0.01160311,0.9772174,0.000039186718],"about_ca_topic_score_codex":0.010524283,"about_ca_topic_score_gemma":0.011351873,"teacher_disagreement_score":0.50413173,"about_ca_system_score_codex":0.0021966624,"about_ca_system_score_gemma":0.0016884361,"threshold_uncertainty_score":0.7072959},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5495935,0.0013671365,0.42582962,0.004249696,0.0001196938,0.0004314271,0.0011966522,0.0027474626,0.014464924],"genre_scores_gemma":[0.86910486,0.00066340645,0.12366146,0.00049306854,0.00017721485,0.00032528283,0.0011669586,0.0005416778,0.003866113],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.988857,0.00399463,0.00094891916,0.0015945146,0.0032062314,0.0013987265],"domain_scores_gemma":[0.8713781,0.11633464,0.0031918108,0.005617627,0.0025402184,0.0009376101],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0066945977,0.0012017888,0.0019305934,0.0013290606,0.0017529416,0.006065761,0.0030509618,0.0018226764,0.0064670425],"category_scores_gemma":[0.050641723,0.00097414356,0.0027052215,0.0023993466,0.0031848836,0.016202964,0.003490818,0.003396585,0.0007224139],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00516376,0.0006995944,0.01839449,0.0017342041,0.0005134642,0.0016352762,0.0024169371,0.46657276,0.021868156,0.1956835,0.009437343,0.2758806],"study_design_scores_gemma":[0.0002060948,0.00017132459,0.0015901435,0.000070399976,0.00017752865,0.00034657994,0.00025048736,0.74932605,0.008023017,0.23785284,0.0019177875,0.000067810965],"about_ca_topic_score_codex":0.00500691,"about_ca_topic_score_gemma":0.004725188,"teacher_disagreement_score":0.0066945977,"about_ca_system_score_codex":0.0036652596,"about_ca_system_score_gemma":0.0032757777,"threshold_uncertainty_score":0.03540486},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09045764,0.00003857705,0.9015779,0.00017690257,0.000031225572,0.00011416058,0.00008087272,0.0024266783,0.0050960835],"genre_scores_gemma":[0.8089403,0.000054778608,0.1864463,0.00015630412,0.000030054382,0.00013463094,0.00020605989,0.00038359262,0.0036480068],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99555355,0.0011228317,0.00021935819,0.0004969435,0.0020949168,0.00051245966],"domain_scores_gemma":[0.9862163,0.009127734,0.0007756332,0.0013887207,0.0021706484,0.00032098722],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003008884,0.0008083038,0.00070340344,0.0007460396,0.0010532105,0.0012971837,0.0015291215,0.0007583209,0.0036513328],"category_scores_gemma":[0.016102413,0.00033953332,0.00087524706,0.00038078535,0.004880088,0.002219885,0.0024876392,0.0017780514,0.00080164993],"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.0012513926,0.00043490893,0.010277309,0.00061972096,0.00011607329,0.0017181087,0.0021320968,0.19049491,0.1357505,0.49309853,0.0041170246,0.15998936],"study_design_scores_gemma":[0.000101881466,0.00018262988,0.00058883213,0.000053250864,0.00002934007,0.00019974132,0.00013370831,0.7202342,0.096813954,0.17746486,0.0041585797,0.000039063783],"about_ca_topic_score_codex":0.0033106348,"about_ca_topic_score_gemma":0.0019748453,"teacher_disagreement_score":0.0036513328,"about_ca_system_score_codex":0.0015545321,"about_ca_system_score_gemma":0.0019345916,"threshold_uncertainty_score":0.015912712},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020869317,0.000053558135,0.9550777,0.00011994262,0.000056229383,0.00027621616,0.00050777144,0.01235462,0.010684571],"genre_scores_gemma":[0.16391647,0.00010408039,0.8265174,0.00010314897,0.000020692964,0.00044395644,0.0012936589,0.0020628516,0.005537682],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99876773,0.00023680775,0.00010485377,0.00016078659,0.00060520886,0.00012457347],"domain_scores_gemma":[0.997692,0.0010330597,0.0002067709,0.0003923953,0.00060267956,0.00007309899],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016452998,0.0007373717,0.0004417944,0.000876836,0.00056491914,0.0011752028,0.0009534909,0.000635408,0.007735198],"category_scores_gemma":[0.0052337497,0.0004879936,0.0006203419,0.00055779424,0.0006002637,0.00059416756,0.0007334484,0.0006608262,0.0026849322],"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.000798572,0.00023244978,0.0017961882,0.001298789,0.000070244816,0.0017628652,0.00079978263,0.28350043,0.17626013,0.2264141,0.024021728,0.2830446],"study_design_scores_gemma":[0.00023099771,0.00017805389,0.0005015659,0.00014407023,0.000043665237,0.0005201143,0.00009612938,0.6570446,0.24094486,0.030743925,0.06947869,0.000073282674],"about_ca_topic_score_codex":0.0020363436,"about_ca_topic_score_gemma":0.0025919455,"teacher_disagreement_score":0.007735198,"about_ca_system_score_codex":0.0010415968,"about_ca_system_score_gemma":0.0023831802,"threshold_uncertainty_score":0.02587682},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3235584,0.0012352162,0.63032967,0.006866103,0.00037167,0.0002882679,0.0011109873,0.0011261632,0.03511356],"genre_scores_gemma":[0.8499678,0.00074604945,0.13706486,0.00039378638,0.00053384906,0.00036127292,0.0010421438,0.00053811335,0.009352097],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99040633,0.0025662882,0.00065081485,0.0018022709,0.0036465996,0.00092778885],"domain_scores_gemma":[0.95974773,0.032975446,0.001108918,0.0039422647,0.0013218037,0.00090390025],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034778076,0.0010901567,0.0021984775,0.0014254269,0.0022486814,0.007990882,0.003913916,0.0027986357,0.011041841],"category_scores_gemma":[0.02973327,0.0013725929,0.0035665415,0.0029800253,0.0048340117,0.021708393,0.0061408444,0.006143141,0.0010475162],"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.0007685673,0.00021239147,0.0020156926,0.00050262414,0.00016138778,0.00019202523,0.0006757097,0.12269335,0.0052165724,0.8012732,0.0045855693,0.061702814],"study_design_scores_gemma":[0.000045023877,0.000039729603,0.00035273752,0.000025151285,0.00004395469,0.00007398947,0.000080406855,0.18859346,0.0017596303,0.8078295,0.0011230328,0.00003333736],"about_ca_topic_score_codex":0.0031271218,"about_ca_topic_score_gemma":0.003677417,"teacher_disagreement_score":0.011041841,"about_ca_system_score_codex":0.0057596075,"about_ca_system_score_gemma":0.0037476204,"threshold_uncertainty_score":0.041789114},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033597056,0.0010630608,0.960244,0.00020409792,0.000033298187,0.00017864101,0.000046715115,0.00066405797,0.0039690547],"genre_scores_gemma":[0.3320151,0.0007738937,0.6644948,0.00020340247,0.000030530202,0.00057759864,0.00017566088,0.000135231,0.0015937852],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987105,0.00069336075,0.00004482164,0.00016402756,0.00029837686,0.00008896702],"domain_scores_gemma":[0.9983077,0.0010536223,0.00015562314,0.00034430213,0.00010302084,0.000035667515],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012401922,0.00064276025,0.0007582237,0.00089096837,0.0003833806,0.00071716093,0.0013260387,0.0008110517,0.0015936657],"category_scores_gemma":[0.003630965,0.00045981666,0.0012133197,0.0011417489,0.0011401995,0.0010121656,0.0008727849,0.0012561752,0.00039333067],"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.00020029841,0.0002862466,0.0033031474,0.00057040184,0.00022675494,0.0002118337,0.0002978478,0.5677402,0.01870912,0.12534255,0.0025924016,0.2805192],"study_design_scores_gemma":[0.000065134926,0.0002666465,0.0006613286,0.000059056503,0.00009128437,0.00017936695,0.00004677634,0.9676972,0.004470766,0.022361644,0.004081719,0.000019020677],"about_ca_topic_score_codex":0.0020266706,"about_ca_topic_score_gemma":0.0044845785,"teacher_disagreement_score":0.0020266706,"about_ca_system_score_codex":0.00076352584,"about_ca_system_score_gemma":0.0015491328,"threshold_uncertainty_score":0.0065588355},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020095171,0.0005708162,0.9259288,0.0010327535,0.00035354742,0.0001645141,0.00067698595,0.001101393,0.050076105],"genre_scores_gemma":[0.5915611,0.0013053154,0.37497854,0.0013607626,0.00067998737,0.0007821226,0.0034633,0.0011216336,0.02474723],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99451375,0.001607697,0.0007538603,0.000989651,0.0015647282,0.0005703067],"domain_scores_gemma":[0.99123573,0.0043224674,0.00033283344,0.0018499327,0.0017312855,0.0005277962],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005669951,0.0010506975,0.0009615042,0.0025860611,0.0022036657,0.0058589024,0.0018109677,0.0017160984,0.007096509],"category_scores_gemma":[0.00724389,0.0015410682,0.0028100556,0.0014595211,0.006364397,0.011616016,0.0046501877,0.007121213,0.0024211349],"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.000014541313,0.000016298316,0.00013009644,0.00004610857,0.000009157336,0.00005112493,0.00033273132,0.00031427588,0.0004945753,0.9933169,0.0008606082,0.0044135954],"study_design_scores_gemma":[0.000033868742,0.00002013938,0.00015833238,0.000044146167,0.000032183834,0.00011256157,0.00022773567,0.0026397125,0.0025295338,0.97647494,0.0177092,0.000017682827],"about_ca_topic_score_codex":0.0011106953,"about_ca_topic_score_gemma":0.0011926406,"teacher_disagreement_score":0.007096509,"about_ca_system_score_codex":0.002036613,"about_ca_system_score_gemma":0.0013381616,"threshold_uncertainty_score":0.029985905},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012164025,0.000046391677,0.97806853,0.00025572866,0.00004391756,0.00013100826,0.00044820653,0.007042042,0.0018001983],"genre_scores_gemma":[0.36654553,0.00019287827,0.6239476,0.0006892701,0.000094649135,0.0006814208,0.002407795,0.002253981,0.0031869262],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99343526,0.0018542605,0.00071101164,0.0011394825,0.0018574038,0.0010026183],"domain_scores_gemma":[0.97224665,0.018397497,0.0019223558,0.004516479,0.0026401028,0.0002769699],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0071996246,0.0017196129,0.001213778,0.0016804249,0.0011278227,0.004132482,0.004282564,0.0017156181,0.005242929],"category_scores_gemma":[0.027806256,0.0012916256,0.004973587,0.0013126656,0.0035852683,0.0065840995,0.0038433345,0.0033582952,0.0012234732],"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.00086532836,0.00036640585,0.004626677,0.0011089002,0.00039445312,0.0009833131,0.0008283253,0.67785394,0.017078338,0.20008346,0.0054793255,0.09033146],"study_design_scores_gemma":[0.00013727829,0.00009706843,0.0001849444,0.0000985427,0.00011080203,0.00013814638,0.0000690401,0.86300224,0.02897915,0.10253436,0.0045933,0.00005518121],"about_ca_topic_score_codex":0.016332971,"about_ca_topic_score_gemma":0.013626924,"teacher_disagreement_score":0.016332971,"about_ca_system_score_codex":0.0036475635,"about_ca_system_score_gemma":0.0053325794,"threshold_uncertainty_score":0.038075745},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015701649,0.00003373099,0.9958372,0.00007923454,0.000052139156,0.0001246558,0.00004566698,0.0006582551,0.0015988151],"genre_scores_gemma":[0.054509185,0.00018261612,0.9426083,0.00012864108,0.00004707046,0.00040397112,0.00021196895,0.00026489852,0.0016434072],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99704665,0.0007428095,0.0005172533,0.00045034642,0.0010323088,0.00021072276],"domain_scores_gemma":[0.99686086,0.0012839183,0.0003295712,0.00064735045,0.00075116317,0.00012714975],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0053310627,0.00083029625,0.00081478345,0.0013066516,0.00095814717,0.0033210642,0.0014896968,0.001182864,0.004178276],"category_scores_gemma":[0.0059310803,0.0008112422,0.0020366653,0.0007340973,0.0024754275,0.004506052,0.0018702681,0.0030418613,0.0012318047],"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.00005401424,0.000103254904,0.00034102355,0.00029009552,0.00003866026,0.00038763322,0.0008001469,0.022472665,0.009082316,0.9160075,0.001079584,0.049343094],"study_design_scores_gemma":[0.0001411291,0.00024197558,0.0003697669,0.00037593604,0.00015428459,0.0009585355,0.00036071727,0.35310835,0.048706103,0.43666264,0.1587821,0.0001384653],"about_ca_topic_score_codex":0.0013401347,"about_ca_topic_score_gemma":0.0009988486,"teacher_disagreement_score":0.0053310627,"about_ca_system_score_codex":0.0011931697,"about_ca_system_score_gemma":0.003329253,"threshold_uncertainty_score":0.028193712},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00061945355,0.00002269697,0.9984498,0.000028626746,0.000009668113,0.00003692946,0.000027015829,0.0003631818,0.00044260532],"genre_scores_gemma":[0.07249189,0.00015842145,0.92530775,0.00007659848,0.000032556152,0.00044579923,0.00018105572,0.00020063185,0.0011053036],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99643373,0.001197428,0.00027060878,0.000346636,0.0015681311,0.0001834264],"domain_scores_gemma":[0.993669,0.003695857,0.0003387937,0.0014889995,0.00068633736,0.000121070436],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034910268,0.0009964738,0.0007603166,0.0011562394,0.0007932289,0.0019689268,0.002640786,0.0009229867,0.0036817782],"category_scores_gemma":[0.007874646,0.0009424867,0.0023234012,0.00047421217,0.0033104916,0.00260749,0.0026452243,0.0025431763,0.0009613425],"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.00013510637,0.0002187153,0.00058648095,0.00069127476,0.00012790468,0.00050726224,0.00060593314,0.19619988,0.03971381,0.6789341,0.0015200858,0.080759466],"study_design_scores_gemma":[0.0001179163,0.00018782869,0.00016568428,0.00019093855,0.0000731588,0.0003149309,0.000086974724,0.5744679,0.028857058,0.37442186,0.021045769,0.00007005204],"about_ca_topic_score_codex":0.0012953375,"about_ca_topic_score_gemma":0.001439189,"teacher_disagreement_score":0.0036817782,"about_ca_system_score_codex":0.0010409019,"about_ca_system_score_gemma":0.0023564065,"threshold_uncertainty_score":0.018462539},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12911746,0.00008604939,0.8649798,0.0010432855,0.00008765264,0.0001577597,0.000112948204,0.0011241697,0.0032908397],"genre_scores_gemma":[0.92997277,0.00003165222,0.068695806,0.00016544075,0.00003408656,0.00011881118,0.00015857581,0.00012513757,0.000697908],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9768014,0.011944331,0.00089897384,0.0035798887,0.005215216,0.0015602802],"domain_scores_gemma":[0.8123876,0.16557613,0.0051396545,0.011012797,0.0042388365,0.0016449912],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011903536,0.0013694069,0.0018849515,0.001401866,0.0009380445,0.0021001636,0.0034912159,0.0021435816,0.0055235336],"category_scores_gemma":[0.13867985,0.000871078,0.0017970187,0.00067636184,0.006685519,0.008585217,0.0055167954,0.0040635285,0.00046271714],"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.0019554687,0.0012650621,0.011830896,0.0004385509,0.0003142233,0.000396571,0.00046771424,0.5438135,0.0050272364,0.29261947,0.0022426404,0.13962865],"study_design_scores_gemma":[0.00013445875,0.00010895937,0.0003609817,0.000024329029,0.00002308709,0.000032404492,0.000037462898,0.7592206,0.0028087622,0.23699218,0.00023884294,0.00001795091],"about_ca_topic_score_codex":0.00327405,"about_ca_topic_score_gemma":0.0030706748,"teacher_disagreement_score":0.011903536,"about_ca_system_score_codex":0.002452075,"about_ca_system_score_gemma":0.0044833315,"threshold_uncertainty_score":0.0629527},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046522442,0.000020472604,0.9496296,0.00012439647,0.000015595457,0.00007035731,0.00012768684,0.0013705469,0.0021189554],"genre_scores_gemma":[0.5715332,0.00007522167,0.425541,0.00010969223,0.00002249317,0.0003234016,0.00054124004,0.00030832234,0.0015454075],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977962,0.00069744495,0.0001690878,0.0002618948,0.00085712987,0.00021817783],"domain_scores_gemma":[0.9922948,0.005437593,0.0006905503,0.000964475,0.0005185258,0.000094061346],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025121933,0.00078641716,0.000827136,0.00058007345,0.0007125587,0.001486248,0.0012266149,0.0008240957,0.002919845],"category_scores_gemma":[0.008983671,0.0006105926,0.0020674446,0.00038227806,0.0014817874,0.0027549723,0.0016955425,0.0017808193,0.000401868],"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.00033712442,0.0002852032,0.004825781,0.00041396718,0.00020144926,0.0012346078,0.00083396933,0.68931407,0.06192338,0.19685574,0.0012436059,0.042531166],"study_design_scores_gemma":[0.000041438747,0.00006814954,0.00013518713,0.000023185208,0.000033269607,0.00009262028,0.00007746785,0.92397887,0.024883438,0.049126726,0.0015291255,0.0000105722365],"about_ca_topic_score_codex":0.0024778577,"about_ca_topic_score_gemma":0.0043456284,"teacher_disagreement_score":0.002919845,"about_ca_system_score_codex":0.0010655061,"about_ca_system_score_gemma":0.0024497164,"threshold_uncertainty_score":0.013285875},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.089826725,0.0020721878,0.8899511,0.0047172154,0.00018049053,0.00016213604,0.00043963117,0.0006623403,0.011988083],"genre_scores_gemma":[0.780152,0.0018448776,0.21352686,0.0007771752,0.00037224553,0.00032986,0.00073743716,0.00040551036,0.0018539478],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9639562,0.01553646,0.0036967595,0.004074454,0.010634744,0.0021014425],"domain_scores_gemma":[0.75110793,0.18067145,0.008275899,0.051249396,0.0077504255,0.0009448616],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.04567955,0.0013053649,0.002923593,0.0036079786,0.002907755,0.009674834,0.0051354724,0.003345054,0.002386292],"category_scores_gemma":[0.18128052,0.0027651584,0.0040644626,0.0035407988,0.014546613,0.02493863,0.008761885,0.010606276,0.0003629499],"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.00019146307,0.00006412017,0.0012556377,0.00023991089,0.00009380425,0.00012001706,0.0011787579,0.035357304,0.0011402832,0.93984437,0.00053459266,0.019979825],"study_design_scores_gemma":[0.00005117264,0.000046706307,0.00021125602,0.00017225876,0.0000884054,0.00007059137,0.00015343339,0.035683088,0.0018194013,0.95988077,0.0017922517,0.00003066775],"about_ca_topic_score_codex":0.0034674942,"about_ca_topic_score_gemma":0.0022864975,"teacher_disagreement_score":0.04567955,"about_ca_system_score_codex":0.0032211703,"about_ca_system_score_gemma":0.0033845005,"threshold_uncertainty_score":0.24157947},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008332352,0.000076753495,0.98109996,0.0002962238,0.000065154876,0.0001086313,0.00021357005,0.0076754782,0.002131811],"genre_scores_gemma":[0.47667488,0.0003069788,0.51422596,0.00076414703,0.00019055349,0.00041814064,0.0008160613,0.0023680085,0.0042353296],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98542213,0.005119176,0.001204847,0.0015471595,0.005304351,0.0014023025],"domain_scores_gemma":[0.9394856,0.050126802,0.0019464613,0.0051031755,0.0029063283,0.00043161528],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.016722344,0.001148215,0.0011791943,0.0019074678,0.0013819286,0.004454049,0.0037554102,0.0014869559,0.006571477],"category_scores_gemma":[0.043518454,0.0012627894,0.0022798206,0.00096996955,0.0051200697,0.0060437773,0.0048820386,0.0032641042,0.0016284504],"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.00060549565,0.0003086679,0.0029771498,0.0009076508,0.0001511068,0.0011696952,0.0011503565,0.08058364,0.015160389,0.78713745,0.008745795,0.10110253],"study_design_scores_gemma":[0.00032541176,0.00016469722,0.0004197493,0.00018805514,0.00013002395,0.00042939323,0.000117175165,0.4531673,0.0625266,0.46379697,0.018626893,0.00010776568],"about_ca_topic_score_codex":0.0025480397,"about_ca_topic_score_gemma":0.0015794841,"teacher_disagreement_score":0.016722344,"about_ca_system_score_codex":0.0024107927,"about_ca_system_score_gemma":0.0035758466,"threshold_uncertainty_score":0.0884372},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00041041974,0.00005617072,0.99853647,0.00005948617,0.00001747178,0.00003876295,0.000017142345,0.00022025265,0.00064380426],"genre_scores_gemma":[0.05120382,0.00034390026,0.94628805,0.0001455789,0.00008518577,0.00027908917,0.000096421216,0.00018663044,0.0013712036],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99282855,0.0025599508,0.00050116674,0.0009025191,0.0027365333,0.00047124454],"domain_scores_gemma":[0.98394173,0.01035531,0.000686638,0.0033066988,0.0015559786,0.0001535627],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009020761,0.0022454616,0.0015708108,0.0035293836,0.0015865021,0.0032363601,0.005071905,0.0018852887,0.00491751],"category_scores_gemma":[0.019857746,0.0013130384,0.004718376,0.0016639576,0.0034501264,0.0057236,0.0032966435,0.004615792,0.0016416985],"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.000091364745,0.00023069045,0.0008274282,0.00074631354,0.00028835537,0.00044477565,0.00040221753,0.108021006,0.010717479,0.7306484,0.003237057,0.14434487],"study_design_scores_gemma":[0.00004756319,0.00010023083,0.00015156114,0.00012377305,0.00018236609,0.00033049294,0.000052646097,0.36220908,0.009998305,0.61664104,0.010102929,0.00005991001],"about_ca_topic_score_codex":0.001656354,"about_ca_topic_score_gemma":0.0012821386,"teacher_disagreement_score":0.009020761,"about_ca_system_score_codex":0.0016598809,"about_ca_system_score_gemma":0.0028603843,"threshold_uncertainty_score":0.047706902},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025241565,0.00041467932,0.9615686,0.00072204514,0.00007012037,0.00021530871,0.00014031693,0.0044765943,0.0071507767],"genre_scores_gemma":[0.3450761,0.0003738141,0.64717513,0.00072593306,0.00008268342,0.0003051427,0.00030379422,0.0007348429,0.00522252],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9941227,0.002346417,0.00041846657,0.0010259204,0.0014028273,0.0006836985],"domain_scores_gemma":[0.9831844,0.009237937,0.0009454257,0.0053357924,0.0009784857,0.00031792404],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005051133,0.00068861037,0.00096344313,0.0010061192,0.0011418859,0.002895481,0.0034923973,0.0015044535,0.004568826],"category_scores_gemma":[0.020896783,0.0010339638,0.0016512815,0.0013996916,0.0040592374,0.0088881245,0.00455141,0.0034291625,0.00093239656],"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.00035037808,0.00023503504,0.002801926,0.0004966746,0.00010503981,0.0004978457,0.0009174953,0.053319845,0.012300865,0.78628904,0.00403028,0.13865565],"study_design_scores_gemma":[0.00016986193,0.00022049833,0.00042442867,0.0001430243,0.00014086318,0.0005307226,0.00017245543,0.39114603,0.036860347,0.5272406,0.042850375,0.00010078411],"about_ca_topic_score_codex":0.0046102502,"about_ca_topic_score_gemma":0.004490906,"teacher_disagreement_score":0.005051133,"about_ca_system_score_codex":0.0031476784,"about_ca_system_score_gemma":0.002753441,"threshold_uncertainty_score":0.026713252},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038042072,0.00006318543,0.95549494,0.00010774908,0.00003200476,0.0001409877,0.000069850976,0.0042643724,0.0017848591],"genre_scores_gemma":[0.57941943,0.00011465098,0.41714993,0.00015391957,0.00003149362,0.00026681516,0.0003171441,0.00067164254,0.0018749936],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99266464,0.002557053,0.0003351374,0.0006286925,0.0032383343,0.00057607895],"domain_scores_gemma":[0.98995006,0.006687922,0.00046632218,0.002087608,0.00071526977,0.00009276971],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003860137,0.00091901154,0.0007998633,0.0014734975,0.0007250082,0.0013211425,0.001788163,0.00077998976,0.0037947781],"category_scores_gemma":[0.008839778,0.00067839504,0.002624219,0.0005562646,0.0027320827,0.0020234287,0.0024377226,0.0023619123,0.0006499475],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007388724,0.0007823863,0.003597333,0.0009719198,0.0004607894,0.0009972629,0.0010451204,0.34984154,0.14315291,0.3515607,0.0023990832,0.14445208],"study_design_scores_gemma":[0.00019135672,0.00023616088,0.0006283405,0.00005973486,0.000135401,0.00016630674,0.00007154326,0.7567026,0.10084923,0.13483898,0.0060622133,0.00005808233],"about_ca_topic_score_codex":0.0027932287,"about_ca_topic_score_gemma":0.00292931,"teacher_disagreement_score":0.003860137,"about_ca_system_score_codex":0.0012236906,"about_ca_system_score_gemma":0.0016682755,"threshold_uncertainty_score":0.02041459},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01579124,0.00044407614,0.97410685,0.0010489065,0.00011161107,0.00010652715,0.00016645914,0.0007069756,0.007517356],"genre_scores_gemma":[0.59451896,0.0011514294,0.39837846,0.0004852391,0.00017167359,0.0004222296,0.00048831484,0.0003055572,0.004078183],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98740655,0.006469223,0.0007486249,0.0012753182,0.0035766996,0.0005235658],"domain_scores_gemma":[0.96359277,0.024953954,0.0019360061,0.0065837265,0.0026832414,0.00025033334],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011178284,0.0006744109,0.0007902495,0.0010743273,0.0009380383,0.0030504789,0.0013818324,0.0012094699,0.0037489433],"category_scores_gemma":[0.03601117,0.0005510684,0.001433526,0.0007846229,0.0064334283,0.004058206,0.0031607102,0.0021116673,0.00072679605],"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.00008251412,0.000052426858,0.0011826248,0.00043424903,0.00009855409,0.00018258381,0.0003955359,0.11508746,0.0052587,0.8010108,0.002588171,0.07362642],"study_design_scores_gemma":[0.000052789277,0.0000489844,0.0003526887,0.00018440948,0.000028361028,0.0000866116,0.00007439229,0.34664243,0.009113874,0.62755823,0.015818285,0.00003883916],"about_ca_topic_score_codex":0.002690762,"about_ca_topic_score_gemma":0.0013218946,"teacher_disagreement_score":0.011178284,"about_ca_system_score_codex":0.0022136085,"about_ca_system_score_gemma":0.0029439535,"threshold_uncertainty_score":0.05911714},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13686061,0.0004914925,0.8537482,0.0005648885,0.000080337086,0.00013563098,0.00025201714,0.0042042974,0.0036625934],"genre_scores_gemma":[0.839862,0.0002460331,0.15768796,0.000086404216,0.000068101835,0.00019322064,0.0003573033,0.00034085615,0.0011580839],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9886568,0.0036444496,0.00064236525,0.0016809102,0.0043671005,0.0010083748],"domain_scores_gemma":[0.94433826,0.03856055,0.004111415,0.00779648,0.0042419215,0.0009513748],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012064999,0.0017805065,0.001381439,0.004789768,0.0010413111,0.0033098655,0.002688856,0.0011266388,0.0017897538],"category_scores_gemma":[0.05857009,0.0011423446,0.0018015999,0.0021989872,0.0043662526,0.009049365,0.003835412,0.0031958323,0.00046571132],"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.0021626267,0.00017576572,0.009747439,0.0003504996,0.00018650769,0.0002181566,0.0008776686,0.64122677,0.01670808,0.21990286,0.0012422048,0.10720141],"study_design_scores_gemma":[0.00005510399,0.00012333324,0.00045389528,0.00004218053,0.00004391376,0.00003205396,0.00003112957,0.87740254,0.012883642,0.108071685,0.00082504423,0.000035376535],"about_ca_topic_score_codex":0.0037853352,"about_ca_topic_score_gemma":0.0025916656,"teacher_disagreement_score":0.012064999,"about_ca_system_score_codex":0.004228486,"about_ca_system_score_gemma":0.0021320498,"threshold_uncertainty_score":0.063806534},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015396789,0.0003811945,0.9757254,0.000078946505,0.000030466068,0.000048702652,0.00006750663,0.0008969727,0.007374125],"genre_scores_gemma":[0.25222605,0.0005821862,0.74179006,0.00012839478,0.000035746718,0.000112906404,0.00032330357,0.00017302767,0.0046283463],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99972063,0.00006587049,0.000019756944,0.000044292996,0.00011455305,0.000034863915],"domain_scores_gemma":[0.999824,0.00007771234,0.000018504124,0.00003139623,0.000041778025,0.0000066019024],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002978156,0.00053656683,0.00024044128,0.0005794877,0.00023223557,0.00045344952,0.00038987267,0.00021540181,0.003167001],"category_scores_gemma":[0.00054782146,0.00023679619,0.00050559297,0.00033520116,0.0003551722,0.0005541523,0.00032385183,0.0004699758,0.0007113222],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001785987,0.00006147548,0.00054349925,0.00046014186,0.000039147693,0.0002033355,0.00014008328,0.20640092,0.14555676,0.142627,0.0036974673,0.5000916],"study_design_scores_gemma":[0.00008547273,0.0004145253,0.00047777544,0.000115448456,0.000063962965,0.00036407085,0.00008188114,0.7399421,0.13090469,0.07636365,0.05115141,0.000035051187],"about_ca_topic_score_codex":0.0013033294,"about_ca_topic_score_gemma":0.0025688696,"teacher_disagreement_score":0.003167001,"about_ca_system_score_codex":0.00062586874,"about_ca_system_score_gemma":0.0005922884,"threshold_uncertainty_score":0.010594666},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022469006,0.000032742242,0.97210914,0.0000304216,0.000019261925,0.000059174545,0.000051862426,0.0038693997,0.0013588584],"genre_scores_gemma":[0.40611434,0.000045738274,0.590814,0.000046211095,0.000014888634,0.00015287119,0.0001970163,0.00044536468,0.002169573],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99871874,0.0002842676,0.000107079955,0.00023577131,0.00052512833,0.00012904058],"domain_scores_gemma":[0.9967102,0.001836386,0.00014620037,0.00093598355,0.00028015766,0.00009118159],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015119122,0.0005217636,0.00056667073,0.00083875033,0.00078498153,0.0010442486,0.0012650237,0.0007313309,0.0054490343],"category_scores_gemma":[0.002348433,0.00064399274,0.001082985,0.00046068427,0.0012677182,0.0020376707,0.0021534283,0.0009952736,0.000872019],"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.0011466913,0.00038697105,0.004531067,0.0007290342,0.00023099582,0.0011106415,0.0010601656,0.12752126,0.2153917,0.29255447,0.0034848526,0.35185212],"study_design_scores_gemma":[0.00026105635,0.0004314909,0.001169322,0.00006670781,0.0001862818,0.00049615797,0.00012837254,0.756146,0.10741767,0.11776221,0.015845302,0.00008954569],"about_ca_topic_score_codex":0.001056083,"about_ca_topic_score_gemma":0.0014336141,"teacher_disagreement_score":0.0054490343,"about_ca_system_score_codex":0.00048894185,"about_ca_system_score_gemma":0.0008476138,"threshold_uncertainty_score":0.018228829},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041117884,0.000323308,0.9518643,0.0005308641,0.00013113633,0.00014264039,0.00017398938,0.0016788042,0.0040370035],"genre_scores_gemma":[0.84067816,0.00028016669,0.15539615,0.00024107234,0.00006303441,0.00018169852,0.0004489253,0.00030434856,0.0024064141],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9816311,0.0076023014,0.0011104877,0.0018773834,0.006420886,0.0013578266],"domain_scores_gemma":[0.952389,0.02902325,0.0025852725,0.009275402,0.0063688774,0.0003581667],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011330797,0.0008147811,0.0008199364,0.0010419119,0.0009615477,0.0032357387,0.0022715707,0.0018095158,0.00234526],"category_scores_gemma":[0.04408614,0.0010157557,0.0017812134,0.00044284767,0.004583579,0.0034905293,0.0025794513,0.002179514,0.00053883466],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00095991103,0.0003035059,0.005768743,0.0008932392,0.00028975002,0.00068134815,0.0011741521,0.32197973,0.027766341,0.5026032,0.0031750696,0.13440505],"study_design_scores_gemma":[0.00014924623,0.00013721542,0.0008884876,0.00017642652,0.00009495647,0.00012386242,0.00009442845,0.7050769,0.04505482,0.24034554,0.0078057763,0.000052377272],"about_ca_topic_score_codex":0.005331348,"about_ca_topic_score_gemma":0.003022722,"teacher_disagreement_score":0.011330797,"about_ca_system_score_codex":0.0019304721,"about_ca_system_score_gemma":0.004445711,"threshold_uncertainty_score":0.05992371},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007984189,0.0000992686,0.9890632,0.000105579915,0.000028340966,0.000064767475,0.000072218,0.00034390154,0.0022384909],"genre_scores_gemma":[0.4393174,0.00045428364,0.5553784,0.00013467453,0.00013100267,0.0007524368,0.000484964,0.00037771053,0.0029691982],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99579597,0.0011898031,0.0005144437,0.00048143254,0.0017809523,0.00023739281],"domain_scores_gemma":[0.992638,0.0041876906,0.0009954562,0.0009041833,0.0010784712,0.00019623307],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031529032,0.0009298575,0.0006144084,0.0018137178,0.0009708854,0.0027639817,0.0013191905,0.0010809134,0.0027357878],"category_scores_gemma":[0.01010314,0.0006265918,0.0029590912,0.001220268,0.0033428927,0.004835519,0.0019720222,0.0019022014,0.0005994536],"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.00005517197,0.000052686948,0.00077990594,0.00014356695,0.000052410018,0.0005397732,0.0007095398,0.07540487,0.005704157,0.89942056,0.0005246698,0.016612744],"study_design_scores_gemma":[0.000037925,0.000037511738,0.00019620957,0.00006089673,0.000048729697,0.00023560078,0.00013544381,0.34002015,0.0069152513,0.6449976,0.0072899004,0.000024708721],"about_ca_topic_score_codex":0.0041997842,"about_ca_topic_score_gemma":0.0024351198,"teacher_disagreement_score":0.0041997842,"about_ca_system_score_codex":0.0014922376,"about_ca_system_score_gemma":0.00244303,"threshold_uncertainty_score":0.01667434},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29264903,0.0072963405,0.44168133,0.008810922,0.00086626556,0.00013653937,0.0004893112,0.0014840799,0.24658619],"genre_scores_gemma":[0.93800145,0.0014338888,0.031034341,0.0005530153,0.000422106,0.00011641617,0.00014267635,0.00012690635,0.02816918],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985114,0.00059755635,0.00007538085,0.000205142,0.00029588857,0.00031463342],"domain_scores_gemma":[0.99796546,0.001122682,0.00017673091,0.0003712625,0.00018519918,0.00017864646],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021994412,0.0004499796,0.0007924711,0.001336509,0.0031074747,0.004142809,0.0009775884,0.0013937332,0.0051032063],"category_scores_gemma":[0.003928712,0.000497603,0.0010805221,0.0011794925,0.0066911047,0.0075245844,0.0022327248,0.0026030317,0.0008288157],"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.000025227804,0.000007739128,0.00007920952,0.000008890223,0.0000030352617,0.00002394286,0.00009428529,0.0004752986,0.00018232205,0.995895,0.00036351223,0.0028415597],"study_design_scores_gemma":[0.0000059851823,0.0000058143523,0.00003824583,0.00000422839,0.000004718181,0.000018996741,0.000028327178,0.0014532625,0.00015511218,0.9952833,0.0029954354,0.0000066047933],"about_ca_topic_score_codex":0.0038198396,"about_ca_topic_score_gemma":0.0029232036,"teacher_disagreement_score":0.0051032063,"about_ca_system_score_codex":0.0016984992,"about_ca_system_score_gemma":0.0017903033,"threshold_uncertainty_score":0.017071903},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009832045,0.000109689245,0.99799144,0.000044933684,0.000025987794,0.000032517197,0.00002480811,0.00011585085,0.00067144],"genre_scores_gemma":[0.021793386,0.0001836811,0.9764158,0.00006990797,0.00003960807,0.0001652724,0.00012808146,0.0001096765,0.0010945849],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997071,0.0006920555,0.00020196011,0.00057750935,0.0013623814,0.00009505174],"domain_scores_gemma":[0.9982503,0.000913255,0.00014768002,0.00029234737,0.00035464595,0.00004176784],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016268324,0.0010600984,0.00096873386,0.0020509183,0.00053712534,0.0011202913,0.0016054163,0.00071058166,0.0030694955],"category_scores_gemma":[0.0056776963,0.0006747195,0.0015527303,0.0014647746,0.0009888988,0.0016807752,0.0014106017,0.0017317202,0.0009941832],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012724515,0.00014156316,0.0008217171,0.00069210527,0.00015414016,0.00009906649,0.0001803219,0.19331734,0.027720507,0.22166282,0.003882683,0.5512005],"study_design_scores_gemma":[0.000067388915,0.00017999655,0.0003239227,0.00010317552,0.000069845075,0.00023514741,0.000033792974,0.8260366,0.019331116,0.11927177,0.034297045,0.00005028095],"about_ca_topic_score_codex":0.0012887303,"about_ca_topic_score_gemma":0.002144403,"teacher_disagreement_score":0.0030694955,"about_ca_system_score_codex":0.00092773803,"about_ca_system_score_gemma":0.0016707726,"threshold_uncertainty_score":0.01026845},"labels":[],"label_agreement":null},{"id":"W2011639059","doi":"10.1007/s10703-006-0017-y","title":"Providing a formal linkage between MDG and HOL","year":2006,"lang":"en","type":"article","venue":"Formal Methods in System Design","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"HOL; Correctness; Linkage (software); Enumeration; Automated theorem proving; Computer science; State (computer science); Programming language; Theoretical computer science; Semantics (computer science); Proof assistant; Mathematics; Discrete mathematics; Mathematical proof","score_opus":0.07185687179739442,"score_gpt":0.35588646291493664,"score_spread":0.2840295911175422,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2011639059","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00084789435,0.000059061236,0.99631506,0.0003117966,0.000073164614,0.000045926543,0.000043575696,0.00061664684,0.0016868504],"genre_scores_gemma":[0.108874574,0.00036771625,0.8844435,0.00068180857,0.0001661155,0.00031183977,0.00028914612,0.00072365167,0.004141675],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99405694,0.0020793842,0.00074836134,0.0007590032,0.0018673588,0.0004889723],"domain_scores_gemma":[0.9865643,0.007494612,0.00065893424,0.0036967904,0.0012495529,0.00033584164],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0069336398,0.0010399618,0.0010348122,0.0020601,0.0012415727,0.0048508253,0.002753246,0.0020132947,0.008282335],"category_scores_gemma":[0.02165601,0.0013008186,0.002341423,0.0014134006,0.0042860117,0.008060901,0.007105704,0.006063884,0.002076626],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000057110894,0.00008805999,0.00037100143,0.00026487664,0.000040503943,0.00014681013,0.00025539586,0.00879965,0.0020585046,0.9369203,0.0018674608,0.049130425],"study_design_scores_gemma":[0.00006464029,0.000068483074,0.0001262401,0.00019450273,0.00007834585,0.00024277878,0.00007903038,0.07370924,0.010807995,0.8779527,0.036621485,0.000054583074],"about_ca_topic_score_codex":0.0009972721,"about_ca_topic_score_gemma":0.0014957507,"teacher_disagreement_score":0.008282335,"about_ca_system_score_codex":0.0014245429,"about_ca_system_score_gemma":0.0031151564,"threshold_uncertainty_score":0.036669075},"labels":[],"label_agreement":null},{"id":"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33402124,0.0005861796,0.6553895,0.0005889244,0.00007082949,0.00040374883,0.0003544182,0.0019014439,0.006683769],"genre_scores_gemma":[0.96059114,0.00005635241,0.03820672,0.000043036718,0.000019774032,0.00017234811,0.00026150345,0.000076527445,0.00057257066],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9916471,0.0048595867,0.0005569334,0.00050954876,0.0019062422,0.00052067364],"domain_scores_gemma":[0.93898946,0.051612843,0.0030434935,0.00086458836,0.004569215,0.0009202784],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0048126886,0.0014562649,0.000998323,0.002931722,0.00043277917,0.0018330981,0.0013492922,0.0011725627,0.0030327414],"category_scores_gemma":[0.03315483,0.00033654974,0.00090388756,0.0009797623,0.0010342889,0.0015141417,0.0009271959,0.00064171973,0.0002831379],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018946325,0.00040309769,0.016148483,0.00072512863,0.00030439105,0.0016824185,0.00036673195,0.839147,0.015016206,0.03224766,0.002465911,0.08959837],"study_design_scores_gemma":[0.00007343208,0.00024634565,0.00081011927,0.00004255454,0.000047112568,0.00013439848,0.000055334363,0.9841473,0.0056098923,0.008380693,0.0004351061,0.000017759006],"about_ca_topic_score_codex":0.0022719942,"about_ca_topic_score_gemma":0.0016676068,"teacher_disagreement_score":0.0048126886,"about_ca_system_score_codex":0.0015472369,"about_ca_system_score_gemma":0.0010178481,"threshold_uncertainty_score":0.025452256},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037139777,0.00042733504,0.9434353,0.0014635583,0.00013136178,0.00014675947,0.00034543173,0.00027955777,0.016630933],"genre_scores_gemma":[0.56752896,0.00088303763,0.41590133,0.0008440855,0.00040649046,0.000563773,0.0014655843,0.00040285196,0.012003907],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99390453,0.0025223503,0.00044832693,0.0009519509,0.001533471,0.000639294],"domain_scores_gemma":[0.9684902,0.02536799,0.0015497687,0.0021856555,0.0017868886,0.0006195112],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007173074,0.0015577512,0.0014242315,0.0016600451,0.0011720273,0.004599805,0.002979395,0.0015004034,0.0070395092],"category_scores_gemma":[0.033296186,0.0017244214,0.0028941776,0.001789942,0.004829128,0.008581769,0.0040346617,0.009966764,0.0007746495],"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.0002104402,0.00027260528,0.00035066693,0.00041486075,0.00008349891,0.00014443549,0.0008447008,0.07877339,0.0020519479,0.8794518,0.0031925393,0.034209106],"study_design_scores_gemma":[0.00004263235,0.000038805276,0.00006593073,0.00004833588,0.000019985955,0.00005634199,0.00014183338,0.13341409,0.0013184241,0.86357415,0.0012550125,0.000024557812],"about_ca_topic_score_codex":0.0017918121,"about_ca_topic_score_gemma":0.0021323438,"teacher_disagreement_score":0.007173074,"about_ca_system_score_codex":0.0017729038,"about_ca_system_score_gemma":0.0017335964,"threshold_uncertainty_score":0.037935317},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018169788,0.0006052941,0.9912298,0.0003450518,0.00006349468,0.000034598084,0.000025091576,0.00023090403,0.0056488602],"genre_scores_gemma":[0.2229401,0.0029022687,0.7608838,0.00046465176,0.00042621483,0.0004489877,0.00018527661,0.0007057317,0.011042923],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99629223,0.001583215,0.00012367782,0.0005248801,0.0011252111,0.00035086137],"domain_scores_gemma":[0.9843126,0.012958752,0.000623136,0.00089810515,0.0009839422,0.00022348357],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004132353,0.0020447515,0.0017905812,0.0014194308,0.0010355988,0.0018313855,0.0016458656,0.0020309098,0.0065965024],"category_scores_gemma":[0.020869898,0.0010505775,0.0017641716,0.002152536,0.0049305586,0.004333748,0.0027605915,0.005821836,0.0019345602],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014466456,0.00006058214,0.00043235926,0.00018474598,0.00004232232,0.00006499435,0.00016127805,0.50406855,0.0010849104,0.4261111,0.0029281199,0.06471634],"study_design_scores_gemma":[0.000021968592,0.000026994861,0.00006419952,0.000031855474,0.000010040243,0.000025510612,0.000008974338,0.83654714,0.0005075716,0.1592363,0.0035045433,0.000014948993],"about_ca_topic_score_codex":0.0074107335,"about_ca_topic_score_gemma":0.0050158473,"teacher_disagreement_score":0.0074107335,"about_ca_system_score_codex":0.0030792903,"about_ca_system_score_gemma":0.0034090476,"threshold_uncertainty_score":0.022341967},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0031891312,0.19102614,0.21966678,0.16072968,0.027098492,0.00016709439,0.00071097957,0.00045456024,0.3969571],"genre_scores_gemma":[0.18411723,0.31494987,0.13796602,0.061084475,0.04980326,0.00077425607,0.00093643414,0.0010370113,0.24933146],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9967186,0.0013951753,0.00025275396,0.00039335317,0.0010295582,0.00021056303],"domain_scores_gemma":[0.9773831,0.019576212,0.00035726844,0.0014097029,0.001014901,0.00025887857],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0072941543,0.0012129627,0.0008961329,0.0035520198,0.003213692,0.0055729602,0.0020435872,0.003382592,0.01609273],"category_scores_gemma":[0.018004583,0.0010255529,0.0009950048,0.004498049,0.01983564,0.017316982,0.0033077393,0.012854632,0.0038389622],"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.000015449461,0.0000132157065,0.000037380512,0.00016524935,0.0000054855495,0.000046022506,0.00033108535,0.00042230333,0.00008225324,0.9613767,0.023709191,0.013795619],"study_design_scores_gemma":[0.000008521322,0.000011234476,0.000044780518,0.00022224936,0.0000039793363,0.00004523942,0.00007342095,0.00036317925,0.00018861465,0.78163147,0.21739115,0.000016093029],"about_ca_topic_score_codex":0.0034625824,"about_ca_topic_score_gemma":0.003043131,"teacher_disagreement_score":0.9967863,"about_ca_system_score_codex":0.0052268654,"about_ca_system_score_gemma":0.0024149076,"threshold_uncertainty_score":0.05383551},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032770983,0.00008309486,0.99399686,0.00016973188,0.000017949013,0.00012425313,0.000028864974,0.0006555153,0.0016466621],"genre_scores_gemma":[0.11702166,0.00024868242,0.8807009,0.00012136412,0.000017840686,0.00021851144,0.000060967017,0.00025224307,0.0013578151],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973411,0.0013805397,0.0001986749,0.00024756635,0.00069417566,0.00013790671],"domain_scores_gemma":[0.98687553,0.010981634,0.00043505666,0.00084492064,0.0006791799,0.00018362279],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0053107487,0.0005273819,0.00053264847,0.0015128094,0.0010666522,0.0019824377,0.0014636018,0.0011555204,0.005394933],"category_scores_gemma":[0.010821118,0.0007611731,0.0010514025,0.0006711528,0.0028629643,0.003638131,0.0025859824,0.0021079388,0.00096322113],"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.0002119989,0.00033309098,0.0008094046,0.00093684625,0.00008192882,0.0013724414,0.0011193644,0.08114396,0.038247753,0.6754022,0.0037317001,0.19660929],"study_design_scores_gemma":[0.0002903773,0.0001393958,0.00020740065,0.00037623764,0.00004900468,0.0006873529,0.00019406974,0.6250395,0.05051119,0.28827804,0.034149516,0.00007789773],"about_ca_topic_score_codex":0.0019968543,"about_ca_topic_score_gemma":0.0016447603,"teacher_disagreement_score":0.005394933,"about_ca_system_score_codex":0.00092852995,"about_ca_system_score_gemma":0.0016895424,"threshold_uncertainty_score":0.028086245},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03723065,0.00019392102,0.95310706,0.00042641128,0.000059727405,0.00015682021,0.0002845188,0.0048918985,0.0036490164],"genre_scores_gemma":[0.6721205,0.00022336874,0.32286835,0.0003446394,0.00019458967,0.00029888243,0.0010200604,0.0014333681,0.0014962071],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9716647,0.007431926,0.0026875597,0.002404371,0.012603568,0.003207787],"domain_scores_gemma":[0.920869,0.05011537,0.003050092,0.015687888,0.009188879,0.0010887762],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010992752,0.0014843654,0.0019392401,0.0032711723,0.0011203422,0.0048608873,0.003767149,0.0027390826,0.003957711],"category_scores_gemma":[0.054089475,0.00207938,0.0027916369,0.0013744367,0.0040360857,0.009543282,0.011239711,0.003912586,0.0014961261],"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.0012876176,0.00082152034,0.020867292,0.0013214736,0.0005521737,0.002729867,0.0037760325,0.17140257,0.0680779,0.43811604,0.0078524295,0.28319505],"study_design_scores_gemma":[0.00014791546,0.0002422638,0.0010495327,0.00030096123,0.0003492765,0.00075466355,0.00038978472,0.627853,0.06866106,0.28883776,0.011299579,0.00011426044],"about_ca_topic_score_codex":0.0018217189,"about_ca_topic_score_gemma":0.0017362621,"teacher_disagreement_score":0.010992752,"about_ca_system_score_codex":0.001096297,"about_ca_system_score_gemma":0.002540653,"threshold_uncertainty_score":0.058135927},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011099176,0.00009078238,0.9868302,0.00011554983,0.000009957974,0.000052124127,0.00018372785,0.00042391795,0.0011945808],"genre_scores_gemma":[0.4714576,0.0003669736,0.52579314,0.00010811376,0.000041932908,0.0002613013,0.0008779069,0.00016594707,0.00092704274],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985257,0.000651982,0.00008535255,0.0001836911,0.000468747,0.00008454526],"domain_scores_gemma":[0.99503964,0.0038582918,0.00041313822,0.00028574158,0.00036312276,0.000040094255],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013555436,0.0009868462,0.0005867243,0.0017635521,0.00032818824,0.0012160434,0.0014417581,0.0008527556,0.003255481],"category_scores_gemma":[0.009695145,0.00058508303,0.0011897444,0.0013728216,0.0006758032,0.0020629566,0.00074295624,0.0008777066,0.00040099717],"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.000098447636,0.00005462192,0.0013734812,0.00029295552,0.00006399124,0.0001675141,0.000073047195,0.8739997,0.0069082375,0.033612896,0.0010466622,0.08230844],"study_design_scores_gemma":[0.000012016519,0.000017570952,0.00011382541,0.000014678939,0.000007869826,0.00003986011,0.000010447702,0.98124033,0.0025679774,0.015589948,0.00038008858,0.0000054664497],"about_ca_topic_score_codex":0.0018580342,"about_ca_topic_score_gemma":0.0034236135,"teacher_disagreement_score":0.003255481,"about_ca_system_score_codex":0.00087591703,"about_ca_system_score_gemma":0.0010751069,"threshold_uncertainty_score":0.010890663},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026428762,0.000057683785,0.99276876,0.00006192735,0.00003381154,0.00007274653,0.000039232396,0.0015746299,0.00274829],"genre_scores_gemma":[0.09635537,0.0001259068,0.89537454,0.00011970296,0.000031991996,0.00018404964,0.00017172351,0.001951224,0.005685514],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9960706,0.0014558963,0.0002571761,0.0006041668,0.0013357686,0.00027643488],"domain_scores_gemma":[0.9919012,0.0032132566,0.000361424,0.0031110796,0.0011406443,0.00027220824],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004754173,0.0011673504,0.0009900493,0.0017384298,0.0011024908,0.0018722517,0.0026125743,0.0016475078,0.009794442],"category_scores_gemma":[0.017025243,0.0012294246,0.0013546087,0.0010039753,0.002380828,0.0035813947,0.0047902158,0.0028584825,0.003293762],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00097603345,0.00021816872,0.0023776393,0.0008817836,0.00013878114,0.00038544764,0.0021025008,0.042660568,0.03266402,0.43553412,0.010499254,0.4715617],"study_design_scores_gemma":[0.00039394706,0.00034214734,0.000588929,0.00037818734,0.00019736905,0.0004208986,0.0003873798,0.56493723,0.06795179,0.28523347,0.079018585,0.00015008246],"about_ca_topic_score_codex":0.004203006,"about_ca_topic_score_gemma":0.0042379517,"teacher_disagreement_score":0.009794442,"about_ca_system_score_codex":0.000632692,"about_ca_system_score_gemma":0.0023609484,"threshold_uncertainty_score":0.032765687},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013116746,0.00008428967,0.9711477,0.00012758652,0.00004480785,0.00031562915,0.00047821895,0.010471557,0.0042133806],"genre_scores_gemma":[0.22681141,0.0001681369,0.76557004,0.00019478497,0.000029508705,0.00045701582,0.0011774689,0.00076099456,0.0048306067],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987118,0.00029422514,0.000085662214,0.00029813347,0.00040883728,0.0002012426],"domain_scores_gemma":[0.998516,0.0007851756,0.00010582053,0.00034944015,0.00017847774,0.00006514895],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001393949,0.00074680184,0.0006036688,0.0012052929,0.00056976476,0.0015478721,0.0018428689,0.0008494496,0.00962643],"category_scores_gemma":[0.003284881,0.00047754808,0.00144502,0.0005143991,0.0013045607,0.0021316826,0.0016402558,0.0013107244,0.001652192],"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.0007344153,0.0006129947,0.002647516,0.00090377795,0.00019124633,0.0017319248,0.00060584646,0.23842454,0.044070374,0.4088938,0.010298346,0.29088524],"study_design_scores_gemma":[0.0002535761,0.00031525508,0.0004928494,0.0001057005,0.000105630155,0.00063861225,0.000068045985,0.7166898,0.062293902,0.16939953,0.049547657,0.000089472065],"about_ca_topic_score_codex":0.0032340318,"about_ca_topic_score_gemma":0.002604737,"teacher_disagreement_score":0.00962643,"about_ca_system_score_codex":0.0011203346,"about_ca_system_score_gemma":0.001700142,"threshold_uncertainty_score":0.032203555},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.069420226,0.00014289397,0.9240098,0.00015119594,0.000029337461,0.000057087775,0.00014890141,0.003869483,0.0021711236],"genre_scores_gemma":[0.5730733,0.00026714467,0.42390564,0.00010144194,0.000024438743,0.00012963961,0.00069476606,0.0005132395,0.0012904089],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971085,0.0010509525,0.00019025545,0.00036547252,0.0010306684,0.00025408494],"domain_scores_gemma":[0.9924683,0.0048221396,0.0005585216,0.0015890624,0.00050509616,0.00005688361],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001981502,0.001000432,0.0006378903,0.0011469049,0.000621876,0.0019320502,0.0015108127,0.00080100127,0.001715173],"category_scores_gemma":[0.009967172,0.0006880085,0.0014928501,0.00084954145,0.0015613433,0.0025412487,0.0012570717,0.0011258428,0.00034560935],"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.0003636231,0.00030137107,0.008392362,0.00065010256,0.0003067836,0.0009908541,0.0007679632,0.5759766,0.112972364,0.13134548,0.0019532226,0.16597933],"study_design_scores_gemma":[0.000048184338,0.00012560977,0.0005071233,0.00005271956,0.00011432659,0.0001967959,0.000065224,0.88880366,0.0655706,0.041392025,0.0030905162,0.00003326097],"about_ca_topic_score_codex":0.0056707766,"about_ca_topic_score_gemma":0.007993222,"teacher_disagreement_score":0.0056707766,"about_ca_system_score_codex":0.0010700516,"about_ca_system_score_gemma":0.0021245738,"threshold_uncertainty_score":0.01127553},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27171078,0.0006447013,0.65370274,0.0019501138,0.0003244819,0.0001726994,0.00038941635,0.000604423,0.07050058],"genre_scores_gemma":[0.8809693,0.00036503907,0.10586562,0.0005648129,0.0002179247,0.00031636693,0.0005603351,0.00034319435,0.010797525],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99257505,0.0025182725,0.0005649529,0.0009208678,0.0026026864,0.00081815536],"domain_scores_gemma":[0.97543734,0.018978294,0.0008958318,0.0021121185,0.0020196354,0.0005567391],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005014429,0.0012718485,0.0016843629,0.0045079733,0.0020814827,0.0053041456,0.0039002819,0.0030819145,0.011276644],"category_scores_gemma":[0.03399334,0.0010343904,0.0017536418,0.0034784689,0.0039531556,0.013846599,0.0049101124,0.0046070656,0.00079633796],"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.000043956934,0.000030445668,0.00032449994,0.00005755591,0.00000997477,0.000054851665,0.00010148875,0.001171626,0.0007965017,0.9887917,0.00045186433,0.008165614],"study_design_scores_gemma":[0.000010152603,0.000011679279,0.0001403981,0.000018859966,0.000016785521,0.000097552824,0.00003576219,0.018970776,0.0015435651,0.9781415,0.0010023754,0.000010504653],"about_ca_topic_score_codex":0.0006132997,"about_ca_topic_score_gemma":0.0007075732,"teacher_disagreement_score":0.011276644,"about_ca_system_score_codex":0.0031622008,"about_ca_system_score_gemma":0.0008608367,"threshold_uncertainty_score":0.037724078},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.064625755,0.0020732412,0.91339153,0.0015153647,0.00025672797,0.00018068083,0.0011455085,0.0005855879,0.016225677],"genre_scores_gemma":[0.7512827,0.0023014867,0.22189061,0.00056255027,0.00064181746,0.0009317848,0.003270275,0.00074615754,0.018372655],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9919155,0.00313528,0.0007850719,0.0014055109,0.002073091,0.0006855302],"domain_scores_gemma":[0.95734555,0.027123557,0.0050376295,0.0025098647,0.004723776,0.003259646],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007560621,0.001861256,0.002029256,0.0071205185,0.0022767596,0.0059864386,0.0020300238,0.0029973714,0.008142412],"category_scores_gemma":[0.047257464,0.001071416,0.0016648805,0.0045403475,0.003889611,0.015589317,0.0041711237,0.00312206,0.00093111285],"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.000042986914,0.000016314094,0.0005755942,0.00008494331,0.000023340219,0.000042464308,0.0001751784,0.009355995,0.0003692221,0.9809223,0.0008396423,0.007551921],"study_design_scores_gemma":[0.0000074413247,0.000020688805,0.00022868262,0.000034522884,0.000011598574,0.000027523123,0.000028060962,0.035278827,0.00019409189,0.96220756,0.0019437856,0.000017182432],"about_ca_topic_score_codex":0.003003439,"about_ca_topic_score_gemma":0.0023478912,"teacher_disagreement_score":0.008142412,"about_ca_system_score_codex":0.0067378986,"about_ca_system_score_gemma":0.0021003515,"threshold_uncertainty_score":0.048887134},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06389349,0.00006154245,0.9270656,0.00025161108,0.000054271313,0.00014424192,0.00015999231,0.0014207725,0.006948391],"genre_scores_gemma":[0.8519517,0.00007599284,0.14355436,0.00013326886,0.000018253559,0.0002161874,0.00017999593,0.00014450298,0.0037257718],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976292,0.00045304737,0.00015013252,0.00038063794,0.0009679672,0.0004191294],"domain_scores_gemma":[0.99698824,0.0016926174,0.00022212157,0.00054226315,0.00046055435,0.000094257455],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016538131,0.00052055623,0.0005536737,0.00048098128,0.00080197316,0.0016832534,0.0014478975,0.0010691329,0.003712918],"category_scores_gemma":[0.0049441955,0.00037890204,0.00079660054,0.00029037838,0.0024277964,0.0018746307,0.0015460065,0.0013371074,0.00048171743],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024957047,0.00011975252,0.001141991,0.00021493481,0.00005887282,0.0006546923,0.00034588267,0.1672713,0.06362192,0.741666,0.0011530682,0.023502085],"study_design_scores_gemma":[0.00016181555,0.00017782186,0.00026375626,0.000053967302,0.000061533756,0.00021393495,0.00008942782,0.73416966,0.08977384,0.16409652,0.010886362,0.0000512791],"about_ca_topic_score_codex":0.0030991267,"about_ca_topic_score_gemma":0.0022100485,"teacher_disagreement_score":0.003712918,"about_ca_system_score_codex":0.0012117772,"about_ca_system_score_gemma":0.0023152682,"threshold_uncertainty_score":0.012420952},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016576264,0.00010610989,0.99678373,0.00011989966,0.000013004345,0.000032740623,0.000027262813,0.00024796493,0.0010117012],"genre_scores_gemma":[0.22849584,0.0013116573,0.76747817,0.00025934988,0.00021333071,0.00036306033,0.00024039255,0.00020582798,0.0014323528],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99173295,0.0034139585,0.0004905102,0.00067037926,0.0031818755,0.0005102934],"domain_scores_gemma":[0.9779107,0.018563548,0.00096320815,0.0014360391,0.0009959545,0.0001306494],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009156946,0.0012603477,0.0009078896,0.0021945522,0.0011081015,0.0033079784,0.0023950748,0.0010315399,0.0033660128],"category_scores_gemma":[0.022723978,0.0006590714,0.0030314631,0.001582553,0.0040746536,0.0045136735,0.0028526483,0.0027415166,0.0006504758],"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.00004491832,0.0000730696,0.0009199591,0.0004229696,0.000121961,0.0003833379,0.00032101173,0.16420016,0.0037086236,0.78243315,0.0012870702,0.04608373],"study_design_scores_gemma":[0.00004287256,0.00004649181,0.00023972834,0.00007342171,0.000058708752,0.00016526614,0.00004725598,0.4189722,0.0059203417,0.5686565,0.0057433,0.000033882305],"about_ca_topic_score_codex":0.0019332138,"about_ca_topic_score_gemma":0.0013171867,"teacher_disagreement_score":0.009156946,"about_ca_system_score_codex":0.0018366501,"about_ca_system_score_gemma":0.00245995,"threshold_uncertainty_score":0.048427105},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023316218,0.00009769945,0.97110534,0.0005200646,0.000052147534,0.00010015138,0.0002453832,0.0010984823,0.003464559],"genre_scores_gemma":[0.7719461,0.00023143971,0.22290958,0.00029387814,0.00011795513,0.00020114236,0.0008020827,0.00029969052,0.0031981946],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9962948,0.0012025766,0.00038192567,0.00048566962,0.0010527761,0.00058227766],"domain_scores_gemma":[0.9727065,0.022859886,0.0011462708,0.0017173791,0.0011331898,0.00043683627],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0056556887,0.0008726777,0.0008751316,0.0017010221,0.0015428961,0.0048706657,0.0028592737,0.0014233828,0.0061438284],"category_scores_gemma":[0.018472603,0.0010803121,0.0036814932,0.0011157102,0.0042316737,0.008505559,0.003341989,0.003680084,0.000558449],"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.00023779331,0.00017131302,0.0017454706,0.00028877112,0.00014144524,0.0006997177,0.0010418552,0.15130547,0.0024448521,0.8222842,0.0011098115,0.01852929],"study_design_scores_gemma":[0.0000882086,0.000024080853,0.00016734503,0.0000496358,0.00008392806,0.00006869562,0.0001596924,0.36104465,0.0036484129,0.63286895,0.0017699694,0.0000263132],"about_ca_topic_score_codex":0.0059073265,"about_ca_topic_score_gemma":0.007296607,"teacher_disagreement_score":0.0061438284,"about_ca_system_score_codex":0.0027247495,"about_ca_system_score_gemma":0.002380497,"threshold_uncertainty_score":0.029910505},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033449013,0.00008068938,0.96316415,0.00010233017,0.000026367472,0.00014596141,0.00006761173,0.0010693304,0.0018946155],"genre_scores_gemma":[0.52088624,0.00024447506,0.47587693,0.00006828074,0.000036931706,0.000257278,0.00024834156,0.00037727543,0.0020042278],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99077773,0.0032820918,0.00084100117,0.0010416927,0.0032900504,0.0007674034],"domain_scores_gemma":[0.97375476,0.017411571,0.001429412,0.0049881823,0.00218382,0.00023228159],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007629293,0.0008808261,0.0009448009,0.0012827934,0.00096700666,0.001641733,0.0018547615,0.000898517,0.0019950734],"category_scores_gemma":[0.02606417,0.0013483872,0.002701608,0.00093323993,0.0040098955,0.0030079328,0.0028761525,0.0021016812,0.00048784248],"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.0011002737,0.0002929828,0.0056161624,0.0008768357,0.0002257364,0.0014542751,0.0029260346,0.25323084,0.05339513,0.54121643,0.001542593,0.13812268],"study_design_scores_gemma":[0.00037998147,0.00023061378,0.0006590792,0.00014456456,0.0002563574,0.00030358424,0.00024823897,0.5923929,0.058037397,0.33923137,0.008024593,0.00009120608],"about_ca_topic_score_codex":0.0085053975,"about_ca_topic_score_gemma":0.007432966,"teacher_disagreement_score":0.0085053975,"about_ca_system_score_codex":0.0010755509,"about_ca_system_score_gemma":0.0022474322,"threshold_uncertainty_score":0.040348053},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3289131,0.00012787628,0.6653764,0.00020342095,0.00004177007,0.00011709992,0.00010299792,0.0009775945,0.004139706],"genre_scores_gemma":[0.95561224,0.000082121776,0.04259868,0.000053630443,0.000017997867,0.00009440573,0.00012307358,0.00006574481,0.0013521045],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979241,0.00090268475,0.00013368097,0.00032882928,0.0004824529,0.00022820102],"domain_scores_gemma":[0.99317086,0.00494518,0.00056320266,0.00047014275,0.00055217394,0.00029841517],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001979663,0.00048690266,0.000635929,0.0006273833,0.000579501,0.0012183783,0.0009794581,0.00079356425,0.0018679012],"category_scores_gemma":[0.008401688,0.0002849917,0.0007987992,0.00053185987,0.002319485,0.002164605,0.001072127,0.00089877046,0.00019494785],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006278289,0.00017213885,0.0034717333,0.00012318492,0.00007271724,0.00030512776,0.00037674673,0.7006414,0.016225386,0.2659301,0.00031304924,0.011740596],"study_design_scores_gemma":[0.000045404577,0.000113444614,0.00016031947,0.000010931029,0.000019165425,0.000043926822,0.000028932775,0.9162501,0.012469986,0.0700903,0.0007526071,0.000014834715],"about_ca_topic_score_codex":0.001890674,"about_ca_topic_score_gemma":0.0010072269,"teacher_disagreement_score":0.001979663,"about_ca_system_score_codex":0.0013194135,"about_ca_system_score_gemma":0.001166369,"threshold_uncertainty_score":0.010469615},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019498134,0.05083645,0.8227901,0.041834403,0.005589284,0.000066144814,0.00028803918,0.000403649,0.058693793],"genre_scores_gemma":[0.5066133,0.034728575,0.40396303,0.0061960244,0.013770913,0.0003620524,0.00045740875,0.00027920253,0.033629473],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99759394,0.0009782963,0.00017424097,0.00045729545,0.00068648084,0.000109723806],"domain_scores_gemma":[0.9873372,0.00936611,0.00021446365,0.0012237906,0.0015271683,0.00033129146],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00602626,0.000901488,0.0021983467,0.0026277693,0.0017938636,0.0055187186,0.0024927645,0.0040287604,0.01204628],"category_scores_gemma":[0.016708918,0.0010359406,0.0022930033,0.0021702885,0.007906061,0.022897024,0.0025300703,0.0067387824,0.0015364242],"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.000024757415,0.000016520109,0.00009177738,0.00007126006,0.000012180607,0.00002027347,0.00011894705,0.0013693607,0.000108107284,0.98349124,0.0017601203,0.0129154725],"study_design_scores_gemma":[0.000012357798,0.000009632262,0.000028658418,0.00002475871,0.000007641724,0.000017035069,0.000044720997,0.009936747,0.00007966611,0.9816648,0.008166091,0.000008003509],"about_ca_topic_score_codex":0.002690762,"about_ca_topic_score_gemma":0.0023609293,"teacher_disagreement_score":0.01204628,"about_ca_system_score_codex":0.0036429495,"about_ca_system_score_gemma":0.0012874538,"threshold_uncertainty_score":0.04029882},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010333064,0.00013600133,0.9875408,0.00012646324,0.000016433756,0.000100524965,0.000046602137,0.0006109886,0.001089181],"genre_scores_gemma":[0.25721973,0.00017432039,0.7402495,0.000121149846,0.00003147212,0.0003822636,0.0002552735,0.00039797009,0.0011683402],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9948761,0.0021648477,0.00029265133,0.0010741919,0.0011598307,0.00043244503],"domain_scores_gemma":[0.97489446,0.019693693,0.0015979896,0.0020594364,0.0012309059,0.00052363414],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0059642144,0.0023564636,0.0024623054,0.0023435226,0.0012344439,0.0026218113,0.0040346445,0.002309993,0.005132341],"category_scores_gemma":[0.029093375,0.0010663754,0.0018579512,0.0019239994,0.0026770527,0.0050227703,0.0045586945,0.0039096465,0.0008100492],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022171317,0.00016293427,0.0010329094,0.00026005926,0.00008787851,0.000057583835,0.00024357677,0.7647239,0.0015103385,0.11122114,0.00083313615,0.119644865],"study_design_scores_gemma":[0.00003225471,0.00005122988,0.00006542105,0.000019043098,0.000013588245,0.000016330623,0.000024621893,0.92719537,0.001082453,0.07104739,0.0004418803,0.000010476446],"about_ca_topic_score_codex":0.0051283226,"about_ca_topic_score_gemma":0.0062773162,"teacher_disagreement_score":0.0059642144,"about_ca_system_score_codex":0.0039738645,"about_ca_system_score_gemma":0.0032036633,"threshold_uncertainty_score":0.031542182},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02890401,0.00014100265,0.9271641,0.00025149313,0.00008070534,0.00031834506,0.00065230276,0.022286084,0.020201925],"genre_scores_gemma":[0.22212267,0.00010026845,0.76881737,0.00031675218,0.000040718183,0.00024102109,0.001795522,0.0018967352,0.0046689464],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99767655,0.00044058394,0.0001572031,0.0004724261,0.0008214363,0.00043181182],"domain_scores_gemma":[0.9962112,0.0016336931,0.00026015498,0.0011269681,0.0006424863,0.00012545504],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001872954,0.0015645452,0.0006689726,0.0010359348,0.0007713719,0.0014636946,0.0027102358,0.00094610656,0.021573],"category_scores_gemma":[0.005480584,0.00085569307,0.002022952,0.0014078108,0.0012975433,0.002331697,0.0027064995,0.002452861,0.004007167],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010642018,0.0008055617,0.005224002,0.0013145062,0.00027713247,0.0007731129,0.000739101,0.25194865,0.09214128,0.17215934,0.03331602,0.4402371],"study_design_scores_gemma":[0.00026223046,0.00021611176,0.000507814,0.00008120987,0.00010508067,0.0002682065,0.00010163149,0.8410777,0.07601549,0.054593828,0.026721278,0.00004939359],"about_ca_topic_score_codex":0.0048405123,"about_ca_topic_score_gemma":0.011062083,"teacher_disagreement_score":0.021573,"about_ca_system_score_codex":0.0017535691,"about_ca_system_score_gemma":0.0032645543,"threshold_uncertainty_score":0.07216889},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04313627,0.00006599911,0.9538142,0.00023477264,0.000055020562,0.000047619917,0.000055414665,0.00097303215,0.0016176633],"genre_scores_gemma":[0.87222993,0.00007353293,0.12585445,0.00010520076,0.000044028024,0.000084022824,0.000128258,0.000152596,0.0013278783],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99297637,0.0028104582,0.00042088926,0.0009768277,0.0022663877,0.00054899545],"domain_scores_gemma":[0.98347384,0.0120285535,0.0012775195,0.0018772994,0.0011389849,0.00020372296],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0053285523,0.0009376804,0.0010704385,0.0011799128,0.00085032865,0.0035757362,0.0020442826,0.0015256192,0.0025411702],"category_scores_gemma":[0.023166422,0.00095997145,0.0024269926,0.0008115237,0.0036219193,0.0056139054,0.0034481727,0.0031341163,0.00029866805],"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.00061956374,0.00018050017,0.0022698608,0.00028960683,0.0002752905,0.00065920275,0.0005397318,0.59795517,0.010469667,0.35629869,0.0007120005,0.029730748],"study_design_scores_gemma":[0.0000575836,0.000038794606,0.00009449967,0.000019561272,0.00004957625,0.000045419725,0.000028889455,0.8482134,0.006219967,0.14471479,0.00049713696,0.000020467844],"about_ca_topic_score_codex":0.0031381857,"about_ca_topic_score_gemma":0.0030270938,"teacher_disagreement_score":0.0053285523,"about_ca_system_score_codex":0.0019540929,"about_ca_system_score_gemma":0.0021133942,"threshold_uncertainty_score":0.02818042},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03667283,0.00005331587,0.9556901,0.00022360779,0.00004056344,0.00019805906,0.00031675867,0.0021066442,0.0046981503],"genre_scores_gemma":[0.584095,0.00013156042,0.40656394,0.00019876305,0.000038284,0.00053909427,0.0009086087,0.0006790591,0.006845659],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975114,0.0007809123,0.00025797533,0.00024751632,0.0009424411,0.0002598192],"domain_scores_gemma":[0.99172217,0.005132357,0.00056300947,0.0012530738,0.0011795667,0.00014977025],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031746875,0.00072277576,0.00047022136,0.0007461257,0.0006316424,0.0028413434,0.0013641709,0.0009704123,0.0047515864],"category_scores_gemma":[0.008861248,0.0007248752,0.0009021372,0.00039607572,0.002187807,0.0025458992,0.0015149104,0.0015889754,0.0007098919],"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.00030686948,0.00016116645,0.0013163717,0.00037409054,0.000037800004,0.0005234,0.0016270159,0.07386189,0.018587269,0.86855453,0.0016205243,0.033029035],"study_design_scores_gemma":[0.0002621101,0.00014201633,0.00039612938,0.00016251569,0.00008258073,0.00025157028,0.00034344284,0.50268835,0.0540303,0.42028657,0.021294322,0.00006006003],"about_ca_topic_score_codex":0.0023866438,"about_ca_topic_score_gemma":0.004082839,"teacher_disagreement_score":0.0047515864,"about_ca_system_score_codex":0.001235881,"about_ca_system_score_gemma":0.0026117666,"threshold_uncertainty_score":0.016789556},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031255767,0.00009559445,0.9600193,0.00005196126,0.0000072809876,0.00006148143,0.00011649913,0.007833953,0.0005582324],"genre_scores_gemma":[0.45468563,0.00018264729,0.5424716,0.000082040446,0.0000182758,0.00019860701,0.0006355691,0.00063784706,0.001087858],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979512,0.00057746813,0.0001538386,0.00030198428,0.00081203476,0.00020343604],"domain_scores_gemma":[0.9939003,0.003566978,0.0005918139,0.0011665081,0.0006719064,0.0001025136],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026928035,0.000867623,0.0007645196,0.0014510475,0.0006367884,0.0010866454,0.00083660753,0.0004203876,0.0014855681],"category_scores_gemma":[0.005654689,0.00079411647,0.0010082758,0.0005559651,0.0011247055,0.0019318929,0.0016469471,0.0010329349,0.0005461924],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005515702,0.00020212257,0.006271784,0.00066362805,0.00016072257,0.0004813662,0.00082287326,0.29677588,0.16961819,0.019759653,0.0017874438,0.5029047],"study_design_scores_gemma":[0.00009808778,0.00015118002,0.001818634,0.00007165983,0.000075748954,0.00019491221,0.00007918824,0.89124477,0.0650481,0.03846468,0.0027057037,0.00004730747],"about_ca_topic_score_codex":0.003084362,"about_ca_topic_score_gemma":0.005698227,"teacher_disagreement_score":0.003084362,"about_ca_system_score_codex":0.0008448158,"about_ca_system_score_gemma":0.0026066243,"threshold_uncertainty_score":0.014241099},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003455424,0.000041985502,0.99265516,0.00011568162,0.000020040012,0.0001302534,0.00008034327,0.00260476,0.00089636707],"genre_scores_gemma":[0.3299127,0.00015744662,0.6653131,0.00030570268,0.000044785364,0.0005283111,0.000659655,0.0008948911,0.0021833547],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99468875,0.0015263824,0.00032465687,0.00076102925,0.0022428664,0.0004563189],"domain_scores_gemma":[0.99127555,0.005453463,0.0005274368,0.0014970202,0.0010883474,0.00015819038],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004015233,0.0010928827,0.00067997025,0.0010100588,0.0011503904,0.0020794976,0.0022678345,0.000757834,0.0044672517],"category_scores_gemma":[0.016276544,0.00068487,0.0023396304,0.00065550074,0.0022031497,0.0024039608,0.0029113437,0.002535935,0.0009444229],"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.0006908876,0.00036552292,0.0031774207,0.0009692939,0.0002744031,0.001052836,0.00085887784,0.4061963,0.028333949,0.26371443,0.0069628404,0.2874033],"study_design_scores_gemma":[0.00006208363,0.00008351103,0.00013893076,0.00005812772,0.000040171646,0.00013571969,0.00007362587,0.86380994,0.021089105,0.109622024,0.004854537,0.000032189742],"about_ca_topic_score_codex":0.006379972,"about_ca_topic_score_gemma":0.0075860643,"teacher_disagreement_score":0.006379972,"about_ca_system_score_codex":0.0022534998,"about_ca_system_score_gemma":0.0045313756,"threshold_uncertainty_score":0.02123487},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00082208944,0.000081128994,0.9969612,0.000119380245,0.000037266254,0.00009680301,0.000042279815,0.00071685616,0.0011229629],"genre_scores_gemma":[0.048175666,0.0003386564,0.94896483,0.00019693274,0.00004635884,0.00030360496,0.0002065913,0.00031129003,0.0014561327],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99328035,0.002615403,0.0005758096,0.0006954299,0.002515921,0.000317087],"domain_scores_gemma":[0.9876887,0.008840669,0.0004868124,0.0016386153,0.0011380847,0.00020706837],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0057191867,0.001429934,0.0010986615,0.0030098797,0.0017374536,0.0036009983,0.003849091,0.0020463013,0.008351184],"category_scores_gemma":[0.017637482,0.0011167608,0.0025909129,0.0013614888,0.0031614904,0.0052287946,0.0032761747,0.0034947845,0.0027580617],"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.00025993978,0.00035384475,0.0007831295,0.0017868271,0.00026186998,0.0011288923,0.00079790625,0.0416483,0.049749214,0.6706814,0.0053612716,0.22718738],"study_design_scores_gemma":[0.0003185482,0.00033932814,0.0003416257,0.0005029673,0.00020905997,0.001590114,0.00018483274,0.2944792,0.08424154,0.53739464,0.08023696,0.00016124551],"about_ca_topic_score_codex":0.0017057606,"about_ca_topic_score_gemma":0.0011977615,"teacher_disagreement_score":0.008351184,"about_ca_system_score_codex":0.0015587994,"about_ca_system_score_gemma":0.002874527,"threshold_uncertainty_score":0.030246317},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00673517,0.00014177532,0.99208856,0.00005305376,0.00000925038,0.000050664345,0.000017151453,0.00046730766,0.00043704707],"genre_scores_gemma":[0.2181792,0.00034764627,0.7801663,0.00006446375,0.00001877323,0.00015029423,0.000102806676,0.00015161636,0.0008190333],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9961146,0.0022505391,0.00020731367,0.00041289488,0.0008083218,0.00020628399],"domain_scores_gemma":[0.99394315,0.0042219576,0.00035970088,0.0010870125,0.00031067902,0.00007740547],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004608056,0.0007922729,0.00065668597,0.0010989995,0.00046275376,0.00089990464,0.0013366084,0.00077679544,0.0021847114],"category_scores_gemma":[0.010899021,0.0008550187,0.0012547947,0.0009886808,0.0018025931,0.0026726527,0.0020187506,0.0016033539,0.00036024148],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00045931374,0.00011990099,0.002548929,0.0005110673,0.000113781185,0.00038599278,0.0010284045,0.5219169,0.018984659,0.18275173,0.0013865036,0.2697928],"study_design_scores_gemma":[0.00005366267,0.00015230771,0.00027522267,0.00007249025,0.000048134298,0.00016176452,0.00007434269,0.8968845,0.0117571205,0.085727714,0.004767566,0.000025189545],"about_ca_topic_score_codex":0.002726599,"about_ca_topic_score_gemma":0.0035684602,"teacher_disagreement_score":0.004608056,"about_ca_system_score_codex":0.00076570327,"about_ca_system_score_gemma":0.0014215024,"threshold_uncertainty_score":0.024370015},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01888877,0.00014142919,0.97226894,0.00024839948,0.00007879937,0.000096990814,0.0002345391,0.0012036159,0.0068384954],"genre_scores_gemma":[0.49621695,0.0005488968,0.4836696,0.00034738338,0.0001402825,0.00033275035,0.0012840204,0.0012093171,0.016250817],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9950877,0.0012691298,0.0005669067,0.00056986447,0.0019671032,0.0005392832],"domain_scores_gemma":[0.9875165,0.006847669,0.0008707254,0.0030874608,0.0013476313,0.00032993077],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006611271,0.0009782978,0.00079368334,0.0013176316,0.0010099333,0.0043442254,0.0019037358,0.0019890051,0.0044550956],"category_scores_gemma":[0.014787464,0.0013604861,0.0019585367,0.0014238043,0.0026667707,0.007670192,0.0032790222,0.0028344456,0.00111638],"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.000079337595,0.00004339347,0.0003509092,0.00009587672,0.000021356316,0.00019207876,0.00050845137,0.012959242,0.0037349355,0.9639667,0.00055960706,0.017487988],"study_design_scores_gemma":[0.00006550956,0.000052787713,0.00016208485,0.00009297707,0.00010150617,0.00018082872,0.00014041997,0.09574024,0.018628126,0.8591958,0.025588078,0.00005178513],"about_ca_topic_score_codex":0.00290873,"about_ca_topic_score_gemma":0.0032120568,"teacher_disagreement_score":0.006611271,"about_ca_system_score_codex":0.0015691477,"about_ca_system_score_gemma":0.0026604445,"threshold_uncertainty_score":0.034964144},"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":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017263329,0.000048199763,0.9337401,0.00010550189,0.0001188392,0.00016743022,0.0017250871,0.05986634,0.002502193],"genre_scores_gemma":[0.090994135,0.00043226447,0.8511193,0.00042142754,0.00011482292,0.0020908674,0.010271241,0.03331842,0.011237516],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9977457,0.0005555803,0.00023924262,0.0004712834,0.00082257274,0.00016563827],"domain_scores_gemma":[0.99497616,0.0025842723,0.000332091,0.0010994747,0.00084030925,0.0001676626],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025958982,0.0014378456,0.00071428803,0.0010132596,0.00052357226,0.0019657314,0.002352295,0.0012047642,0.035685427],"category_scores_gemma":[0.009864921,0.0011710548,0.0018522844,0.0006709798,0.0012149202,0.002687441,0.002269107,0.002855942,0.011878084],"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.0016171387,0.0005509969,0.003206199,0.0030974597,0.00027358715,0.0016189343,0.0018293939,0.12581806,0.09602409,0.27758807,0.11224883,0.37612718],"study_design_scores_gemma":[0.00044225517,0.00033842685,0.00079086004,0.0003714039,0.00012240396,0.0009829092,0.00013573923,0.44998062,0.09702295,0.09524785,0.354359,0.00020559186],"about_ca_topic_score_codex":0.0015151051,"about_ca_topic_score_gemma":0.0012384929,"teacher_disagreement_score":0.035685427,"about_ca_system_score_codex":0.00087411655,"about_ca_system_score_gemma":0.0022280938,"threshold_uncertainty_score":0.11937964},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00067810086,0.00005515616,0.9947701,0.000062286854,0.000018643676,0.00007689663,0.000048701604,0.003738882,0.00055110786],"genre_scores_gemma":[0.038371205,0.00008751372,0.9592814,0.00007288423,0.000027068196,0.00021337089,0.00021567201,0.00083731255,0.0008935346],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9917156,0.002761932,0.000664214,0.0013286328,0.002843817,0.00068586116],"domain_scores_gemma":[0.98213655,0.011175509,0.0007308769,0.0038044283,0.001862226,0.0002903213],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007221956,0.0026417358,0.00219971,0.005403483,0.0016542556,0.00443478,0.0053826915,0.0034978213,0.012299251],"category_scores_gemma":[0.030926902,0.0020134058,0.0039754068,0.0024528974,0.0033407598,0.0070216996,0.006344877,0.0033440113,0.0033001646],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00062834023,0.00041196085,0.0016237727,0.0010127344,0.00033119542,0.00090992794,0.00090066803,0.099509716,0.015998727,0.39388043,0.011097797,0.47369474],"study_design_scores_gemma":[0.00013221764,0.000099816236,0.00018102955,0.00017925455,0.0001632041,0.00048812156,0.00011553804,0.7315498,0.021781866,0.2244771,0.020733507,0.00009849401],"about_ca_topic_score_codex":0.0031941435,"about_ca_topic_score_gemma":0.004197693,"teacher_disagreement_score":0.012299251,"about_ca_system_score_codex":0.0011190226,"about_ca_system_score_gemma":0.0029837098,"threshold_uncertainty_score":0.041145027},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.133424,0.00015399935,0.8606176,0.00020150976,0.000104010054,0.000071118346,0.00009062968,0.0031150763,0.0022220965],"genre_scores_gemma":[0.886673,0.00007971388,0.11199363,0.00006576888,0.00001988107,0.000100560035,0.0001101539,0.00018330738,0.0007740397],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977452,0.0007671415,0.0002005465,0.00030002554,0.00065850356,0.00032861077],"domain_scores_gemma":[0.9918419,0.0046520303,0.000604427,0.002320422,0.00037695284,0.00020422915],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027495134,0.0007216185,0.0013692987,0.00085490866,0.0009552932,0.0020268837,0.001795279,0.0010362013,0.0018707464],"category_scores_gemma":[0.009505981,0.00092880195,0.0016873112,0.00060076965,0.0034874638,0.005015321,0.0031108947,0.0028798608,0.00018712161],"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.0005830601,0.00013838724,0.0031264857,0.00023533504,0.00021775064,0.00031484704,0.0004730075,0.7234877,0.01153072,0.23357193,0.0007369207,0.025583962],"study_design_scores_gemma":[0.00005476764,0.000037591744,0.0001316017,0.000012406542,0.000044714245,0.000018464778,0.000029790965,0.86767685,0.003913752,0.12749821,0.00056432164,0.000017488937],"about_ca_topic_score_codex":0.0048178895,"about_ca_topic_score_gemma":0.008542986,"teacher_disagreement_score":0.0048178895,"about_ca_system_score_codex":0.0012499368,"about_ca_system_score_gemma":0.0017070376,"threshold_uncertainty_score":0.01454103},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0120210005,0.00010092477,0.98331946,0.00010452386,0.000055111257,0.00021457665,0.0002123842,0.0024825293,0.0014894458],"genre_scores_gemma":[0.31104195,0.000481217,0.6823802,0.0001238651,0.000054698434,0.0008450512,0.001175419,0.00075473264,0.003142895],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98953897,0.0046234364,0.0009038093,0.0009028729,0.0035754587,0.0004554779],"domain_scores_gemma":[0.98452896,0.008935026,0.0018620506,0.0021171432,0.0023930827,0.00016386302],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009320548,0.001250397,0.00052739267,0.002007754,0.0008847868,0.0022175405,0.0013693437,0.0010906325,0.0022530775],"category_scores_gemma":[0.021845272,0.00086992804,0.0014215424,0.00075304956,0.002042515,0.0020731061,0.0013836977,0.0013308409,0.0006785758],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005919149,0.00031908893,0.007023258,0.0012785291,0.00014367714,0.0015578413,0.0027904718,0.25586683,0.06546874,0.52553093,0.0038099128,0.13561878],"study_design_scores_gemma":[0.0002477135,0.00035176578,0.0017313379,0.0005332121,0.0001656052,0.0007014637,0.00027570312,0.69490373,0.12054414,0.11891334,0.06147555,0.00015644384],"about_ca_topic_score_codex":0.0064261756,"about_ca_topic_score_gemma":0.0052236156,"teacher_disagreement_score":0.009320548,"about_ca_system_score_codex":0.0018596991,"about_ca_system_score_gemma":0.004795347,"threshold_uncertainty_score":0.049292326},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00081821776,0.00005033661,0.9966138,0.000105760555,0.000015567359,0.00005674251,0.00003394204,0.0009131814,0.0013924453],"genre_scores_gemma":[0.11032425,0.0002744756,0.88559294,0.00017018296,0.00007088148,0.00040832054,0.0003137451,0.00045099354,0.002394141],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9944959,0.0016767575,0.000437743,0.00064854027,0.002367459,0.00037352587],"domain_scores_gemma":[0.9949261,0.0026530686,0.0003302539,0.0012642792,0.0006829889,0.0001433609],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00534698,0.001240325,0.00080928346,0.0017151478,0.0008923549,0.002658325,0.0034200135,0.001271152,0.0027275977],"category_scores_gemma":[0.009747094,0.0008058924,0.0025951318,0.001035038,0.0059283935,0.0033532924,0.0026104355,0.0049433606,0.0009917917],"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.000055247423,0.00011668651,0.000460684,0.00018722894,0.000044851204,0.00043182023,0.0006419892,0.07264125,0.005531106,0.86140734,0.0018944915,0.05658741],"study_design_scores_gemma":[0.00007343355,0.000092552196,0.0001973152,0.000113282214,0.000058089332,0.0003237674,0.000090716654,0.32056653,0.009357837,0.63396126,0.035107214,0.000058029702],"about_ca_topic_score_codex":0.0051412033,"about_ca_topic_score_gemma":0.0031238564,"teacher_disagreement_score":0.00534698,"about_ca_system_score_codex":0.0019897106,"about_ca_system_score_gemma":0.0033192069,"threshold_uncertainty_score":0.028277874},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026466286,0.00008417698,0.9688898,0.0002355319,0.000024789677,0.000049837883,0.00010956218,0.0019490105,0.0021909354],"genre_scores_gemma":[0.70920616,0.00017772634,0.2875029,0.00013869301,0.00004715085,0.00015494843,0.0003911052,0.00031655014,0.0020647321],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9948579,0.0015850903,0.00024547515,0.0008307026,0.0020401857,0.00044060466],"domain_scores_gemma":[0.98790145,0.008415066,0.0007332303,0.0021926006,0.00060356123,0.00015406661],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028380502,0.00075765746,0.0011075642,0.0011593325,0.0009773257,0.0028542439,0.0027045645,0.0011083717,0.004350095],"category_scores_gemma":[0.018628748,0.0006867949,0.0018764356,0.0009535585,0.003417146,0.0063503506,0.0031155695,0.0023994276,0.00048389102],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042746236,0.000105371764,0.001538125,0.00035654372,0.00017456281,0.00039495502,0.00058198563,0.46677315,0.009713507,0.44125348,0.0014322909,0.07724861],"study_design_scores_gemma":[0.00005830212,0.000038656963,0.00011618782,0.00003480795,0.000045424276,0.000072173,0.000039235812,0.79814154,0.009006771,0.19062318,0.0018045559,0.00001916124],"about_ca_topic_score_codex":0.0040913736,"about_ca_topic_score_gemma":0.004067137,"teacher_disagreement_score":0.004350095,"about_ca_system_score_codex":0.0022355046,"about_ca_system_score_gemma":0.0027495695,"threshold_uncertainty_score":0.016219795},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021932818,0.00013493576,0.97548485,0.00011240048,0.000023387018,0.000019426107,0.00003344749,0.00022343466,0.002035301],"genre_scores_gemma":[0.734889,0.00043524263,0.25981963,0.00012248164,0.000091739676,0.00014780434,0.0002105826,0.00022852074,0.004054966],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975878,0.00086963474,0.00015808163,0.00040590824,0.000759731,0.00021896929],"domain_scores_gemma":[0.9949275,0.0034178263,0.0004412423,0.00066013745,0.0003736338,0.00017968072],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003943745,0.00072811247,0.0011186625,0.0015542256,0.0007003389,0.0019286805,0.0014896868,0.0009910346,0.0022195808],"category_scores_gemma":[0.014199239,0.0005113946,0.0016555295,0.0009098788,0.0022755198,0.0033807873,0.0022339392,0.0018840822,0.00037005925],"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.000072603194,0.000030214986,0.0015224814,0.000066133325,0.000058978316,0.000109667184,0.00025903282,0.40635476,0.0019416453,0.57611275,0.00037963162,0.01309204],"study_design_scores_gemma":[0.0000043022956,0.000014817511,0.000104234394,0.0000079421425,0.000008487536,0.000017264843,0.000012985887,0.8623143,0.00046448296,0.13663264,0.0004105342,0.000007987048],"about_ca_topic_score_codex":0.006513045,"about_ca_topic_score_gemma":0.0043339888,"teacher_disagreement_score":0.006513045,"about_ca_system_score_codex":0.0025831244,"about_ca_system_score_gemma":0.001242628,"threshold_uncertainty_score":0.020856738},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04278911,0.000082909224,0.9536044,0.00006245474,0.000037129226,0.000028770728,0.000053234937,0.0017250037,0.0016170668],"genre_scores_gemma":[0.7861927,0.00013259063,0.211376,0.000043434615,0.000018165825,0.00007360745,0.00010916306,0.00028707174,0.0017672405],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99748105,0.00096912385,0.00015856612,0.0003194323,0.0007895733,0.00028220168],"domain_scores_gemma":[0.99475586,0.003384339,0.00037134596,0.0010824886,0.00035471216,0.00005137081],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019408755,0.0010346043,0.0009611918,0.0008657352,0.00047993386,0.0016803273,0.0012481683,0.0007815042,0.0022792362],"category_scores_gemma":[0.0076024616,0.0005004644,0.0012626752,0.0005583575,0.0029053479,0.0022633679,0.0012921379,0.0012523762,0.00035738095],"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.0011447761,0.0001902016,0.0021949108,0.00044448723,0.00016022676,0.0009852151,0.00071475096,0.5416312,0.036386326,0.30587563,0.00084978883,0.109422475],"study_design_scores_gemma":[0.000067990826,0.00009246866,0.00019913072,0.00005181489,0.00005702819,0.0001063915,0.000031608237,0.8765912,0.037009284,0.08450983,0.0012575977,0.000025750773],"about_ca_topic_score_codex":0.0015499399,"about_ca_topic_score_gemma":0.0017702507,"teacher_disagreement_score":0.0022792362,"about_ca_system_score_codex":0.0009636639,"about_ca_system_score_gemma":0.0015526162,"threshold_uncertainty_score":0.010264456},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12863734,0.00014932816,0.8630584,0.00017883714,0.000024639934,0.00009640725,0.00005311815,0.0050694114,0.002732637],"genre_scores_gemma":[0.5974344,0.00013128153,0.39975828,0.000047138954,0.000023081124,0.000122475,0.0001831688,0.0006540759,0.0016460787],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99096984,0.0030214784,0.000427031,0.00053956837,0.004490924,0.0005511951],"domain_scores_gemma":[0.96577245,0.024204366,0.0017467283,0.004522773,0.0034853786,0.00026826366],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005249854,0.0010845512,0.0010687496,0.001437949,0.00088861235,0.0022224963,0.0025456692,0.0012683076,0.002261796],"category_scores_gemma":[0.044073183,0.00063025486,0.00091209303,0.00097026903,0.0018487014,0.0039847842,0.002279839,0.0020109247,0.00051917374],"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.0010987064,0.0003888043,0.016562307,0.00069681724,0.00012227295,0.00044291108,0.0014128485,0.373511,0.08770999,0.13476528,0.0017981182,0.381491],"study_design_scores_gemma":[0.00005204649,0.00010748081,0.0009113839,0.000033423003,0.0000417621,0.00008144807,0.0000525072,0.9188633,0.047382466,0.030285181,0.0021533587,0.000035690373],"about_ca_topic_score_codex":0.0026441126,"about_ca_topic_score_gemma":0.0029788723,"teacher_disagreement_score":0.005249854,"about_ca_system_score_codex":0.0014106808,"about_ca_system_score_gemma":0.0024921042,"threshold_uncertainty_score":0.02776426},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003650614,0.0002192727,0.993435,0.000084195366,0.00001330374,0.00006984357,0.000018639937,0.0013495112,0.0011596356],"genre_scores_gemma":[0.19648604,0.00054066663,0.79918504,0.000110033594,0.000035038418,0.00025704902,0.00016900795,0.00040417208,0.0028129523],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99665904,0.0012647723,0.0002075552,0.0004978665,0.0011958019,0.00017489621],"domain_scores_gemma":[0.99458754,0.002586813,0.00065295683,0.0014569208,0.0006682488,0.000047602145],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027053813,0.0012854548,0.00079812657,0.0023404597,0.00076816155,0.0012600062,0.0022414727,0.0010665196,0.005506772],"category_scores_gemma":[0.01090462,0.0007466965,0.0012778534,0.0011049375,0.0022756574,0.0021005413,0.0021757104,0.0017731882,0.0008745514],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011739455,0.00014890332,0.0009675155,0.0006923964,0.00006896638,0.00042503135,0.0010048195,0.2032075,0.019436311,0.15525393,0.0024760447,0.6162012],"study_design_scores_gemma":[0.00006488567,0.00019002135,0.00039438673,0.00019978057,0.000059913655,0.00039541392,0.00019275033,0.8255188,0.029317481,0.11889195,0.02472467,0.000050025705],"about_ca_topic_score_codex":0.0019244546,"about_ca_topic_score_gemma":0.0018675216,"teacher_disagreement_score":0.005506772,"about_ca_system_score_codex":0.0011005035,"about_ca_system_score_gemma":0.0018120921,"threshold_uncertainty_score":0.018422008},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21312404,0.0013077332,0.7753194,0.0005956249,0.00019191238,0.00003432727,0.0002121697,0.0008525349,0.008362168],"genre_scores_gemma":[0.89458334,0.0006126966,0.0975327,0.00011723824,0.00006880142,0.00008353427,0.0002993341,0.00023013685,0.006472267],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99853456,0.00029636963,0.000058998263,0.00023359313,0.0006806682,0.00019583102],"domain_scores_gemma":[0.9844694,0.012615329,0.0006808296,0.00068842684,0.0012055915,0.00034038426],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025940249,0.0008881328,0.0009621076,0.0015249795,0.00075410516,0.0019181618,0.00094941654,0.0012643237,0.0050558373],"category_scores_gemma":[0.016107777,0.0003986343,0.0010682065,0.0005745663,0.001849144,0.0014004742,0.0010571042,0.002153539,0.00048925914],"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.0021879817,0.00016796097,0.007554122,0.00043342807,0.00019916377,0.00085567136,0.00082499307,0.8005703,0.029606745,0.0646726,0.0023702462,0.09055679],"study_design_scores_gemma":[0.000023533596,0.0000861228,0.0012422766,0.0000395285,0.000017742217,0.00016637851,0.00006477318,0.983365,0.004864983,0.008766704,0.0013488001,0.000014109195],"about_ca_topic_score_codex":0.013254222,"about_ca_topic_score_gemma":0.006662487,"teacher_disagreement_score":0.013254222,"about_ca_system_score_codex":0.0024160715,"about_ca_system_score_gemma":0.0010799263,"threshold_uncertainty_score":0.026354134},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011204792,0.00017100899,0.98203063,0.00039028513,0.000093968825,0.00010829422,0.00018076641,0.0019931134,0.0038271043],"genre_scores_gemma":[0.41593492,0.0003185491,0.5790212,0.0003638101,0.00006672918,0.00033929368,0.00053350115,0.00039523936,0.0030267588],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9928832,0.0022897401,0.00053395936,0.0010932577,0.0026345374,0.0005652841],"domain_scores_gemma":[0.98680335,0.008081825,0.00086336,0.0026616333,0.0013417086,0.00024814118],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005600933,0.0011323073,0.0014799203,0.0015129037,0.0012647357,0.003920918,0.0034765087,0.0015577578,0.0047924533],"category_scores_gemma":[0.016556012,0.0007470801,0.0028413206,0.0013493457,0.0039000968,0.006764889,0.004209601,0.002886376,0.00057005516],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022396397,0.00010968015,0.0015438135,0.00035665487,0.00013913972,0.00045985793,0.00045127817,0.2755729,0.0053887162,0.6705075,0.001877678,0.043368816],"study_design_scores_gemma":[0.0000582361,0.00003594123,0.00007916423,0.00006606608,0.000050943843,0.00009422375,0.00004556232,0.74629456,0.008944369,0.23891218,0.0053893523,0.000029487212],"about_ca_topic_score_codex":0.003913706,"about_ca_topic_score_gemma":0.004841553,"teacher_disagreement_score":0.005600933,"about_ca_system_score_codex":0.0031851092,"about_ca_system_score_gemma":0.0038675552,"threshold_uncertainty_score":0.029620886},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002504976,0.00055041956,0.98808265,0.00074398605,0.00008800986,0.00021162297,0.0005085313,0.0022736941,0.0050361915],"genre_scores_gemma":[0.14846154,0.0020612304,0.8394028,0.00084307295,0.00020508499,0.0008714495,0.0027738777,0.0008131643,0.0045677572],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98508954,0.0064494195,0.0012966878,0.0017510719,0.00452079,0.0008924384],"domain_scores_gemma":[0.97894233,0.014523698,0.00091041735,0.0036668207,0.0017311305,0.00022561979],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009855345,0.0015894792,0.001675349,0.0031447068,0.0013263482,0.005332992,0.0042615416,0.0017485606,0.007100579],"category_scores_gemma":[0.026799979,0.0013614524,0.0047356994,0.0028960977,0.004272204,0.0073972456,0.0053177187,0.004023892,0.0017237434],"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.00018204303,0.0001314447,0.0009715414,0.0010531559,0.0003150058,0.00050202827,0.00051051093,0.08090914,0.0048534693,0.80583686,0.006834864,0.09789995],"study_design_scores_gemma":[0.0001774998,0.00006465951,0.00016900813,0.000277515,0.00012955064,0.00023237708,0.00010081922,0.19798814,0.010006679,0.75262946,0.038153134,0.000071144525],"about_ca_topic_score_codex":0.008031501,"about_ca_topic_score_gemma":0.0055989334,"teacher_disagreement_score":0.009855345,"about_ca_system_score_codex":0.0037910468,"about_ca_system_score_gemma":0.0052437396,"threshold_uncertainty_score":0.052120686},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007175405,0.00002519682,0.9979138,0.00004340437,0.00000987439,0.000039223574,0.000048618935,0.0008231123,0.00037917655],"genre_scores_gemma":[0.09789453,0.0001836605,0.9000495,0.00007717083,0.00003253694,0.00024444165,0.00031320666,0.0002561067,0.0009488812],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9927845,0.00217626,0.0005562033,0.0011648658,0.0029290128,0.0003891362],"domain_scores_gemma":[0.993778,0.0027595304,0.000662024,0.0011408065,0.0015225434,0.00013716094],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0069287387,0.001019803,0.00059799815,0.0017178383,0.0008802485,0.0020670246,0.0022450022,0.0010450473,0.0031440165],"category_scores_gemma":[0.014320436,0.0008694673,0.0027186042,0.0009804543,0.0022941062,0.0030455943,0.0020693159,0.0026132625,0.00086224335],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011125371,0.00006279741,0.0009949201,0.00047243992,0.00010010184,0.00068664516,0.00052885636,0.21891585,0.018414114,0.67912245,0.002060978,0.07852951],"study_design_scores_gemma":[0.0000671444,0.00009546567,0.00024870658,0.00012720558,0.00008736627,0.00032221386,0.00006338677,0.7874977,0.025069835,0.15848027,0.027882796,0.00005788563],"about_ca_topic_score_codex":0.0060896,"about_ca_topic_score_gemma":0.003933131,"teacher_disagreement_score":0.0069287387,"about_ca_system_score_codex":0.0016028067,"about_ca_system_score_gemma":0.004945434,"threshold_uncertainty_score":0.036643147},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24598381,0.0002094061,0.74510205,0.00026720302,0.00007737762,0.00011184984,0.00017812975,0.005590954,0.00247925],"genre_scores_gemma":[0.94839007,0.0000731634,0.05016825,0.000059050064,0.000028739263,0.00006699511,0.00010572065,0.0002156952,0.00089231844],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99383897,0.0022397975,0.00028474376,0.0007941881,0.0020363845,0.0008059831],"domain_scores_gemma":[0.982464,0.011645559,0.0014908498,0.002974074,0.0011855687,0.00023998931],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0043940526,0.0012037491,0.0011969359,0.0017587251,0.0010351263,0.0025745425,0.0028218399,0.0011916516,0.0020624462],"category_scores_gemma":[0.017435467,0.001128596,0.002085844,0.0011292406,0.0034882412,0.0046480014,0.0023867392,0.0017251413,0.00024990257],"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.0019197119,0.000484179,0.01243097,0.0005003397,0.00032494165,0.0006935236,0.00072645344,0.73839617,0.04638654,0.1293091,0.0013613639,0.067466706],"study_design_scores_gemma":[0.000110111316,0.000117036405,0.00036227485,0.000027361655,0.00010443808,0.00007479023,0.000041873096,0.9186908,0.026419524,0.053470016,0.00055310794,0.00002854947],"about_ca_topic_score_codex":0.007945425,"about_ca_topic_score_gemma":0.01074712,"teacher_disagreement_score":0.007945425,"about_ca_system_score_codex":0.0020436759,"about_ca_system_score_gemma":0.00447224,"threshold_uncertainty_score":0.023238242},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15621857,0.00066596665,0.81207144,0.0006600465,0.00026799488,0.00033418476,0.00060612615,0.004206322,0.024969317],"genre_scores_gemma":[0.7640065,0.0003531453,0.22362137,0.00054286554,0.00013829883,0.00041317113,0.0010945686,0.0005856636,0.009244477],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99189067,0.0021488105,0.0004978517,0.0013626775,0.003450128,0.0006499424],"domain_scores_gemma":[0.9717101,0.020227825,0.0016510279,0.003262873,0.002601893,0.0005462593],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004688273,0.0007761617,0.0005427289,0.0009310441,0.000674392,0.0014557462,0.0020791702,0.0012138897,0.009053442],"category_scores_gemma":[0.023928719,0.0004010851,0.0009283615,0.0005670411,0.0016924813,0.0042128945,0.0025322565,0.0013541759,0.0014161721],"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.0015575476,0.00051558303,0.023547567,0.0014584633,0.00024976852,0.001708586,0.0028790103,0.043797605,0.07842023,0.4443134,0.012056121,0.38949603],"study_design_scores_gemma":[0.0005972895,0.0035648905,0.011873755,0.00071274216,0.00028965386,0.0038130858,0.0015099123,0.2908957,0.15967758,0.37364972,0.15315165,0.00026403685],"about_ca_topic_score_codex":0.0012893411,"about_ca_topic_score_gemma":0.00095056824,"teacher_disagreement_score":0.009053442,"about_ca_system_score_codex":0.00079690956,"about_ca_system_score_gemma":0.0012710782,"threshold_uncertainty_score":0.030286789},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020296646,0.0002461356,0.97900873,0.00040706954,0.00014415932,0.00014222309,0.0003675677,0.0020224962,0.015632076],"genre_scores_gemma":[0.08717882,0.00069579686,0.88714623,0.00065598154,0.000119775286,0.0003453483,0.0013732592,0.0011419646,0.021342838],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988673,0.00030173187,0.000062900144,0.00022383645,0.0004125106,0.00013182807],"domain_scores_gemma":[0.9984971,0.00096286176,0.00004576896,0.00018942199,0.00025971903,0.000045034078],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015216426,0.0012518018,0.0011260433,0.0010849538,0.0008820616,0.002285723,0.0030752644,0.0016405485,0.027879177],"category_scores_gemma":[0.0050488194,0.00068350596,0.0011011537,0.0018028377,0.0011909492,0.0041295122,0.0019725394,0.00305179,0.0048566433],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003075529,0.00014640192,0.0002227907,0.0007756199,0.000063330306,0.00017800536,0.00018833666,0.05859356,0.006639248,0.5019922,0.039552674,0.39134032],"study_design_scores_gemma":[0.00019739562,0.00006608805,0.00006692168,0.00015622354,0.00005497084,0.00019840592,0.00005143419,0.33046392,0.009766483,0.6053487,0.05359348,0.000035900965],"about_ca_topic_score_codex":0.004660924,"about_ca_topic_score_gemma":0.006437666,"teacher_disagreement_score":0.027879177,"about_ca_system_score_codex":0.0016288736,"about_ca_system_score_gemma":0.0026874025,"threshold_uncertainty_score":0.093265116},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008510956,0.00002378364,0.9889535,0.000034252884,0.000022346816,0.00009078469,0.000079884514,0.001599378,0.0006850688],"genre_scores_gemma":[0.2754327,0.00014197004,0.7202025,0.00008619052,0.000023545072,0.0005033861,0.00045071886,0.00081561256,0.0023432723],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99678445,0.0008379493,0.00029698884,0.00055490225,0.0012427779,0.00028293455],"domain_scores_gemma":[0.99480927,0.0031817865,0.0004184813,0.0007069365,0.00081985624,0.00006371187],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022227152,0.00064506644,0.00042829764,0.00072710915,0.00048375613,0.00092406984,0.00092268107,0.000618429,0.0024379673],"category_scores_gemma":[0.009426858,0.00045152663,0.0011150701,0.0004823812,0.0016372621,0.00117458,0.000990952,0.0012896537,0.00050280784],"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.00037717473,0.0001468953,0.004057819,0.0005532587,0.000101563135,0.0010930964,0.0007201613,0.39929816,0.046919007,0.3858724,0.0021389688,0.15872155],"study_design_scores_gemma":[0.000115994386,0.00018024493,0.0005023512,0.000096556025,0.000058240817,0.0003292843,0.00006313046,0.8173501,0.07692671,0.08639347,0.017925233,0.000058681817],"about_ca_topic_score_codex":0.0028644851,"about_ca_topic_score_gemma":0.001745811,"teacher_disagreement_score":0.0028644851,"about_ca_system_score_codex":0.00069909997,"about_ca_system_score_gemma":0.0017656805,"threshold_uncertainty_score":0.01175499},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004118235,0.00003815665,0.99294734,0.0000489014,0.0000422957,0.000041017236,0.00004467768,0.0011235364,0.0015958647],"genre_scores_gemma":[0.2665693,0.00041667162,0.7263028,0.00017874037,0.000113986556,0.00030597503,0.0003497265,0.00067707145,0.0050856937],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99735224,0.0008329625,0.00029125545,0.0005214831,0.00074658584,0.0002554982],"domain_scores_gemma":[0.9946913,0.0030883686,0.00029124063,0.0012612048,0.0005185364,0.00014932823],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037701372,0.00085889566,0.00062690064,0.0013186377,0.00085868745,0.0020843223,0.0014955335,0.0010616153,0.004850503],"category_scores_gemma":[0.0082222745,0.0008015854,0.002665229,0.0012750808,0.0024788172,0.00702036,0.0030783652,0.0022406902,0.0011117544],"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.00011520389,0.00010370551,0.00060612883,0.00019838208,0.000045825207,0.0003441246,0.0006581116,0.03286131,0.008329055,0.8563482,0.001212009,0.09917791],"study_design_scores_gemma":[0.000052007443,0.000087732136,0.00017698851,0.00007586533,0.00011209143,0.00013211051,0.000062798914,0.1580592,0.01189796,0.8018298,0.02745813,0.000055287983],"about_ca_topic_score_codex":0.0018752295,"about_ca_topic_score_gemma":0.0016760988,"teacher_disagreement_score":0.004850503,"about_ca_system_score_codex":0.0006281784,"about_ca_system_score_gemma":0.0013007567,"threshold_uncertainty_score":0.019938648},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015445062,0.00026706708,0.98021746,0.0010685179,0.00006011362,0.000115806644,0.00011993186,0.0007744088,0.001931676],"genre_scores_gemma":[0.5931837,0.0007096902,0.40276912,0.00035988234,0.00018494634,0.00060052704,0.00033961993,0.00035185646,0.0015007452],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.97021806,0.013738659,0.0026971442,0.0024393892,0.009164785,0.0017419303],"domain_scores_gemma":[0.94651765,0.034162313,0.003399115,0.01153448,0.0037745675,0.0006120006],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.020278456,0.001591911,0.0019094805,0.0023950143,0.0020038967,0.008277534,0.0036732054,0.0028751134,0.0020442505],"category_scores_gemma":[0.056214053,0.002106106,0.003999995,0.0017006132,0.011374105,0.014066258,0.0054666535,0.0068450808,0.00047475583],"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.0001300033,0.000089781395,0.00087935914,0.00024102346,0.00007150342,0.00008757216,0.00046595905,0.05400701,0.0023464854,0.9247304,0.00079198607,0.01615902],"study_design_scores_gemma":[0.000070088456,0.00005635253,0.00020289801,0.00010297748,0.00008564223,0.000053680804,0.000077891695,0.20092607,0.007866472,0.7877764,0.0027311884,0.000050308987],"about_ca_topic_score_codex":0.0061932425,"about_ca_topic_score_gemma":0.0045053144,"teacher_disagreement_score":0.020278456,"about_ca_system_score_codex":0.005071188,"about_ca_system_score_gemma":0.009009805,"threshold_uncertainty_score":0.107244015},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022161733,0.00005119733,0.9736139,0.0002716386,0.000042661024,0.00008894535,0.000087091415,0.0013658996,0.0023170277],"genre_scores_gemma":[0.6012533,0.00017420715,0.39445338,0.00033711022,0.000056670273,0.00028401444,0.0005108418,0.00040977923,0.0025206576],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9952382,0.0012828629,0.00021137414,0.00044401706,0.0021188296,0.00070466916],"domain_scores_gemma":[0.98621964,0.00881096,0.0005523812,0.002638816,0.001582076,0.00019609483],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003388812,0.00065074617,0.00084867334,0.0011041478,0.0010414569,0.0021689362,0.0024635342,0.00090358796,0.0019819895],"category_scores_gemma":[0.014204606,0.00050516514,0.0028137942,0.00063145434,0.0028123562,0.0031954492,0.0034535187,0.0039624134,0.00038220664],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002591927,0.00034874846,0.0022829326,0.00034077498,0.0001885461,0.00078109355,0.0007824131,0.48671737,0.021252431,0.40083632,0.0022736331,0.08393649],"study_design_scores_gemma":[0.000046477562,0.000043138967,0.00014818962,0.000029530203,0.00006235622,0.00007574981,0.00008927279,0.7664654,0.024758026,0.20641927,0.0018424462,0.0000200607],"about_ca_topic_score_codex":0.007752602,"about_ca_topic_score_gemma":0.008171705,"teacher_disagreement_score":0.007752602,"about_ca_system_score_codex":0.0021367802,"about_ca_system_score_gemma":0.00404966,"threshold_uncertainty_score":0.017921925},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023389228,0.00002290502,0.9950676,0.00004581719,0.00001554746,0.00004985532,0.00004713275,0.000844204,0.0015680935],"genre_scores_gemma":[0.16478284,0.00013617665,0.82967955,0.00014414043,0.00003902613,0.00018223195,0.00047972138,0.0006335058,0.0039227516],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977429,0.0005951247,0.00013655043,0.00048184893,0.0007273205,0.00031624694],"domain_scores_gemma":[0.9970605,0.0014393623,0.00014230565,0.0009790262,0.00029156954,0.00008725225],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016775739,0.00088203215,0.0009346714,0.0016595577,0.0009569862,0.0019034622,0.0024983326,0.00068365905,0.0068746987],"category_scores_gemma":[0.0027823986,0.000758666,0.0027138328,0.0009737646,0.0018153951,0.004257776,0.0030160663,0.0027901384,0.0014971523],"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.0003311062,0.0006983643,0.0015522988,0.0006225183,0.00019846337,0.0004235969,0.00046704998,0.15183882,0.02941889,0.5196762,0.003404335,0.29136825],"study_design_scores_gemma":[0.00005818643,0.0001242085,0.0003251714,0.000077912046,0.00019166863,0.00010193306,0.00007283035,0.532752,0.029975742,0.42807803,0.008187757,0.000054641023],"about_ca_topic_score_codex":0.0018671936,"about_ca_topic_score_gemma":0.004238195,"teacher_disagreement_score":0.0068746987,"about_ca_system_score_codex":0.00086543406,"about_ca_system_score_gemma":0.0016678927,"threshold_uncertainty_score":0.022998214},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04051004,0.000050930885,0.9565148,0.00021055357,0.000011645411,0.00013224357,0.000034395827,0.001145927,0.0013893674],"genre_scores_gemma":[0.46589354,0.00023064224,0.5318647,0.00024860437,0.000027350643,0.00026931736,0.00019625427,0.00048374664,0.0007858579],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9938211,0.0027366537,0.00075750577,0.0006800957,0.001599563,0.0004050099],"domain_scores_gemma":[0.97941786,0.011424942,0.0021721902,0.0052630515,0.0014683947,0.00025348886],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006732702,0.00093826925,0.0009282411,0.0011815712,0.00064262515,0.0017638197,0.0012425665,0.0010183031,0.0011525287],"category_scores_gemma":[0.019245181,0.00093267555,0.0018460864,0.0006367387,0.0034287695,0.0049356357,0.003661236,0.0021063937,0.00031888176],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024034636,0.00015865485,0.0059664124,0.0007988603,0.00020989016,0.0020203833,0.0032477826,0.25457582,0.11723226,0.4678255,0.0010109473,0.14671312],"study_design_scores_gemma":[0.00006142236,0.00032427887,0.0011589556,0.00025709634,0.00018097166,0.0011223854,0.00044183806,0.4640284,0.09910337,0.42140567,0.011774106,0.00014153216],"about_ca_topic_score_codex":0.00068308756,"about_ca_topic_score_gemma":0.0011392322,"teacher_disagreement_score":0.006732702,"about_ca_system_score_codex":0.00069394894,"about_ca_system_score_gemma":0.0017945641,"threshold_uncertainty_score":0.035606384},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005132013,0.00061959826,0.9764258,0.00083493866,0.00045539738,0.00019201316,0.00039592315,0.0010388155,0.014905599],"genre_scores_gemma":[0.30943316,0.0016526019,0.6697953,0.001205184,0.0010809728,0.0013650723,0.0013120064,0.00067306944,0.013482646],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99677795,0.0007393502,0.0004856369,0.0005662057,0.0010746213,0.0003561587],"domain_scores_gemma":[0.99663144,0.0011245315,0.00036140266,0.0003575973,0.0012341465,0.000290869],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002473523,0.0011147939,0.0007327914,0.0016542666,0.001552158,0.003290492,0.0015736229,0.0017124123,0.0062138615],"category_scores_gemma":[0.0048003034,0.00053475786,0.0019048153,0.0014847473,0.0031643752,0.005158209,0.0026506141,0.0031459955,0.00164344],"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.00002282605,0.000017548538,0.000053710202,0.00007029249,0.000009833152,0.0001731792,0.00038126268,0.0020987524,0.0017325024,0.98690933,0.0011487767,0.0073820627],"study_design_scores_gemma":[0.000073632174,0.00007447512,0.000062702085,0.00008982747,0.00003987476,0.00050849345,0.0002457882,0.02228648,0.004929035,0.8664896,0.10515889,0.000041216004],"about_ca_topic_score_codex":0.0013018771,"about_ca_topic_score_gemma":0.00091861974,"teacher_disagreement_score":0.0062138615,"about_ca_system_score_codex":0.0016249353,"about_ca_system_score_gemma":0.0020511525,"threshold_uncertainty_score":0.020787477},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10347864,0.008036594,0.6809962,0.026001345,0.002659753,0.0002538575,0.00077775936,0.001489879,0.17630598],"genre_scores_gemma":[0.874487,0.0031580697,0.08437799,0.004466825,0.0022690424,0.00041670122,0.0011879327,0.0009236945,0.028712887],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99181056,0.0026322221,0.0007980863,0.0020449099,0.0018149182,0.000899361],"domain_scores_gemma":[0.97371835,0.016566893,0.001632111,0.004313347,0.002906449,0.00086284505],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007388001,0.00066174037,0.0011855825,0.0024241046,0.0037466732,0.0040655574,0.0017844067,0.0022944335,0.008883892],"category_scores_gemma":[0.03431058,0.00072322326,0.0019646643,0.001491535,0.0089584,0.018603597,0.009854094,0.0052654156,0.001092139],"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.00006284974,0.000027366643,0.00039601748,0.000089169254,0.000012891507,0.00025374282,0.0009441812,0.0009072792,0.0005470675,0.9802664,0.0039876485,0.0125053935],"study_design_scores_gemma":[0.000018140998,0.000019263096,0.00012769502,0.000056452565,0.000011794175,0.00018265983,0.00023209497,0.0040064612,0.00068328856,0.9767097,0.017938644,0.000013834679],"about_ca_topic_score_codex":0.0020807476,"about_ca_topic_score_gemma":0.0012818237,"teacher_disagreement_score":0.008883892,"about_ca_system_score_codex":0.0027080574,"about_ca_system_score_gemma":0.001296502,"threshold_uncertainty_score":0.039071918},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.077299975,0.00011469367,0.91813517,0.00025248702,0.00005186859,0.000190641,0.00015093462,0.0024524482,0.0013517499],"genre_scores_gemma":[0.7931048,0.00012582082,0.2048298,0.00015830154,0.000040087853,0.00029234873,0.00033146338,0.00023826782,0.0008791029],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9862714,0.0052605644,0.0012749083,0.0021030712,0.0040507964,0.0010391595],"domain_scores_gemma":[0.9480851,0.038496725,0.0050948234,0.004513058,0.0032880697,0.000522124],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010806183,0.0009730759,0.0009954444,0.0014359724,0.0008376441,0.0032980072,0.0022033984,0.0017246018,0.0022314058],"category_scores_gemma":[0.044678956,0.0011165534,0.0027584133,0.00073496427,0.00439011,0.0035414165,0.0026422397,0.0019000762,0.0002633179],"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.0009726449,0.0003261599,0.009079698,0.00065312005,0.0004787218,0.0017135292,0.001296513,0.7171497,0.03223425,0.19328198,0.001082098,0.041731667],"study_design_scores_gemma":[0.00017941077,0.00014690329,0.00031051063,0.00007846851,0.00013064417,0.00014462866,0.00007156272,0.90740794,0.024622552,0.06516546,0.0017083444,0.000033466516],"about_ca_topic_score_codex":0.0073906803,"about_ca_topic_score_gemma":0.004768218,"teacher_disagreement_score":0.010806183,"about_ca_system_score_codex":0.0023118265,"about_ca_system_score_gemma":0.0038175266,"threshold_uncertainty_score":0.05714929},"labels":[],"label_agreement":null},{"id":"W2050180686","doi":"10.1007/s10703-013-0204-6","title":"Verifying global start-up for a Möbius ring-oscillator","year":2013,"lang":"en","type":"article","venue":"Formal Methods in System Design","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Soundness; Generalization; Ring (chemistry); Computer science; Lock (firearm); Differential (mechanical device); Set (abstract data type); Ring oscillator; Theoretical computer science; Algorithm; Mathematics; Electronic engineering; Programming language; Engineering; Mathematical analysis","score_opus":0.10332112468873382,"score_gpt":0.382787888189207,"score_spread":0.27946676350047317,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2050180686","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15286313,0.00006238007,0.8408115,0.00008552584,0.00007443253,0.00008425435,0.00007200632,0.0013675916,0.004579317],"genre_scores_gemma":[0.9585278,0.000025007024,0.03871572,0.00002993451,0.000009758769,0.00005746042,0.000040179693,0.00019157183,0.0024026053],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988066,0.00022409282,0.00006334949,0.00033904015,0.00038549397,0.00018135083],"domain_scores_gemma":[0.9977894,0.0011857643,0.00027052508,0.00040683345,0.00023642581,0.00011103619],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016901973,0.0008082384,0.00090273394,0.0004191765,0.00075617083,0.0011833366,0.0011147626,0.0010769848,0.0057952604],"category_scores_gemma":[0.0046516047,0.00040422188,0.00092247763,0.00014037512,0.001985048,0.001481841,0.0019181225,0.0010979406,0.00084615767],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018514754,0.0002169936,0.006215163,0.0007042799,0.00024609687,0.0021302793,0.0014091383,0.2791293,0.23344648,0.4172226,0.0013248705,0.056103375],"study_design_scores_gemma":[0.00031717378,0.00093619636,0.00097385247,0.000065500775,0.00015077964,0.00034726888,0.00020151584,0.8025983,0.100626156,0.0899585,0.0037338166,0.000090951486],"about_ca_topic_score_codex":0.00063048257,"about_ca_topic_score_gemma":0.00063019537,"teacher_disagreement_score":0.0057952604,"about_ca_system_score_codex":0.00059176306,"about_ca_system_score_gemma":0.00079282734,"threshold_uncertainty_score":0.019387126},"labels":[],"label_agreement":null},{"id":"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012543619,0.0006520875,0.96852475,0.00090506196,0.00037924768,0.00016862461,0.0004235353,0.0021621683,0.014240946],"genre_scores_gemma":[0.42249036,0.0006136155,0.56043696,0.00074283604,0.00039071572,0.0007581774,0.0007619251,0.001138841,0.01266658],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99633884,0.00093350647,0.00048118696,0.00091745274,0.0009918843,0.00033723545],"domain_scores_gemma":[0.99624217,0.0015821799,0.00034133458,0.00073735137,0.0008513255,0.00024576604],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035095133,0.00133639,0.0010875019,0.0015744069,0.0022908081,0.005775718,0.0031981922,0.0025267992,0.006419645],"category_scores_gemma":[0.005878304,0.0011799228,0.002520128,0.00095154915,0.007426524,0.008488642,0.0030348399,0.0048128213,0.0019554985],"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.000025096893,0.00001805692,0.00007241342,0.00006381722,0.000011188437,0.0001121177,0.00067105633,0.0012635227,0.0020195616,0.99123657,0.0006308272,0.003875721],"study_design_scores_gemma":[0.000050976636,0.000051061008,0.00007838136,0.000090048605,0.00004668017,0.00022099825,0.00018467507,0.015030225,0.005225444,0.9404285,0.03853398,0.00005914758],"about_ca_topic_score_codex":0.0014304693,"about_ca_topic_score_gemma":0.0012434721,"teacher_disagreement_score":0.006419645,"about_ca_system_score_codex":0.0019815254,"about_ca_system_score_gemma":0.0029043758,"threshold_uncertainty_score":0.021475911},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022773188,0.00014398395,0.97412825,0.00012496902,0.000022993445,0.0000966234,0.000060053102,0.0011066196,0.0015433478],"genre_scores_gemma":[0.29815134,0.00028722038,0.69874686,0.00013180882,0.000024253239,0.0003063358,0.0004024478,0.0003742909,0.0015754214],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965262,0.0014823632,0.00037969236,0.00030757984,0.0010961478,0.00020806259],"domain_scores_gemma":[0.99066204,0.0054149204,0.00049728475,0.0023802621,0.0009324214,0.000113094415],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0048899557,0.0004904437,0.0009642715,0.0008244598,0.00030699844,0.0011675395,0.0012758055,0.0008039105,0.0018657481],"category_scores_gemma":[0.014678751,0.0004174222,0.0011399877,0.0008480695,0.0014289662,0.0031534322,0.0024340427,0.0019820633,0.0006288484],"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.0006208737,0.00023015086,0.0030050331,0.00067855936,0.000113376365,0.00043176344,0.000939894,0.25919282,0.063193195,0.365023,0.0019380342,0.30463332],"study_design_scores_gemma":[0.00008602249,0.00013659087,0.00023991059,0.00006657955,0.000054582888,0.00012453974,0.00006261248,0.8451135,0.0500945,0.09825954,0.0057348707,0.000026724518],"about_ca_topic_score_codex":0.0006302065,"about_ca_topic_score_gemma":0.0008614049,"teacher_disagreement_score":0.0048899557,"about_ca_system_score_codex":0.00075863244,"about_ca_system_score_gemma":0.0015349282,"threshold_uncertainty_score":0.025860846},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018662378,0.00009907315,0.9703738,0.0005702767,0.0001444751,0.00019620621,0.00023554827,0.005814082,0.0039040756],"genre_scores_gemma":[0.28509888,0.00030639156,0.70409745,0.0010259822,0.00016874798,0.0007233514,0.0010281547,0.0023193592,0.0052317483],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98416466,0.005153495,0.001636919,0.0035836005,0.003955665,0.0015057271],"domain_scores_gemma":[0.9660026,0.019914394,0.002623075,0.006931703,0.0037902398,0.00073801354],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00797938,0.0018838717,0.0015363635,0.0021651716,0.0018231396,0.0037469119,0.002774221,0.0031814387,0.00525467],"category_scores_gemma":[0.033728518,0.0016016343,0.0037909192,0.00078967295,0.004852342,0.009466494,0.006022126,0.0044391295,0.0025768676],"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.0025241317,0.0010888821,0.018207705,0.0021990351,0.00048005828,0.004258075,0.0017448252,0.027290592,0.16286896,0.5022594,0.020544209,0.25653425],"study_design_scores_gemma":[0.00078913796,0.00092646066,0.0028811917,0.00048006038,0.0003930266,0.0027818705,0.0005595538,0.3255849,0.21011639,0.3948348,0.060321398,0.00033119708],"about_ca_topic_score_codex":0.0033373258,"about_ca_topic_score_gemma":0.0018390592,"teacher_disagreement_score":0.00797938,"about_ca_system_score_codex":0.00090209715,"about_ca_system_score_gemma":0.0029121493,"threshold_uncertainty_score":0.042199492},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016700152,0.00014677456,0.9953738,0.00023982499,0.000060886654,0.00004462076,0.000027659298,0.0006131755,0.0018233008],"genre_scores_gemma":[0.11325925,0.00074599107,0.8797451,0.00026545709,0.00015354574,0.00024448385,0.00013368686,0.0002257243,0.0052267076],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969363,0.000766513,0.00024386428,0.00040174363,0.0013795445,0.00027207026],"domain_scores_gemma":[0.9968933,0.0014404905,0.00021952626,0.0008252169,0.00052200444,0.00009943199],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034016166,0.00066231197,0.0005869874,0.0010286832,0.001213644,0.0029489289,0.0030444232,0.0013967628,0.0033219242],"category_scores_gemma":[0.004939621,0.0011795576,0.002309416,0.00061510154,0.0054884367,0.0045548314,0.0024817442,0.0039150245,0.00087103696],"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.000063783686,0.00008032023,0.00022022094,0.00029123636,0.000040926963,0.00027581883,0.00083449326,0.029243147,0.011794208,0.9019442,0.0021474096,0.053064167],"study_design_scores_gemma":[0.000097108765,0.00013157347,0.00012401924,0.00014125535,0.00008990167,0.00047952382,0.00017970744,0.17773405,0.027465107,0.70465523,0.088822365,0.00008016896],"about_ca_topic_score_codex":0.002581675,"about_ca_topic_score_gemma":0.0026135112,"teacher_disagreement_score":0.0034016166,"about_ca_system_score_codex":0.0015507207,"about_ca_system_score_gemma":0.0027202468,"threshold_uncertainty_score":0.017989695},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0070134387,0.0001884802,0.98561954,0.0006301052,0.000060875373,0.000090273854,0.000049437695,0.0005132524,0.005834553],"genre_scores_gemma":[0.22020017,0.00046458736,0.7740304,0.0005489573,0.00007479983,0.0002427572,0.00025852656,0.000259531,0.003920203],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99499077,0.0025642465,0.00026576058,0.0004521869,0.0013651139,0.0003618938],"domain_scores_gemma":[0.9875608,0.009423958,0.00038089487,0.0012139786,0.0012372087,0.00018320349],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0066239284,0.0007664056,0.0007724687,0.0011918986,0.00097262266,0.0025159938,0.0025149921,0.001328054,0.007709722],"category_scores_gemma":[0.019622229,0.00065482425,0.0010140036,0.0014360942,0.0024802457,0.0042510047,0.0041823057,0.0036681986,0.000914601],"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.0003369013,0.0003596511,0.0009509415,0.00046293682,0.000070697395,0.00020093367,0.00039800807,0.14387201,0.0061190473,0.5832133,0.006969376,0.2570462],"study_design_scores_gemma":[0.00004662925,0.000040913274,0.00007329405,0.00005758037,0.000016820022,0.00005837396,0.000040118077,0.8128031,0.0053992853,0.17606948,0.0053786105,0.000015774463],"about_ca_topic_score_codex":0.0062548425,"about_ca_topic_score_gemma":0.0061356025,"teacher_disagreement_score":0.007709722,"about_ca_system_score_codex":0.0024781171,"about_ca_system_score_gemma":0.003806233,"threshold_uncertainty_score":0.03503108},"labels":[],"label_agreement":null},{"id":"W2053340187","doi":"10.1023/a:1008795229459","title":"Delay-Insensitivity and Semi-Modularity","year":2000,"lang":"en","type":"article","venue":"Formal Methods in System Design","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; University of Waterloo","funders":"","keywords":"Correctness; Asynchronous communication; Equivalence (formal languages); Inertial frame of reference; Computer science; Modularity (biology); Modular design; Electronic circuit; Bisimulation; Component (thermodynamics); Theoretical computer science; Topology (electrical circuits); Algorithm; Mathematics; Discrete mathematics; Programming language; Physics; Engineering; Electrical engineering; Telecommunications","score_opus":0.05309760259252033,"score_gpt":0.3447944458955521,"score_spread":0.29169684330303175,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2053340187","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016166776,0.00018027982,0.9790715,0.000147685,0.000035631343,0.000039549075,0.000027284035,0.00028407908,0.0040472155],"genre_scores_gemma":[0.7912922,0.0005595356,0.20113134,0.00023904136,0.00010165217,0.0003166107,0.000071756534,0.0003299922,0.005957776],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99676895,0.00088033476,0.0002231631,0.0006950993,0.0011070773,0.00032539383],"domain_scores_gemma":[0.9808772,0.012980439,0.0014087036,0.0027836396,0.0015537366,0.00039633963],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004084856,0.0008248,0.0009165979,0.0010365789,0.0007397643,0.001461325,0.0014710011,0.0009803398,0.003244014],"category_scores_gemma":[0.014853242,0.0012504923,0.0014758285,0.00062157225,0.0044258265,0.0051430184,0.0032593776,0.0024391413,0.00066263904],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014175558,0.000059308808,0.00052369025,0.00030740837,0.00007533308,0.00022617185,0.0006339935,0.038735017,0.010521218,0.9198624,0.00048568536,0.028427929],"study_design_scores_gemma":[0.000066853645,0.000105002066,0.00023039675,0.000051267023,0.00009399676,0.00035759632,0.000063975946,0.06633638,0.015506221,0.91251844,0.0046319054,0.00003796545],"about_ca_topic_score_codex":0.00036514885,"about_ca_topic_score_gemma":0.00029305133,"teacher_disagreement_score":0.004084856,"about_ca_system_score_codex":0.0008466072,"about_ca_system_score_gemma":0.001016939,"threshold_uncertainty_score":0.021603048},"labels":[],"label_agreement":null},{"id":"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15903142,0.0013497337,0.80722946,0.00070939946,0.000120330624,0.00008443458,0.00018435383,0.00075636484,0.030534456],"genre_scores_gemma":[0.8492186,0.0006164968,0.1371313,0.0002965022,0.0001353307,0.00014492648,0.00037655066,0.00025142776,0.011828776],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99828196,0.00043439915,0.000121050645,0.00048806632,0.0004453988,0.00022912849],"domain_scores_gemma":[0.99862313,0.0005902452,0.00014727617,0.00018156754,0.00033867883,0.0001191484],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018880211,0.00036084725,0.00034782066,0.0014715133,0.0008510752,0.0018702584,0.000653034,0.0005158463,0.0026412848],"category_scores_gemma":[0.002355112,0.00030108332,0.0010755586,0.000772409,0.0031017396,0.004216423,0.002699064,0.0011691571,0.0004132643],"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.000034399003,0.000013993694,0.0003062373,0.000066220186,0.000013314183,0.00014067844,0.00065532397,0.0017278912,0.0035441497,0.9794545,0.00029688558,0.013746329],"study_design_scores_gemma":[0.000005455247,0.000040851275,0.00030245518,0.00001838751,0.000014597413,0.00023590485,0.00022395147,0.006186454,0.0042360257,0.97930336,0.00941573,0.000016768383],"about_ca_topic_score_codex":0.0011491238,"about_ca_topic_score_gemma":0.0009012003,"teacher_disagreement_score":0.0026412848,"about_ca_system_score_codex":0.0007299609,"about_ca_system_score_gemma":0.0005906496,"threshold_uncertainty_score":0.0099849105},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007345048,0.00024724938,0.9963625,0.00030016288,0.00004199351,0.000021062264,0.00004515053,0.000072711424,0.0021747616],"genre_scores_gemma":[0.22779143,0.0018374426,0.76131386,0.00048819845,0.00065652287,0.00067060906,0.00029651495,0.00015958208,0.0067859003],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979773,0.00075662066,0.00021152859,0.00028177828,0.0006319002,0.00014081654],"domain_scores_gemma":[0.99615955,0.0023900256,0.0003651242,0.0004780024,0.00048129036,0.0001259852],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041921195,0.0013904057,0.0011509999,0.0021218592,0.0014235515,0.0036135297,0.0033374084,0.0022125263,0.004070621],"category_scores_gemma":[0.0075299237,0.0010275602,0.002528297,0.0015594118,0.0054409597,0.0063631665,0.0024830785,0.0042265872,0.0009586233],"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.000004555139,0.000007978995,0.000043683216,0.000032777898,0.00000939021,0.00004859269,0.00007907377,0.016617006,0.00025039425,0.979603,0.00030623842,0.0029973474],"study_design_scores_gemma":[0.000014561114,0.000017476186,0.000039734612,0.000035059384,0.000018989678,0.000077742,0.00003111948,0.10965158,0.00031807597,0.88144344,0.008333137,0.00001916159],"about_ca_topic_score_codex":0.002776689,"about_ca_topic_score_gemma":0.0022103176,"teacher_disagreement_score":0.0041921195,"about_ca_system_score_codex":0.001731556,"about_ca_system_score_gemma":0.0019114383,"threshold_uncertainty_score":0.022170305},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0042910585,0.00008383895,0.99408215,0.000040117073,0.00001385978,0.00005080674,0.000033581942,0.00089285785,0.00051175174],"genre_scores_gemma":[0.22378573,0.00043811023,0.77255666,0.00010695895,0.000027755015,0.00033158518,0.00034017654,0.0003338789,0.0020791125],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9935662,0.00291509,0.0006079838,0.0005702485,0.0020607172,0.00027987224],"domain_scores_gemma":[0.98974645,0.0061669624,0.00091592845,0.0022691186,0.0008019786,0.00009962369],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0053738933,0.0010118078,0.0007284842,0.00096894754,0.0005060982,0.0018331978,0.0021976775,0.0010044704,0.0016869667],"category_scores_gemma":[0.011615282,0.00077208085,0.0015840838,0.0007353409,0.0017152914,0.0034725927,0.001792329,0.0014566379,0.00036402518],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00044910668,0.00020592824,0.0021154871,0.0009277047,0.00023223257,0.0007413618,0.0008805409,0.47538406,0.028242914,0.3118301,0.0018763673,0.17711419],"study_design_scores_gemma":[0.00024372991,0.00010515074,0.00022352632,0.00012239252,0.000096592565,0.00030719777,0.00005321021,0.8920337,0.035160832,0.057753574,0.013835884,0.000064282634],"about_ca_topic_score_codex":0.0019967204,"about_ca_topic_score_gemma":0.0022891196,"teacher_disagreement_score":0.0053738933,"about_ca_system_score_codex":0.0011129577,"about_ca_system_score_gemma":0.0021195353,"threshold_uncertainty_score":0.02842021},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0070157074,0.000095943935,0.9909004,0.00005712554,0.000015466016,0.00006201344,0.000053315962,0.0008222039,0.0009779531],"genre_scores_gemma":[0.25975806,0.00025666575,0.7372615,0.00009395748,0.0000124306835,0.0003546211,0.0002461253,0.00014204526,0.0018746945],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99916065,0.0003477343,0.00005559956,0.000107160544,0.00025938157,0.000069472684],"domain_scores_gemma":[0.99805415,0.0012864283,0.00015086457,0.00036156067,0.0001198812,0.000027076505],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011550115,0.0007026818,0.0006149738,0.00077918597,0.0002796372,0.0005589459,0.001008285,0.00064920617,0.0026027644],"category_scores_gemma":[0.0039001468,0.00033595576,0.00068402494,0.00068428257,0.00090657605,0.0011822291,0.0007939927,0.0010071233,0.00035740074],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019227399,0.00008342031,0.00066039787,0.00029955182,0.00005641837,0.00017877319,0.00016104178,0.5896575,0.01940588,0.14665939,0.0012917237,0.24135368],"study_design_scores_gemma":[0.00005198567,0.000072800016,0.00008338528,0.00002315901,0.000023150638,0.000059657825,0.000012893041,0.9408912,0.019256203,0.034969825,0.0045401063,0.00001555233],"about_ca_topic_score_codex":0.001440549,"about_ca_topic_score_gemma":0.002179686,"teacher_disagreement_score":0.0026027644,"about_ca_system_score_codex":0.0006294178,"about_ca_system_score_gemma":0.0010601064,"threshold_uncertainty_score":0.008707106},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003671808,0.00010916054,0.9887007,0.0004849403,0.00007041484,0.00028911774,0.00022383619,0.0016222853,0.0048277387],"genre_scores_gemma":[0.09671785,0.0003459784,0.89520866,0.0004151143,0.000050306517,0.00078435865,0.0008249607,0.00082086766,0.0048319367],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.97828,0.0069075995,0.004729317,0.00205474,0.006943648,0.0010847688],"domain_scores_gemma":[0.971135,0.0120249875,0.0022769498,0.0086160125,0.0054212683,0.00052576483],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012698958,0.001127298,0.00069744926,0.0024136226,0.0014514745,0.0030962832,0.0020079147,0.0026175405,0.006021718],"category_scores_gemma":[0.029845886,0.0013838573,0.0026934033,0.0019022496,0.005300258,0.006330494,0.005080001,0.0044556647,0.002461364],"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.00018936172,0.00008156099,0.0019474906,0.0006299477,0.000048801787,0.0010123142,0.003357386,0.008904607,0.012957314,0.873961,0.0054990803,0.09141103],"study_design_scores_gemma":[0.0001822076,0.0002763731,0.0006922776,0.0005060632,0.00009895625,0.0023051419,0.0009418688,0.06601425,0.02946056,0.64479214,0.25456217,0.00016792509],"about_ca_topic_score_codex":0.003501924,"about_ca_topic_score_gemma":0.0034470388,"teacher_disagreement_score":0.012698958,"about_ca_system_score_codex":0.0018011146,"about_ca_system_score_gemma":0.0032406668,"threshold_uncertainty_score":0.067159355},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042862505,0.00019529165,0.94153434,0.00032386035,0.00006507986,0.0000972189,0.0002130887,0.003213517,0.011495103],"genre_scores_gemma":[0.7037494,0.00027760686,0.28899944,0.000084072795,0.0000446724,0.00017518098,0.0005341083,0.0005653385,0.005570156],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977986,0.000582648,0.00009044177,0.0002471403,0.00092972093,0.00035148687],"domain_scores_gemma":[0.99503976,0.0036015117,0.00019346953,0.0006716533,0.0004053778,0.000088178655],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013622437,0.00090172986,0.0011689952,0.0010064653,0.0013909467,0.0026772092,0.0018010519,0.000981177,0.009649885],"category_scores_gemma":[0.009485059,0.000539913,0.0010577398,0.0014205647,0.0023929907,0.0034182812,0.0023595754,0.0016445866,0.0014538891],"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.00060759764,0.00016194239,0.0009113008,0.0005316225,0.00007315894,0.00042699144,0.0006438957,0.13949913,0.018117774,0.63827723,0.004073699,0.1966756],"study_design_scores_gemma":[0.0001517713,0.00007691777,0.0001676906,0.00006846462,0.00007654887,0.000089443754,0.00014241709,0.5551578,0.032266647,0.40419257,0.007575806,0.000033933455],"about_ca_topic_score_codex":0.0024923189,"about_ca_topic_score_gemma":0.00420837,"teacher_disagreement_score":0.009649885,"about_ca_system_score_codex":0.0014952787,"about_ca_system_score_gemma":0.0030497888,"threshold_uncertainty_score":0.032282054},"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":"software","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0036136971,0.00014754517,0.3771153,0.0009934446,0.00050297927,0.0005193436,0.02589618,0.4308577,0.16035385],"genre_scores_gemma":[0.07936945,0.0008792207,0.28695992,0.000833699,0.00026097745,0.001017214,0.07736831,0.19573171,0.3575796],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992902,0.00013693524,0.00004768826,0.00012646457,0.00030659745,0.00009202871],"domain_scores_gemma":[0.99684745,0.0011348213,0.000115709336,0.0011762518,0.00051273947,0.00021292252],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0014879225,0.001474435,0.0011479164,0.0019059279,0.00087126606,0.004192605,0.0023825103,0.0014471331,0.3699673],"category_scores_gemma":[0.005863215,0.0011148019,0.0011310186,0.0012116826,0.00065163855,0.0048775305,0.0034612303,0.001741233,0.21707626],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007768745,0.00020386485,0.0009433711,0.0005205251,0.000065629414,0.00021558926,0.00045821237,0.002953,0.010987311,0.028025365,0.6620955,0.29275492],"study_design_scores_gemma":[0.00028576635,0.00005119957,0.0012826349,0.0002034799,0.000038377548,0.00018711993,0.00023833082,0.03830473,0.040213346,0.032769,0.88631725,0.00010870864],"about_ca_topic_score_codex":0.004645639,"about_ca_topic_score_gemma":0.0071847076,"teacher_disagreement_score":0.3699673,"about_ca_system_score_codex":0.0011044345,"about_ca_system_score_gemma":0.0011579589,"threshold_uncertainty_score":0.8986652},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018115735,0.00060343795,0.96318793,0.00039883883,0.00015121802,0.00009068379,0.00086384814,0.0012254987,0.015362844],"genre_scores_gemma":[0.3824217,0.002022335,0.59741503,0.00029044528,0.00010325298,0.0002887906,0.0022709896,0.00047985124,0.014707644],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995403,0.00014214787,0.000049303006,0.00008916262,0.000104536346,0.00007461235],"domain_scores_gemma":[0.99921536,0.00032666503,0.00007885664,0.0001779582,0.00015738551,0.00004381685],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059392495,0.0006341714,0.00053104607,0.0016414524,0.0005251056,0.0029510383,0.0008109338,0.00060643104,0.006189683],"category_scores_gemma":[0.0017820946,0.0003676293,0.0008157751,0.0014971471,0.0010092647,0.0027443785,0.0011050865,0.0010278817,0.0011394852],"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.00009693715,0.000039482213,0.00042685182,0.00023397226,0.000022973529,0.00018757896,0.0003024599,0.0320503,0.0027795215,0.8798445,0.002457629,0.081557885],"study_design_scores_gemma":[0.000030356436,0.000022684113,0.00013548075,0.00012073913,0.000051315554,0.00015087241,0.0001513673,0.076304995,0.004493839,0.8663512,0.052166823,0.000020324407],"about_ca_topic_score_codex":0.0018268836,"about_ca_topic_score_gemma":0.0021420289,"teacher_disagreement_score":0.006189683,"about_ca_system_score_codex":0.0006590908,"about_ca_system_score_gemma":0.0007527497,"threshold_uncertainty_score":0.020706534},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015438766,0.00008362346,0.99551976,0.0003742363,0.000028524342,0.00009471633,0.00003576925,0.0011187069,0.0012008562],"genre_scores_gemma":[0.07599362,0.00021984045,0.92126685,0.00015720341,0.000074099175,0.0002806337,0.00015525195,0.00016427724,0.0016882491],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99590224,0.0010521866,0.0003435893,0.0006811498,0.0016676623,0.00035321718],"domain_scores_gemma":[0.9948573,0.0018394821,0.00059425726,0.0011746756,0.0010914273,0.0004427881],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009015643,0.00071838533,0.00081964344,0.0015789587,0.0014475156,0.004269061,0.0032917478,0.0016481675,0.0024892928],"category_scores_gemma":[0.0080708815,0.00081509136,0.0019361574,0.0010205631,0.0031738728,0.0039042023,0.0038409873,0.0039652972,0.0006150784],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009608341,0.00014138562,0.00088575087,0.00016592133,0.00008243506,0.000372991,0.00052814645,0.1580297,0.005163899,0.7740574,0.00305961,0.05741667],"study_design_scores_gemma":[0.000054347878,0.000046836056,0.00015785491,0.00008004162,0.0000584066,0.00012432002,0.00009642155,0.7640912,0.0037708539,0.20910034,0.022384122,0.000035316036],"about_ca_topic_score_codex":0.008180145,"about_ca_topic_score_gemma":0.007844695,"teacher_disagreement_score":0.009015643,"about_ca_system_score_codex":0.0024906264,"about_ca_system_score_gemma":0.00673465,"threshold_uncertainty_score":0.0476799},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014049414,0.0005693039,0.9915917,0.00041921987,0.00012392424,0.0000822448,0.00002734129,0.0002456268,0.005535756],"genre_scores_gemma":[0.1282925,0.0017311713,0.861616,0.0005150778,0.00036993707,0.001065656,0.00017996464,0.00025179182,0.0059779426],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997189,0.0011894745,0.00024887518,0.00028101009,0.0009198311,0.00017178358],"domain_scores_gemma":[0.9976082,0.0014776151,0.00019897538,0.00037769374,0.0002668826,0.00007062761],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027734307,0.0008102047,0.0004758983,0.0007112395,0.0013928276,0.0023894613,0.0013704409,0.001193712,0.0050158165],"category_scores_gemma":[0.006829771,0.00043936627,0.0008742173,0.00092060305,0.0037316335,0.003495067,0.001843104,0.0029361884,0.0012646177],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016797774,0.000017648663,0.00006529093,0.00011920854,0.00000656404,0.00008084645,0.0002634936,0.008051787,0.0012493627,0.9728917,0.001173641,0.016063692],"study_design_scores_gemma":[0.000055524317,0.000054399818,0.00007906934,0.0001370242,0.000026528161,0.00022827774,0.00009856888,0.10514404,0.003382044,0.79622656,0.094527274,0.000040737912],"about_ca_topic_score_codex":0.002226947,"about_ca_topic_score_gemma":0.002188896,"teacher_disagreement_score":0.0050158165,"about_ca_system_score_codex":0.0014919918,"about_ca_system_score_gemma":0.0023557239,"threshold_uncertainty_score":0.016779602},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018351001,0.00012761532,0.99539644,0.00034966946,0.000049354934,0.00004069568,0.00003896147,0.0002227245,0.0019395343],"genre_scores_gemma":[0.2691917,0.0007823894,0.7236307,0.00090848614,0.0004799053,0.0005989653,0.00026015472,0.00044046502,0.0037071498],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9943305,0.0018444572,0.0005158203,0.0005850355,0.0022907974,0.0004333776],"domain_scores_gemma":[0.98837006,0.008196875,0.0006282201,0.0014747799,0.0010947819,0.00023523948],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009168622,0.0009016955,0.0010542495,0.0024120926,0.0011406781,0.003648912,0.002629855,0.0014986534,0.0033790173],"category_scores_gemma":[0.014728849,0.00067455234,0.003161959,0.001399018,0.008939006,0.007062133,0.004126533,0.0051761903,0.00074890273],"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.000007311927,0.000014010766,0.00008313079,0.00005149858,0.000012603504,0.000096306016,0.00015964574,0.004265112,0.00066486775,0.98939884,0.00031987406,0.004926753],"study_design_scores_gemma":[0.000023668657,0.000036465703,0.00009948611,0.000056580157,0.000021635626,0.00015068126,0.000048955866,0.058540672,0.0029431453,0.9288545,0.009196225,0.000027908582],"about_ca_topic_score_codex":0.0012211872,"about_ca_topic_score_gemma":0.00088917767,"teacher_disagreement_score":0.009168622,"about_ca_system_score_codex":0.0024546024,"about_ca_system_score_gemma":0.002472195,"threshold_uncertainty_score":0.048488915},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0059212497,0.0028830909,0.9088481,0.000604918,0.00019161278,0.0007004588,0.0004293446,0.055866104,0.024555037],"genre_scores_gemma":[0.05838056,0.0031949924,0.89818144,0.0010548091,0.00027859263,0.00084629655,0.0030073442,0.00901147,0.026044492],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9980811,0.00018280665,0.00015763022,0.00032101132,0.000992028,0.00026537702],"domain_scores_gemma":[0.9991731,0.00012224296,0.000089627654,0.00015881541,0.0002606599,0.00019559161],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024399452,0.0010413408,0.00074827217,0.0028242585,0.0007767569,0.0032349345,0.0037740148,0.0015000199,0.006016155],"category_scores_gemma":[0.0021474212,0.0016789273,0.0011237791,0.0016855306,0.00095120026,0.00346151,0.002067915,0.003046863,0.0056786304],"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.0006544783,0.0008279711,0.005305546,0.0014287671,0.00020521063,0.00095219945,0.0012775151,0.02842515,0.04428289,0.11572854,0.06138778,0.73952395],"study_design_scores_gemma":[0.00015328186,0.00048058966,0.0042163227,0.00052508374,0.00015389807,0.001358318,0.00019068069,0.112549886,0.025427256,0.02654199,0.82811695,0.0002857484],"about_ca_topic_score_codex":0.0057763867,"about_ca_topic_score_gemma":0.0035590222,"teacher_disagreement_score":0.006016155,"about_ca_system_score_codex":0.0014097106,"about_ca_system_score_gemma":0.0031535025,"threshold_uncertainty_score":0.020126104},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012111382,0.00032056146,0.9952188,0.00020773234,0.000042171083,0.000054471886,0.000066461456,0.00036436928,0.002514323],"genre_scores_gemma":[0.14833161,0.0027158551,0.84407735,0.0004484825,0.0004538937,0.0007219534,0.00050299754,0.00027219433,0.0024756552],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9929957,0.0026654687,0.0006137066,0.00073563005,0.002474614,0.00051498075],"domain_scores_gemma":[0.9846859,0.0117113115,0.00076125603,0.0015643624,0.0011625133,0.00011462122],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009812902,0.001481841,0.000923123,0.0024409937,0.00095993077,0.003044241,0.002721859,0.001074855,0.005016435],"category_scores_gemma":[0.018438496,0.00067934673,0.0029005625,0.0015691784,0.0044918186,0.003457438,0.002605685,0.0034262158,0.0013844623],"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.00003515345,0.0000839167,0.00036749736,0.00060231093,0.00007437225,0.00037734403,0.00036924475,0.059842303,0.0032916393,0.87958896,0.0026351262,0.05273214],"study_design_scores_gemma":[0.000055777266,0.000050606795,0.000136826,0.0001533687,0.00005025767,0.00020956121,0.000049904575,0.11794195,0.0047721136,0.86009914,0.016444562,0.000035912708],"about_ca_topic_score_codex":0.0015333768,"about_ca_topic_score_gemma":0.00075928844,"teacher_disagreement_score":0.009812902,"about_ca_system_score_codex":0.00175068,"about_ca_system_score_gemma":0.002558835,"threshold_uncertainty_score":0.051896214},"labels":[],"label_agreement":null},{"id":"W2059949763","doi":"10.1007/s10703-006-0016-z","title":"Data structures for symbolic multi-valued model-checking","year":2006,"lang":"en","type":"article","venue":"Formal Methods in System Design","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":44,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Theoretical computer science; Computer science; Binary decision diagram; Negation; Boolean function; Model checking; Mathematics; Algebra over a field; Algorithm; Programming language; Pure mathematics","score_opus":0.25846484264324404,"score_gpt":0.43768191777295007,"score_spread":0.17921707512970603,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2059949763","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0034529592,0.00014702784,0.9915489,0.00015692417,0.0000535129,0.00007232117,0.00045461874,0.0027364069,0.0013772968],"genre_scores_gemma":[0.28691906,0.0004434942,0.703238,0.00035739958,0.000088940935,0.0011504155,0.0023063626,0.0019013962,0.003594848],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99468553,0.0015668212,0.00083049614,0.0008050987,0.0017419878,0.0003699756],"domain_scores_gemma":[0.98476887,0.009053403,0.0007863328,0.0041136625,0.001093268,0.00018447217],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038193369,0.0017583494,0.001893789,0.0022921928,0.0012124417,0.004686311,0.004339509,0.0022005665,0.00983526],"category_scores_gemma":[0.02107059,0.0018558485,0.0024916157,0.0027580578,0.0035166277,0.010406713,0.0053969827,0.0048144567,0.0028314416],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043082022,0.00012207295,0.00074210967,0.0006327057,0.00010917113,0.00020305955,0.0005186319,0.058784254,0.0046270825,0.8175287,0.0040342472,0.11226706],"study_design_scores_gemma":[0.00009627598,0.00004474854,0.00006393571,0.0001608512,0.000071153954,0.000053737283,0.000062224324,0.14371367,0.012919822,0.83215827,0.010611235,0.000044081637],"about_ca_topic_score_codex":0.0016631823,"about_ca_topic_score_gemma":0.0018714837,"teacher_disagreement_score":0.00983526,"about_ca_system_score_codex":0.0020043175,"about_ca_system_score_gemma":0.0020255628,"threshold_uncertainty_score":0.03290224},"labels":[],"label_agreement":null},{"id":"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026344186,0.0036493079,0.7904265,0.010461796,0.0010997624,0.0000885477,0.00046250646,0.00445239,0.16301507],"genre_scores_gemma":[0.6564128,0.0033393933,0.27687994,0.0022209266,0.0004701818,0.00020077742,0.0007211356,0.0017647606,0.05799015],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972692,0.0012380709,0.00012414125,0.0005326298,0.0006241771,0.00021179116],"domain_scores_gemma":[0.9948795,0.002516837,0.0002687691,0.0015288633,0.0005496543,0.00025631068],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040077535,0.00041483404,0.00038080607,0.0006293698,0.00080895924,0.0040269564,0.0010865161,0.0010791374,0.007420133],"category_scores_gemma":[0.01018953,0.0004454247,0.0005014366,0.0007032881,0.0037042547,0.011647619,0.0021464056,0.0017513984,0.0021850097],"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.000043057462,0.0000079842675,0.00017109257,0.0000819586,0.000008410323,0.000021746604,0.00038610265,0.0009816862,0.0007897942,0.94615614,0.0055733784,0.045778617],"study_design_scores_gemma":[0.000020930682,0.00003228787,0.0002038536,0.00010274176,0.000035109206,0.000113942086,0.00019060775,0.0062506134,0.003839161,0.8917078,0.09748367,0.000019253877],"about_ca_topic_score_codex":0.0015936533,"about_ca_topic_score_gemma":0.0017442561,"teacher_disagreement_score":0.007420133,"about_ca_system_score_codex":0.001422554,"about_ca_system_score_gemma":0.0015015805,"threshold_uncertainty_score":0.024822772},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09906032,0.00024261524,0.8957166,0.00028846215,0.000032779928,0.000109264874,0.00037584204,0.0009363687,0.0032377867],"genre_scores_gemma":[0.71729636,0.0004381736,0.2779393,0.00013029274,0.000052079853,0.00037827255,0.0013035799,0.00031940162,0.0021425837],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99502796,0.0015438646,0.00040219512,0.000655126,0.0019681184,0.0004027947],"domain_scores_gemma":[0.97660726,0.0152821755,0.0027186987,0.003173329,0.0019287379,0.0002898723],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0047719465,0.00062895153,0.00056840904,0.0018168748,0.0008492618,0.0026948098,0.001129799,0.0009464028,0.00194446],"category_scores_gemma":[0.025939737,0.00079705194,0.0017784126,0.0012422055,0.0022267099,0.0058698137,0.0015341983,0.0015877201,0.0002554354],"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.0003591393,0.00012370848,0.010260724,0.0004532384,0.00018979235,0.00081618706,0.0013517927,0.4085886,0.021354325,0.5085976,0.0010846346,0.046820235],"study_design_scores_gemma":[0.000034171975,0.000054141055,0.00087170204,0.00005903768,0.00007859805,0.000102789396,0.00014071273,0.7940323,0.010397953,0.19006637,0.004136744,0.000025448544],"about_ca_topic_score_codex":0.006003482,"about_ca_topic_score_gemma":0.005577748,"teacher_disagreement_score":0.006003482,"about_ca_system_score_codex":0.0021321499,"about_ca_system_score_gemma":0.001678149,"threshold_uncertainty_score":0.025236785},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034919992,0.00016960403,0.96194935,0.00011703577,0.000024098616,0.000025141037,0.000050597075,0.00026250878,0.0024816971],"genre_scores_gemma":[0.9396791,0.00022268994,0.056032203,0.00005156701,0.000028070128,0.00008132445,0.00011300886,0.000086473214,0.003705603],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991229,0.00021554373,0.000029669913,0.00014676926,0.00040116045,0.00008403184],"domain_scores_gemma":[0.9982016,0.0012650384,0.00016416269,0.000112662536,0.00021028171,0.00004622612],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00095960655,0.00055000605,0.00051705755,0.0005409899,0.0003783478,0.0009646482,0.0008758678,0.00049643376,0.0031962378],"category_scores_gemma":[0.003729204,0.000299439,0.0007460845,0.00033320792,0.0012625343,0.0011992109,0.0011419952,0.0008742286,0.00023954247],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000805323,0.000016027487,0.0009995685,0.00010756206,0.00004939964,0.00017483106,0.00012919147,0.84262836,0.0054776873,0.13955268,0.0002133915,0.01057074],"study_design_scores_gemma":[0.0000050895,0.000010121621,0.00013178172,0.0000037246339,0.000006162396,0.000015416303,0.000011473894,0.9684541,0.000989229,0.029931169,0.00043763264,0.000004026487],"about_ca_topic_score_codex":0.0032216755,"about_ca_topic_score_gemma":0.0016394742,"teacher_disagreement_score":0.0032216755,"about_ca_system_score_codex":0.0010726112,"about_ca_system_score_gemma":0.00077644427,"threshold_uncertainty_score":0.010692477},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01610445,0.00007333579,0.97418946,0.00013982486,0.000019353669,0.00017390834,0.00019263837,0.0062812134,0.0028257952],"genre_scores_gemma":[0.30795354,0.00007498978,0.6882015,0.00012967702,0.000018625144,0.00038415843,0.00083340093,0.0009052118,0.0014990206],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990306,0.00030817644,0.000046106514,0.00020541826,0.00028631423,0.00012347536],"domain_scores_gemma":[0.99734443,0.0019345974,0.00011921335,0.00034633905,0.00020800837,0.00004731598],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00085341,0.0011494785,0.0005800492,0.0008581276,0.00053020875,0.0008574949,0.001565141,0.0006608388,0.008045942],"category_scores_gemma":[0.0041453363,0.0005577102,0.0010905437,0.0008085111,0.0008435578,0.0014739921,0.0015875159,0.0011090444,0.00088008534],"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.0003586006,0.0002358433,0.0015734197,0.0005464073,0.000076302575,0.00035978926,0.00024140737,0.46036783,0.03256376,0.039222833,0.008367286,0.45608655],"study_design_scores_gemma":[0.000060003505,0.000077338125,0.00012606628,0.000014233975,0.0000150179385,0.0000685472,0.00003296332,0.9611725,0.013543294,0.022352654,0.002527077,0.000010358311],"about_ca_topic_score_codex":0.002670042,"about_ca_topic_score_gemma":0.0067068106,"teacher_disagreement_score":0.008045942,"about_ca_system_score_codex":0.000947165,"about_ca_system_score_gemma":0.0017907176,"threshold_uncertainty_score":0.026916385},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15411316,0.006166458,0.70288444,0.0472569,0.022529192,0.0030473273,0.005337057,0.009376873,0.049288623],"genre_scores_gemma":[0.5696928,0.0023260533,0.25482658,0.004139846,0.007632606,0.0012668543,0.019926809,0.0027282564,0.13746013],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99127805,0.0033329886,0.00046932907,0.0012160451,0.0026212698,0.0010823474],"domain_scores_gemma":[0.97977346,0.007816322,0.00043097485,0.0022654529,0.007270132,0.0024435958],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.016432732,0.0018754633,0.004115822,0.0024898848,0.003621102,0.0066433754,0.0032452692,0.0039158408,0.01517898],"category_scores_gemma":[0.014478274,0.0008039346,0.0021117497,0.0010452594,0.0018073191,0.0048450325,0.0038470235,0.0034418327,0.0040941974],"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.005811962,0.0025143512,0.009030329,0.0011001768,0.00047162137,0.0013651607,0.00095127785,0.012202951,0.030205807,0.02546571,0.5026471,0.40823352],"study_design_scores_gemma":[0.0015142685,0.0027984276,0.017616015,0.00042668908,0.0007639335,0.001848699,0.0020323377,0.31881347,0.13206431,0.05301857,0.46872896,0.00037425515],"about_ca_topic_score_codex":0.008018792,"about_ca_topic_score_gemma":0.016628923,"teacher_disagreement_score":0.016432732,"about_ca_system_score_codex":0.002653491,"about_ca_system_score_gemma":0.0042908737,"threshold_uncertainty_score":0.08690566},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.051845998,0.000071449744,0.94267017,0.00077259797,0.00008324493,0.00015661627,0.00015300431,0.00096797897,0.0032787786],"genre_scores_gemma":[0.87937325,0.00007252977,0.11601395,0.00017867568,0.00006130974,0.0003237068,0.000240169,0.00024992664,0.0034865492],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9896713,0.0044210586,0.0005367323,0.0014900477,0.0028960546,0.0009849387],"domain_scores_gemma":[0.9381142,0.049120348,0.0032360537,0.005762618,0.0027686167,0.0009981091],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008172524,0.001188952,0.0018694976,0.0012913647,0.0017389115,0.00394868,0.0040023457,0.0024757006,0.0061030434],"category_scores_gemma":[0.060357597,0.0013457611,0.0024568685,0.0011105139,0.0051204707,0.006674332,0.0064080576,0.0051216707,0.00069860945],"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.00043649605,0.00014574984,0.001229283,0.0002078883,0.00014375839,0.00022577513,0.00058543857,0.53079593,0.0019428143,0.44356385,0.0015224172,0.019200588],"study_design_scores_gemma":[0.000043813994,0.00002083797,0.00006292642,0.000011715222,0.000019681485,0.000016944008,0.00004061204,0.836656,0.001088773,0.1616667,0.00035770034,0.000014307488],"about_ca_topic_score_codex":0.0069274306,"about_ca_topic_score_gemma":0.009674044,"teacher_disagreement_score":0.008172524,"about_ca_system_score_codex":0.0038673826,"about_ca_system_score_gemma":0.0056880536,"threshold_uncertainty_score":0.043220997},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044285294,0.00006363417,0.9480127,0.00016297075,0.000017522407,0.000096130825,0.00013859813,0.0059713754,0.00125182],"genre_scores_gemma":[0.7368943,0.000063631385,0.26054487,0.00008771506,0.000013963783,0.00031027183,0.0002975007,0.0003667131,0.0014209908],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9949469,0.0020347214,0.0002676031,0.000993739,0.0013267272,0.00043030604],"domain_scores_gemma":[0.98736763,0.008307192,0.00088256295,0.0026162784,0.0006480068,0.00017838704],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038421915,0.0010988107,0.0012617206,0.001108661,0.00097467325,0.0019360846,0.0027043857,0.0010606388,0.002908751],"category_scores_gemma":[0.013771532,0.0007878622,0.0017532728,0.0009734139,0.0025086424,0.005056862,0.0041831955,0.0018028986,0.00039999324],"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.0006616762,0.00021855066,0.004962025,0.00026964353,0.00013031949,0.00033081145,0.0004813136,0.8218365,0.015305178,0.058525864,0.0014403244,0.09583783],"study_design_scores_gemma":[0.000050982635,0.000039975537,0.000117276,0.000009898868,0.000019189676,0.000029390892,0.000033606484,0.96634555,0.0067556035,0.02599287,0.00059293717,0.000012650345],"about_ca_topic_score_codex":0.0056322166,"about_ca_topic_score_gemma":0.008920793,"teacher_disagreement_score":0.0056322166,"about_ca_system_score_codex":0.0015432715,"about_ca_system_score_gemma":0.0032316197,"threshold_uncertainty_score":0.0203197},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19552323,0.0017456708,0.72546166,0.003250349,0.0001363897,0.00017508042,0.00022712038,0.0006999798,0.072780535],"genre_scores_gemma":[0.8922987,0.0009846368,0.091115534,0.00019402817,0.00017210988,0.00016663878,0.00016038152,0.00013134477,0.014776641],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969254,0.0008246983,0.00021586221,0.0005276094,0.0009274026,0.00057902635],"domain_scores_gemma":[0.98908895,0.00599852,0.00076177623,0.0020008173,0.0010397353,0.0011102053],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002860798,0.00068810163,0.0016758307,0.0017323573,0.002919226,0.0059409854,0.0025932156,0.0018780257,0.007093694],"category_scores_gemma":[0.011677459,0.0007952588,0.0014223421,0.0014093213,0.006194836,0.010382292,0.0040853024,0.0035214366,0.00074857706],"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.00007640344,0.000034866505,0.00031025245,0.000080519,0.00001605545,0.00007918551,0.0004256162,0.010928039,0.0009169454,0.97814286,0.0005739896,0.008415238],"study_design_scores_gemma":[0.00003415857,0.00004229028,0.00012313943,0.000022118567,0.000022677887,0.000073682655,0.00012769451,0.1024956,0.00051963597,0.89399546,0.0025217065,0.000021810005],"about_ca_topic_score_codex":0.0027029559,"about_ca_topic_score_gemma":0.0022537326,"teacher_disagreement_score":0.007093694,"about_ca_system_score_codex":0.0026054198,"about_ca_system_score_gemma":0.002276177,"threshold_uncertainty_score":0.023730755},"labels":[],"label_agreement":null},{"id":"W2065086898","doi":"10.1007/s10703-011-0132-2","title":"Explaining counterexamples using causality","year":2011,"lang":"en","type":"article","venue":"Formal Methods in System Design","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":104,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Novo Nordisk Fonden; Azrieli Foundation","keywords":"Counterexample; TRACE (psycholinguistics); Computer science; Causality (physics); Set (abstract data type); Theoretical computer science; Algorithm; Feature (linguistics); Programming language; Discrete mathematics; Mathematics","score_opus":0.3656074904811601,"score_gpt":0.4137656834194675,"score_spread":0.04815819293830742,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2065086898","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046651874,0.0002321381,0.93865585,0.0017730669,0.00029868673,0.00013634974,0.00011778142,0.0023830582,0.009751115],"genre_scores_gemma":[0.78544533,0.00030810572,0.20874843,0.0005155609,0.00007899291,0.00022472402,0.00018380016,0.00067696243,0.0038180721],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.993489,0.003188075,0.0004020366,0.0007612641,0.0015698888,0.00058977713],"domain_scores_gemma":[0.9278431,0.062413596,0.0018252686,0.005636012,0.0019049371,0.00037722808],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0062166094,0.0014522397,0.0009317704,0.0029402003,0.0015568666,0.0026648843,0.0016401003,0.003020688,0.011904977],"category_scores_gemma":[0.057773508,0.001118632,0.0018930968,0.0013178731,0.0048566866,0.009423453,0.0034594594,0.0041917614,0.0006395034],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031128386,0.0001463931,0.0024156878,0.00036396796,0.00006177228,0.0011024831,0.0012775765,0.035789758,0.0031590299,0.9236122,0.0021917014,0.029568216],"study_design_scores_gemma":[0.000121931946,0.00007086445,0.00031587132,0.00016593405,0.00009636149,0.00041916643,0.0003092258,0.19517845,0.011584434,0.7815413,0.010137282,0.000059124486],"about_ca_topic_score_codex":0.0022318785,"about_ca_topic_score_gemma":0.002216048,"teacher_disagreement_score":0.011904977,"about_ca_system_score_codex":0.0011529383,"about_ca_system_score_gemma":0.0016754383,"threshold_uncertainty_score":0.039826155},"labels":[],"label_agreement":null},{"id":"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017679255,0.00005430929,0.97868025,0.00003707003,0.000011456139,0.00011114589,0.00008051047,0.0021073397,0.0012386019],"genre_scores_gemma":[0.30988675,0.00021675369,0.6866948,0.00007654863,0.000018023891,0.00017042844,0.00032278654,0.0005230159,0.0020908848],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99881244,0.0001877537,0.000088864166,0.00019541661,0.00060487987,0.00011077776],"domain_scores_gemma":[0.99740916,0.0011935618,0.00023978221,0.00084445206,0.0002843506,0.000028627279],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010378477,0.0004935116,0.00033433692,0.00040150495,0.00046958018,0.00060726627,0.0014260508,0.0003593724,0.0031147434],"category_scores_gemma":[0.004233762,0.0005985196,0.0007402922,0.0002845231,0.00096175476,0.0013974028,0.0008855344,0.0011790247,0.0006602395],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030305824,0.00013735377,0.0034958234,0.0010882502,0.00010396238,0.00045468836,0.0006624718,0.1669156,0.3352556,0.11554845,0.0035504529,0.3724843],"study_design_scores_gemma":[0.00014347128,0.00038839935,0.0011728919,0.00007409416,0.00012011184,0.0006361586,0.000085242995,0.37581095,0.53557193,0.046243247,0.039697044,0.00005649671],"about_ca_topic_score_codex":0.001933498,"about_ca_topic_score_gemma":0.0028945603,"teacher_disagreement_score":0.0031147434,"about_ca_system_score_codex":0.0006122607,"about_ca_system_score_gemma":0.0020910385,"threshold_uncertainty_score":0.010419786},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005555837,0.0005653901,0.98067725,0.0006308104,0.0001416791,0.00012152563,0.00008656739,0.000394139,0.0118268775],"genre_scores_gemma":[0.16280293,0.001739307,0.81723017,0.00109224,0.000593746,0.00086911424,0.00045703308,0.0007348977,0.014480563],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98991895,0.0026778746,0.0010107673,0.0022895576,0.0034338352,0.0006690487],"domain_scores_gemma":[0.98567617,0.004628712,0.0009252776,0.0059301606,0.0022500628,0.00058953604],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009333263,0.0014639574,0.0012186081,0.003144006,0.0020821523,0.004110585,0.0028755413,0.0020525681,0.005206495],"category_scores_gemma":[0.015248908,0.0013360045,0.003251666,0.002949703,0.010860121,0.013457844,0.0066356445,0.0062595867,0.0016196643],"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.000036041314,0.00001851672,0.0002059064,0.000074666015,0.00001991801,0.00009844773,0.0006036915,0.0038377598,0.001923198,0.978865,0.0007047091,0.013612023],"study_design_scores_gemma":[0.000054510216,0.00014060535,0.00024643776,0.00012747805,0.00007463023,0.00038631845,0.00018676474,0.026313582,0.0037998292,0.90490365,0.06370049,0.00006575689],"about_ca_topic_score_codex":0.0021184334,"about_ca_topic_score_gemma":0.0018946165,"teacher_disagreement_score":0.009333263,"about_ca_system_score_codex":0.0018019875,"about_ca_system_score_gemma":0.0022145344,"threshold_uncertainty_score":0.04935962},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00575567,0.000116357296,0.9841666,0.00016644095,0.00011315798,0.00006254943,0.0003630741,0.0028091883,0.0064468808],"genre_scores_gemma":[0.24577688,0.00045540632,0.7400722,0.0003190167,0.000112181704,0.0003468689,0.001865748,0.001618418,0.00943335],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99683076,0.00075085973,0.00030493242,0.0005413774,0.0013206993,0.0002513768],"domain_scores_gemma":[0.99534106,0.0015053499,0.00027914174,0.0018909634,0.00087304413,0.00011035653],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025696713,0.0008501424,0.0006245944,0.0007909284,0.00044612563,0.001913773,0.0020116514,0.00063190644,0.008071107],"category_scores_gemma":[0.00951004,0.00069714425,0.0017319856,0.0006275468,0.002017438,0.003013111,0.002935796,0.0030496656,0.0017840407],"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.00024973042,0.000054618307,0.00094107975,0.00028544816,0.000055737273,0.00024818478,0.00026827535,0.17071772,0.008003188,0.7478144,0.0042594243,0.067102194],"study_design_scores_gemma":[0.00006286386,0.00009135183,0.00020528107,0.00010163099,0.000055040604,0.00018648713,0.00004993023,0.5198721,0.017502008,0.3799675,0.08186955,0.000036251062],"about_ca_topic_score_codex":0.0035726014,"about_ca_topic_score_gemma":0.0033011292,"teacher_disagreement_score":0.008071107,"about_ca_system_score_codex":0.0012881818,"about_ca_system_score_gemma":0.0016388461,"threshold_uncertainty_score":0.027000487},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032142527,0.00036281644,0.9584871,0.0006198004,0.00015962728,0.00038587739,0.00013088823,0.0032515833,0.0044597383],"genre_scores_gemma":[0.72650194,0.00063487375,0.2674413,0.00040642737,0.00008865306,0.00046833738,0.00038152,0.00078302977,0.0032938689],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99055463,0.0036988854,0.0006990946,0.00075940584,0.0033506847,0.0009373307],"domain_scores_gemma":[0.9848642,0.007315092,0.0011054305,0.0049828845,0.0015140991,0.00021837663],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011462571,0.0009809554,0.000993107,0.001330913,0.001748742,0.004413173,0.002881552,0.0019043211,0.0028417516],"category_scores_gemma":[0.024192695,0.0013559833,0.0021868942,0.00076353166,0.0062201573,0.005402558,0.0047446075,0.005276642,0.00043740383],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00059523864,0.00023884709,0.0030630736,0.0009634588,0.00019022221,0.0009914028,0.0012622521,0.16487114,0.025702473,0.7309255,0.0022966296,0.06889977],"study_design_scores_gemma":[0.00024611954,0.0002802166,0.0008321516,0.00045621872,0.00027491123,0.00050498045,0.00029238372,0.55016774,0.06953253,0.35605422,0.021208942,0.00014964193],"about_ca_topic_score_codex":0.004306448,"about_ca_topic_score_gemma":0.0039988365,"teacher_disagreement_score":0.011462571,"about_ca_system_score_codex":0.0013711577,"about_ca_system_score_gemma":0.005805969,"threshold_uncertainty_score":0.060620606},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08060961,0.00050794805,0.84727234,0.00029749467,0.00024630528,0.0005239171,0.0013640064,0.031656545,0.03752186],"genre_scores_gemma":[0.4291759,0.0002159647,0.5580139,0.0001735143,0.000040252755,0.00043919488,0.0018743861,0.0005420101,0.009524912],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995919,0.00007757836,0.000032099313,0.000080638725,0.00012965307,0.00008826583],"domain_scores_gemma":[0.99967563,0.00013553174,0.000021371168,0.00006524458,0.00008193281,0.000020260772],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003369835,0.0009498191,0.0005496122,0.0006806296,0.00034711507,0.0008656416,0.0013153389,0.0004174381,0.02321849],"category_scores_gemma":[0.0008397079,0.0003702466,0.00054921315,0.0006727076,0.00019585948,0.0005535708,0.00037213237,0.0007120319,0.0049809483],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001331188,0.0004304102,0.0028773565,0.00113513,0.0002460875,0.0010538944,0.00019858123,0.12752594,0.14556815,0.03147687,0.033861045,0.6542953],"study_design_scores_gemma":[0.00061613077,0.0010525452,0.0026535532,0.00012801401,0.00016711165,0.0009365567,0.00012580286,0.7858217,0.14447059,0.0066931704,0.057266925,0.000067938665],"about_ca_topic_score_codex":0.0018525443,"about_ca_topic_score_gemma":0.0029047872,"teacher_disagreement_score":0.02321849,"about_ca_system_score_codex":0.0006379191,"about_ca_system_score_gemma":0.0010719768,"threshold_uncertainty_score":0.077673554},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020014632,0.00008185664,0.9735869,0.00009555811,0.000013508478,0.00008522848,0.0002255251,0.0049530338,0.0009438202],"genre_scores_gemma":[0.23589376,0.00013043058,0.7597038,0.00011525386,0.000018833021,0.00029024694,0.0017806143,0.00074367545,0.0013234111],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98782617,0.0038622816,0.0011709292,0.0012804728,0.0052341004,0.0006259946],"domain_scores_gemma":[0.9756245,0.014362265,0.002800654,0.0043883636,0.0026035884,0.00022053652],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0056231446,0.0012457222,0.001009199,0.0035280774,0.0009204544,0.001968911,0.0023948231,0.0013597348,0.0032453972],"category_scores_gemma":[0.029067198,0.0012669421,0.0015820987,0.002751593,0.0015912486,0.0039362204,0.002495034,0.0015914917,0.00085900986],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00078685867,0.00040648217,0.034115594,0.0012412699,0.0003058965,0.0020742344,0.0025501286,0.14582483,0.07926623,0.11207541,0.009626948,0.61172605],"study_design_scores_gemma":[0.00017270393,0.00027588248,0.0038308136,0.00014452747,0.00012757764,0.0014292074,0.00043964622,0.78632516,0.10515119,0.08068908,0.021258436,0.00015575546],"about_ca_topic_score_codex":0.0037956382,"about_ca_topic_score_gemma":0.003432441,"teacher_disagreement_score":0.0056231446,"about_ca_system_score_codex":0.0011108826,"about_ca_system_score_gemma":0.0021267007,"threshold_uncertainty_score":0.029738426},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012005337,0.05155139,0.80428916,0.0058102286,0.001758476,0.00006752973,0.00054871576,0.00050136214,0.12346783],"genre_scores_gemma":[0.4977111,0.046461515,0.37464246,0.0023129913,0.0040738336,0.000518184,0.0010046979,0.00037829694,0.07289689],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99920624,0.00019186063,0.00006294777,0.00017698154,0.0002964881,0.00006558993],"domain_scores_gemma":[0.99950194,0.00026466596,0.000059859452,0.000057146673,0.00008478794,0.000031540465],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010927119,0.0013790079,0.0009320927,0.0020494557,0.00094596774,0.005417524,0.0011981959,0.00139083,0.005778498],"category_scores_gemma":[0.0017864608,0.0007396864,0.0010415507,0.0035615154,0.003157854,0.006314864,0.001274103,0.0041178158,0.0016113045],"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.0000054416832,0.000006871025,0.000023904826,0.000071060465,0.000004305165,0.000022318325,0.00009109043,0.00079076085,0.000419878,0.981122,0.002420027,0.015022214],"study_design_scores_gemma":[0.0000046289497,0.000009049502,0.000037838025,0.000058705427,0.000007235908,0.00007088394,0.00003716298,0.0031646139,0.00033392035,0.9689539,0.027313901,0.000008088244],"about_ca_topic_score_codex":0.0007216299,"about_ca_topic_score_gemma":0.00063341693,"teacher_disagreement_score":0.005778498,"about_ca_system_score_codex":0.002302348,"about_ca_system_score_gemma":0.00093785994,"threshold_uncertainty_score":0.019330978},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005975228,0.000076318924,0.97730416,0.00044683449,0.00004587294,0.00020016062,0.00034859576,0.002997457,0.012605422],"genre_scores_gemma":[0.3155206,0.0004459447,0.65441924,0.00034341798,0.00008583541,0.00095244165,0.0010556402,0.0013398342,0.025836945],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9964665,0.0013325072,0.00033319354,0.00042079738,0.0011898042,0.00025717972],"domain_scores_gemma":[0.9933697,0.0042579263,0.00038535046,0.001062173,0.0007719157,0.00015281024],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036855917,0.00092807185,0.0004977066,0.0023984462,0.0011672265,0.004370722,0.0019021219,0.001742311,0.012078983],"category_scores_gemma":[0.0065803207,0.0011487615,0.0014432025,0.0015191387,0.0025134005,0.0063927774,0.002443546,0.0022736976,0.0027728928],"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.000062813066,0.000061396044,0.00059880456,0.00017696444,0.000034550565,0.0006625486,0.0011349538,0.009557143,0.0031480768,0.9515114,0.003476519,0.029574899],"study_design_scores_gemma":[0.000058598875,0.00010072854,0.0002942974,0.00022724218,0.00018224037,0.0011172033,0.00048000645,0.17783992,0.032633018,0.59092623,0.19606383,0.00007670276],"about_ca_topic_score_codex":0.002419844,"about_ca_topic_score_gemma":0.0027240755,"teacher_disagreement_score":0.012078983,"about_ca_system_score_codex":0.000981371,"about_ca_system_score_gemma":0.0018143506,"threshold_uncertainty_score":0.040408194},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023827061,0.00005299734,0.9680476,0.00005700928,0.0000385483,0.00016261356,0.00018624506,0.0049920427,0.002635816],"genre_scores_gemma":[0.4516965,0.00008801619,0.5443744,0.00008268837,0.000016970604,0.00038072758,0.0005834558,0.0005332394,0.002244097],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987804,0.00028493794,0.00014015062,0.00019821485,0.0004966572,0.000099694545],"domain_scores_gemma":[0.9965719,0.0017697578,0.0002630055,0.0007102483,0.0006347648,0.000050333292],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010139119,0.0005505219,0.0004402089,0.00078206294,0.0004245937,0.00086430635,0.000830781,0.00042211838,0.002838686],"category_scores_gemma":[0.0045794514,0.00043372638,0.0006609789,0.0003626623,0.0007304609,0.0009991861,0.0006433413,0.0006953126,0.0008110807],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00052200997,0.0003247454,0.0026689172,0.00079658977,0.0001401522,0.0009273581,0.0005868472,0.2956684,0.2375048,0.1460798,0.0063625486,0.30841786],"study_design_scores_gemma":[0.00010489995,0.00013978867,0.00024836606,0.000035961693,0.00007121041,0.00015070986,0.000038516526,0.8011864,0.17418161,0.01739314,0.0064223725,0.000026971284],"about_ca_topic_score_codex":0.0011884001,"about_ca_topic_score_gemma":0.0023204575,"teacher_disagreement_score":0.002838686,"about_ca_system_score_codex":0.00060078915,"about_ca_system_score_gemma":0.0016588398,"threshold_uncertainty_score":0.009496391},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010475592,0.00014139971,0.9878997,0.00010927462,0.000045374585,0.00009614112,0.000078763194,0.00956857,0.0010132431],"genre_scores_gemma":[0.07083531,0.0003351729,0.92317015,0.00017498,0.00022612263,0.0003563772,0.00032249803,0.001638691,0.0029408254],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9957718,0.000895073,0.00045239818,0.0008745362,0.0016351005,0.00037112235],"domain_scores_gemma":[0.9948822,0.0020521334,0.0006744345,0.0013555031,0.0006648046,0.00037093917],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006629053,0.0015435485,0.0014443273,0.002021785,0.0013363697,0.003940008,0.0041086045,0.0018142831,0.0045089964],"category_scores_gemma":[0.009763925,0.0013398846,0.002460432,0.0010961253,0.0025223899,0.0056272093,0.0031514526,0.0044236775,0.0016216377],"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.0005406258,0.0002871705,0.0019861495,0.0007604876,0.00018854345,0.0011280949,0.00094362523,0.05381224,0.02934919,0.6880338,0.015647855,0.20732215],"study_design_scores_gemma":[0.0003107142,0.0003470159,0.0008019293,0.00038625352,0.0003560376,0.0015707954,0.00011383841,0.57048416,0.04768204,0.22840624,0.14925659,0.00028438063],"about_ca_topic_score_codex":0.002756073,"about_ca_topic_score_gemma":0.003144943,"teacher_disagreement_score":0.006629053,"about_ca_system_score_codex":0.0013129027,"about_ca_system_score_gemma":0.0036360784,"threshold_uncertainty_score":0.0350582},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00098889,0.00006783775,0.99684334,0.000065778004,0.000021238551,0.000058992944,0.000092026894,0.00077971123,0.0010822255],"genre_scores_gemma":[0.056610987,0.0005221029,0.9392241,0.0001306088,0.00004518883,0.00026147842,0.00050140935,0.0005379108,0.0021661997],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99610186,0.0010349449,0.000349974,0.00060290715,0.0017072287,0.00020312684],"domain_scores_gemma":[0.9953081,0.0030230244,0.00026275465,0.0006142019,0.0007281641,0.00006372571],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002443804,0.0017038431,0.0013245927,0.0030232465,0.0010920833,0.0037368524,0.0019426655,0.0010246041,0.008063818],"category_scores_gemma":[0.008767108,0.0011012108,0.0028695604,0.0020289256,0.0019553923,0.005200544,0.002332012,0.002857478,0.0015996639],"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.00026234836,0.00008637081,0.0009895165,0.0007501561,0.00015242644,0.00023087293,0.00045966898,0.21997248,0.0077291867,0.5605205,0.0052918755,0.20355469],"study_design_scores_gemma":[0.00008514996,0.00007864981,0.000136425,0.00015873674,0.000099217985,0.0001669432,0.00011771253,0.5137652,0.019207217,0.4166424,0.04947909,0.00006327355],"about_ca_topic_score_codex":0.0045516114,"about_ca_topic_score_gemma":0.0043474585,"teacher_disagreement_score":0.008063818,"about_ca_system_score_codex":0.0017892953,"about_ca_system_score_gemma":0.002071286,"threshold_uncertainty_score":0.026976168},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033449624,0.000048377442,0.9603679,0.000115186325,0.000028949817,0.00010458979,0.00021901091,0.0030726946,0.0025935976],"genre_scores_gemma":[0.37196833,0.00013106986,0.6224623,0.000059137114,0.000016086844,0.00021120433,0.00089930935,0.0013905702,0.0028619566],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99922836,0.0002217136,0.00005589191,0.00013585562,0.00027501571,0.00008318877],"domain_scores_gemma":[0.9970202,0.0017945718,0.00020811333,0.00047839046,0.00043256563,0.00006622174],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010706084,0.00078234804,0.00028309334,0.0008304608,0.0004943443,0.0007263993,0.0006821241,0.0007382013,0.0034855404],"category_scores_gemma":[0.0067385584,0.00040411323,0.0010375313,0.00046561324,0.00055317,0.00083636405,0.00086277054,0.0009032833,0.00089949573],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007178662,0.00033422117,0.004506778,0.00080937246,0.000103663355,0.0017659859,0.0012643543,0.19034423,0.13571785,0.31713375,0.008561535,0.33874047],"study_design_scores_gemma":[0.00012769377,0.00018465506,0.00055499864,0.000104484534,0.00008902865,0.00070597016,0.000099661054,0.7891784,0.09424476,0.09873639,0.015923502,0.000050455503],"about_ca_topic_score_codex":0.00074743974,"about_ca_topic_score_gemma":0.0007889836,"teacher_disagreement_score":0.0034855404,"about_ca_system_score_codex":0.00045399214,"about_ca_system_score_gemma":0.0009806752,"threshold_uncertainty_score":0.011660278},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00596276,0.0014476482,0.9832675,0.0009112049,0.00013325953,0.000021534377,0.000063284424,0.0011302431,0.007062585],"genre_scores_gemma":[0.4353514,0.005721926,0.53719324,0.0010332834,0.0005563423,0.00021292861,0.0003330629,0.0013926225,0.018205235],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972097,0.00076251937,0.00012778367,0.00042228072,0.0012824632,0.0001952419],"domain_scores_gemma":[0.99459225,0.0034562703,0.00030565172,0.00095338887,0.0006113114,0.00008107318],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00161246,0.0010844789,0.0010815823,0.002730533,0.0010663779,0.002249438,0.0022882735,0.0015342239,0.0069999467],"category_scores_gemma":[0.013299581,0.0005422271,0.0012880419,0.0041833343,0.004845359,0.007373769,0.0029288337,0.0042344737,0.0017224663],"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.00006380822,0.000017862745,0.00037606462,0.00022134512,0.000025856296,0.00011831899,0.00020991961,0.03842173,0.003344927,0.8525515,0.0024068814,0.10224187],"study_design_scores_gemma":[0.000016434955,0.000027783344,0.00011993635,0.000073217656,0.000025991218,0.00015440147,0.00005338191,0.14555566,0.005736926,0.83460575,0.013601324,0.000029186474],"about_ca_topic_score_codex":0.0030836877,"about_ca_topic_score_gemma":0.0018103153,"teacher_disagreement_score":0.0069999467,"about_ca_system_score_codex":0.0019890366,"about_ca_system_score_gemma":0.0024326039,"threshold_uncertainty_score":0.023417115},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028621644,0.0001718506,0.9645814,0.00015917698,0.000022887249,0.00008096432,0.000117565134,0.0028962104,0.0033484309],"genre_scores_gemma":[0.4547459,0.00027631546,0.54021895,0.00019168947,0.0000363163,0.00017765335,0.00049013854,0.0006838332,0.003179169],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99765706,0.00079758867,0.00010595369,0.00038360988,0.0008278295,0.00022793078],"domain_scores_gemma":[0.99481046,0.0033985185,0.00046992966,0.00054393196,0.0006803386,0.00009679142],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017277588,0.0013660879,0.00070720277,0.002052624,0.00078724045,0.0012570363,0.0013081061,0.0007463604,0.004578695],"category_scores_gemma":[0.009110223,0.00080149795,0.0011298308,0.00075373094,0.0010186057,0.0022324582,0.002068713,0.0010623646,0.00093204214],"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.00034793766,0.00017364405,0.004696933,0.00042286044,0.000095255135,0.0005707182,0.00060561794,0.46026507,0.06804397,0.07031471,0.0037765347,0.39068672],"study_design_scores_gemma":[0.00004622289,0.00012710187,0.00034562804,0.000046686113,0.000033014454,0.00019821616,0.00006327658,0.9359437,0.023553675,0.035616122,0.003995275,0.000031073774],"about_ca_topic_score_codex":0.004354976,"about_ca_topic_score_gemma":0.008788154,"teacher_disagreement_score":0.004578695,"about_ca_system_score_codex":0.0010390051,"about_ca_system_score_gemma":0.0024572415,"threshold_uncertainty_score":0.015317321},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005986021,0.00022296213,0.98009616,0.00020091649,0.00022272347,0.000092911214,0.0004141179,0.0017629031,0.011001297],"genre_scores_gemma":[0.26531273,0.00080774416,0.71750575,0.00031617613,0.00017923284,0.0003736709,0.0016988297,0.00091338734,0.012892458],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982673,0.00036679918,0.00019428006,0.00036289648,0.0005898418,0.000218708],"domain_scores_gemma":[0.9977443,0.0007028913,0.00022258636,0.00082340196,0.0003958259,0.00011103732],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020622998,0.00088581035,0.00074007636,0.0007988529,0.0005830511,0.0019944157,0.0023596426,0.0008532896,0.0067985877],"category_scores_gemma":[0.003960432,0.00069022435,0.002288487,0.0006618274,0.0019848344,0.0036813898,0.002206597,0.0033599972,0.0018265384],"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.00014494736,0.000039198712,0.0005015947,0.00019841245,0.000032257118,0.0003245992,0.0002540269,0.03274037,0.006466228,0.92517805,0.002712066,0.03140825],"study_design_scores_gemma":[0.000115917486,0.00016071294,0.00022577285,0.00014062086,0.00010756305,0.00061936944,0.00009688641,0.26466677,0.018406838,0.54477054,0.17061105,0.00007794967],"about_ca_topic_score_codex":0.0024120365,"about_ca_topic_score_gemma":0.0025931578,"teacher_disagreement_score":0.0067985877,"about_ca_system_score_codex":0.000983305,"about_ca_system_score_gemma":0.0015316848,"threshold_uncertainty_score":0.022743583},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20405103,0.0009560402,0.7802666,0.0011592794,0.00016007523,0.0010488279,0.0009444029,0.0028999527,0.00851371],"genre_scores_gemma":[0.2979417,0.0003494256,0.6965139,0.0003909975,0.000045263187,0.00032848667,0.0020797877,0.0004165093,0.0019339755],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982474,0.0006960629,0.00014220545,0.00029973916,0.0003308117,0.00028382335],"domain_scores_gemma":[0.98829865,0.009834387,0.0004716779,0.0005603894,0.0006570657,0.00017775806],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024605223,0.0016839925,0.0016451018,0.0033542183,0.0013385651,0.0021748398,0.0023591644,0.0014733621,0.005873346],"category_scores_gemma":[0.014962454,0.0015712939,0.0023388693,0.0023343218,0.0016851288,0.0030802183,0.0017471295,0.0027583044,0.00060448813],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014408758,0.0012778637,0.008487594,0.0013535235,0.00043971647,0.0009597827,0.0009799325,0.43255168,0.015545148,0.06354022,0.013166587,0.46025705],"study_design_scores_gemma":[0.000312097,0.00022977292,0.0008544215,0.00017562197,0.00028466678,0.00017603178,0.00058211305,0.88921154,0.010904071,0.09442185,0.002798204,0.000049681603],"about_ca_topic_score_codex":0.007764929,"about_ca_topic_score_gemma":0.017007018,"teacher_disagreement_score":0.007764929,"about_ca_system_score_codex":0.001825659,"about_ca_system_score_gemma":0.0035184897,"threshold_uncertainty_score":0.019648314},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007398693,0.00013897273,0.9965341,0.0000690479,0.000038686696,0.00004461704,0.000090867245,0.0011248281,0.0012189609],"genre_scores_gemma":[0.037466966,0.00047140341,0.95891935,0.00017835,0.00006361771,0.00028572613,0.0003731938,0.0006091319,0.0016323063],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99715185,0.0008218621,0.0003629192,0.00044493724,0.0010061405,0.00021224644],"domain_scores_gemma":[0.997521,0.0013860891,0.000164432,0.0005737917,0.00028800647,0.00006664735],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028369576,0.0012751063,0.00090147165,0.0026537434,0.0009826584,0.0036570898,0.0016347318,0.0008352339,0.0046309265],"category_scores_gemma":[0.0052159554,0.0012824263,0.0026047246,0.0019477468,0.0028278937,0.004320641,0.0032406314,0.0041401843,0.0014889721],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010768678,0.00005208728,0.00071109954,0.00064691296,0.000083882696,0.00032209666,0.0006939271,0.042446975,0.0078054927,0.84085596,0.0038668301,0.102407075],"study_design_scores_gemma":[0.00006807684,0.00006710903,0.00023681208,0.00023506377,0.0001231777,0.00029262973,0.00012397212,0.22053356,0.01342713,0.63939667,0.12542441,0.000071409064],"about_ca_topic_score_codex":0.0023741312,"about_ca_topic_score_gemma":0.0031133802,"teacher_disagreement_score":0.0046309265,"about_ca_system_score_codex":0.0015244982,"about_ca_system_score_gemma":0.0018386522,"threshold_uncertainty_score":0.015491962},"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":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002065844,0.00003921507,0.97952795,0.000088047134,0.000022445263,0.00009671811,0.0002392842,0.01408278,0.0038377834],"genre_scores_gemma":[0.05278557,0.000105367675,0.9394765,0.0001292088,0.000024762563,0.00060419,0.0008188727,0.0032612323,0.002794294],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99764425,0.0007487548,0.00020600992,0.00027764263,0.00091305043,0.0002103971],"domain_scores_gemma":[0.9947648,0.0040033637,0.0002728041,0.0002988958,0.000560264,0.000099846555],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025062284,0.0022464413,0.00091609725,0.0022468101,0.000647922,0.0018208651,0.0025158813,0.0011065744,0.029528342],"category_scores_gemma":[0.00919405,0.0011900194,0.0019949167,0.0010741977,0.00092074374,0.0016032937,0.0021216907,0.0018445608,0.004806287],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009464173,0.0004172487,0.0023710523,0.0015246756,0.00017277489,0.001346831,0.0006559922,0.31987104,0.04235601,0.100547664,0.03868406,0.49110615],"study_design_scores_gemma":[0.00031592656,0.00017602801,0.00030586167,0.00022222887,0.000071815455,0.00042207484,0.00007984713,0.88169914,0.02905109,0.03422089,0.0533409,0.00009426838],"about_ca_topic_score_codex":0.0016457409,"about_ca_topic_score_gemma":0.0020319053,"teacher_disagreement_score":0.029528342,"about_ca_system_score_codex":0.0006323179,"about_ca_system_score_gemma":0.0015883369,"threshold_uncertainty_score":0.09878218},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008581839,0.00005003933,0.986953,0.00020097349,0.00003681929,0.00013860989,0.00006354636,0.00086625485,0.0031089336],"genre_scores_gemma":[0.29125234,0.00019683344,0.7041772,0.00018391387,0.00008869533,0.0004058116,0.00029273675,0.00023784355,0.0031646413],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9935674,0.0021267505,0.0004850422,0.00074649847,0.002567353,0.00050694135],"domain_scores_gemma":[0.9918677,0.00510029,0.00043434024,0.0014496121,0.00093726465,0.00021085971],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006626982,0.0009906603,0.00083919876,0.0015373563,0.0020011761,0.0030484726,0.0023526128,0.0015020058,0.005269493],"category_scores_gemma":[0.01493089,0.0009160514,0.0037895527,0.0009457574,0.004916488,0.005503629,0.004399033,0.0029135966,0.0007821856],"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.00012245274,0.000108394466,0.0005080474,0.00026441042,0.00008802176,0.00081817934,0.0011198672,0.099977896,0.009068606,0.85710955,0.0010733226,0.029741237],"study_design_scores_gemma":[0.00012985987,0.000041573014,0.00006721953,0.0000490204,0.00008682707,0.00016764857,0.00012734585,0.37609223,0.010641868,0.60585725,0.0067056296,0.000033585427],"about_ca_topic_score_codex":0.004229635,"about_ca_topic_score_gemma":0.0048384015,"teacher_disagreement_score":0.006626982,"about_ca_system_score_codex":0.0018001753,"about_ca_system_score_gemma":0.0021364489,"threshold_uncertainty_score":0.035047233},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31003115,0.000129461,0.6850268,0.00016190637,0.000028816165,0.00003191892,0.00012455987,0.0009660439,0.0034992862],"genre_scores_gemma":[0.95059013,0.000049880768,0.048510335,0.000019962155,0.000011258565,0.000021021537,0.000083338266,0.00004820361,0.0006659696],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992091,0.00026022297,0.000047551468,0.00012787769,0.00023067121,0.00012451994],"domain_scores_gemma":[0.99529773,0.003778956,0.00027195222,0.00024909017,0.00030071553,0.00010151613],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012214193,0.00050987647,0.00078408775,0.0008870596,0.00040657213,0.0019867076,0.0007351037,0.0006969071,0.002874486],"category_scores_gemma":[0.007891029,0.00032695188,0.0006204945,0.0006646928,0.00079354155,0.0014202076,0.00070368976,0.00047680826,0.00018718657],"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.0010426723,0.00007645444,0.0064558657,0.0002490158,0.0001135492,0.0004107574,0.00020341821,0.7566556,0.011142659,0.17101817,0.0007802012,0.0518517],"study_design_scores_gemma":[0.000016345482,0.000026621465,0.00030436157,0.0000075236944,0.000017401948,0.000033457676,0.00001159505,0.97198504,0.004464764,0.022927543,0.00019843549,0.000006957571],"about_ca_topic_score_codex":0.001373044,"about_ca_topic_score_gemma":0.0012426936,"teacher_disagreement_score":0.002874486,"about_ca_system_score_codex":0.0009154141,"about_ca_system_score_gemma":0.0006399049,"threshold_uncertainty_score":0.009616137},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22697689,0.0003653709,0.7632325,0.00050520076,0.00006759356,0.00011347666,0.0006874983,0.0013535548,0.0066979243],"genre_scores_gemma":[0.7751483,0.00042710977,0.21737157,0.0000971791,0.000049039594,0.00014618238,0.0016348272,0.00034677962,0.004778968],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978606,0.0003485676,0.00014749644,0.00034418123,0.001032177,0.00026697863],"domain_scores_gemma":[0.9884642,0.0073998054,0.00058762287,0.0020102647,0.0012512432,0.00028683554],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017344449,0.00093950966,0.0010832915,0.0023255022,0.00067537994,0.0024213041,0.002428354,0.0012261787,0.006582409],"category_scores_gemma":[0.023524104,0.00080442504,0.0014888104,0.0013572876,0.0017327104,0.0043613883,0.002729893,0.0021377332,0.0006476988],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006376084,0.0002162306,0.0055146194,0.000340431,0.00016019135,0.0006056604,0.00032411152,0.6960092,0.004617433,0.11061584,0.002662887,0.17829579],"study_design_scores_gemma":[0.00003918654,0.000056869176,0.00034255907,0.000036399157,0.000035408637,0.00008659507,0.000058638994,0.87987626,0.002599121,0.115881085,0.000978,0.000009881468],"about_ca_topic_score_codex":0.00821059,"about_ca_topic_score_gemma":0.0074463105,"teacher_disagreement_score":0.00821059,"about_ca_system_score_codex":0.0019159792,"about_ca_system_score_gemma":0.002795186,"threshold_uncertainty_score":0.02202034},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06273591,0.0005731839,0.9232054,0.0003459028,0.00008289206,0.0002850365,0.00010991903,0.0067360736,0.0059256596],"genre_scores_gemma":[0.5308714,0.00027776128,0.46569353,0.00031538433,0.000058682628,0.00031700335,0.00027729772,0.0011177218,0.0010712298],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9887085,0.006160284,0.0007832676,0.001700659,0.0019859476,0.0006612427],"domain_scores_gemma":[0.96168905,0.027447255,0.0016187663,0.007313064,0.0016850751,0.00024667385],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00758256,0.001688191,0.0014155976,0.001452838,0.0008031303,0.0022956238,0.0024923352,0.0014578333,0.0040248134],"category_scores_gemma":[0.041101523,0.0012443069,0.0012091629,0.0009921055,0.0018966232,0.0034627258,0.002679172,0.0029889515,0.0017074316],"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.0008811416,0.00059282646,0.0041368064,0.00060751964,0.0001564865,0.00020900463,0.0004198633,0.4537548,0.050052725,0.04730071,0.00370671,0.43818137],"study_design_scores_gemma":[0.00016380748,0.00013520569,0.00040253444,0.00006856963,0.00006270445,0.00010102199,0.00004803331,0.92789954,0.02408765,0.04276799,0.0042082784,0.00005464419],"about_ca_topic_score_codex":0.0012049726,"about_ca_topic_score_gemma":0.0020984507,"teacher_disagreement_score":0.00758256,"about_ca_system_score_codex":0.0014789059,"about_ca_system_score_gemma":0.0026006745,"threshold_uncertainty_score":0.040100873},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008186151,0.005633846,0.9625933,0.0022358296,0.0003377834,0.00013638582,0.00008336192,0.0012704611,0.019522887],"genre_scores_gemma":[0.12681267,0.0039355676,0.8619451,0.0009121138,0.00039215796,0.00035985134,0.00020976097,0.0002567801,0.0051760958],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.991413,0.0049238503,0.00039014188,0.0007070455,0.0021471153,0.00041894751],"domain_scores_gemma":[0.986158,0.0111997,0.0006575781,0.0012239101,0.0005783862,0.00018233834],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004338234,0.001460575,0.0010528513,0.0025911666,0.0005168247,0.0033381348,0.0019538195,0.0020754822,0.007658782],"category_scores_gemma":[0.015390143,0.0010017582,0.0014136719,0.003226578,0.0031023677,0.0077319783,0.0032704477,0.0054547274,0.0018586305],"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.00031073988,0.00031224804,0.0007394602,0.0009867027,0.00014984899,0.00025918832,0.00034272703,0.039603688,0.007691715,0.62979954,0.0062022605,0.31360185],"study_design_scores_gemma":[0.000215477,0.00025328065,0.00047460062,0.00046658362,0.00015467609,0.0005336045,0.0002706969,0.42817512,0.020181157,0.49535763,0.05383227,0.000084914245],"about_ca_topic_score_codex":0.0007036864,"about_ca_topic_score_gemma":0.00097572175,"teacher_disagreement_score":0.007658782,"about_ca_system_score_codex":0.0009623822,"about_ca_system_score_gemma":0.001396443,"threshold_uncertainty_score":0.025621176},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027026033,0.000058002035,0.9663805,0.000059718473,0.000048687652,0.00013451581,0.00009685743,0.0044698417,0.0017258276],"genre_scores_gemma":[0.421141,0.00008334713,0.5756465,0.00008635174,0.000020952177,0.00028674374,0.00031832335,0.00057363685,0.0018432046],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99808073,0.0006559072,0.00019849637,0.0003086075,0.0006168772,0.00013934022],"domain_scores_gemma":[0.9944559,0.003393635,0.00048651485,0.0009287773,0.0006526369,0.00008259484],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018885839,0.0006781187,0.00049248856,0.00073304906,0.0003522537,0.0008541242,0.001025548,0.000473219,0.0031825881],"category_scores_gemma":[0.006605301,0.00036167452,0.0006730526,0.00027276663,0.0008306587,0.0012659789,0.0006610353,0.00081199355,0.0007595331],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010760075,0.00043776742,0.0041668895,0.00091503904,0.00016403157,0.0012219938,0.00071186625,0.2716328,0.19485235,0.19044654,0.00486418,0.32951057],"study_design_scores_gemma":[0.00013352817,0.0002997095,0.00024972318,0.000061680854,0.00007008888,0.0002625904,0.00004541352,0.7424426,0.22118656,0.026669947,0.008540243,0.00003791566],"about_ca_topic_score_codex":0.00056506455,"about_ca_topic_score_gemma":0.0009640437,"teacher_disagreement_score":0.0031825881,"about_ca_system_score_codex":0.00045997958,"about_ca_system_score_gemma":0.0011294278,"threshold_uncertainty_score":0.01064682},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018581897,0.00021927494,0.9734677,0.00030359376,0.00007417455,0.000043142107,0.00007917541,0.001336184,0.0058948398],"genre_scores_gemma":[0.60409456,0.00071908545,0.3842299,0.00020652908,0.00009978354,0.00018318379,0.00043864286,0.0009179372,0.009110279],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99748874,0.0009582088,0.00020425797,0.00056084763,0.0005905648,0.0001974195],"domain_scores_gemma":[0.9930982,0.0046140403,0.00031817832,0.0013740008,0.00048513527,0.000110413435],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018328897,0.00076820876,0.00069548894,0.00094103353,0.00058563176,0.0028203789,0.0013557199,0.0010680172,0.0044898978],"category_scores_gemma":[0.008786207,0.0011136545,0.0012223258,0.00088594295,0.0026658906,0.0082243355,0.0027663368,0.0028730445,0.0016325254],"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.000113413465,0.00006260641,0.00034256035,0.00018411914,0.000025096442,0.00017260715,0.000979295,0.024044495,0.004876669,0.9186169,0.0006722875,0.049909916],"study_design_scores_gemma":[0.000026762094,0.00004015141,0.00007534287,0.000060320297,0.000038056925,0.000076695935,0.00015205517,0.06963035,0.008706525,0.91015565,0.011015345,0.00002278896],"about_ca_topic_score_codex":0.00077024143,"about_ca_topic_score_gemma":0.00070103403,"teacher_disagreement_score":0.0044898978,"about_ca_system_score_codex":0.000906523,"about_ca_system_score_gemma":0.0007991114,"threshold_uncertainty_score":0.015020192},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009099266,0.000113814065,0.99735105,0.00015270349,0.000014676901,0.000045789122,0.000008862719,0.00011336138,0.0012897475],"genre_scores_gemma":[0.038699046,0.00022062063,0.959015,0.0000896805,0.000033910244,0.00027085867,0.000035841917,0.00008653506,0.0015485082],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9841589,0.0075466344,0.0010920726,0.001302924,0.005505963,0.00039359345],"domain_scores_gemma":[0.9826371,0.008378761,0.0010344115,0.005122792,0.0024928115,0.00033402228],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.015998079,0.0013601565,0.0009536631,0.0021747313,0.0010450333,0.00327874,0.0033252144,0.0018385691,0.0034931556],"category_scores_gemma":[0.020263478,0.0015193679,0.0019252948,0.0009968588,0.004334625,0.0043949545,0.0053265183,0.004421664,0.0010354148],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000059738064,0.00007634249,0.0004109782,0.0004924688,0.00008792298,0.00022555963,0.001058254,0.026193183,0.010703492,0.89800197,0.0009101031,0.061780084],"study_design_scores_gemma":[0.00011920607,0.00035682187,0.00025482627,0.00042515626,0.00009138173,0.0004206599,0.000270386,0.22064939,0.019465365,0.68794876,0.06991958,0.0000784506],"about_ca_topic_score_codex":0.0009758552,"about_ca_topic_score_gemma":0.001136124,"teacher_disagreement_score":0.015998079,"about_ca_system_score_codex":0.0017567916,"about_ca_system_score_gemma":0.0038579504,"threshold_uncertainty_score":0.084606946},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0031539514,0.00023241632,0.99263096,0.00036431503,0.00007786561,0.00011068275,0.000102327824,0.00045311425,0.0028744591],"genre_scores_gemma":[0.3214094,0.0008767395,0.6720347,0.0005878482,0.00024730447,0.0010881199,0.00071337377,0.000470377,0.002572126],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98926765,0.0043797176,0.0016404273,0.000847436,0.0033972443,0.00046750883],"domain_scores_gemma":[0.99055594,0.0050847842,0.0006304007,0.0017987086,0.0016971083,0.00023304617],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009305994,0.001160869,0.0010273468,0.0015722204,0.0011527181,0.0047138548,0.0022103956,0.0025242667,0.0024791558],"category_scores_gemma":[0.014393229,0.00064036914,0.0021548807,0.0008670283,0.0053414213,0.0051983315,0.0029387511,0.0039731245,0.0007349758],"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.000075241114,0.000049309892,0.0002206031,0.00021437836,0.000036644837,0.00021987616,0.00073074445,0.020954732,0.003562964,0.961105,0.00074804603,0.012082498],"study_design_scores_gemma":[0.00009932531,0.000121756864,0.00017448302,0.00027615228,0.000080421974,0.0003275481,0.00024172345,0.13223962,0.010906963,0.82176965,0.033697642,0.000064702275],"about_ca_topic_score_codex":0.0016359214,"about_ca_topic_score_gemma":0.00091773923,"teacher_disagreement_score":0.009305994,"about_ca_system_score_codex":0.001901044,"about_ca_system_score_gemma":0.0026635688,"threshold_uncertainty_score":0.049215436},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06672456,0.007215872,0.84693986,0.0070593557,0.0006418636,0.00010039833,0.00041701074,0.0002749187,0.07062617],"genre_scores_gemma":[0.8103452,0.0048488616,0.15963152,0.003910766,0.0018263584,0.00045881726,0.0006220471,0.00018282264,0.018173719],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965167,0.0010221391,0.00018457265,0.0008630957,0.0011274713,0.00028595925],"domain_scores_gemma":[0.9909909,0.006859556,0.00037383908,0.0005915831,0.000985593,0.00019855938],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006271287,0.0008007781,0.0013066983,0.0017416576,0.0012903085,0.0027301058,0.0013621625,0.0022282305,0.009594642],"category_scores_gemma":[0.013617582,0.00046387484,0.002134489,0.0013924555,0.006203811,0.009445512,0.0025357674,0.005753683,0.0013726294],"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.00007255748,0.000026540762,0.00024537477,0.00014121116,0.0000426803,0.0001673944,0.00040290054,0.00363613,0.0019999766,0.9804098,0.0018308229,0.011024609],"study_design_scores_gemma":[0.000030967694,0.00015165853,0.0005836526,0.000058804028,0.000030954823,0.00026099023,0.00018114611,0.023541806,0.0025085807,0.9617186,0.0109069515,0.000025929192],"about_ca_topic_score_codex":0.0014767126,"about_ca_topic_score_gemma":0.0006353359,"teacher_disagreement_score":0.009594642,"about_ca_system_score_codex":0.0017353459,"about_ca_system_score_gemma":0.00079313817,"threshold_uncertainty_score":0.03316611},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002508723,0.0000469489,0.99649847,0.000014356877,0.000005827817,0.000028578266,0.000017711747,0.00066116435,0.00021830194],"genre_scores_gemma":[0.12374328,0.0001714969,0.8747653,0.000043658678,0.00001161741,0.00013614788,0.00019098866,0.0002194006,0.0007181263],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986085,0.0005694065,0.00009333476,0.00019971262,0.00042535894,0.0001036735],"domain_scores_gemma":[0.99736685,0.0015378682,0.00020709974,0.0005845855,0.00026323058,0.00004037889],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001664112,0.001070076,0.00065151067,0.0014158087,0.0004207669,0.0005303823,0.0012768218,0.00058861385,0.002367198],"category_scores_gemma":[0.005627081,0.00059769873,0.0012962858,0.0010645702,0.0008543766,0.0014358438,0.001380932,0.0013206921,0.0006375159],"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.00037378928,0.00009213325,0.0020877582,0.0004277692,0.00011143787,0.00043774935,0.0007119509,0.45769098,0.044051263,0.09434407,0.002382124,0.39728898],"study_design_scores_gemma":[0.000033694207,0.00008290558,0.00020137343,0.000037311314,0.000040403025,0.0001295632,0.00003655582,0.94523275,0.015047164,0.03504199,0.0040968754,0.00001938804],"about_ca_topic_score_codex":0.0029266276,"about_ca_topic_score_gemma":0.004127277,"teacher_disagreement_score":0.0029266276,"about_ca_system_score_codex":0.00068042823,"about_ca_system_score_gemma":0.0012524233,"threshold_uncertainty_score":0.008800805},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01900487,0.0006577422,0.95081294,0.0013104245,0.00026968392,0.00019374245,0.0008951024,0.0004028608,0.026452651],"genre_scores_gemma":[0.5146487,0.0017403257,0.44130844,0.0010360575,0.00039470673,0.001325821,0.0026801382,0.0003925821,0.036473233],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981969,0.00033207223,0.00024062746,0.00031118788,0.00071287405,0.00020641164],"domain_scores_gemma":[0.9971814,0.001436223,0.0003381939,0.00013686421,0.0008261646,0.00008114653],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013245209,0.0007414133,0.0006690909,0.00096375484,0.0008271754,0.002180386,0.001162987,0.0012955267,0.0071501373],"category_scores_gemma":[0.007641653,0.00054533797,0.0018386153,0.0011145418,0.001435647,0.0037788008,0.0015785227,0.002973077,0.0015196493],"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.000011297802,0.000013975519,0.00019846225,0.000054725086,0.000011277791,0.00021790079,0.0004661931,0.009387586,0.00095885724,0.9820062,0.0015328035,0.0051408876],"study_design_scores_gemma":[0.000033045522,0.000012783426,0.00008076363,0.000025610694,0.000017021446,0.00017556215,0.000118758326,0.09075284,0.00084436225,0.89176834,0.016150022,0.00002096031],"about_ca_topic_score_codex":0.0054601342,"about_ca_topic_score_gemma":0.004521857,"teacher_disagreement_score":0.0071501373,"about_ca_system_score_codex":0.0019347648,"about_ca_system_score_gemma":0.0015967458,"threshold_uncertainty_score":0.023919642},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00535946,0.000112824346,0.982219,0.0004718584,0.00010368037,0.00006641715,0.00019309547,0.0074474267,0.0040262174],"genre_scores_gemma":[0.25909147,0.00037497465,0.7335367,0.0005540693,0.0002857585,0.00036526594,0.0012303027,0.0015093568,0.0030520468],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9851929,0.005824757,0.0012991597,0.0016387075,0.004845103,0.0011992946],"domain_scores_gemma":[0.92769533,0.055335864,0.0019271557,0.010361443,0.0040230867,0.00065715314],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.014528498,0.0013223516,0.0014705242,0.002527304,0.0016826167,0.005061352,0.0045456085,0.0020809062,0.013615865],"category_scores_gemma":[0.06647494,0.001563799,0.003097483,0.0018242031,0.0035913954,0.009711544,0.0058507733,0.0038239423,0.0028173553],"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.00038021657,0.0001792973,0.0012179433,0.0006250433,0.000117865486,0.0008377214,0.00061341084,0.026563363,0.010094544,0.83877164,0.009194974,0.111403994],"study_design_scores_gemma":[0.00035622407,0.00012165156,0.00022779865,0.00019492589,0.00012122954,0.00062706706,0.00011364289,0.27496973,0.037733894,0.65186733,0.033593874,0.0000727569],"about_ca_topic_score_codex":0.0012362506,"about_ca_topic_score_gemma":0.0012243039,"teacher_disagreement_score":0.014528498,"about_ca_system_score_codex":0.0016876559,"about_ca_system_score_gemma":0.002137183,"threshold_uncertainty_score":0.07683498},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.064536214,0.00094244647,0.8886622,0.00083016395,0.00017693493,0.00010357715,0.00025506102,0.00022619081,0.044267137],"genre_scores_gemma":[0.84716856,0.0011601764,0.13757549,0.00041302736,0.00032734236,0.00029861077,0.0004426446,0.00011008423,0.012504163],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99781775,0.0006383362,0.00014538555,0.00037804447,0.0007661123,0.00025430738],"domain_scores_gemma":[0.9972307,0.00128018,0.0003155196,0.00029141663,0.00060050027,0.000281759],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022639183,0.0006005281,0.000902721,0.0018642179,0.002027502,0.0030663465,0.000986715,0.00092859805,0.005018335],"category_scores_gemma":[0.0055217654,0.0003656205,0.0018612124,0.0013269932,0.003278195,0.006654202,0.002915929,0.002386654,0.00058671145],"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.0000041151206,0.000005518332,0.000040044608,0.000011230589,0.000004386339,0.000014830303,0.0000566385,0.00084178115,0.00016171655,0.9976324,0.00011101808,0.0011162774],"study_design_scores_gemma":[0.0000037902364,0.000008412248,0.000037338403,0.0000075919656,0.0000047115223,0.0000233707,0.000027318087,0.011085847,0.00038999005,0.98661476,0.0017911386,0.000005681821],"about_ca_topic_score_codex":0.0014094051,"about_ca_topic_score_gemma":0.001140358,"teacher_disagreement_score":0.005018335,"about_ca_system_score_codex":0.0017983167,"about_ca_system_score_gemma":0.0015314835,"threshold_uncertainty_score":0.016787946},"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":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018422834,0.8248024,0.16092028,0.0020162486,0.0009726395,0.000092385184,0.00016950624,0.00031674068,0.008867446],"genre_scores_gemma":[0.0281547,0.8627892,0.10320833,0.00063987327,0.0014730121,0.00021203214,0.00033131713,0.00013016189,0.0030612517],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9972409,0.0006771101,0.0005058932,0.0005755056,0.0008734605,0.00012726105],"domain_scores_gemma":[0.99133486,0.0066051143,0.00034006633,0.00048438404,0.001085843,0.00014975217],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037114064,0.001223729,0.0017383669,0.004551695,0.00062892365,0.0030535432,0.0023042655,0.0019210221,0.0031546704],"category_scores_gemma":[0.008379831,0.0011954397,0.0013859412,0.0065983334,0.0016706048,0.005434165,0.0011159504,0.0026927935,0.001671304],"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.00010680516,0.00016855967,0.001079354,0.013744133,0.00011823437,0.00020415471,0.00034880236,0.012204231,0.0034790789,0.31758457,0.01358595,0.6373761],"study_design_scores_gemma":[0.00005062493,0.00024350725,0.0011823488,0.0045657074,0.00018719184,0.0012566643,0.0002949383,0.031105414,0.0061172456,0.19044366,0.7644233,0.00012932585],"about_ca_topic_score_codex":0.0022844067,"about_ca_topic_score_gemma":0.0019409724,"teacher_disagreement_score":0.004551695,"about_ca_system_score_codex":0.0029889173,"about_ca_system_score_gemma":0.0034150956,"threshold_uncertainty_score":0.021686256},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0726221,0.000048575646,0.9125821,0.00026752276,0.00006803577,0.00007692446,0.00013694998,0.011705091,0.0024926972],"genre_scores_gemma":[0.8207131,0.000058716392,0.17419927,0.0001361759,0.000042007476,0.00014711493,0.00031073383,0.0019470826,0.002445772],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99411017,0.002032951,0.00028516422,0.0005122427,0.0025606265,0.0004988615],"domain_scores_gemma":[0.9706824,0.019069687,0.0012716743,0.006635475,0.0020768791,0.00026391767],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003922613,0.0010637018,0.00093164307,0.0015033932,0.0007793542,0.001849078,0.0033540495,0.0019039179,0.0043187873],"category_scores_gemma":[0.031590734,0.0008741732,0.0014742862,0.0009513525,0.0032111483,0.006116694,0.0034122472,0.0026150257,0.00084701716],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002002695,0.00094575365,0.012476921,0.00086619204,0.00030878876,0.001459131,0.0016671421,0.2441808,0.059307933,0.43937513,0.0066763,0.23073329],"study_design_scores_gemma":[0.00019856075,0.00016720619,0.00042101066,0.000040864343,0.000106637155,0.00017023302,0.00006597438,0.71104264,0.07033656,0.21456893,0.0028250967,0.00005627653],"about_ca_topic_score_codex":0.0017418052,"about_ca_topic_score_gemma":0.0021288707,"teacher_disagreement_score":0.0043187873,"about_ca_system_score_codex":0.0011512428,"about_ca_system_score_gemma":0.0018529966,"threshold_uncertainty_score":0.02074498},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016875051,0.00058432797,0.9675684,0.00042968884,0.000095512354,0.00022646238,0.0006836915,0.00787066,0.0056662727],"genre_scores_gemma":[0.11904778,0.0004962534,0.8741619,0.00019425222,0.00006887361,0.0004859836,0.0029110783,0.0008140274,0.0018199186],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985784,0.0003674561,0.00011108373,0.00022236853,0.000541471,0.00017915963],"domain_scores_gemma":[0.99644417,0.0020323074,0.00017971658,0.0008753496,0.0003780187,0.00009045701],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013157874,0.0010065468,0.0008486074,0.0013020353,0.00063862087,0.0012923632,0.0012177965,0.00074379187,0.0074908226],"category_scores_gemma":[0.0067064166,0.00057673844,0.0014705985,0.0020033305,0.0007655071,0.002159735,0.0018716689,0.002275051,0.0017282137],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034722014,0.00034282065,0.001017187,0.00080105365,0.00009074075,0.00033369104,0.00024537655,0.2263158,0.03857091,0.11234379,0.026641404,0.59295005],"study_design_scores_gemma":[0.00016731383,0.00008188154,0.00022823094,0.000059051465,0.000045832578,0.00011331486,0.00006661787,0.843431,0.014541983,0.12928997,0.011956223,0.000018545677],"about_ca_topic_score_codex":0.0027613516,"about_ca_topic_score_gemma":0.0052997954,"teacher_disagreement_score":0.0074908226,"about_ca_system_score_codex":0.001179055,"about_ca_system_score_gemma":0.0018373355,"threshold_uncertainty_score":0.025059283},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004759087,0.000083282095,0.99374384,0.00006329348,0.000025539368,0.00009066312,0.000029057872,0.00044924,0.00075601146],"genre_scores_gemma":[0.27068448,0.00057720765,0.7252651,0.00008611158,0.00003779672,0.0005967047,0.00023522979,0.00024753856,0.0022698566],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9935766,0.001672623,0.00075053493,0.0004994346,0.0031697399,0.0003309601],"domain_scores_gemma":[0.99384564,0.0028936912,0.0009415307,0.0011286371,0.0010727238,0.00011777987],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0046164338,0.0007482907,0.0007799757,0.0007952576,0.00064718205,0.00220777,0.0018134157,0.0012851097,0.001277003],"category_scores_gemma":[0.009110007,0.0009207569,0.0013937717,0.0004358509,0.0024780286,0.0019706292,0.0013144298,0.0016798603,0.0004909271],"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.00012839382,0.00010731972,0.00100315,0.0005604523,0.00009939357,0.0010678379,0.0012078789,0.34085226,0.055692304,0.55678344,0.0010288634,0.041468747],"study_design_scores_gemma":[0.00018702248,0.00017417573,0.00024954873,0.00014472127,0.0000828592,0.00035586412,0.00014429074,0.82856536,0.060522012,0.087439165,0.02206211,0.00007287536],"about_ca_topic_score_codex":0.0030516132,"about_ca_topic_score_gemma":0.0027733913,"teacher_disagreement_score":0.0046164338,"about_ca_system_score_codex":0.0009459867,"about_ca_system_score_gemma":0.0028729842,"threshold_uncertainty_score":0.02441436},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18213119,0.00044591862,0.803498,0.0011360237,0.00007102918,0.00016755375,0.00026646245,0.0007370176,0.011546841],"genre_scores_gemma":[0.76520616,0.00064733037,0.22594531,0.0002790223,0.000051947703,0.00030789492,0.0005673877,0.00041673274,0.0065782573],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9945919,0.0019351355,0.00035878192,0.00054516963,0.0019473429,0.0006216613],"domain_scores_gemma":[0.9595531,0.03471218,0.0024784773,0.0014174648,0.0013517129,0.0004870559],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004251047,0.0007552483,0.00092271715,0.0019918422,0.0025259303,0.0034299935,0.0014600349,0.0022155484,0.0043939757],"category_scores_gemma":[0.03500198,0.0016156767,0.0011508047,0.0021138529,0.0049399915,0.007270311,0.0037473748,0.004033217,0.00041073243],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004187055,0.00014367823,0.003816617,0.00039408702,0.000052615564,0.0010652245,0.0013952598,0.10133162,0.0021318097,0.8597063,0.001432364,0.028111786],"study_design_scores_gemma":[0.00004658603,0.000028026585,0.00029882768,0.00006240264,0.000036414174,0.0001398016,0.00017958622,0.0828622,0.0017188286,0.91232526,0.002282075,0.000020098158],"about_ca_topic_score_codex":0.00464487,"about_ca_topic_score_gemma":0.004865397,"teacher_disagreement_score":0.00464487,"about_ca_system_score_codex":0.0016514079,"about_ca_system_score_gemma":0.0026453126,"threshold_uncertainty_score":0.022481978},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033614468,0.00026478403,0.9513864,0.00014666072,0.00009875318,0.00010790585,0.0002201527,0.0018849075,0.012275983],"genre_scores_gemma":[0.506736,0.0007105907,0.47352946,0.00024058661,0.00016902781,0.00019012376,0.0014069709,0.0006809847,0.016336266],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99778277,0.00044964557,0.00020915785,0.00046346826,0.0008873612,0.0002076553],"domain_scores_gemma":[0.99840313,0.0006646153,0.00013081174,0.00027866982,0.00044228486,0.000080485544],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014025264,0.0004386728,0.0006599517,0.0014946181,0.0011889368,0.0031770456,0.0009466178,0.00046457027,0.0086047165],"category_scores_gemma":[0.0034908443,0.00046571466,0.0011104102,0.0014161546,0.001596783,0.0052969633,0.0018148939,0.00074886996,0.0018169744],"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.000239984,0.000089360634,0.0014014441,0.00030547305,0.00007178712,0.0004040786,0.0005095118,0.02882071,0.012236285,0.82124656,0.0032626174,0.13141225],"study_design_scores_gemma":[0.000073613075,0.00015435857,0.00054162974,0.000095757445,0.00015071931,0.0005759288,0.00023690365,0.16739874,0.037021987,0.7158284,0.0778515,0.000070405185],"about_ca_topic_score_codex":0.0016789937,"about_ca_topic_score_gemma":0.0014800027,"teacher_disagreement_score":0.0086047165,"about_ca_system_score_codex":0.00097613403,"about_ca_system_score_gemma":0.0012302814,"threshold_uncertainty_score":0.028785586},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030625153,0.00084178307,0.9807778,0.0015472139,0.00017503704,0.00006511529,0.000083198465,0.00047790076,0.01296933],"genre_scores_gemma":[0.30102038,0.002609025,0.6772294,0.00090486277,0.00079372956,0.0005092733,0.0003507639,0.0003339262,0.016248653],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974897,0.0008626203,0.00021429009,0.00037208872,0.0008228065,0.00023851293],"domain_scores_gemma":[0.9938241,0.003768078,0.0004491268,0.0010998431,0.00064466987,0.0002142185],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003156832,0.0007877519,0.00053218036,0.0020040227,0.0018774834,0.004578458,0.0031873856,0.0020975948,0.004892131],"category_scores_gemma":[0.009284517,0.00082864356,0.0018779517,0.0014030434,0.007926265,0.007092025,0.0029927536,0.0038510093,0.001010683],"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.000009654784,0.000030002584,0.00013236688,0.0000638252,0.000008363243,0.0001300525,0.0004112693,0.008193741,0.00069663365,0.98081404,0.00089386984,0.008616124],"study_design_scores_gemma":[0.000018491002,0.000024748533,0.00008251596,0.000063224295,0.000021810632,0.00020471001,0.000102355545,0.050305333,0.0010325381,0.9216777,0.026444362,0.000022315851],"about_ca_topic_score_codex":0.0043089804,"about_ca_topic_score_gemma":0.0035883663,"teacher_disagreement_score":0.004892131,"about_ca_system_score_codex":0.0029614938,"about_ca_system_score_gemma":0.0022303998,"threshold_uncertainty_score":0.021487176},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019909296,0.008909275,0.51649356,0.0037236733,0.0060895598,0.0007789753,0.004619711,0.0072938325,0.43218216],"genre_scores_gemma":[0.4745777,0.00997051,0.23224285,0.0017526767,0.0015926161,0.0013520689,0.010361997,0.0014245511,0.26672497],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987539,0.0002590486,0.00014571082,0.000360871,0.00035525623,0.00012518484],"domain_scores_gemma":[0.9977406,0.0009777638,0.00016802872,0.00039522693,0.00054707367,0.00017125325],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064574985,0.0011419653,0.0010697764,0.000723818,0.0010593443,0.002566835,0.0020469958,0.0012886511,0.074392654],"category_scores_gemma":[0.0041373577,0.0003435529,0.0009060986,0.001657639,0.0013041141,0.002776039,0.0015567725,0.0017067533,0.017446073],"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.00045589096,0.000118977085,0.0008778247,0.001406993,0.00008215218,0.0007953495,0.00044737558,0.018416319,0.0060846414,0.71538615,0.06320783,0.1927205],"study_design_scores_gemma":[0.00010888729,0.00011854735,0.0003043391,0.00045483973,0.00013414802,0.00059592875,0.00013759355,0.051179085,0.003286057,0.40042716,0.5431896,0.00006378528],"about_ca_topic_score_codex":0.0018397981,"about_ca_topic_score_gemma":0.0023423433,"teacher_disagreement_score":0.074392654,"about_ca_system_score_codex":0.0015768538,"about_ca_system_score_gemma":0.0014085438,"threshold_uncertainty_score":0.24886817},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020567114,0.000048352384,0.9771682,0.000092756,0.000012437451,0.000110837835,0.000056596444,0.0015351232,0.0004085908],"genre_scores_gemma":[0.4426396,0.00013678068,0.5551521,0.00011866419,0.000037799455,0.00035391498,0.00028708327,0.0004697236,0.00080430123],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9915895,0.0022173342,0.00079610513,0.0018859007,0.002752066,0.0007591147],"domain_scores_gemma":[0.97376233,0.018195089,0.0022281657,0.0041529476,0.001320885,0.00034055108],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0082833255,0.0015390797,0.0011949969,0.0011861484,0.0012165108,0.0031193085,0.0034176153,0.0013430185,0.0019793522],"category_scores_gemma":[0.027945954,0.0018575646,0.003896958,0.0008802673,0.0052489103,0.00881295,0.0040049125,0.0024057638,0.0002982637],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006570815,0.00028948954,0.006223932,0.0008268927,0.0003777957,0.0012798484,0.0017515632,0.60198855,0.046718206,0.22555105,0.0009375241,0.11339802],"study_design_scores_gemma":[0.00014645567,0.00011964711,0.00038857458,0.00006348535,0.00012721037,0.0001609859,0.00008948882,0.869208,0.032782514,0.09426362,0.0025994596,0.000050593793],"about_ca_topic_score_codex":0.005567364,"about_ca_topic_score_gemma":0.004382967,"teacher_disagreement_score":0.0082833255,"about_ca_system_score_codex":0.0025037252,"about_ca_system_score_gemma":0.0038166596,"threshold_uncertainty_score":0.04380697},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000031660325,0.0033896258,0.00040910326,0.014415357,0.98023456,0.000014602349,0.000032623368,0.00006494605,0.0014075848],"genre_scores_gemma":[0.0006822838,0.0045674695,0.0003389306,0.0102256965,0.9680176,0.000030880503,0.000062223946,0.00008360237,0.015991423],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.995366,0.00094198954,0.00057650055,0.0005180786,0.0023174044,0.00028003342],"domain_scores_gemma":[0.97750604,0.009056666,0.0013476355,0.0006208163,0.009570983,0.0018977631],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0068132565,0.0035388884,0.004147815,0.004603601,0.0021464557,0.0071240147,0.0030467224,0.010783993,0.018057872],"category_scores_gemma":[0.024860276,0.0012638952,0.002762556,0.0013818041,0.0018721394,0.0037839005,0.0013027751,0.013328397,0.010176091],"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.000050380935,0.00001685636,0.000015450925,0.00022784054,0.000026210897,0.00010462774,0.0000066094863,0.000036793524,0.0000807555,0.000342698,0.99329656,0.0057952614],"study_design_scores_gemma":[0.000120322016,0.000046499175,0.00023676264,0.00045779042,0.00013864493,0.00034081226,0.00002308696,0.00053026876,0.00031571678,0.0019820652,0.9957825,0.000025534178],"about_ca_topic_score_codex":0.0008453066,"about_ca_topic_score_gemma":0.0022955965,"teacher_disagreement_score":0.018057872,"about_ca_system_score_codex":0.0017183088,"about_ca_system_score_gemma":0.0017010277,"threshold_uncertainty_score":0.060409665},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012348219,0.00014808927,0.9955585,0.00021318387,0.000058038673,0.00011928029,0.00018589546,0.0006288604,0.001853392],"genre_scores_gemma":[0.09553623,0.00095323264,0.89617264,0.0003162775,0.00010728522,0.001053699,0.0013927415,0.0002927779,0.0041750637],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9933689,0.0022584056,0.0011905197,0.0005026592,0.002279338,0.00040022607],"domain_scores_gemma":[0.9922065,0.004555904,0.0005625903,0.001138604,0.0013194722,0.0002170305],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006708879,0.0011945679,0.0009944054,0.0016990385,0.000876456,0.003607591,0.0026924924,0.0013761163,0.0045012375],"category_scores_gemma":[0.008632572,0.0007772397,0.0024377564,0.0016064981,0.0035334846,0.0041049905,0.002002505,0.0036586034,0.0011297421],"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.00007469272,0.00007325837,0.0004902316,0.0004262677,0.000052576146,0.00053997117,0.0007907367,0.103400536,0.004075091,0.8554365,0.002793465,0.031846717],"study_design_scores_gemma":[0.00021927217,0.00010523403,0.00014074204,0.00023615944,0.00006633079,0.00038520258,0.00025858267,0.45651358,0.010057987,0.41874263,0.11319974,0.00007459933],"about_ca_topic_score_codex":0.0047127386,"about_ca_topic_score_gemma":0.004304713,"teacher_disagreement_score":0.006708879,"about_ca_system_score_codex":0.0023859197,"about_ca_system_score_gemma":0.0035074046,"threshold_uncertainty_score":0.03548032},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0046446254,0.0005374983,0.9755145,0.0008857421,0.00026755346,0.00014690476,0.0002675412,0.00093444576,0.016801178],"genre_scores_gemma":[0.3355527,0.0016231496,0.64366025,0.0015774142,0.000970038,0.0014014447,0.001050601,0.00085714035,0.01330735],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99233776,0.0020491213,0.0010882344,0.0013854209,0.002376016,0.00076356914],"domain_scores_gemma":[0.9935713,0.0023927349,0.00055297156,0.0009345578,0.0022731132,0.00027528772],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005606667,0.0011383059,0.0008805735,0.0020665172,0.0020506615,0.0045330212,0.0020010571,0.002108928,0.005847734],"category_scores_gemma":[0.008209364,0.0007489217,0.002532572,0.0015449609,0.0071222754,0.009547127,0.0026356482,0.0050764736,0.002105107],"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.00001131557,0.000019782849,0.000058722744,0.000042173393,0.000009033413,0.00011885885,0.00042411522,0.0013286253,0.0012233455,0.99140924,0.00062387256,0.0047309753],"study_design_scores_gemma":[0.000031164916,0.000040985866,0.00005702596,0.000048155,0.00002487773,0.0003238879,0.00016560711,0.013230659,0.0025851596,0.94739544,0.036057018,0.000039987626],"about_ca_topic_score_codex":0.0024363236,"about_ca_topic_score_gemma":0.0011946099,"teacher_disagreement_score":0.005847734,"about_ca_system_score_codex":0.0016611218,"about_ca_system_score_gemma":0.0028047399,"threshold_uncertainty_score":0.029651225},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012487546,0.0001328502,0.9771428,0.00025517933,0.0000880058,0.00009682836,0.00027377263,0.003225635,0.006297426],"genre_scores_gemma":[0.46489275,0.00031963034,0.5242916,0.00036480973,0.00010532498,0.0002651593,0.0015150636,0.00068455894,0.0075610806],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973124,0.0006545528,0.00014159559,0.0005162826,0.0010826129,0.00029262193],"domain_scores_gemma":[0.9946614,0.0031773928,0.000206382,0.0012238562,0.0006571868,0.00007382951],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017557065,0.0012096537,0.0010330067,0.0019153521,0.00083573034,0.0014744793,0.00245246,0.000946948,0.010943937],"category_scores_gemma":[0.0077372068,0.0007863738,0.0024914,0.0013941526,0.0015884277,0.0035523102,0.0020780119,0.002589486,0.0017220785],"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.00061723957,0.00041022236,0.0034033528,0.0004646784,0.00026587048,0.00057058386,0.00027750732,0.4301204,0.020931987,0.24660914,0.00876113,0.2875679],"study_design_scores_gemma":[0.000052708052,0.000051417785,0.0003625841,0.000028535349,0.000077934754,0.00007407989,0.00002085331,0.92506063,0.0066507114,0.065044425,0.0025485083,0.000027599706],"about_ca_topic_score_codex":0.009166699,"about_ca_topic_score_gemma":0.015590231,"teacher_disagreement_score":0.010943937,"about_ca_system_score_codex":0.0011148422,"about_ca_system_score_gemma":0.0022117314,"threshold_uncertainty_score":0.03661114},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004999764,0.00005668547,0.99221474,0.0001599048,0.00003118618,0.00010478755,0.000039562834,0.0006283827,0.0017649928],"genre_scores_gemma":[0.21074362,0.00043404635,0.7821368,0.00022472675,0.000061452934,0.0007936183,0.00035039193,0.0002799872,0.004975341],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9869011,0.0070232013,0.0012967725,0.0008251865,0.0034807508,0.0004730763],"domain_scores_gemma":[0.9697973,0.018620532,0.0024454421,0.0055455607,0.0033760057,0.00021512873],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.015471941,0.00063963875,0.00042125816,0.0010564061,0.00065771694,0.0030178118,0.0016317042,0.0014940994,0.0019500692],"category_scores_gemma":[0.034490336,0.0006441987,0.00092936674,0.00049324613,0.0042657387,0.0052967523,0.001655781,0.0025301857,0.0005382185],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000100025565,0.000083738756,0.0012785568,0.00019971478,0.000031631906,0.00023711969,0.0012861107,0.049974605,0.009682088,0.89495087,0.0013734858,0.040801987],"study_design_scores_gemma":[0.00026978942,0.00025953367,0.00056875206,0.00036636132,0.00010624871,0.00035036623,0.00041693772,0.4310876,0.07246039,0.4288979,0.06508191,0.00013417001],"about_ca_topic_score_codex":0.0029931732,"about_ca_topic_score_gemma":0.0019498736,"teacher_disagreement_score":0.015471941,"about_ca_system_score_codex":0.0015645988,"about_ca_system_score_gemma":0.0034581167,"threshold_uncertainty_score":0.08182442},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.090769336,0.0009351201,0.89994717,0.0007278432,0.00005914448,0.00027021993,0.00025978667,0.0003641332,0.006667257],"genre_scores_gemma":[0.94904995,0.0004521443,0.049046256,0.00016688014,0.000033701184,0.00025063148,0.00014520551,0.00009998414,0.0007552171],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99131143,0.004844652,0.0003223998,0.00082716957,0.0020135755,0.00068088825],"domain_scores_gemma":[0.92635113,0.06762443,0.0026860347,0.0013185522,0.001511187,0.000508722],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011344529,0.0020877686,0.0017338499,0.0024990658,0.0009181166,0.0021833717,0.0014567073,0.0017417563,0.0023619102],"category_scores_gemma":[0.06530631,0.0011806001,0.0018994757,0.0011092472,0.0026544337,0.003232741,0.0025255664,0.0026941756,0.00015201287],"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.00011345449,0.000029780209,0.00084829156,0.00010815676,0.000079711695,0.00010484552,0.00009178287,0.9712695,0.00081928034,0.021182904,0.00019626111,0.005156039],"study_design_scores_gemma":[0.000008818426,0.000047165886,0.00025119193,0.000030199268,0.000018994017,0.00003531521,0.00003486013,0.9698112,0.0007304701,0.028799552,0.00021635249,0.000015810032],"about_ca_topic_score_codex":0.0040272074,"about_ca_topic_score_gemma":0.0015080299,"teacher_disagreement_score":0.011344529,"about_ca_system_score_codex":0.0038810095,"about_ca_system_score_gemma":0.001611237,"threshold_uncertainty_score":0.059996307},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011478801,0.000022140086,0.9973066,0.00011635588,0.000040676092,0.00006939901,0.000019761068,0.0006591714,0.0006180655],"genre_scores_gemma":[0.060177315,0.00013247995,0.9369096,0.00023871262,0.00007355366,0.00033381663,0.00012843507,0.00024376041,0.0017622308],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99723274,0.00075429206,0.00026428179,0.0005687874,0.0010025541,0.00017745273],"domain_scores_gemma":[0.99563074,0.0016537672,0.00023614978,0.0014064134,0.00088369346,0.00018928357],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035292797,0.00093260885,0.00086483563,0.0010452081,0.0008853965,0.0028764997,0.004263683,0.0020376,0.0032602004],"category_scores_gemma":[0.0062474436,0.0010098553,0.0019653786,0.00081428513,0.0026132166,0.0031496272,0.0027387855,0.0066944747,0.00083026895],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018629093,0.0004794192,0.0020228971,0.00052269106,0.00025785147,0.0006730077,0.0007944873,0.2049686,0.051800597,0.6032636,0.004309069,0.13072152],"study_design_scores_gemma":[0.00015818451,0.00032922515,0.00023302918,0.00012103677,0.0002166039,0.00032348948,0.000071481394,0.78047425,0.052115273,0.13254714,0.033337068,0.00007323727],"about_ca_topic_score_codex":0.0020707843,"about_ca_topic_score_gemma":0.0034109289,"teacher_disagreement_score":0.004263683,"about_ca_system_score_codex":0.0016176938,"about_ca_system_score_gemma":0.0039020905,"threshold_uncertainty_score":0.018664837},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016181553,0.00006488879,0.99619067,0.00005715122,0.000030095329,0.00010185062,0.00005137734,0.0009942007,0.0008915103],"genre_scores_gemma":[0.100530416,0.0002350141,0.8954949,0.00014901423,0.00007392416,0.00042850745,0.000416145,0.00030765537,0.002364548],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976907,0.0003695895,0.00020574071,0.00040155617,0.0011793413,0.00015305048],"domain_scores_gemma":[0.997883,0.0010401183,0.00013002488,0.00047532856,0.0004387955,0.00003263759],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017585292,0.0009925308,0.0007159877,0.0012217701,0.0008278622,0.001075023,0.0013898542,0.0009591258,0.0054125544],"category_scores_gemma":[0.004809942,0.0006351041,0.0019742327,0.0008659706,0.0009638967,0.0022824665,0.0012471629,0.0019371316,0.0010534253],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031538424,0.00024279092,0.00069691346,0.00085528044,0.00016248623,0.00079741055,0.0003915606,0.08360693,0.087760665,0.28768754,0.007916417,0.52956665],"study_design_scores_gemma":[0.0002802255,0.00021676195,0.00032604433,0.00012775084,0.00015593568,0.0010731114,0.00004602413,0.7232725,0.070029885,0.15737037,0.047027703,0.000073701594],"about_ca_topic_score_codex":0.0012592336,"about_ca_topic_score_gemma":0.0015816228,"teacher_disagreement_score":0.0054125544,"about_ca_system_score_codex":0.0011198022,"about_ca_system_score_gemma":0.001654532,"threshold_uncertainty_score":0.018106759},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01498021,0.00014940831,0.97652096,0.00022669304,0.00006497095,0.00014326998,0.00012397268,0.0014342582,0.006356321],"genre_scores_gemma":[0.50471866,0.0006794494,0.48191532,0.00031525965,0.0000829085,0.00073550537,0.00097632944,0.0009037135,0.009672817],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984792,0.00040763957,0.00006561863,0.0002642351,0.00061626744,0.00016706521],"domain_scores_gemma":[0.9985819,0.00064409646,0.00008391156,0.00047557414,0.00019324274,0.0000212788],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008588752,0.00075096387,0.0007906201,0.001141601,0.0007024277,0.0007420534,0.0010891872,0.00065191096,0.0036858737],"category_scores_gemma":[0.0032505859,0.00061445695,0.0022514057,0.00086661126,0.0015570439,0.0017660065,0.0018501398,0.0014834363,0.000881384],"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.0002504487,0.00020870118,0.0015168363,0.0004119869,0.00017059267,0.00081964955,0.0004926351,0.23365504,0.04284222,0.54205537,0.0071546314,0.17042173],"study_design_scores_gemma":[0.00007199248,0.000099027246,0.00033521416,0.000038123428,0.00011875825,0.00030712143,0.000047081267,0.6104938,0.04152606,0.32820535,0.018707175,0.000050359075],"about_ca_topic_score_codex":0.001975573,"about_ca_topic_score_gemma":0.0017567889,"teacher_disagreement_score":0.0036858737,"about_ca_system_score_codex":0.0007772749,"about_ca_system_score_gemma":0.0013326196,"threshold_uncertainty_score":0.012330413},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03061905,0.00021656821,0.9579888,0.00035645958,0.00007631912,0.0001377303,0.00019956184,0.00055031,0.009855207],"genre_scores_gemma":[0.75987124,0.0005379377,0.22447063,0.00042459354,0.00013335695,0.0010743145,0.0008176789,0.0005058799,0.012164356],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99386805,0.0023990918,0.0004096803,0.0011175438,0.0013985094,0.0008071667],"domain_scores_gemma":[0.9836573,0.011823417,0.0011147034,0.0014629265,0.001356189,0.0005854107],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0045408276,0.0012665294,0.0015051994,0.001890072,0.0023054257,0.0037547182,0.0025244865,0.0021251927,0.0068764696],"category_scores_gemma":[0.019815084,0.0010377443,0.002436092,0.0016107736,0.004253785,0.0067286594,0.004241829,0.004198548,0.0011773283],"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.000103172664,0.00004304783,0.00012793035,0.00006154831,0.000023913703,0.000050741313,0.00021961083,0.021156492,0.00076994917,0.971307,0.00034266643,0.005793987],"study_design_scores_gemma":[0.00003340397,0.000021244197,0.000039319388,0.000023100087,0.000018134198,0.00001635288,0.000025703053,0.07419014,0.00097097264,0.9236257,0.001019965,0.000015864698],"about_ca_topic_score_codex":0.0045527024,"about_ca_topic_score_gemma":0.004086094,"teacher_disagreement_score":0.0068764696,"about_ca_system_score_codex":0.0042924085,"about_ca_system_score_gemma":0.0029110224,"threshold_uncertainty_score":0.031143785},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041867223,0.0007565185,0.94027746,0.002352326,0.000076216085,0.00024030246,0.0003304723,0.0032534185,0.010846192],"genre_scores_gemma":[0.66296566,0.0008502139,0.3295902,0.001190078,0.00028492085,0.00034873397,0.0009333211,0.00043559066,0.0034013113],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99154246,0.0018953049,0.00064503046,0.0016427796,0.0036703306,0.00060402503],"domain_scores_gemma":[0.97999805,0.013868509,0.001454474,0.0026529492,0.0016302377,0.0003956754],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0064924485,0.00083732326,0.001214874,0.0022891762,0.0016043978,0.0039148736,0.0022625378,0.001567117,0.003407867],"category_scores_gemma":[0.026581423,0.00090510154,0.0028816632,0.0022105195,0.005675228,0.0071893483,0.0040380256,0.007060933,0.0004777341],"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.00024028013,0.00009103791,0.0015343395,0.00039364534,0.00011519691,0.0004386149,0.00087855716,0.04344482,0.009325893,0.9018469,0.0024034653,0.03928721],"study_design_scores_gemma":[0.00003017305,0.000028445833,0.00018927759,0.000036805533,0.000034460907,0.00011610166,0.00006429678,0.13050264,0.0033869373,0.8633698,0.0022135908,0.000027547176],"about_ca_topic_score_codex":0.0044460385,"about_ca_topic_score_gemma":0.0027706062,"teacher_disagreement_score":0.0064924485,"about_ca_system_score_codex":0.0048979237,"about_ca_system_score_gemma":0.0018644016,"threshold_uncertainty_score":0.035537064},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010149452,0.00019964033,0.98495126,0.0007911493,0.000034257646,0.00007821533,0.000053343305,0.00040900102,0.0033336882],"genre_scores_gemma":[0.27683723,0.00094895024,0.7133457,0.00041569155,0.00013731094,0.0007394049,0.00017426745,0.00060920906,0.006792194],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9851291,0.006842364,0.0014453754,0.0017703064,0.003946889,0.0008658542],"domain_scores_gemma":[0.9585186,0.027545102,0.0029221985,0.007871049,0.0022800933,0.0008628439],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.021381525,0.0012957366,0.0010858129,0.0023137466,0.0025736452,0.004248327,0.0024183574,0.0026891334,0.00335079],"category_scores_gemma":[0.03730133,0.0015290865,0.002292712,0.0013984079,0.014279337,0.016700663,0.004986945,0.004501821,0.0009319675],"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.000028464952,0.00001603365,0.00033628824,0.00010157622,0.000017388202,0.00018451105,0.0014188839,0.0055521047,0.0015972708,0.9804788,0.00053777057,0.009730763],"study_design_scores_gemma":[0.000035643963,0.0000608825,0.00012416359,0.00011417832,0.00003991569,0.00026523313,0.00035957282,0.031025013,0.0040346016,0.94636685,0.017523281,0.00005066526],"about_ca_topic_score_codex":0.0012052492,"about_ca_topic_score_gemma":0.00091076776,"teacher_disagreement_score":0.021381525,"about_ca_system_score_codex":0.002054946,"about_ca_system_score_gemma":0.0025501712,"threshold_uncertainty_score":0.1130777},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022322506,0.0040867575,0.8895809,0.0056397067,0.00075258466,0.00022842587,0.00068977784,0.0012145324,0.07548491],"genre_scores_gemma":[0.62525487,0.004831751,0.32933038,0.0033279948,0.001520019,0.001094739,0.0022928882,0.000812242,0.031535156],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9964317,0.0008355918,0.00043530142,0.0009272872,0.0009550297,0.00041502403],"domain_scores_gemma":[0.9890953,0.007578157,0.000984083,0.0010403206,0.0010343404,0.00026785224],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029246788,0.0011999838,0.0007057475,0.0017469982,0.001693272,0.004816328,0.0014484974,0.001925916,0.010203553],"category_scores_gemma":[0.010932949,0.0009595736,0.0018315841,0.0018477655,0.0070719398,0.011729319,0.002946785,0.0048738145,0.002233899],"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.000034044835,0.000025230942,0.00021232516,0.00012922128,0.000012551814,0.00029341082,0.00052368245,0.0025434762,0.0008364034,0.98666686,0.0012817088,0.0074410033],"study_design_scores_gemma":[0.000023942433,0.00001990778,0.00010718012,0.000057780977,0.000018860355,0.0001613028,0.0000995559,0.006748043,0.0021290793,0.96272033,0.027898727,0.000015281537],"about_ca_topic_score_codex":0.0022135675,"about_ca_topic_score_gemma":0.0014959702,"teacher_disagreement_score":0.010203553,"about_ca_system_score_codex":0.0024442377,"about_ca_system_score_gemma":0.001104595,"threshold_uncertainty_score":0.03413427},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0051580505,0.00056985806,0.9885063,0.0009267837,0.000058095204,0.00010362479,0.00011548302,0.0004952652,0.004066571],"genre_scores_gemma":[0.3016674,0.0019917577,0.6922273,0.0005815808,0.00019839648,0.0003501711,0.00060601614,0.00014428601,0.0022331222],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99565816,0.0018813581,0.0003609893,0.00052680704,0.0013368974,0.00023576271],"domain_scores_gemma":[0.99226016,0.0059962813,0.00046227025,0.0005799667,0.00062088267,0.000080448284],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033548018,0.0011104409,0.00072962814,0.002850876,0.0008251498,0.002124116,0.0017309305,0.00156217,0.0041399263],"category_scores_gemma":[0.017459255,0.0006711601,0.001574062,0.0018713091,0.0026629586,0.004030083,0.0019313801,0.0019354086,0.0006340004],"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.00020661195,0.000115514355,0.00184456,0.0010240708,0.0001775723,0.0008491731,0.00053706055,0.17534521,0.010139442,0.5730529,0.005167938,0.23154],"study_design_scores_gemma":[0.00008183946,0.000058177106,0.00016609902,0.00016191439,0.000083248044,0.00026951512,0.00008385568,0.39812464,0.0066352836,0.5869075,0.007395039,0.000032851607],"about_ca_topic_score_codex":0.002577939,"about_ca_topic_score_gemma":0.0031023677,"teacher_disagreement_score":0.0041399263,"about_ca_system_score_codex":0.0018022981,"about_ca_system_score_gemma":0.0018092868,"threshold_uncertainty_score":0.017742097},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009413845,0.00072660035,0.9720091,0.0006103965,0.00022814813,0.00021496009,0.00021331535,0.007839703,0.00874389],"genre_scores_gemma":[0.29117104,0.0012256365,0.6971965,0.00057649455,0.00029302802,0.00043269905,0.0005807441,0.0017981789,0.0067257434],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9874879,0.0043240483,0.0007460381,0.0011268847,0.005600584,0.0007145674],"domain_scores_gemma":[0.97058636,0.016061177,0.0019424863,0.007554112,0.003433738,0.0004221445],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0113621745,0.00092317624,0.000796468,0.0024500848,0.0008750123,0.0036561517,0.0018762596,0.0011851585,0.0075766174],"category_scores_gemma":[0.040901527,0.0012042628,0.001138899,0.001138918,0.003426149,0.005291163,0.0031381457,0.00283653,0.0025735619],"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.0004884493,0.00014671405,0.0032598134,0.0008575111,0.00011862064,0.0007432672,0.0011262482,0.019763766,0.02564509,0.66790086,0.009499159,0.2704504],"study_design_scores_gemma":[0.0004088683,0.00071748835,0.0013022266,0.00086150586,0.00031700317,0.0013042387,0.000283059,0.16924258,0.102955945,0.51221824,0.21021436,0.00017445728],"about_ca_topic_score_codex":0.00070862996,"about_ca_topic_score_gemma":0.0009860425,"teacher_disagreement_score":0.0113621745,"about_ca_system_score_codex":0.00079690496,"about_ca_system_score_gemma":0.0017491699,"threshold_uncertainty_score":0.060089648},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01830942,0.010441279,0.91529375,0.021566037,0.00053942174,0.00011208209,0.00005410021,0.00051822996,0.03316565],"genre_scores_gemma":[0.74461675,0.0077610705,0.23724966,0.0018597752,0.0007675169,0.00027597533,0.00008484622,0.00024465032,0.0071398476],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98736364,0.006193343,0.00095735653,0.0010460276,0.0037303402,0.0007092497],"domain_scores_gemma":[0.96971357,0.022588506,0.0012338174,0.0037535492,0.0022269126,0.00048365042],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.015861759,0.00045929127,0.0008179765,0.0009827539,0.0024528669,0.0062835836,0.0027925225,0.004711464,0.0026524654],"category_scores_gemma":[0.030774614,0.00078931375,0.0013390911,0.0009126333,0.013908016,0.012122373,0.0040615434,0.004502454,0.00059511117],"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.000016243688,0.000014205366,0.00034041837,0.00013598378,0.000009425392,0.00011355393,0.00063173624,0.007999001,0.0006891365,0.9599929,0.0010345569,0.029022949],"study_design_scores_gemma":[0.000010104446,0.000032096432,0.00014135003,0.00011197415,0.0000054276798,0.00019750942,0.0002697999,0.018377334,0.001007975,0.9610469,0.018778311,0.000021304933],"about_ca_topic_score_codex":0.0034228375,"about_ca_topic_score_gemma":0.002022062,"teacher_disagreement_score":0.015861759,"about_ca_system_score_codex":0.002125668,"about_ca_system_score_gemma":0.0028586497,"threshold_uncertainty_score":0.08388603},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03694625,0.00009577357,0.9611076,0.00009041495,0.000019189672,0.00004125322,0.000049042425,0.0005606734,0.0010897876],"genre_scores_gemma":[0.7940568,0.00024996075,0.2045178,0.00007707682,0.00003407777,0.000106577616,0.00020453898,0.00010514746,0.0006480348],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974253,0.00056983286,0.00018634673,0.00031462527,0.0013472947,0.0001566011],"domain_scores_gemma":[0.994292,0.00360058,0.00061778823,0.0010158881,0.00042764307,0.000046130335],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024391771,0.00081483787,0.00061397906,0.00086468074,0.00034435335,0.0013003944,0.0012284892,0.00074095884,0.0012047602],"category_scores_gemma":[0.010523028,0.00031441098,0.00088287215,0.0006819174,0.0019310721,0.0047022803,0.0013446131,0.0012026173,0.00022121824],"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.00043651563,0.000087628396,0.0016860792,0.00029962952,0.000072596216,0.00031061782,0.00024281522,0.50982636,0.05250936,0.3589333,0.00040130512,0.075193815],"study_design_scores_gemma":[0.00003606748,0.00015366728,0.00010626005,0.000024699806,0.000033592663,0.00010811174,0.000020057183,0.8750499,0.047617175,0.07512937,0.0017034881,0.000017683258],"about_ca_topic_score_codex":0.00089459814,"about_ca_topic_score_gemma":0.00074003474,"teacher_disagreement_score":0.0024391771,"about_ca_system_score_codex":0.00091134285,"about_ca_system_score_gemma":0.00093192945,"threshold_uncertainty_score":0.012899697},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0145087205,0.00009718341,0.97875804,0.00018715521,0.00017062825,0.0000900179,0.00013050147,0.002215416,0.0038424614],"genre_scores_gemma":[0.6086776,0.00034991445,0.38621435,0.00024835757,0.0001295274,0.0002664574,0.00080326316,0.00078247726,0.0025280549],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98317343,0.005004896,0.0012797116,0.0017459485,0.007755432,0.0010405153],"domain_scores_gemma":[0.98646694,0.008255135,0.0008009641,0.0023871108,0.0018918661,0.00019798895],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007204854,0.0006384109,0.0008371383,0.0014347873,0.00086753984,0.0019245818,0.0022049495,0.001077264,0.0034559283],"category_scores_gemma":[0.028681885,0.00069600873,0.0021905515,0.0009254391,0.002790047,0.005578965,0.003893589,0.0030100842,0.0005833004],"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.00021402033,0.00015733323,0.0010111528,0.00027419496,0.000104711915,0.00066368695,0.00055575016,0.09284656,0.0111195585,0.80563843,0.0018730821,0.0855415],"study_design_scores_gemma":[0.00013199316,0.00011260349,0.00023024979,0.000091899994,0.000074094365,0.00019163416,0.00009822584,0.37257683,0.030076917,0.5794481,0.01692824,0.000039108225],"about_ca_topic_score_codex":0.0022919222,"about_ca_topic_score_gemma":0.0017389702,"teacher_disagreement_score":0.007204854,"about_ca_system_score_codex":0.0015538527,"about_ca_system_score_gemma":0.0024296078,"threshold_uncertainty_score":0.0381034},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027418602,0.010815989,0.9747243,0.0019022383,0.00037398396,0.000115575305,0.00010952326,0.0006248812,0.008591645],"genre_scores_gemma":[0.15900461,0.02328525,0.8056469,0.0014134931,0.0026501238,0.0008574834,0.00053598004,0.00040118708,0.006205038],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99461174,0.0013054156,0.00047567114,0.0008731981,0.002455728,0.00027826047],"domain_scores_gemma":[0.9925964,0.0049943347,0.00044943354,0.0011421035,0.00068096025,0.00013674267],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0063134637,0.0010747322,0.0009963068,0.0024279682,0.0013240977,0.004085015,0.0026619025,0.002431424,0.002901011],"category_scores_gemma":[0.012044107,0.0009835173,0.001734085,0.0018229723,0.010285418,0.008932174,0.002818915,0.0043386603,0.0018011747],"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.000020161267,0.000042838197,0.00017436006,0.0005478402,0.000019331554,0.00007487477,0.00037436778,0.004781819,0.0026270312,0.93604285,0.00220029,0.053094268],"study_design_scores_gemma":[0.000023936893,0.00003053263,0.00010365081,0.00026031135,0.000013038401,0.00019067866,0.000049127873,0.01042644,0.0024174014,0.9427342,0.04372203,0.000028551613],"about_ca_topic_score_codex":0.0010776073,"about_ca_topic_score_gemma":0.00043260196,"teacher_disagreement_score":0.0063134637,"about_ca_system_score_codex":0.0019835162,"about_ca_system_score_gemma":0.003044377,"threshold_uncertainty_score":0.03338915},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0068151527,0.000060811068,0.99077433,0.00009334253,0.000025622678,0.00004703491,0.000030471849,0.001155882,0.0009972783],"genre_scores_gemma":[0.23976515,0.00022484698,0.75771576,0.00012516277,0.000026301377,0.00019296058,0.0002667748,0.0003043755,0.001378749],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99437135,0.0019999724,0.0003952871,0.0006262393,0.002319324,0.0002878214],"domain_scores_gemma":[0.99389654,0.0034189653,0.0003504195,0.0013674088,0.0008570321,0.000109619046],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005557509,0.00069469895,0.0007390336,0.0012927928,0.00051174546,0.0020836042,0.0017153625,0.0008138693,0.0029393965],"category_scores_gemma":[0.010750172,0.0008236364,0.0020096132,0.0010289433,0.0022199801,0.004042226,0.00425199,0.0031757003,0.0005955112],"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.00033791995,0.00032351678,0.0025180269,0.00065403746,0.00024803283,0.0006682656,0.001053551,0.3299194,0.039931785,0.5005413,0.0015226635,0.122281484],"study_design_scores_gemma":[0.00008092013,0.000077443,0.00014968983,0.00008774546,0.00007876058,0.00008130691,0.00007029832,0.79640836,0.024241993,0.17106678,0.0076395203,0.00001713366],"about_ca_topic_score_codex":0.0018547059,"about_ca_topic_score_gemma":0.001871448,"teacher_disagreement_score":0.005557509,"about_ca_system_score_codex":0.0012288697,"about_ca_system_score_gemma":0.0021750643,"threshold_uncertainty_score":0.029391289},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08451423,0.00028962773,0.9022653,0.00028170025,0.000054491004,0.00026622813,0.0002497888,0.00208601,0.009992691],"genre_scores_gemma":[0.78248715,0.00038201417,0.21108428,0.00007204388,0.00003353177,0.00041311374,0.00022913277,0.0001341262,0.0051647],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988746,0.00030847648,0.000074054966,0.00012724036,0.00051356026,0.000101972815],"domain_scores_gemma":[0.99903405,0.00042429852,0.00017052957,0.00021028874,0.00013860849,0.000022233837],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011565953,0.00048470814,0.00029544908,0.00040725115,0.0004833298,0.0010320948,0.0011328663,0.0007564826,0.002582584],"category_scores_gemma":[0.0021286407,0.00041836794,0.0007988464,0.0002083091,0.0009616379,0.0012859367,0.0005886918,0.0008359565,0.00041597945],"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.0002144273,0.000091865804,0.0012949171,0.0002548727,0.00005942592,0.0005379496,0.00031460455,0.6964711,0.04729864,0.23363224,0.00074191357,0.019088047],"study_design_scores_gemma":[0.000046787573,0.00008604993,0.00020544854,0.000024277611,0.000029776858,0.00008632398,0.000021502454,0.9625656,0.022204533,0.0087032225,0.006013284,0.000013262421],"about_ca_topic_score_codex":0.004312251,"about_ca_topic_score_gemma":0.0025878993,"teacher_disagreement_score":0.004312251,"about_ca_system_score_codex":0.00090979895,"about_ca_system_score_gemma":0.0018410551,"threshold_uncertainty_score":0.008639574},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028187234,0.00007516791,0.9589319,0.00008945398,0.000082591716,0.00016486639,0.00024627533,0.007231666,0.0049908394],"genre_scores_gemma":[0.51761305,0.00011190691,0.4762763,0.00012958175,0.000033827673,0.00038591228,0.00074300746,0.000813948,0.003892403],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99858403,0.0003213707,0.00017059049,0.00022646926,0.000575147,0.00012230215],"domain_scores_gemma":[0.996443,0.0015961295,0.00026589146,0.00081901427,0.0008061152,0.00006997865],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011475917,0.00054092676,0.00041267634,0.00079502387,0.0004708291,0.0010442551,0.0008995703,0.000457571,0.0035853325],"category_scores_gemma":[0.00427346,0.00045379717,0.0008514694,0.00030722917,0.00089069887,0.0011812528,0.0008135181,0.0008462645,0.0011742449],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00065063604,0.00033567642,0.0029052866,0.0008812744,0.00015989084,0.00125305,0.00078687444,0.24137636,0.25497192,0.2433281,0.008455951,0.24489507],"study_design_scores_gemma":[0.00010015963,0.00017436894,0.0002736724,0.00006066623,0.00008985293,0.00018576333,0.000046089055,0.77187455,0.1838554,0.03144341,0.0118588405,0.000037268637],"about_ca_topic_score_codex":0.0011498694,"about_ca_topic_score_gemma":0.0021038884,"teacher_disagreement_score":0.0035853325,"about_ca_system_score_codex":0.00060427125,"about_ca_system_score_gemma":0.0014670962,"threshold_uncertainty_score":0.011994123},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024143973,0.00016003948,0.97059894,0.00028340972,0.000024335188,0.00011083275,0.000105537096,0.0010115033,0.0035614376],"genre_scores_gemma":[0.20236914,0.0002493993,0.79282343,0.00019035245,0.000027147724,0.000308596,0.0006208054,0.00027123903,0.003139841],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998973,0.00045754743,0.0000495071,0.00017213226,0.00022172123,0.00012602934],"domain_scores_gemma":[0.9979037,0.0012246368,0.0001784008,0.00032756993,0.0002577219,0.000108004926],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013758464,0.0008187578,0.0007932074,0.00097220065,0.00055057695,0.0012372661,0.0013607129,0.0009378202,0.0038079654],"category_scores_gemma":[0.0033958522,0.00069856946,0.001063487,0.0013011012,0.0009289228,0.0028602444,0.0020026737,0.0018303981,0.0007590269],"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.0003625393,0.00036566035,0.0020296485,0.0003632664,0.00011701186,0.0002795604,0.0004408706,0.6200188,0.023136849,0.09144805,0.0077810157,0.25365672],"study_design_scores_gemma":[0.000053730677,0.00002936994,0.00012696775,0.000015401954,0.000017813973,0.000037254093,0.0000666642,0.9539632,0.0060286224,0.03599068,0.003660379,0.00000999706],"about_ca_topic_score_codex":0.0031798375,"about_ca_topic_score_gemma":0.0075559104,"teacher_disagreement_score":0.0038079654,"about_ca_system_score_codex":0.0011151088,"about_ca_system_score_gemma":0.0019744234,"threshold_uncertainty_score":0.0127388835},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12821658,0.000745316,0.86675346,0.00059247995,0.000047218353,0.00014614812,0.00012087437,0.0008034277,0.0025744895],"genre_scores_gemma":[0.91854453,0.0002169444,0.080059126,0.000094014584,0.000036077767,0.00017883249,0.00012362417,0.00012619751,0.0006206694],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9841883,0.0065500946,0.0007287203,0.002284854,0.0046619265,0.0015861029],"domain_scores_gemma":[0.94466096,0.042249914,0.003911789,0.0057345503,0.0019566743,0.0014861027],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01183935,0.0019466034,0.002919891,0.0017522575,0.00096041185,0.0028821153,0.003105961,0.0019324806,0.0018197837],"category_scores_gemma":[0.07513663,0.00093343924,0.0009016598,0.0016436505,0.0033518139,0.0075244913,0.005848832,0.0028018528,0.00035419755],"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.00072724797,0.00015970475,0.002907461,0.00016826732,0.000081859565,0.000106585554,0.00021495647,0.8921471,0.0035923617,0.050810844,0.0005701962,0.048513357],"study_design_scores_gemma":[0.000017975179,0.00018141637,0.00027515562,0.00001334587,0.000012529839,0.000049457747,0.00003367647,0.9629909,0.001479155,0.0346999,0.0002361708,0.0000102746135],"about_ca_topic_score_codex":0.0015171595,"about_ca_topic_score_gemma":0.00086718326,"teacher_disagreement_score":0.01183935,"about_ca_system_score_codex":0.0040469356,"about_ca_system_score_gemma":0.0024995736,"threshold_uncertainty_score":0.06261319},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00044651897,0.000038646293,0.9980514,0.000082593135,0.000016081498,0.00015090272,0.00003541104,0.0003061951,0.00087225426],"genre_scores_gemma":[0.017128078,0.00015827366,0.98029035,0.000103469785,0.000021058522,0.0005471621,0.00013493447,0.0001457468,0.0014709599],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99233705,0.0022602363,0.0011011054,0.0011374307,0.0026817496,0.00048242224],"domain_scores_gemma":[0.9905936,0.004540032,0.00076248666,0.0022844656,0.0015943883,0.00022495897],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007587697,0.0019142157,0.00097427866,0.0027790929,0.002151597,0.0048852987,0.005534469,0.002227015,0.0059695626],"category_scores_gemma":[0.014649689,0.002126543,0.004837555,0.0019143624,0.00621322,0.007581614,0.0046308497,0.006107673,0.00251504],"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.000040606694,0.000098326935,0.000222706,0.00044399317,0.000056179193,0.00030799443,0.0007962955,0.034378376,0.004971217,0.91022253,0.0019758556,0.04648602],"study_design_scores_gemma":[0.00016654818,0.00019662612,0.00013020371,0.00043784254,0.00013554018,0.0005319873,0.00024784208,0.19391064,0.028126407,0.68877614,0.08720827,0.00013197103],"about_ca_topic_score_codex":0.003264874,"about_ca_topic_score_gemma":0.0024191455,"teacher_disagreement_score":0.007587697,"about_ca_system_score_codex":0.0032471702,"about_ca_system_score_gemma":0.005769722,"threshold_uncertainty_score":0.040128052},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0031464198,0.000053772197,0.9939989,0.000090816386,0.000017324628,0.000053264466,0.000026607595,0.0004974627,0.0021154224],"genre_scores_gemma":[0.24997339,0.00025965757,0.7460879,0.0002254417,0.000058386442,0.0005184098,0.00019201444,0.0003971647,0.002287614],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9965766,0.0014372024,0.00019507515,0.00051251706,0.0010226619,0.00025588452],"domain_scores_gemma":[0.9961434,0.0024321459,0.00019688811,0.00093561056,0.00024048056,0.00005146165],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033384569,0.00075195136,0.0006202621,0.0007729867,0.0008452455,0.0016003882,0.0011861078,0.0009794668,0.004239012],"category_scores_gemma":[0.008112828,0.0007325396,0.0018328251,0.0004660706,0.0027993785,0.0028724775,0.002543429,0.002216003,0.00091529323],"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.00010134112,0.00006443144,0.00040432237,0.00029972452,0.000053441527,0.00033457816,0.00043243534,0.14993596,0.016739918,0.78293854,0.0010041731,0.047691155],"study_design_scores_gemma":[0.000053365147,0.00006799999,0.000058492893,0.00007363288,0.000039098257,0.000113536524,0.00005926032,0.3554369,0.01792778,0.6156402,0.010503769,0.000025848063],"about_ca_topic_score_codex":0.0011977119,"about_ca_topic_score_gemma":0.0016953124,"teacher_disagreement_score":0.004239012,"about_ca_system_score_codex":0.0012578275,"about_ca_system_score_gemma":0.0017393974,"threshold_uncertainty_score":0.01765567},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016161313,0.000037681486,0.97907215,0.000086878725,0.00001428919,0.000043829503,0.000060898437,0.00359172,0.0009312389],"genre_scores_gemma":[0.53193176,0.00009383051,0.4656109,0.00011009231,0.000026920374,0.00021898211,0.00030305763,0.00054770143,0.001156665],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99301845,0.0035336015,0.00047535906,0.0004944286,0.0021275834,0.00035048323],"domain_scores_gemma":[0.9841248,0.009795627,0.0008864414,0.0041480814,0.0009512641,0.00009374887],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037326245,0.00057717535,0.00065223005,0.0010733942,0.00048367685,0.0014271506,0.0013014568,0.000951338,0.0033471545],"category_scores_gemma":[0.017338116,0.0005132995,0.0012387783,0.0006279264,0.0014430817,0.0023939083,0.0020829064,0.0010878713,0.0009021586],"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.00060713326,0.00021108799,0.003049273,0.0006161877,0.00014692605,0.00057615334,0.0005179677,0.5351943,0.06715058,0.16266733,0.0025408573,0.22672223],"study_design_scores_gemma":[0.000055982633,0.00007556167,0.00010898224,0.000023319013,0.000022374064,0.000071696086,0.000017440832,0.94764566,0.018659197,0.03160178,0.0017065445,0.000011437715],"about_ca_topic_score_codex":0.0012298134,"about_ca_topic_score_gemma":0.0013339752,"teacher_disagreement_score":0.0037326245,"about_ca_system_score_codex":0.0007222807,"about_ca_system_score_gemma":0.0012807754,"threshold_uncertainty_score":0.019740224},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0033785596,0.00027096068,0.9933536,0.00016540432,0.000024373232,0.00007319724,0.000040514788,0.00017885052,0.0025146096],"genre_scores_gemma":[0.24459451,0.0006273009,0.7490056,0.00015403252,0.000078743724,0.0007512002,0.00020890865,0.0002435816,0.004336073],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99583983,0.0016983908,0.00026453478,0.00051366864,0.0014093259,0.0002742813],"domain_scores_gemma":[0.9833655,0.014173641,0.0005304795,0.0010139283,0.0007621142,0.00015436992],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0058353255,0.0011663747,0.0008938765,0.0010259765,0.0006505648,0.0017894275,0.0019366835,0.0013214112,0.0060425713],"category_scores_gemma":[0.022436043,0.0008546554,0.0016692509,0.0008814869,0.0029512935,0.0027600704,0.0031074495,0.002591587,0.0005352688],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009347699,0.00004999752,0.00054383837,0.0005695281,0.00011513646,0.00008493565,0.00028659336,0.28933996,0.0015614061,0.6318665,0.0013836174,0.074104935],"study_design_scores_gemma":[0.00005162791,0.000034394357,0.0000708965,0.00008107406,0.000021545804,0.000035500132,0.000026295404,0.6306882,0.0015653777,0.36228377,0.0051295515,0.000011810564],"about_ca_topic_score_codex":0.0019054778,"about_ca_topic_score_gemma":0.0018502981,"teacher_disagreement_score":0.0060425713,"about_ca_system_score_codex":0.00185699,"about_ca_system_score_gemma":0.0019849988,"threshold_uncertainty_score":0.030860543},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012402048,0.00003865972,0.9926609,0.00009273782,0.000020551279,0.00011173628,0.00004526612,0.005405837,0.0003840799],"genre_scores_gemma":[0.046525918,0.00007350261,0.95157206,0.00007637007,0.000040349652,0.0001744506,0.00016156492,0.00039719828,0.0009785582],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9919423,0.0020616623,0.00064882863,0.0013157933,0.0035254122,0.00050596474],"domain_scores_gemma":[0.98798275,0.0046837777,0.0013520106,0.0036298982,0.0020710742,0.00028047417],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009199573,0.0014606126,0.0013001994,0.003619143,0.001674129,0.0034216307,0.0043069967,0.002199234,0.0046210727],"category_scores_gemma":[0.01795694,0.0012684803,0.0026890005,0.0010603297,0.004444291,0.0038770903,0.0037512735,0.0031873598,0.0020753755],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003385792,0.0005055951,0.0029391157,0.00060209195,0.00016544673,0.001896478,0.0015818323,0.13681898,0.05270546,0.4160168,0.008971195,0.37745848],"study_design_scores_gemma":[0.00014478879,0.00022984424,0.0003411124,0.0001493561,0.000106116386,0.0007863844,0.00010133986,0.819385,0.051099632,0.096567996,0.030971147,0.00011727891],"about_ca_topic_score_codex":0.0035810613,"about_ca_topic_score_gemma":0.003603298,"teacher_disagreement_score":0.009199573,"about_ca_system_score_codex":0.0015787678,"about_ca_system_score_gemma":0.0047794823,"threshold_uncertainty_score":0.04865259},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003979329,0.00032204314,0.9902091,0.0002094238,0.000067150635,0.00005700843,0.00010815164,0.00042612426,0.004621695],"genre_scores_gemma":[0.2050823,0.0017201898,0.7838047,0.00019247482,0.00012759803,0.0005030508,0.0009369401,0.0007025399,0.0069301412],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965419,0.001196582,0.00038118777,0.0005155564,0.0010755077,0.00028920107],"domain_scores_gemma":[0.9960228,0.0022170036,0.00044581157,0.0005405176,0.0005560812,0.0002177585],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038597542,0.0011425263,0.0007691383,0.0021432054,0.0012839786,0.005902957,0.0017651897,0.0020992754,0.0037940878],"category_scores_gemma":[0.0090009235,0.0008498766,0.0018285305,0.0014503159,0.0041033477,0.008057417,0.0026543506,0.003921784,0.0014911615],"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.000031628875,0.000011936994,0.00009509268,0.000066974746,0.000009478733,0.00012199003,0.0005429502,0.0038341691,0.0017059165,0.98671824,0.00028075223,0.006580875],"study_design_scores_gemma":[0.000036594352,0.000045342487,0.00007295661,0.00011191583,0.000030108213,0.00014747707,0.0001918519,0.016202612,0.0051028654,0.9415178,0.036510233,0.000030321557],"about_ca_topic_score_codex":0.0017892137,"about_ca_topic_score_gemma":0.0011809821,"teacher_disagreement_score":0.005902957,"about_ca_system_score_codex":0.0016965541,"about_ca_system_score_gemma":0.0016824732,"threshold_uncertainty_score":0.020412624},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009319447,0.00059942977,0.98051906,0.0012064184,0.000080755795,0.00021585029,0.00012654801,0.00055544666,0.0073770615],"genre_scores_gemma":[0.16324319,0.0012889332,0.82805794,0.00076114177,0.00042887495,0.00072655565,0.0006649739,0.0005870334,0.0042414274],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.96687496,0.012946725,0.002789128,0.003539787,0.012399701,0.0014497513],"domain_scores_gemma":[0.854274,0.109604605,0.0031794927,0.019795869,0.0120999385,0.0010461503],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.036684036,0.0017022046,0.0021758077,0.0033474616,0.004019518,0.0048549357,0.003398327,0.0030563343,0.005026496],"category_scores_gemma":[0.09883411,0.0018456262,0.004858962,0.0016802097,0.011378603,0.018296639,0.008261238,0.00833887,0.0019021229],"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.00014424702,0.00013173933,0.0007115211,0.00048637434,0.00011689314,0.00020560081,0.0016597736,0.02445897,0.0023390763,0.91660595,0.0019061394,0.05123364],"study_design_scores_gemma":[0.00007173422,0.000051805728,0.00009832209,0.00012265707,0.00005442641,0.00009264516,0.000112648384,0.0681841,0.0039314833,0.9213177,0.0059257825,0.00003657984],"about_ca_topic_score_codex":0.0030836673,"about_ca_topic_score_gemma":0.0025981746,"teacher_disagreement_score":0.036684036,"about_ca_system_score_codex":0.0021742315,"about_ca_system_score_gemma":0.005206001,"threshold_uncertainty_score":0.19400603},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011986905,0.000058040943,0.9850189,0.000052947722,0.000013896654,0.000048515747,0.000021845373,0.0004887927,0.002310123],"genre_scores_gemma":[0.35275048,0.000148309,0.6438851,0.00008417535,0.000022440243,0.0001358022,0.00013204846,0.000097313525,0.0027444118],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990213,0.00018550582,0.00007373833,0.0001340897,0.00052663416,0.000058783102],"domain_scores_gemma":[0.9991211,0.00037364272,0.0000962731,0.00024909998,0.00014518725,0.000014648449],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008501277,0.0005090359,0.00043151877,0.0007436891,0.00036050222,0.00062683277,0.0007927404,0.00052207924,0.004519685],"category_scores_gemma":[0.0032755707,0.0003404493,0.00072061585,0.0006877735,0.00091025245,0.0014058368,0.00089200004,0.00084356783,0.0005776051],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003159468,0.000085015825,0.0009518474,0.00025566004,0.00004862546,0.00037993156,0.00026632042,0.3078719,0.048870068,0.15014803,0.0017582497,0.48904833],"study_design_scores_gemma":[0.00008379471,0.00025262023,0.00023774178,0.000042534397,0.000038999162,0.0004591884,0.00006804877,0.8419203,0.035699088,0.10758534,0.013588706,0.00002358319],"about_ca_topic_score_codex":0.0011054239,"about_ca_topic_score_gemma":0.0014660123,"teacher_disagreement_score":0.004519685,"about_ca_system_score_codex":0.00057896954,"about_ca_system_score_gemma":0.0007007051,"threshold_uncertainty_score":0.015119791},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008849894,0.00030620382,0.9887084,0.00035742292,0.000020651743,0.000020354522,0.000027270577,0.00009558318,0.0016143074],"genre_scores_gemma":[0.6094826,0.0012565489,0.3839885,0.00033644296,0.0001861324,0.00025529045,0.00018766025,0.00014751904,0.004159363],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965947,0.0014235242,0.00021631602,0.00046345705,0.0010693148,0.00023258924],"domain_scores_gemma":[0.9930743,0.0049347924,0.00060454174,0.00075516576,0.0004480135,0.00018322967],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033210795,0.0009880714,0.001320794,0.0013313537,0.0006574453,0.0028517328,0.0022550132,0.0014417589,0.0025228758],"category_scores_gemma":[0.013073823,0.0005324904,0.0020004306,0.0014315622,0.00381068,0.0061504813,0.0026962392,0.0026587078,0.0003296071],"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.00005289836,0.000030065416,0.0005353077,0.000122945,0.00004804555,0.00006769463,0.0001396283,0.23961344,0.0014175291,0.7435972,0.00027388326,0.014101329],"study_design_scores_gemma":[0.000008409095,0.000021023028,0.000072584284,0.000014819477,0.000010326558,0.000029955727,0.00001626003,0.4904248,0.0007217262,0.50769913,0.00097066007,0.00001040247],"about_ca_topic_score_codex":0.0027083587,"about_ca_topic_score_gemma":0.0015024843,"teacher_disagreement_score":0.0033210795,"about_ca_system_score_codex":0.002894669,"about_ca_system_score_gemma":0.0014150046,"threshold_uncertainty_score":0.021002412},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10902462,0.00014079218,0.8786671,0.0003703479,0.00007700692,0.0003226888,0.00072597957,0.004660939,0.006010503],"genre_scores_gemma":[0.78317165,0.00020809678,0.21109435,0.00017055427,0.00003277685,0.00053498143,0.0010186183,0.0005503023,0.0032187381],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99743855,0.00060961925,0.000119938726,0.00032175417,0.001153208,0.00035681218],"domain_scores_gemma":[0.99675316,0.001649401,0.00035432514,0.0005073335,0.00068217766,0.000053610474],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016924499,0.0008023771,0.0006466506,0.0008278188,0.00079660956,0.0016140867,0.0010096518,0.0010526954,0.002875194],"category_scores_gemma":[0.0048234873,0.0005214814,0.0010872849,0.0004328082,0.0024500426,0.0010379199,0.0010088187,0.001280593,0.0005265674],"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.00027714105,0.00014928918,0.0033893525,0.00066803856,0.00010100563,0.0011797368,0.00069973094,0.5511267,0.07643465,0.33998418,0.0024086104,0.023581546],"study_design_scores_gemma":[0.0001243112,0.00017629977,0.0005698684,0.0000772125,0.00006364599,0.00017009096,0.00006380066,0.8937473,0.055458806,0.03575016,0.013752151,0.000046220503],"about_ca_topic_score_codex":0.012660175,"about_ca_topic_score_gemma":0.0068581635,"teacher_disagreement_score":0.012660175,"about_ca_system_score_codex":0.0022551601,"about_ca_system_score_gemma":0.0041541224,"threshold_uncertainty_score":0.025172949},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046466902,0.000120074095,0.9293541,0.00015275709,0.00007844835,0.00018156378,0.00037703285,0.0038964662,0.019372756],"genre_scores_gemma":[0.33077994,0.00031041296,0.65070415,0.00021832096,0.000018169621,0.00029844564,0.0010909648,0.002404675,0.01417489],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992093,0.0002042804,0.000071378796,0.00009154352,0.00032133222,0.00010208688],"domain_scores_gemma":[0.99849164,0.00087135454,0.00008260136,0.0002739361,0.00023499271,0.000045455516],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010475223,0.00048826676,0.00033075886,0.0007527023,0.00041288667,0.0015616749,0.00073072646,0.0008216004,0.006716936],"category_scores_gemma":[0.0035491805,0.0007043083,0.0007167531,0.00057217316,0.0007184617,0.0013552901,0.0014462969,0.0010694335,0.0018048527],"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.00039694482,0.00015385542,0.0024275375,0.00073952513,0.00006254641,0.0011287283,0.0015735126,0.06466144,0.17787234,0.49712607,0.007374085,0.24648343],"study_design_scores_gemma":[0.0001935104,0.0002494783,0.001025592,0.000324691,0.000115738156,0.00064196467,0.0007531789,0.21850875,0.41599238,0.22322577,0.13887447,0.000094435796],"about_ca_topic_score_codex":0.0023597786,"about_ca_topic_score_gemma":0.003285857,"teacher_disagreement_score":0.006716936,"about_ca_system_score_codex":0.00052577024,"about_ca_system_score_gemma":0.0010362694,"threshold_uncertainty_score":0.022470415},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021495018,0.00009402113,0.9966343,0.000045258043,0.000007921478,0.00003091624,0.000004906854,0.00011601239,0.0009172252],"genre_scores_gemma":[0.40851894,0.00053204113,0.58734125,0.00015313856,0.000058548947,0.0006460525,0.000103719576,0.00014014977,0.0025061476],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99685067,0.00085855694,0.00022521259,0.00045207684,0.0014661889,0.00014734574],"domain_scores_gemma":[0.9974849,0.0013599995,0.00036744488,0.00019154893,0.0005411996,0.00005491838],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002657473,0.001333452,0.0007997833,0.0007479891,0.00073827204,0.0012447905,0.0011816117,0.001047959,0.0022309166],"category_scores_gemma":[0.005575022,0.0006902168,0.0010921265,0.0008092163,0.0012713894,0.0011838294,0.0015274406,0.0016101243,0.00044272208],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017183095,0.00008923497,0.0004828448,0.0006297955,0.00012220239,0.0005037888,0.0008215947,0.6296671,0.02736024,0.12822622,0.0016347902,0.21029033],"study_design_scores_gemma":[0.00006493995,0.00020449303,0.00009737594,0.000053676133,0.00003642926,0.00016427512,0.00007580283,0.942238,0.0109859025,0.039777916,0.006272241,0.000029020015],"about_ca_topic_score_codex":0.0013577265,"about_ca_topic_score_gemma":0.0016642745,"teacher_disagreement_score":0.002657473,"about_ca_system_score_codex":0.0007201312,"about_ca_system_score_gemma":0.0014490762,"threshold_uncertainty_score":0.014054239},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2077285,0.001327407,0.75760835,0.004070788,0.0003281844,0.00048464985,0.00039374354,0.002948252,0.025110124],"genre_scores_gemma":[0.7244889,0.0006119865,0.26511294,0.0009745436,0.00009768755,0.00027211854,0.00052790757,0.0006195829,0.0072942665],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99463946,0.0021001673,0.0003314386,0.0007789636,0.0014585365,0.00069148757],"domain_scores_gemma":[0.97820866,0.017112605,0.0011173063,0.0020131394,0.0012264177,0.00032190667],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0046490734,0.0010011405,0.0014281049,0.0013651685,0.0026788788,0.003418291,0.0024272292,0.002048553,0.007062113],"category_scores_gemma":[0.026446406,0.001122322,0.0014346766,0.0013520437,0.0032715779,0.008484634,0.003021883,0.0032226818,0.00079719315],"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.0020831295,0.00064303534,0.0076780287,0.0008315949,0.00020708938,0.0021029715,0.0016766334,0.18788499,0.016011376,0.36687556,0.015790133,0.39821547],"study_design_scores_gemma":[0.0002596106,0.0003074459,0.0006620875,0.00016986892,0.00018893926,0.00087773934,0.0006833784,0.53847235,0.028898241,0.41581553,0.013553144,0.00011169786],"about_ca_topic_score_codex":0.0034536286,"about_ca_topic_score_gemma":0.007154106,"teacher_disagreement_score":0.007062113,"about_ca_system_score_codex":0.002141496,"about_ca_system_score_gemma":0.0028234478,"threshold_uncertainty_score":0.024586916},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03141888,0.00030913678,0.9634177,0.00049087737,0.0000350844,0.00020557278,0.00047734194,0.0012118799,0.0024334907],"genre_scores_gemma":[0.23104814,0.0009069358,0.7626573,0.00018570208,0.00005774169,0.0003712209,0.0018108926,0.00040286634,0.0025592428],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9961273,0.001499426,0.0004898422,0.0005536301,0.0011062233,0.00022360959],"domain_scores_gemma":[0.98084867,0.013987025,0.0018907242,0.001262387,0.0017691401,0.0002421385],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004696923,0.0007172679,0.00045884185,0.0050707906,0.0015353404,0.0053096283,0.0009009221,0.0016330035,0.0027451236],"category_scores_gemma":[0.02249402,0.0008861421,0.0010917557,0.0031525027,0.0027985626,0.0074637863,0.0013306679,0.0015271098,0.00066194404],"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.00016888366,0.00018325367,0.0050254385,0.0007413222,0.000041063708,0.0009136489,0.0038430272,0.04568979,0.01756844,0.7811632,0.0027676984,0.14189431],"study_design_scores_gemma":[0.00008418926,0.000135993,0.0017964736,0.00033991737,0.00007296585,0.0007030605,0.0009125217,0.1323707,0.029504666,0.7840437,0.04992478,0.000110908346],"about_ca_topic_score_codex":0.003886296,"about_ca_topic_score_gemma":0.0026164202,"teacher_disagreement_score":0.0053096283,"about_ca_system_score_codex":0.0021676333,"about_ca_system_score_gemma":0.0029589338,"threshold_uncertainty_score":0.024839997},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.097004324,0.00009953458,0.8922888,0.00007934166,0.000047498404,0.00007565118,0.00026397957,0.008475901,0.0016648975],"genre_scores_gemma":[0.7371435,0.00012104302,0.26017568,0.00006225,0.000010668169,0.00013177157,0.00048216307,0.00049940636,0.0013734762],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978249,0.0006309761,0.0001881306,0.00038377155,0.00079073635,0.00018136982],"domain_scores_gemma":[0.99335843,0.004071518,0.0006901022,0.0012487542,0.00051432254,0.000116830524],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020501337,0.00085841585,0.00062173256,0.001031141,0.00060529035,0.0012658156,0.0011816038,0.00060365675,0.002436277],"category_scores_gemma":[0.0077314144,0.0005672503,0.0012899209,0.0005703779,0.0012823469,0.0025884556,0.0013824677,0.0009915248,0.00023022338],"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.00081394793,0.00023582087,0.012257262,0.0006876429,0.00041081556,0.0008653044,0.00047982417,0.76843077,0.04833513,0.094089955,0.0013029615,0.0720905],"study_design_scores_gemma":[0.000048424554,0.00012458955,0.00038172552,0.00002997258,0.0000725896,0.00008567529,0.00004320928,0.9247231,0.048450828,0.023859184,0.0021494876,0.00003118097],"about_ca_topic_score_codex":0.00677599,"about_ca_topic_score_gemma":0.009780703,"teacher_disagreement_score":0.00677599,"about_ca_system_score_codex":0.00087294914,"about_ca_system_score_gemma":0.0021555403,"threshold_uncertainty_score":0.0134730935},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020173816,0.0006034975,0.9724653,0.0010043631,0.00009305558,0.00012891782,0.0004947577,0.00048620845,0.0045500677],"genre_scores_gemma":[0.42884222,0.0012618921,0.5556856,0.000646584,0.0001328539,0.00079030404,0.0016933072,0.00029716198,0.010650088],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9954476,0.0013910513,0.00049740553,0.00079852494,0.0014379399,0.00042750925],"domain_scores_gemma":[0.9902829,0.0071398853,0.00053755596,0.00092514994,0.0009272809,0.0001872439],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032960172,0.0007646344,0.0011600511,0.0010293851,0.0008279561,0.0017009224,0.0011268927,0.0014631852,0.005723874],"category_scores_gemma":[0.012761265,0.0006383531,0.0010599903,0.0017340868,0.0016692017,0.0036339783,0.0020167294,0.0023847204,0.0007465346],"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.00030239363,0.00008332202,0.00095014594,0.0004760056,0.00007890237,0.0009162023,0.000297057,0.2558644,0.003606796,0.62655187,0.0045284852,0.1063443],"study_design_scores_gemma":[0.00010112239,0.00006655832,0.00011611343,0.000040041985,0.000033934964,0.0002009521,0.00004820533,0.35310435,0.0044101328,0.6317803,0.0100741545,0.000024109413],"about_ca_topic_score_codex":0.0031433243,"about_ca_topic_score_gemma":0.0026817697,"teacher_disagreement_score":0.005723874,"about_ca_system_score_codex":0.0017967263,"about_ca_system_score_gemma":0.0021632644,"threshold_uncertainty_score":0.01914823},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024250022,0.00024358332,0.9941812,0.0001489367,0.00007369288,0.0001272352,0.000028684259,0.0012216663,0.0015498602],"genre_scores_gemma":[0.15316485,0.0007140736,0.8430902,0.0002373777,0.00008068101,0.0004378941,0.00030796777,0.00047694726,0.0014901134],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9841377,0.007974647,0.0009945979,0.001418973,0.0047546416,0.0007193244],"domain_scores_gemma":[0.9755432,0.016901724,0.0015116669,0.004306928,0.0015552477,0.00018131806],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010443731,0.0015895118,0.0012700714,0.0028538746,0.0013953847,0.00350063,0.002907498,0.001909316,0.0028131106],"category_scores_gemma":[0.048188798,0.0015138244,0.0041121393,0.0013627432,0.0029021807,0.0040684217,0.005550804,0.0029030102,0.0009085646],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014874621,0.00025729943,0.0034764805,0.0012998465,0.00092909625,0.0012864807,0.0016454315,0.29330575,0.022231044,0.52859163,0.003423784,0.14340442],"study_design_scores_gemma":[0.00008799528,0.00011812592,0.00022281977,0.00040062144,0.00024185982,0.00048701372,0.00020484137,0.70847285,0.027406445,0.24304143,0.019248025,0.000068021356],"about_ca_topic_score_codex":0.006607351,"about_ca_topic_score_gemma":0.0060751466,"teacher_disagreement_score":0.010443731,"about_ca_system_score_codex":0.0016504084,"about_ca_system_score_gemma":0.004109931,"threshold_uncertainty_score":0.055232406},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004409558,0.00031458214,0.9918972,0.0002984272,0.00006856669,0.00017369364,0.00018975322,0.0004352368,0.0061814687],"genre_scores_gemma":[0.054466806,0.002398808,0.9329938,0.000421141,0.00023658003,0.0017638353,0.0011058361,0.000300831,0.0063123275],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99425924,0.0013621226,0.00055398914,0.0006462016,0.002869554,0.00030883963],"domain_scores_gemma":[0.99483925,0.0027442453,0.00035589674,0.0011511925,0.000820369,0.00008906953],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005183619,0.0016639829,0.0013435942,0.0018967775,0.0008771999,0.004152137,0.003685555,0.0020708337,0.0067125787],"category_scores_gemma":[0.010461393,0.001275698,0.00299036,0.001738031,0.0034917784,0.0029698166,0.0023008108,0.0044185314,0.0036815177],"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.00002658986,0.0000463444,0.0002540073,0.00033874082,0.000075201286,0.00017442339,0.00022696244,0.036682546,0.0016924898,0.92454034,0.0029978494,0.032944582],"study_design_scores_gemma":[0.000100713456,0.000058145288,0.00016382741,0.0002910449,0.000067479436,0.00025435552,0.00007858029,0.16752684,0.0053310525,0.7207868,0.10528745,0.000053642885],"about_ca_topic_score_codex":0.0034181497,"about_ca_topic_score_gemma":0.0019370174,"teacher_disagreement_score":0.0067125787,"about_ca_system_score_codex":0.0018781377,"about_ca_system_score_gemma":0.004248533,"threshold_uncertainty_score":0.027413964},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006249705,0.00010485728,0.99183685,0.000059796555,0.000013956565,0.000028773888,0.00004198347,0.00019030545,0.0014737931],"genre_scores_gemma":[0.48157418,0.0003619051,0.5151876,0.000057645902,0.000031890395,0.0003315104,0.00026000882,0.00016264713,0.0020326057],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990777,0.0003568742,0.00004609062,0.000104319886,0.00032559497,0.00008939272],"domain_scores_gemma":[0.9959572,0.0029563878,0.0003012829,0.00035090803,0.00029906322,0.00013505906],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021450366,0.0009475613,0.0012485987,0.0007497215,0.0006603666,0.0014174066,0.0018183101,0.0009319307,0.003713108],"category_scores_gemma":[0.008311304,0.00067735335,0.0010331317,0.00074238045,0.0012413852,0.0017627766,0.0017992468,0.0024725127,0.00054714934],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041462517,0.000015337446,0.00023693664,0.00004922326,0.0000134503225,0.000031491174,0.000061588726,0.94572294,0.00022059474,0.0442944,0.0002493987,0.009063159],"study_design_scores_gemma":[0.0000066584184,0.000009211825,0.000017260612,0.0000071719187,0.0000023735165,0.0000043908844,0.000009627853,0.9823615,0.00013492533,0.017103994,0.00034056866,0.0000023007103],"about_ca_topic_score_codex":0.0063932748,"about_ca_topic_score_gemma":0.007936267,"teacher_disagreement_score":0.0063932748,"about_ca_system_score_codex":0.0017999575,"about_ca_system_score_gemma":0.0017536266,"threshold_uncertainty_score":0.013059676},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041096322,0.00017164514,0.95576936,0.00013142679,0.000045519053,0.000043105327,0.00006682266,0.00019929098,0.0024766733],"genre_scores_gemma":[0.7284271,0.00027370054,0.26807967,0.00013756243,0.00018417544,0.00009085707,0.00019986738,0.00017079625,0.0024363627],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99809617,0.00041271842,0.00019045918,0.00046744477,0.00068118586,0.0001520458],"domain_scores_gemma":[0.98894054,0.0060194237,0.0012722713,0.0023995023,0.0011102452,0.00025795354],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023007384,0.0006104969,0.0006560999,0.0018998303,0.0005987298,0.0018086401,0.0010286989,0.00068624207,0.0026553695],"category_scores_gemma":[0.008170541,0.00038448646,0.0007715928,0.00094111107,0.0027579751,0.0041651526,0.0013580951,0.0017400675,0.0004622126],"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.0002616669,0.00008386634,0.0047929096,0.00015536137,0.000038308626,0.00053159485,0.0004493066,0.010787123,0.055955134,0.78445226,0.0011723887,0.14132005],"study_design_scores_gemma":[0.000025186995,0.00012228897,0.0015933806,0.000041322408,0.000032993168,0.0012959623,0.00013362718,0.2070043,0.03627802,0.74799687,0.00541431,0.00006185671],"about_ca_topic_score_codex":0.00025548242,"about_ca_topic_score_gemma":0.00026357084,"teacher_disagreement_score":0.0026553695,"about_ca_system_score_codex":0.0006375408,"about_ca_system_score_gemma":0.00045571235,"threshold_uncertainty_score":0.012167633},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017340226,0.000050158593,0.9788245,0.000071545146,0.000041083666,0.00007820243,0.00010274468,0.0019702613,0.0015212074],"genre_scores_gemma":[0.6208178,0.00015111161,0.37505847,0.00017196077,0.00001460528,0.0002914057,0.0003729895,0.00032267868,0.0027990052],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99790984,0.00038871577,0.00013668221,0.0003201486,0.0010167385,0.00022788679],"domain_scores_gemma":[0.99732614,0.0014722222,0.00024598587,0.0005165428,0.0003821537,0.00005702608],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017246528,0.0005984523,0.0005894138,0.0007296945,0.0005180096,0.0011734846,0.0012591605,0.00088706124,0.0030796006],"category_scores_gemma":[0.004817316,0.00044447655,0.0010510259,0.00021460907,0.0016798803,0.0014606037,0.0011725521,0.001364601,0.0005517976],"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.00050199975,0.00020326783,0.0028079427,0.00055580377,0.000092614704,0.0009846363,0.0004423865,0.5267334,0.09306949,0.31146562,0.0018103066,0.061332453],"study_design_scores_gemma":[0.000101982296,0.00013999519,0.0002793416,0.000053743355,0.00004390582,0.00014544901,0.000024622237,0.8896651,0.06804735,0.034469627,0.0069945105,0.000034279496],"about_ca_topic_score_codex":0.0026204302,"about_ca_topic_score_gemma":0.0018905723,"teacher_disagreement_score":0.0030796006,"about_ca_system_score_codex":0.0009328386,"about_ca_system_score_gemma":0.001895551,"threshold_uncertainty_score":0.010302246},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004618301,0.000085658605,0.99228996,0.000040221188,0.00003044547,0.000029195671,0.000031298434,0.000830056,0.0020447718],"genre_scores_gemma":[0.17259675,0.00025681895,0.82044923,0.00012118041,0.00006256892,0.00015328299,0.00025233944,0.0009370207,0.005170717],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986071,0.00043084437,0.00011567163,0.0002565157,0.00048661415,0.00010320762],"domain_scores_gemma":[0.99777067,0.0013180333,0.000087765206,0.0005850854,0.00019262357,0.000045915716],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014641498,0.0011240457,0.0010272465,0.0009786871,0.0005332177,0.0008602295,0.0018268644,0.00077850616,0.006020436],"category_scores_gemma":[0.0046002655,0.0006236498,0.0021041126,0.000651276,0.0013126907,0.003688829,0.0031639345,0.0025201126,0.0012183656],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035399885,0.0002889304,0.0014426654,0.0008125486,0.0002481102,0.00028333292,0.00043243694,0.2085767,0.05071657,0.27242044,0.0036224253,0.46080184],"study_design_scores_gemma":[0.00006208544,0.00010963545,0.0003005119,0.00006745207,0.00009645731,0.00011412815,0.000031232576,0.79797494,0.023493998,0.16898118,0.0087365005,0.000031842144],"about_ca_topic_score_codex":0.00073999946,"about_ca_topic_score_gemma":0.0015602317,"teacher_disagreement_score":0.006020436,"about_ca_system_score_codex":0.0004914885,"about_ca_system_score_gemma":0.0005579224,"threshold_uncertainty_score":0.02014035},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002880025,0.000074877906,0.99330324,0.00014373919,0.000021437214,0.000060574686,0.000034816443,0.00049224804,0.0029890426],"genre_scores_gemma":[0.10763878,0.0006361676,0.88680625,0.00032265333,0.00007609251,0.0004892334,0.00031929844,0.00033215797,0.003379326],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996874,0.0008770026,0.00026770827,0.00029968098,0.0014534717,0.00022813467],"domain_scores_gemma":[0.9962924,0.0019502706,0.00028862836,0.00081746024,0.0004967838,0.000154438],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003168037,0.0009548204,0.00043908192,0.001108597,0.0006611739,0.0018840276,0.0020105862,0.0011031827,0.0021521356],"category_scores_gemma":[0.00543797,0.0006378362,0.00081716076,0.0016125753,0.0026093742,0.0025134329,0.0022654524,0.0022013665,0.00091721426],"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.00005653044,0.000036872974,0.00022201099,0.00020301965,0.000012219772,0.00039910714,0.00051201915,0.010658866,0.009138578,0.92344487,0.0017292963,0.053586546],"study_design_scores_gemma":[0.00011315456,0.00015274837,0.0002799318,0.00013518904,0.000041712872,0.00080595555,0.00021799727,0.22999959,0.0425751,0.61513805,0.11048239,0.000058170423],"about_ca_topic_score_codex":0.0018886089,"about_ca_topic_score_gemma":0.0018627731,"teacher_disagreement_score":0.003168037,"about_ca_system_score_codex":0.00068764336,"about_ca_system_score_gemma":0.0030243248,"threshold_uncertainty_score":0.01675433},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08249527,0.00013923107,0.9121573,0.00009772914,0.000039864473,0.00011431219,0.00030575518,0.003223091,0.0014274907],"genre_scores_gemma":[0.624731,0.00016535046,0.3715282,0.000115490824,0.00005544202,0.00031056895,0.00089468725,0.0005603161,0.0016389731],"study_design_codex":"bench_or_experimental","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980021,0.00037294332,0.00022771623,0.0003291885,0.0009683188,0.000099753466],"domain_scores_gemma":[0.98045796,0.013521269,0.0018898052,0.0026150516,0.0013530562,0.00016296367],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014440145,0.0006926859,0.00047224882,0.0012441368,0.00028307093,0.0010042652,0.0007191344,0.00050241646,0.0023132095],"category_scores_gemma":[0.010106441,0.00034036947,0.00045430055,0.0004406892,0.0008011655,0.0019940406,0.00076257944,0.00058900076,0.00046991915],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015089277,0.00029599658,0.0046317223,0.0010996851,0.00014476631,0.001633778,0.001917854,0.12757747,0.3879881,0.083760194,0.002295443,0.3871461],"study_design_scores_gemma":[0.00013003264,0.0006580508,0.001236797,0.00015306225,0.000095755866,0.0006182142,0.00013541503,0.5108203,0.44199508,0.034810755,0.00928223,0.000064249754],"about_ca_topic_score_codex":0.0004056714,"about_ca_topic_score_gemma":0.00064531335,"teacher_disagreement_score":0.0023132095,"about_ca_system_score_codex":0.00033005708,"about_ca_system_score_gemma":0.00036944766,"threshold_uncertainty_score":0.0077384114},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016804899,0.0002881729,0.99298006,0.0004269383,0.000069819966,0.00004070823,0.00005252595,0.00015551843,0.004305731],"genre_scores_gemma":[0.2029615,0.0017013995,0.7853482,0.00043358607,0.0003184496,0.0005810385,0.00034357805,0.00021124347,0.008100985],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971528,0.0005338913,0.00019642075,0.00024018856,0.0017124553,0.00016428668],"domain_scores_gemma":[0.99836,0.0006233542,0.00020872992,0.000338769,0.00037876464,0.000090314184],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021223763,0.000908701,0.00078258774,0.0013610105,0.0010010488,0.0024930916,0.0026448395,0.0017527404,0.0022384312],"category_scores_gemma":[0.003998128,0.00073266984,0.0016966334,0.00077146664,0.003221288,0.0031416889,0.00222013,0.0030760013,0.0007104405],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009145959,0.000041098276,0.0001277531,0.00010240316,0.000021130798,0.000135372,0.00018187202,0.07584505,0.0036259072,0.9104029,0.0009753498,0.008531978],"study_design_scores_gemma":[0.000028385219,0.00006550269,0.00012383785,0.00007706335,0.000026829412,0.00010048406,0.000052898486,0.34308374,0.002102956,0.6172193,0.037079863,0.000039112398],"about_ca_topic_score_codex":0.0039683534,"about_ca_topic_score_gemma":0.0028270653,"teacher_disagreement_score":0.0039683534,"about_ca_system_score_codex":0.0016374992,"about_ca_system_score_gemma":0.0028126824,"threshold_uncertainty_score":0.011880994},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06802643,0.00016349414,0.9222774,0.00053625024,0.000028516157,0.000162226,0.00013465152,0.001471519,0.007199501],"genre_scores_gemma":[0.71680754,0.0002631434,0.27873543,0.0005390204,0.000034891385,0.00022565058,0.00039883595,0.0002689656,0.0027265488],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9956584,0.0020706402,0.00017368777,0.0006298022,0.0010407764,0.00042674472],"domain_scores_gemma":[0.9777028,0.017541217,0.00081740646,0.0030008154,0.0006882846,0.00024956846],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0043682265,0.0006619087,0.000651168,0.00067373994,0.0006158022,0.0012868298,0.0018153951,0.0011747372,0.0040578763],"category_scores_gemma":[0.024592286,0.0005194784,0.0011823317,0.00065946433,0.0024758994,0.004463657,0.0031396467,0.0026469938,0.00066254305],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004916323,0.0002680742,0.0033640685,0.00036289744,0.00013421573,0.0003402321,0.00040437674,0.38985297,0.009850127,0.42982414,0.0038384772,0.16126877],"study_design_scores_gemma":[0.000074894866,0.00012926069,0.0002698089,0.0000327247,0.000039262526,0.00013877492,0.00006387881,0.6904208,0.016306689,0.28929865,0.0032064521,0.000018771132],"about_ca_topic_score_codex":0.0010545825,"about_ca_topic_score_gemma":0.0020801034,"teacher_disagreement_score":0.0043682265,"about_ca_system_score_codex":0.00099164,"about_ca_system_score_gemma":0.0020430963,"threshold_uncertainty_score":0.023101687},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0100760395,0.000021636266,0.9882713,0.00011643136,0.0000119825845,0.000045449437,0.000026098418,0.00073377456,0.00069726864],"genre_scores_gemma":[0.42065117,0.00016422816,0.5767779,0.00017744096,0.000039174327,0.00028294433,0.00016437905,0.00029568287,0.0014470324],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9946343,0.0018932519,0.0002770947,0.00059863616,0.0021835838,0.00041320332],"domain_scores_gemma":[0.98068833,0.0122998925,0.000908097,0.0047784583,0.0011721756,0.00015288951],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005518564,0.00079425116,0.0005243056,0.0009363907,0.0007779247,0.0014522334,0.0018570591,0.00093069416,0.0022964082],"category_scores_gemma":[0.022080254,0.00085867394,0.0017453457,0.00051936455,0.00551577,0.004053302,0.0031069752,0.0028106864,0.00044192816],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024360517,0.00011598788,0.0016811652,0.00038176533,0.00009054457,0.00051742775,0.0010675553,0.22696435,0.031997476,0.6588937,0.0012592798,0.07678709],"study_design_scores_gemma":[0.00014947262,0.0001895022,0.00023784593,0.00007227402,0.0000706524,0.00022006595,0.0001009096,0.64371306,0.04606343,0.30131555,0.007823041,0.000044155964],"about_ca_topic_score_codex":0.002566924,"about_ca_topic_score_gemma":0.0022820137,"teacher_disagreement_score":0.005518564,"about_ca_system_score_codex":0.0012189698,"about_ca_system_score_gemma":0.0020503288,"threshold_uncertainty_score":0.029185355},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.79377264,0.0016704977,0.15102313,0.0037197017,0.00010933353,0.0002957719,0.00031035597,0.0013609679,0.047737718],"genre_scores_gemma":[0.9422009,0.00047656626,0.053004395,0.00015789596,0.000031017873,0.00007168418,0.00009071258,0.00011654127,0.0038501834],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9950117,0.0030932962,0.00017614098,0.00023180514,0.0011753706,0.00031172272],"domain_scores_gemma":[0.9871313,0.010808505,0.00041218539,0.0010031376,0.00046595102,0.00017882239],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006729827,0.00048318005,0.00045156755,0.0008852953,0.0015619647,0.0019160294,0.0009071775,0.0026296459,0.0024649268],"category_scores_gemma":[0.010889902,0.00029984693,0.0007552857,0.00088225654,0.0027503213,0.002652348,0.0013516098,0.0013479757,0.00020666332],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0026067428,0.00094465265,0.015576903,0.0012837453,0.0001565102,0.016660208,0.009519727,0.14574605,0.027482836,0.58707404,0.0072810077,0.18566768],"study_design_scores_gemma":[0.00070024614,0.0016977533,0.0061786873,0.00037116164,0.00024850763,0.00735502,0.0064386125,0.6979877,0.07350059,0.14595863,0.059418634,0.00014446274],"about_ca_topic_score_codex":0.0044011157,"about_ca_topic_score_gemma":0.0060375785,"teacher_disagreement_score":0.006729827,"about_ca_system_score_codex":0.0013041899,"about_ca_system_score_gemma":0.0008503695,"threshold_uncertainty_score":0.035591125},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002741051,0.00006016046,0.9959876,0.000052389532,0.000009816402,0.00006925477,0.000018735675,0.00020065882,0.00086028123],"genre_scores_gemma":[0.16037492,0.00033746287,0.83627886,0.00008026905,0.000035040342,0.00044203628,0.00015858903,0.0002741247,0.0020186114],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9937243,0.0021208727,0.0003988479,0.00059981947,0.002752436,0.00040374495],"domain_scores_gemma":[0.9914028,0.0054783197,0.0006048327,0.0012101819,0.0011871076,0.00011672758],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0043913526,0.0011052402,0.00071253534,0.0014380462,0.0010478621,0.0013367789,0.0013777746,0.0007245771,0.0032265487],"category_scores_gemma":[0.009864623,0.0007934629,0.0017034619,0.001083113,0.0018216417,0.003083509,0.002077385,0.0021236148,0.00048080203],"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.00038332085,0.00015087967,0.0017081685,0.00082889973,0.00019161456,0.000793301,0.0015812973,0.3002533,0.055982083,0.37414628,0.0020744721,0.2619065],"study_design_scores_gemma":[0.00012342045,0.00016995742,0.0003110772,0.00016249498,0.00017892424,0.0002881802,0.00019280917,0.75067776,0.07915464,0.14955068,0.01910261,0.00008742378],"about_ca_topic_score_codex":0.003954098,"about_ca_topic_score_gemma":0.0043511135,"teacher_disagreement_score":0.0043913526,"about_ca_system_score_codex":0.00093564333,"about_ca_system_score_gemma":0.002384162,"threshold_uncertainty_score":0.023223996},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0047303867,0.0028144144,0.9599241,0.0021424405,0.0005433718,0.000122028934,0.000049742666,0.0003385872,0.029334942],"genre_scores_gemma":[0.4091725,0.009939765,0.5543856,0.0015611593,0.0012409075,0.0006778214,0.00014715643,0.00022233462,0.022652717],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975089,0.00095959625,0.00016478919,0.0003027202,0.00076193316,0.0003019777],"domain_scores_gemma":[0.9983943,0.0008348799,0.00021511782,0.00022783852,0.00019443862,0.00013345026],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00257418,0.00062595966,0.0004184932,0.000967633,0.0013968493,0.0040264344,0.0015300267,0.0021812452,0.0029822576],"category_scores_gemma":[0.003806526,0.0006028659,0.0010899039,0.0012082533,0.0066054855,0.0045969454,0.0018361632,0.0033395467,0.0011059253],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012222422,0.000014508769,0.00007323919,0.00006368614,0.000008873508,0.00012245718,0.00024125999,0.0077164182,0.00073735387,0.9712322,0.0008921855,0.018885637],"study_design_scores_gemma":[0.00002541754,0.00007788588,0.00013172977,0.00012917511,0.000024442152,0.0003355232,0.00011138735,0.04637501,0.003121071,0.84787226,0.101759195,0.00003686659],"about_ca_topic_score_codex":0.0028728,"about_ca_topic_score_gemma":0.0013424398,"teacher_disagreement_score":0.0040264344,"about_ca_system_score_codex":0.0022298638,"about_ca_system_score_gemma":0.0023395747,"threshold_uncertainty_score":0.016178906},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026208874,0.0019942168,0.7028537,0.007978446,0.0004404732,0.00037354606,0.002260952,0.002308075,0.2555817],"genre_scores_gemma":[0.73212,0.0018224913,0.1670233,0.002309419,0.0010844911,0.0011884719,0.0058040465,0.0013321054,0.08731572],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975309,0.0006347863,0.00014382273,0.0005231285,0.00081772584,0.00034970485],"domain_scores_gemma":[0.9946226,0.0031471828,0.00024459133,0.0013632299,0.0003513373,0.00027105157],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015585107,0.001431824,0.001438843,0.0018202523,0.0022779633,0.004207607,0.0038233101,0.0021121416,0.039211836],"category_scores_gemma":[0.0075124907,0.0014179603,0.002990933,0.0024630409,0.0039382605,0.011288042,0.0044814316,0.009088133,0.004904365],"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.00002337306,0.000028713956,0.00007943291,0.00006955656,0.000010195375,0.000017406297,0.00009288552,0.004771327,0.00015867827,0.98254436,0.005236289,0.006967744],"study_design_scores_gemma":[0.000012302815,0.0000066317784,0.000074742034,0.000014527634,0.000006866578,0.000015872574,0.000021748992,0.011658558,0.00012896642,0.98443246,0.0036208783,0.0000063575026],"about_ca_topic_score_codex":0.0024662649,"about_ca_topic_score_gemma":0.0036432182,"teacher_disagreement_score":0.039211836,"about_ca_system_score_codex":0.003991922,"about_ca_system_score_gemma":0.0015311044,"threshold_uncertainty_score":0.13117665},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023032006,0.0001733083,0.9740036,0.00012241336,0.000030139629,0.00008124827,0.00006117858,0.0007909486,0.0017051519],"genre_scores_gemma":[0.73547226,0.00037388454,0.26207694,0.000087046355,0.00009395677,0.00018821497,0.00018633077,0.0003292728,0.0011920535],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9940398,0.0021998181,0.0003269713,0.0006423626,0.0022585453,0.00053253985],"domain_scores_gemma":[0.96276975,0.029173028,0.0017060633,0.0038019835,0.002388373,0.0001607907],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0058981967,0.0009752468,0.0009227928,0.0021992328,0.00068173226,0.0017436708,0.0021430645,0.00088065077,0.0041564866],"category_scores_gemma":[0.02689987,0.00082430383,0.0024789434,0.00091605575,0.0023421594,0.0038355377,0.0012050036,0.001989793,0.00047056752],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004078451,0.00027178615,0.0026181228,0.0009654877,0.00030738927,0.00052442215,0.00048396952,0.45226157,0.028412117,0.39279845,0.00212479,0.11882416],"study_design_scores_gemma":[0.00005558654,0.00009271694,0.0003246541,0.00005828409,0.00011732944,0.00016916302,0.00003624243,0.79996866,0.01695366,0.18074313,0.001449452,0.000031162734],"about_ca_topic_score_codex":0.0011486904,"about_ca_topic_score_gemma":0.0010442636,"teacher_disagreement_score":0.0058981967,"about_ca_system_score_codex":0.0012549303,"about_ca_system_score_gemma":0.0015570474,"threshold_uncertainty_score":0.031193018},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0034665647,0.008396283,0.9521675,0.0007922188,0.00039792014,0.00007019656,0.00009408463,0.00077492645,0.03384036],"genre_scores_gemma":[0.2817149,0.011069991,0.66998404,0.0006051868,0.00055762636,0.00037377182,0.0002758653,0.00069507933,0.03472363],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99869424,0.00041541317,0.00013248969,0.00022087249,0.0004674011,0.00006960514],"domain_scores_gemma":[0.99873286,0.00083658635,0.000081277656,0.00020960934,0.00011163109,0.000027896143],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020371918,0.0014004109,0.0013938686,0.0017677038,0.0009977986,0.0018030608,0.0013152293,0.0010605343,0.0048700487],"category_scores_gemma":[0.0037291949,0.0012927166,0.0020559966,0.0014339937,0.0025516332,0.0031886718,0.0021248427,0.003528592,0.0019930026],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010183479,0.000046097506,0.0002678293,0.0007487239,0.000089135014,0.00034023297,0.00050239457,0.023156658,0.0054701488,0.85244226,0.004536972,0.1122977],"study_design_scores_gemma":[0.00004640592,0.00008496729,0.00029384263,0.0003116317,0.000066822664,0.0005391522,0.00006745469,0.09141821,0.0086907735,0.82359576,0.0748211,0.00006396991],"about_ca_topic_score_codex":0.0010798187,"about_ca_topic_score_gemma":0.0014077238,"teacher_disagreement_score":0.0048700487,"about_ca_system_score_codex":0.0012473227,"about_ca_system_score_gemma":0.0008107839,"threshold_uncertainty_score":0.016291976},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008924612,0.000058551304,0.98944294,0.0002969431,0.00004243107,0.00003575679,0.000052498013,0.0004592391,0.00068697054],"genre_scores_gemma":[0.60467744,0.00021966844,0.39241162,0.00054299494,0.00021165822,0.00024219512,0.00025651124,0.00044133223,0.0009966354],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.95892954,0.018149475,0.0030698911,0.006222995,0.010783281,0.0028449],"domain_scores_gemma":[0.68673897,0.27823144,0.0075415676,0.018053615,0.008185638,0.0012487244],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.03635799,0.0017020353,0.0027434325,0.0026239904,0.0018203831,0.0061076065,0.0041695572,0.002581469,0.003249364],"category_scores_gemma":[0.18283206,0.0018003869,0.005808221,0.0015872326,0.009355793,0.01247823,0.0060236584,0.007323007,0.0006703809],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042315415,0.0002213927,0.0047555063,0.00038359498,0.00050571223,0.0006046767,0.00062041805,0.1023038,0.004956016,0.8473018,0.0014357169,0.03648818],"study_design_scores_gemma":[0.00010657837,0.00007168748,0.00034952065,0.00003921521,0.0000836611,0.00012955807,0.000037695958,0.39649102,0.0071077324,0.59489596,0.00064155314,0.00004588204],"about_ca_topic_score_codex":0.0030098297,"about_ca_topic_score_gemma":0.0020474058,"teacher_disagreement_score":0.03635799,"about_ca_system_score_codex":0.0032004276,"about_ca_system_score_gemma":0.0048141484,"threshold_uncertainty_score":0.19228172},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022098653,0.00023081883,0.9745815,0.00025521236,0.00004907022,0.00006693844,0.00015633406,0.0014153857,0.0011460306],"genre_scores_gemma":[0.58349997,0.00037405026,0.41389,0.0002313216,0.00006530042,0.0002521079,0.00041158247,0.0001536526,0.0011220584],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9907025,0.0040781638,0.000773275,0.0010834032,0.0028315657,0.00053098233],"domain_scores_gemma":[0.9799745,0.014250801,0.0017242895,0.0025770655,0.0011961061,0.0002772494],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00626331,0.00085479754,0.0012178122,0.0017634807,0.0010258905,0.004133876,0.0023022187,0.0012041992,0.0016353024],"category_scores_gemma":[0.02041528,0.00089638954,0.002528379,0.0015144078,0.003378797,0.0055499515,0.0032467102,0.0023996788,0.0002213786],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004940952,0.00014666014,0.0024805234,0.00042854657,0.00032400974,0.0006423786,0.00044935543,0.54026484,0.00910232,0.3897554,0.0011756311,0.054736212],"study_design_scores_gemma":[0.00010780502,0.000035977133,0.000078591926,0.00004414211,0.00005745879,0.00007453775,0.0000330911,0.8369436,0.008107518,0.15301055,0.0014829625,0.000023759123],"about_ca_topic_score_codex":0.0057043275,"about_ca_topic_score_gemma":0.006363136,"teacher_disagreement_score":0.00626331,"about_ca_system_score_codex":0.0030781252,"about_ca_system_score_gemma":0.0032130964,"threshold_uncertainty_score":0.03312397},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027698189,0.0004717051,0.9407372,0.000510013,0.00009514558,0.000165447,0.00016905753,0.004125853,0.026027499],"genre_scores_gemma":[0.28353003,0.0005559665,0.6803396,0.0004895385,0.00004846824,0.00026264065,0.00044339043,0.00083998806,0.03349042],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99905306,0.0002674966,0.000043548847,0.00013211352,0.00041414882,0.000089613124],"domain_scores_gemma":[0.9993475,0.00024139998,0.00005176675,0.00020514723,0.00013368536,0.000020487634],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011590602,0.00041936958,0.000337014,0.0004630403,0.0003438372,0.0010008872,0.00069091277,0.00049970386,0.0067859585],"category_scores_gemma":[0.0016889417,0.00053246395,0.0005480246,0.00030604083,0.0010503443,0.0014922261,0.00095096737,0.0008370461,0.0010125113],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006671672,0.00012069753,0.0015434631,0.0007598554,0.00005887867,0.0008131656,0.0009420732,0.12479514,0.08478007,0.45869812,0.013527268,0.3132941],"study_design_scores_gemma":[0.00029133944,0.00038842592,0.0010540417,0.00025718793,0.000051496198,0.0006154533,0.000119406,0.40244517,0.08024388,0.24003577,0.27443105,0.0000667885],"about_ca_topic_score_codex":0.0028312127,"about_ca_topic_score_gemma":0.003506548,"teacher_disagreement_score":0.0067859585,"about_ca_system_score_codex":0.00075615395,"about_ca_system_score_gemma":0.0011880436,"threshold_uncertainty_score":0.022701323},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019504137,0.000090499176,0.9902238,0.0002543266,0.000027995824,0.00009045768,0.00014159457,0.0064103277,0.0008105014],"genre_scores_gemma":[0.111102335,0.00027037438,0.88480014,0.0003835187,0.00007700578,0.00042226544,0.0005573101,0.0011616015,0.0012253541],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9913693,0.0033007762,0.0007333376,0.001294448,0.0027967426,0.00050541287],"domain_scores_gemma":[0.9650836,0.025896141,0.0016470983,0.005233979,0.001718241,0.00042096205],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008106193,0.0016411961,0.0014480802,0.0029913383,0.0012587144,0.003432382,0.0038457264,0.0017631693,0.0052495827],"category_scores_gemma":[0.03484001,0.0016230489,0.003377285,0.0024195588,0.005528235,0.009750882,0.0064204936,0.0052054776,0.00095617457],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006734086,0.00026774761,0.002942641,0.0010129717,0.00029009895,0.0011524614,0.001755689,0.08064788,0.017916013,0.61633635,0.015727269,0.2612774],"study_design_scores_gemma":[0.00015702358,0.00014912018,0.000233536,0.00019911354,0.00011785752,0.00054784876,0.00019460777,0.5701344,0.027414924,0.3762074,0.02454856,0.00009561584],"about_ca_topic_score_codex":0.0034903267,"about_ca_topic_score_gemma":0.0030481971,"teacher_disagreement_score":0.008106193,"about_ca_system_score_codex":0.0017364366,"about_ca_system_score_gemma":0.0028949098,"threshold_uncertainty_score":0.042870104},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08967129,0.0005295613,0.889651,0.00024777773,0.00008828201,0.00017849468,0.0001441965,0.0151445875,0.00434484],"genre_scores_gemma":[0.4703172,0.00026017195,0.5270217,0.0001223455,0.000032076936,0.00010249908,0.0003067419,0.0005459487,0.0012912487],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9952484,0.0016973407,0.00021310528,0.0008392496,0.0017123139,0.00028962587],"domain_scores_gemma":[0.99319804,0.0046468964,0.00027012493,0.0013276921,0.00038794405,0.00016932221],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038642576,0.0012773557,0.0011840019,0.0014459547,0.00051484443,0.0018563068,0.0025507014,0.0008762476,0.0045970655],"category_scores_gemma":[0.006610271,0.00071125606,0.0008113775,0.0010105593,0.00084478967,0.0042601763,0.002422114,0.001434092,0.0010899433],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0029853422,0.0010226805,0.00651375,0.0012306888,0.00059243554,0.0009200571,0.00037845827,0.24135263,0.09111885,0.049705546,0.0035832513,0.6005964],"study_design_scores_gemma":[0.00021580388,0.0004610349,0.0006681264,0.000053937954,0.00015186971,0.0002134765,0.00008322838,0.9030601,0.06910397,0.021198802,0.004722778,0.000066989756],"about_ca_topic_score_codex":0.0015177014,"about_ca_topic_score_gemma":0.0019494856,"teacher_disagreement_score":0.0045970655,"about_ca_system_score_codex":0.0008188631,"about_ca_system_score_gemma":0.0014580375,"threshold_uncertainty_score":0.020436406},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009793327,0.00010509486,0.97456217,0.00039884532,0.000109389286,0.00027950748,0.0008743964,0.0063391924,0.007538121],"genre_scores_gemma":[0.17815425,0.00046489012,0.801368,0.000532099,0.00012417344,0.0013212052,0.003065264,0.0016915612,0.013278519],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99780697,0.0005521272,0.00024791213,0.00019477805,0.00097395625,0.00022433403],"domain_scores_gemma":[0.9973014,0.0012953863,0.0002995111,0.00036838528,0.00065966044,0.00007567817],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021374992,0.0007909103,0.00040844007,0.0007778688,0.0005713157,0.0018310036,0.00088500173,0.00091255805,0.0054068025],"category_scores_gemma":[0.004182645,0.00059160544,0.0007813214,0.00048774158,0.0012455637,0.001748275,0.0010260855,0.0016636044,0.0022212183],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002916182,0.00030901676,0.0021946526,0.0008217955,0.00004433679,0.0022829764,0.002064022,0.060059454,0.058234554,0.7774741,0.01906428,0.07715923],"study_design_scores_gemma":[0.00028310122,0.0003195749,0.0011234375,0.0005410775,0.00009336676,0.0015870298,0.0005280258,0.34015074,0.10695787,0.15909012,0.38913456,0.00019102919],"about_ca_topic_score_codex":0.002385384,"about_ca_topic_score_gemma":0.0024074272,"teacher_disagreement_score":0.0054068025,"about_ca_system_score_codex":0.00091609283,"about_ca_system_score_gemma":0.002614716,"threshold_uncertainty_score":0.018087566},"labels":[],"label_agreement":null},{"id":"W2117013774","doi":"10.1007/s10703-008-0049-6","title":"Learning to divide and conquer: applying the L* algorithm to automate assume-guarantee reasoning","year":2008,"lang":"en","type":"article","venue":"Formal Methods in System Design","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":129,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Engineering and Physical Sciences Research Council","keywords":"Divide and conquer algorithms; Computer science; Component (thermodynamics); Counterexample; Property (philosophy); Process (computing); Scalability; Alphabet; Model checking; Theoretical computer science; Process calculus; Algorithm; Artificial intelligence; Programming language; Mathematics","score_opus":0.05480365477555006,"score_gpt":0.34642625720747283,"score_spread":0.2916226024319228,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2117013774","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008049882,0.000050721228,0.98847777,0.00037092858,0.000017292416,0.000056384037,0.000032410637,0.0017893479,0.0011552171],"genre_scores_gemma":[0.21959649,0.000058183017,0.77773786,0.00028256947,0.00003660113,0.00014257607,0.00014893276,0.00040545283,0.0015914736],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.994132,0.0026424665,0.00032707865,0.0010217627,0.0013295021,0.0005471163],"domain_scores_gemma":[0.9792108,0.014565019,0.0010127535,0.0033579397,0.001472334,0.00038118937],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006435745,0.0010637029,0.0014640327,0.0013004229,0.0015027728,0.0025668363,0.003995461,0.0020664877,0.007030066],"category_scores_gemma":[0.03130167,0.0011683578,0.0017110289,0.0009014077,0.0035522915,0.00569971,0.0052871336,0.0041016275,0.0014335049],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001007666,0.00040541936,0.0026675484,0.00034126695,0.00015328343,0.00021648238,0.0006741969,0.18472403,0.007167767,0.13192347,0.00802456,0.66269433],"study_design_scores_gemma":[0.00008390859,0.000049010338,0.0001031986,0.000027879505,0.000023968516,0.000039385606,0.00006592118,0.8524445,0.005525797,0.14019935,0.00142132,0.00001579053],"about_ca_topic_score_codex":0.0064015547,"about_ca_topic_score_gemma":0.009609075,"teacher_disagreement_score":0.007030066,"about_ca_system_score_codex":0.0017715346,"about_ca_system_score_gemma":0.0052953935,"threshold_uncertainty_score":0.03403592},"labels":[],"label_agreement":null},{"id":"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0985776,0.00010724998,0.88900995,0.0002176742,0.000030291088,0.00010852145,0.00012064236,0.010999541,0.00082857115],"genre_scores_gemma":[0.45508903,0.00005040067,0.5431101,0.0001035008,0.000009236599,0.00008949623,0.0002815396,0.0007274005,0.00053928164],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9943159,0.0030125421,0.0003966324,0.000675987,0.0012527641,0.00034618835],"domain_scores_gemma":[0.95560443,0.03528213,0.002470619,0.003995925,0.0022976096,0.00034929256],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0060280855,0.0011632617,0.00085469976,0.0012990624,0.0007965648,0.0013584631,0.0016311776,0.001336166,0.0021377585],"category_scores_gemma":[0.029295858,0.0007166481,0.0008596493,0.00057810027,0.0012896777,0.0020701136,0.0011789185,0.0012963272,0.0005421085],"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.0022260074,0.00090899685,0.02872793,0.0010053113,0.00016705526,0.002344308,0.0018338301,0.4169142,0.08135713,0.049005255,0.0057757455,0.40973413],"study_design_scores_gemma":[0.00008516134,0.00022584229,0.00055272377,0.00012163311,0.00004583279,0.00034695677,0.00006199183,0.9178907,0.06310461,0.014319135,0.0032046528,0.00004071724],"about_ca_topic_score_codex":0.0018092134,"about_ca_topic_score_gemma":0.0023293279,"teacher_disagreement_score":0.0060280855,"about_ca_system_score_codex":0.0009084992,"about_ca_system_score_gemma":0.0017324103,"threshold_uncertainty_score":0.03187996},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00068929605,0.00033963347,0.9850448,0.00015733119,0.000115448725,0.00028773566,0.00061244174,0.0024011598,0.01035203],"genre_scores_gemma":[0.039167546,0.0022413007,0.9324049,0.00047392346,0.00014327452,0.00095805223,0.0026852807,0.00091129635,0.021014454],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99305576,0.0014528795,0.0010018799,0.00078556564,0.0033002356,0.00040373488],"domain_scores_gemma":[0.9931617,0.002554914,0.00036988297,0.0021281508,0.0016700878,0.00011536432],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041261683,0.0012434586,0.0010065995,0.0023612934,0.0009383162,0.004188081,0.0031949573,0.0014620055,0.033222843],"category_scores_gemma":[0.008488373,0.0011161902,0.0024189684,0.002850487,0.0011113266,0.004968766,0.0023172835,0.0024254092,0.01589761],"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.0001814129,0.00011259812,0.00042053568,0.0010154283,0.00009620729,0.00034661122,0.00051029783,0.012992905,0.018512856,0.6934438,0.029091539,0.2432759],"study_design_scores_gemma":[0.00022482306,0.00023570895,0.00028289392,0.00046677564,0.00021483784,0.0013063023,0.00027079246,0.101685226,0.051373586,0.27920595,0.56458217,0.0001509454],"about_ca_topic_score_codex":0.0017239092,"about_ca_topic_score_gemma":0.0016743595,"teacher_disagreement_score":0.033222843,"about_ca_system_score_codex":0.0014065224,"about_ca_system_score_gemma":0.0023369151,"threshold_uncertainty_score":0.1111415},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07151371,0.00016433407,0.9214247,0.00027012423,0.000035997367,0.00012317377,0.00018424948,0.0025433267,0.0037404688],"genre_scores_gemma":[0.8307799,0.00028359945,0.16658531,0.00013831844,0.000067262685,0.00018481766,0.00023840777,0.0002737204,0.0014487122],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99275607,0.0027288387,0.00038197773,0.00069362164,0.0026908806,0.0007486696],"domain_scores_gemma":[0.97314936,0.021765342,0.0013375105,0.00204841,0.0015119873,0.0001874739],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0067511452,0.0010882538,0.0009377241,0.0015463075,0.00073824247,0.0023704334,0.0021002085,0.0011169825,0.0027636795],"category_scores_gemma":[0.018210525,0.0005650535,0.0014794568,0.0009436026,0.0018909177,0.0033338827,0.0013129971,0.001519737,0.00041270134],"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.00046732253,0.0004833061,0.0042041047,0.00044084192,0.00015411059,0.00043139845,0.00033974604,0.69418997,0.02522337,0.23357123,0.0014787057,0.039015975],"study_design_scores_gemma":[0.000042876734,0.00009788363,0.0001630889,0.000009882578,0.000027289352,0.000044621967,0.000016263824,0.96678895,0.009958702,0.02231412,0.0005231429,0.000013179642],"about_ca_topic_score_codex":0.0018844716,"about_ca_topic_score_gemma":0.0010637119,"teacher_disagreement_score":0.0067511452,"about_ca_system_score_codex":0.002702614,"about_ca_system_score_gemma":0.002393272,"threshold_uncertainty_score":0.035703897},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0862908,0.00011313403,0.90469706,0.0004939904,0.00005428013,0.0002521976,0.00016297298,0.002700344,0.0052352753],"genre_scores_gemma":[0.8045051,0.00012373828,0.19136997,0.00015376438,0.000030664403,0.00027137145,0.0002841171,0.00014819352,0.0031130165],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9941491,0.0025122,0.00030889554,0.00066358974,0.001942004,0.00042427942],"domain_scores_gemma":[0.9828628,0.012845286,0.0009395447,0.0017017946,0.0013598182,0.0002907691],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004035277,0.00084399356,0.0010353506,0.0012657878,0.0014373878,0.0032585629,0.001940228,0.0013671605,0.0034139808],"category_scores_gemma":[0.020386135,0.00054991065,0.0013519529,0.000900007,0.0034744595,0.0027061275,0.0024819307,0.0016840285,0.00058115786],"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.0004342056,0.00019534724,0.003702335,0.00030492997,0.00022965971,0.0009735014,0.0009857976,0.6114613,0.01579352,0.33016768,0.0019311908,0.03382059],"study_design_scores_gemma":[0.000077509074,0.000047579306,0.00014500196,0.000026679038,0.000043043845,0.00006611922,0.000056461162,0.8965849,0.010146681,0.0909722,0.0018139669,0.000019767876],"about_ca_topic_score_codex":0.011680386,"about_ca_topic_score_gemma":0.009112583,"teacher_disagreement_score":0.011680386,"about_ca_system_score_codex":0.0030551446,"about_ca_system_score_gemma":0.0035760982,"threshold_uncertainty_score":0.02322483},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014698469,0.000026041362,0.9777334,0.00006428012,0.000016569385,0.00011131052,0.0001348631,0.005449383,0.0017657374],"genre_scores_gemma":[0.28395766,0.00008929618,0.71083367,0.000121100005,0.000020011012,0.00040672268,0.0004996149,0.0011166777,0.0029552141],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99850273,0.00039874602,0.00012337317,0.00017174141,0.00070086634,0.00010266323],"domain_scores_gemma":[0.9972481,0.0014207104,0.00025909132,0.00056173385,0.00046638038,0.00004399273],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011560902,0.00046540864,0.00027781288,0.00044938587,0.0002295332,0.0011159553,0.0010450508,0.0006890824,0.003301906],"category_scores_gemma":[0.0050823847,0.0005075952,0.00041273772,0.00026839148,0.00065353117,0.0011475688,0.0006338584,0.0011874823,0.0010554539],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00049955136,0.00024814962,0.004761373,0.0007498822,0.00005745355,0.0012185674,0.0008868446,0.11625456,0.40552366,0.17882553,0.009466303,0.28150818],"study_design_scores_gemma":[0.0001532851,0.00023169986,0.000663391,0.00005555469,0.00003920124,0.00046462304,0.0000638413,0.6558366,0.29658338,0.022622017,0.023255935,0.000030549556],"about_ca_topic_score_codex":0.00046511376,"about_ca_topic_score_gemma":0.0005443186,"teacher_disagreement_score":0.003301906,"about_ca_system_score_codex":0.00043224977,"about_ca_system_score_gemma":0.0008587214,"threshold_uncertainty_score":0.011045992},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023127971,0.00011555248,0.9955342,0.0000697659,0.000034154386,0.000086453416,0.000044229626,0.0009051081,0.00089762354],"genre_scores_gemma":[0.18396066,0.0005711433,0.811748,0.00022194292,0.00009948495,0.0007929506,0.0005042029,0.00056955125,0.0015320985],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9935638,0.002114725,0.00060837204,0.00078486715,0.0025858488,0.0003424829],"domain_scores_gemma":[0.98763055,0.0091212485,0.0006243957,0.0014773223,0.0010263685,0.00012007504],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0054903785,0.0010490343,0.00064489804,0.00166628,0.0007059594,0.0018388953,0.0019067372,0.0011116898,0.0049889637],"category_scores_gemma":[0.019273086,0.00080308854,0.0016827969,0.0008550032,0.0037694029,0.0032843049,0.0026250265,0.0038587328,0.0008480763],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021022465,0.00012453414,0.0005817562,0.0007544289,0.00010194673,0.0004945552,0.00060151215,0.057306845,0.019170407,0.7881667,0.0033183747,0.1291687],"study_design_scores_gemma":[0.00017589678,0.00019236673,0.00022888229,0.00024382058,0.00008063232,0.00033853718,0.00010514181,0.17800887,0.0491244,0.74584883,0.025584223,0.00006827414],"about_ca_topic_score_codex":0.0015974987,"about_ca_topic_score_gemma":0.0009991471,"teacher_disagreement_score":0.0054903785,"about_ca_system_score_codex":0.0013919843,"about_ca_system_score_gemma":0.0016315154,"threshold_uncertainty_score":0.029036224},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07165091,0.00018701488,0.921547,0.00036659415,0.000042861015,0.00018224436,0.00014266148,0.0018282763,0.004052355],"genre_scores_gemma":[0.6222213,0.00040285088,0.37288243,0.00025740443,0.00004364033,0.00025840427,0.0004105849,0.00044701123,0.0030763461],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99328834,0.0023564734,0.00027114604,0.00085126905,0.0025898204,0.0006428934],"domain_scores_gemma":[0.9820119,0.013179306,0.0008091918,0.0026776392,0.0012032485,0.00011880756],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005613259,0.0011050865,0.00076350145,0.0008439714,0.0010949204,0.0021932318,0.0024927775,0.0013850307,0.0023531031],"category_scores_gemma":[0.020711798,0.0007185558,0.0015850352,0.00079258485,0.0036671895,0.0029561415,0.0014877681,0.0019987568,0.00042683972],"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.00056382647,0.00029272155,0.004570818,0.0008008815,0.00014491257,0.0013849372,0.0016308931,0.7065636,0.027841005,0.18072999,0.0017576606,0.073718734],"study_design_scores_gemma":[0.000111941,0.00022699907,0.0004488307,0.00013863794,0.00011946028,0.00030871652,0.00012042524,0.87479746,0.07324188,0.044134926,0.006295514,0.000055090695],"about_ca_topic_score_codex":0.009394361,"about_ca_topic_score_gemma":0.007430261,"teacher_disagreement_score":0.009394361,"about_ca_system_score_codex":0.0021658475,"about_ca_system_score_gemma":0.0036200047,"threshold_uncertainty_score":0.029686093},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0083904425,0.0001121425,0.9877628,0.00012744327,0.000026685757,0.00011729232,0.00017367446,0.0006507813,0.002638671],"genre_scores_gemma":[0.23221655,0.00039294866,0.7644221,0.000099857374,0.000032612006,0.00046907153,0.0004387224,0.0003337567,0.0015944021],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962536,0.0015586343,0.00020786964,0.00035064723,0.0014095095,0.00021976777],"domain_scores_gemma":[0.99217165,0.0054727923,0.0005228952,0.0008173823,0.0009132026,0.00010200052],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028734147,0.0010180857,0.0007268248,0.0009202185,0.000748759,0.0013745093,0.001460783,0.0006822976,0.0032899086],"category_scores_gemma":[0.010225518,0.0005802164,0.0011760035,0.0010899527,0.0016370463,0.001350295,0.0012583409,0.0013316801,0.0005261881],"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.000097459255,0.000056080695,0.00037172975,0.00025231414,0.000057683144,0.00016751114,0.000080055106,0.8822405,0.010573332,0.061223734,0.0012124577,0.043667145],"study_design_scores_gemma":[0.000037190064,0.000024644862,0.00006268332,0.000020230806,0.00001170369,0.000025841415,0.000009910982,0.972138,0.007152764,0.017857214,0.0026497291,0.0000101876585],"about_ca_topic_score_codex":0.008962817,"about_ca_topic_score_gemma":0.0078378655,"teacher_disagreement_score":0.008962817,"about_ca_system_score_codex":0.0014479128,"about_ca_system_score_gemma":0.004301777,"threshold_uncertainty_score":0.017821252},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009614125,0.00009646905,0.98679465,0.00012895375,0.000031084845,0.00009790545,0.00007114002,0.00085128634,0.002314427],"genre_scores_gemma":[0.31459093,0.00021915713,0.6800111,0.00015869491,0.00005829814,0.00048782886,0.00040749757,0.00037357866,0.0036928898],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969304,0.0012096801,0.0002028703,0.00030954418,0.0010550736,0.00029248168],"domain_scores_gemma":[0.99622947,0.0025231994,0.00027110602,0.00036501887,0.000545069,0.000066084656],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023132204,0.0008070701,0.0006731344,0.0020764177,0.000973784,0.0021742831,0.001737241,0.0010142917,0.0034960166],"category_scores_gemma":[0.0076763653,0.0006645667,0.002562289,0.0009096083,0.0023592645,0.0023843425,0.0015851326,0.0014382695,0.0006093674],"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.00011246813,0.00009619587,0.001138874,0.00031312928,0.00010440859,0.000488745,0.0007540135,0.27980444,0.011517345,0.6677678,0.0014468868,0.036455665],"study_design_scores_gemma":[0.00003375939,0.00004082787,0.00013412144,0.00005079047,0.00003571423,0.00009912014,0.000063980595,0.7725694,0.009005132,0.21135409,0.0065851263,0.000027943111],"about_ca_topic_score_codex":0.0026675684,"about_ca_topic_score_gemma":0.0019621525,"teacher_disagreement_score":0.0034960166,"about_ca_system_score_codex":0.0019624506,"about_ca_system_score_gemma":0.0021769158,"threshold_uncertainty_score":0.014238656},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019520517,0.000047864967,0.9967644,0.000042301315,0.000012177877,0.00003245161,0.000045020326,0.00051300094,0.00059070945],"genre_scores_gemma":[0.12466995,0.00017595243,0.87343436,0.000054204476,0.000015863061,0.0002546729,0.00019531569,0.00018475935,0.0010148787],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974988,0.000908946,0.00014867733,0.00039628008,0.0008891219,0.00015819525],"domain_scores_gemma":[0.9961318,0.0026137903,0.00021952808,0.00062555505,0.00030572485,0.00010356608],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025437074,0.00087808346,0.0010285778,0.001327337,0.00065644295,0.0018839309,0.0014611891,0.00093918113,0.0046339394],"category_scores_gemma":[0.009037191,0.000845063,0.0012448867,0.0009111871,0.0012466154,0.0023027533,0.002231336,0.0019030183,0.00081965287],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002052598,0.000089706096,0.0010366542,0.0003108925,0.00008661237,0.00011825056,0.00015688874,0.6433227,0.005792861,0.13942268,0.0015952192,0.20786221],"study_design_scores_gemma":[0.000034539997,0.000040908308,0.00005589279,0.00003182626,0.000019355142,0.000053274918,0.000019317598,0.9261941,0.006402875,0.06088128,0.0062503004,0.000016373382],"about_ca_topic_score_codex":0.0026510493,"about_ca_topic_score_gemma":0.0024318323,"teacher_disagreement_score":0.0046339394,"about_ca_system_score_codex":0.0012204383,"about_ca_system_score_gemma":0.0026674606,"threshold_uncertainty_score":0.015502036},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021694213,0.00019831525,0.97052383,0.00023545351,0.000024093957,0.0001184644,0.00037585522,0.0045112027,0.0023186351],"genre_scores_gemma":[0.46264434,0.0004528557,0.5307787,0.00019938937,0.00003869389,0.00051191216,0.0015088965,0.0008904213,0.0029747828],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99719656,0.0012165799,0.00016668964,0.00027840235,0.0008957068,0.00024603907],"domain_scores_gemma":[0.99211335,0.0052417982,0.00050373335,0.0014757729,0.0005734449,0.00009188673],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002124654,0.0009940355,0.000936343,0.0013066654,0.00055094366,0.0017405355,0.0016535887,0.000920318,0.0042617805],"category_scores_gemma":[0.009106504,0.0007479168,0.0013495178,0.00136553,0.0015386664,0.005074986,0.0019552845,0.0017416485,0.00085903157],"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.00075722573,0.00020216359,0.0012936379,0.0004934049,0.000086743006,0.00036181786,0.00031499937,0.64699733,0.014632694,0.21752147,0.003057481,0.11428109],"study_design_scores_gemma":[0.000076214434,0.00006153795,0.00007653805,0.000050062357,0.00002821871,0.000048022845,0.000021132622,0.8788298,0.009304746,0.108718365,0.0027665182,0.000018887527],"about_ca_topic_score_codex":0.003780512,"about_ca_topic_score_gemma":0.006257597,"teacher_disagreement_score":0.0042617805,"about_ca_system_score_codex":0.0018243055,"about_ca_system_score_gemma":0.0022459915,"threshold_uncertainty_score":0.014257133},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010121479,0.000054816315,0.9951271,0.000050787152,0.000013339065,0.00009924324,0.00009837688,0.0025315655,0.00101265],"genre_scores_gemma":[0.028872887,0.00011682097,0.9680599,0.000047476813,0.00002006399,0.00031200898,0.0008020206,0.0005121141,0.001256701],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99843603,0.00030397778,0.00015188899,0.00042784793,0.0005060437,0.00017416949],"domain_scores_gemma":[0.99709475,0.0018846189,0.00015909565,0.00045397316,0.00034808723,0.0000595707],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013134973,0.0019197252,0.0011490849,0.0024887056,0.0013761654,0.0019988157,0.0026602864,0.0014019088,0.015356976],"category_scores_gemma":[0.0053943754,0.0011614215,0.0020808894,0.001733461,0.0012890293,0.0032568336,0.0022966408,0.0021364947,0.0044337334],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000417143,0.0003497052,0.0011062776,0.0010892192,0.00015883254,0.00045459138,0.00036644575,0.07032262,0.03903524,0.16196094,0.015223084,0.7095159],"study_design_scores_gemma":[0.00033992843,0.00022062936,0.0005256724,0.00016821404,0.00013424321,0.0007191853,0.00013916219,0.64689106,0.030988332,0.28131765,0.038450006,0.00010586729],"about_ca_topic_score_codex":0.0022723814,"about_ca_topic_score_gemma":0.0034211902,"teacher_disagreement_score":0.015356976,"about_ca_system_score_codex":0.0015369516,"about_ca_system_score_gemma":0.002707505,"threshold_uncertainty_score":0.051374257},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018220056,0.00014540348,0.97353506,0.000338159,0.00002983459,0.00016055528,0.00012941175,0.0030191194,0.0044224416],"genre_scores_gemma":[0.24850811,0.0002227904,0.7461969,0.00027291308,0.00005151358,0.00021627964,0.0007425568,0.0006724192,0.003116474],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99824286,0.0006442616,0.0001203105,0.0003655791,0.00038043282,0.00024658936],"domain_scores_gemma":[0.99390984,0.0037648522,0.00032632987,0.0012921707,0.00062879117,0.000078025805],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001483221,0.0011053075,0.0006811883,0.0010321337,0.0009440311,0.0014697068,0.0016431209,0.0008865986,0.011286302],"category_scores_gemma":[0.0073543396,0.000664026,0.0013690509,0.001195974,0.0011557708,0.0027883374,0.0019028888,0.0020007647,0.0023012627],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00068782805,0.0004570142,0.002171104,0.00078351464,0.00011412788,0.00047229635,0.0004605929,0.15856066,0.10125558,0.11667077,0.013729085,0.60463744],"study_design_scores_gemma":[0.0001688376,0.00033154705,0.0006515931,0.000119194265,0.00007162485,0.00039995046,0.0001369925,0.72779924,0.120963775,0.12506938,0.024226101,0.00006182827],"about_ca_topic_score_codex":0.0024172522,"about_ca_topic_score_gemma":0.003368626,"teacher_disagreement_score":0.011286302,"about_ca_system_score_codex":0.0010763351,"about_ca_system_score_gemma":0.0018522965,"threshold_uncertainty_score":0.037756383},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0066361264,0.000038709066,0.99109113,0.000050769264,0.000012277987,0.000110042005,0.000044214008,0.0006525135,0.0013641999],"genre_scores_gemma":[0.22015427,0.0001735201,0.7762943,0.00020795323,0.000020011172,0.00027766248,0.00032193764,0.0003252503,0.0022251278],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9954217,0.0010322632,0.00038610084,0.0010700984,0.0015361626,0.0005535953],"domain_scores_gemma":[0.9966535,0.0010842982,0.00028456986,0.0014094791,0.00045946022,0.00010879053],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0042334828,0.0015761639,0.0009944438,0.0015330528,0.0008599505,0.001744997,0.0021685483,0.0012801796,0.0025519282],"category_scores_gemma":[0.0060421326,0.0010737487,0.0022231615,0.0007480854,0.0025591454,0.0060980474,0.0031181313,0.0022898167,0.00091452606],"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.00040413457,0.00030651983,0.002294327,0.00043546042,0.00016353792,0.000657373,0.0007871409,0.112297356,0.12286502,0.6071685,0.002543664,0.15007702],"study_design_scores_gemma":[0.00014586099,0.00031754773,0.00044100423,0.00014552251,0.00018766522,0.0006331756,0.00020071806,0.5408389,0.14855874,0.28739667,0.021008803,0.00012542661],"about_ca_topic_score_codex":0.0022738543,"about_ca_topic_score_gemma":0.0021522841,"teacher_disagreement_score":0.0042334828,"about_ca_system_score_codex":0.0013118753,"about_ca_system_score_gemma":0.002544541,"threshold_uncertainty_score":0.022389054},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020722335,0.0000874738,0.9753963,0.0000903836,0.000011817458,0.000057966547,0.00010245212,0.001882762,0.0016485542],"genre_scores_gemma":[0.38617486,0.00010874358,0.61096513,0.00008596298,0.0000143114175,0.00016881323,0.00038677364,0.00023365868,0.001861846],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993136,0.0002191012,0.00003917901,0.00012862863,0.00023299479,0.00006644862],"domain_scores_gemma":[0.9989058,0.0006985802,0.00012823485,0.00012397366,0.00012189539,0.000021452443],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008144411,0.0004950756,0.00055918354,0.0009385005,0.00046427277,0.0009998017,0.0008561609,0.00040782226,0.0053643514],"category_scores_gemma":[0.003768019,0.00032546592,0.00055156235,0.0007981966,0.00047283436,0.001363702,0.0009010436,0.00067674776,0.0005514648],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027094485,0.00010529359,0.0017353332,0.00030055744,0.000048382302,0.00017362628,0.00020934739,0.41036868,0.020683514,0.066089176,0.003743149,0.4962721],"study_design_scores_gemma":[0.000019410101,0.000059231887,0.00017705397,0.00002317405,0.000018342851,0.000041472835,0.00003027272,0.96413547,0.0072812154,0.026572278,0.0016322484,0.000009872451],"about_ca_topic_score_codex":0.002289651,"about_ca_topic_score_gemma":0.0055971155,"teacher_disagreement_score":0.0053643514,"about_ca_system_score_codex":0.0010037629,"about_ca_system_score_gemma":0.0010020618,"threshold_uncertainty_score":0.017945588},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08044564,0.00014384673,0.9139524,0.00049668376,0.00007683423,0.00009433923,0.00025761893,0.0027426623,0.0017898976],"genre_scores_gemma":[0.77182204,0.00012787184,0.2254734,0.00034519573,0.000047441583,0.0001236055,0.00035104633,0.000192187,0.0015171733],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9941703,0.0015169573,0.0005024623,0.0010673515,0.0020021335,0.0007407323],"domain_scores_gemma":[0.988704,0.0070722583,0.00091668003,0.0014963828,0.0015321021,0.00027845698],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005707455,0.0009775604,0.0010456403,0.0014285505,0.0010826142,0.0037438,0.0038935186,0.0014353845,0.0018097648],"category_scores_gemma":[0.011639005,0.0007734947,0.0026831538,0.0012289733,0.004599831,0.0074142558,0.002769614,0.0029234707,0.00020940175],"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.0010743376,0.000281448,0.0049001407,0.0005640306,0.00039514495,0.0011174987,0.0007579948,0.37928304,0.03330293,0.53062725,0.0023509145,0.045345306],"study_design_scores_gemma":[0.00016367316,0.00006104511,0.00019539184,0.000040673924,0.0001169813,0.000111705696,0.00006677661,0.80221635,0.034909695,0.1605125,0.0015589462,0.000046290326],"about_ca_topic_score_codex":0.010549986,"about_ca_topic_score_gemma":0.013205052,"teacher_disagreement_score":0.010549986,"about_ca_system_score_codex":0.0045288936,"about_ca_system_score_gemma":0.0037388625,"threshold_uncertainty_score":0.032859564},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010761269,0.00026085,0.9596384,0.00060650334,0.00021514964,0.000106723885,0.00020876757,0.0019977721,0.026204607],"genre_scores_gemma":[0.40564075,0.00041582997,0.57673484,0.00055911706,0.0002552885,0.00036002498,0.0005184693,0.00087843137,0.014637281],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980996,0.00031627493,0.00017895117,0.00046261682,0.0006056242,0.00033691383],"domain_scores_gemma":[0.9979825,0.0008406804,0.00012330749,0.0003680813,0.00054024754,0.00014518813],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014256007,0.0011787849,0.00071789394,0.0016888822,0.0023263851,0.0040940903,0.0020570387,0.0018532682,0.009305981],"category_scores_gemma":[0.0031747387,0.0009165866,0.0013934267,0.0016183648,0.0054875202,0.0058252015,0.0037522644,0.0028048826,0.001694846],"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.000031319592,0.000024954015,0.00009532812,0.00006838108,0.000007970702,0.00011007825,0.000278649,0.0016839746,0.001771705,0.9823682,0.0010478472,0.012511535],"study_design_scores_gemma":[0.000042506064,0.000041032083,0.00012796963,0.00005029413,0.00003344638,0.0002202421,0.00017158526,0.01831163,0.005523664,0.9463034,0.029126804,0.000047335718],"about_ca_topic_score_codex":0.0037617986,"about_ca_topic_score_gemma":0.0032391036,"teacher_disagreement_score":0.009305981,"about_ca_system_score_codex":0.001753519,"about_ca_system_score_gemma":0.0017782307,"threshold_uncertainty_score":0.031131625},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004908716,0.034568645,0.62190264,0.02468257,0.0011219035,0.0001128271,0.00033818817,0.0008032271,0.3115613],"genre_scores_gemma":[0.53035825,0.04706666,0.33631098,0.009570065,0.00272385,0.000737381,0.00059240457,0.00045059167,0.07218967],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9959495,0.002176174,0.00029176593,0.0004807893,0.00082630786,0.000275434],"domain_scores_gemma":[0.9958103,0.0029136254,0.00025195614,0.00051890145,0.0003457303,0.000159629],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0044723144,0.00088761596,0.00066329294,0.0024433543,0.0022144997,0.0077248765,0.0012278085,0.0019263467,0.0052780635],"category_scores_gemma":[0.0059299953,0.0006036113,0.0010248574,0.0023324701,0.01475566,0.00827771,0.0026165945,0.0040651965,0.001733778],"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.0000037698233,0.000002619331,0.000030811872,0.000042919557,0.0000035808293,0.000022759954,0.00019093405,0.00044037652,0.00005536097,0.9910047,0.0017819616,0.0064201728],"study_design_scores_gemma":[0.0000066924404,0.0000087414,0.000027692953,0.00008285593,0.0000039244796,0.000044798348,0.00006452001,0.0010115915,0.000117592215,0.9366665,0.061958775,0.0000063948382],"about_ca_topic_score_codex":0.0048230225,"about_ca_topic_score_gemma":0.0026167948,"teacher_disagreement_score":0.0077248765,"about_ca_system_score_codex":0.0048960834,"about_ca_system_score_gemma":0.003328421,"threshold_uncertainty_score":0.035523772},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006202456,0.0031783418,0.9638801,0.00041551192,0.0003438349,0.000070420036,0.00017320279,0.0016306167,0.02410554],"genre_scores_gemma":[0.24481452,0.01143053,0.69929874,0.0005072768,0.0004177015,0.0003711546,0.0011259692,0.0010641748,0.04096993],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998536,0.00033564187,0.00008428955,0.00026418763,0.000685718,0.000094109935],"domain_scores_gemma":[0.9989079,0.00072432094,0.00005415234,0.00015429406,0.00014243288,0.000016817887],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012053025,0.0010346663,0.00065727986,0.0009795495,0.00062520395,0.0017558293,0.0012099468,0.0007761254,0.0042861034],"category_scores_gemma":[0.0035790678,0.0006337004,0.001742253,0.0011353522,0.0011670353,0.0027552866,0.0009006204,0.001753721,0.0010903962],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000848366,0.00004528811,0.00031629932,0.0005727746,0.00009095496,0.00028030892,0.00039769494,0.13088365,0.01533292,0.69021696,0.00785341,0.15392491],"study_design_scores_gemma":[0.000040760468,0.00004681239,0.00018125017,0.00030481824,0.000075021606,0.00025436378,0.000044443237,0.3031365,0.020895293,0.5830956,0.09188231,0.000042786603],"about_ca_topic_score_codex":0.002535794,"about_ca_topic_score_gemma":0.0019393824,"teacher_disagreement_score":0.0042861034,"about_ca_system_score_codex":0.0013617105,"about_ca_system_score_gemma":0.0010425573,"threshold_uncertainty_score":0.014338493},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04162369,0.000035406745,0.95297575,0.00009026042,0.000021985743,0.00007840279,0.0001268696,0.0041744774,0.0008731533],"genre_scores_gemma":[0.682519,0.000099965924,0.3146016,0.000116371295,0.000043395787,0.00029514593,0.0005243072,0.00068178936,0.0011183972],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.994534,0.0020361147,0.00048472805,0.0009568813,0.0015003964,0.00048782237],"domain_scores_gemma":[0.97068393,0.021490138,0.0024748705,0.003234147,0.0018934113,0.00022343222],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0054112277,0.0007369276,0.00075636833,0.0011685593,0.00080830883,0.0014952581,0.0014289954,0.0009862662,0.0027630029],"category_scores_gemma":[0.025186203,0.0008715463,0.0016063253,0.0007559191,0.0032527463,0.0043573254,0.0021105884,0.0013710486,0.0005228439],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011050202,0.00040124325,0.013907295,0.00086861127,0.00026111762,0.0010505402,0.0016289034,0.3989237,0.084033184,0.33521912,0.0033476872,0.15925355],"study_design_scores_gemma":[0.00023237777,0.00029488083,0.0010152565,0.00008880066,0.0001768213,0.00015546079,0.00018289898,0.733105,0.10273545,0.15626656,0.005667092,0.00007942629],"about_ca_topic_score_codex":0.004427287,"about_ca_topic_score_gemma":0.0035038698,"teacher_disagreement_score":0.0054112277,"about_ca_system_score_codex":0.0012151072,"about_ca_system_score_gemma":0.0025370787,"threshold_uncertainty_score":0.02861762},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006744046,0.00005717215,0.9982162,0.000048867525,0.000031461797,0.000040610583,0.000018461724,0.00041938,0.0004933753],"genre_scores_gemma":[0.057677507,0.00025117848,0.938744,0.00017350275,0.00008518658,0.00045663674,0.00017804139,0.0003739892,0.0020600122],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98406625,0.0039675795,0.0010001688,0.0012192094,0.009300784,0.00044590235],"domain_scores_gemma":[0.98264045,0.008688753,0.0011808298,0.004431141,0.0027077943,0.0003509817],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006863161,0.0014244642,0.0013087429,0.0021360016,0.0006250824,0.0017616844,0.0028879067,0.0017516211,0.003374455],"category_scores_gemma":[0.02465764,0.0010481601,0.0021149695,0.001072295,0.00337689,0.003468107,0.0023891258,0.0037491356,0.0016132924],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002334464,0.00031034788,0.001015868,0.0008691459,0.00020816257,0.0007388367,0.0005263217,0.06451899,0.10894809,0.57460004,0.0057905223,0.24224027],"study_design_scores_gemma":[0.0002997882,0.0006293774,0.00059303176,0.00029835114,0.00018592857,0.0013105242,0.00009173855,0.5051165,0.12141362,0.30739406,0.062397223,0.00026988235],"about_ca_topic_score_codex":0.0007976525,"about_ca_topic_score_gemma":0.0008616282,"teacher_disagreement_score":0.006863161,"about_ca_system_score_codex":0.001115825,"about_ca_system_score_gemma":0.0023932026,"threshold_uncertainty_score":0.036296308},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029235166,0.00003377925,0.9675414,0.00006829214,0.000029482235,0.000084349005,0.00005226786,0.0005906086,0.0023646846],"genre_scores_gemma":[0.5899654,0.00013552175,0.40718868,0.00010034824,0.000052696763,0.0002981065,0.00029531828,0.00021002715,0.0017539281],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99744713,0.0005749526,0.00017450399,0.00044781063,0.0011565628,0.00019897001],"domain_scores_gemma":[0.99736434,0.0013141118,0.0002790335,0.00053723593,0.00043487758,0.000070353584],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002045513,0.00057657214,0.0004165999,0.00073166064,0.0005238563,0.0016192987,0.0008024918,0.0006711339,0.0026518032],"category_scores_gemma":[0.0072180456,0.00035822397,0.00085356523,0.000588648,0.0028067224,0.0025754378,0.0013014389,0.0016757756,0.00058455794],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018096431,0.000073436175,0.00072318316,0.00014091337,0.000025214144,0.00018265935,0.000264842,0.03896222,0.027190676,0.8702503,0.00073583226,0.06126973],"study_design_scores_gemma":[0.00007429038,0.00020563608,0.0001789665,0.000040572508,0.000045897832,0.00023320784,0.0001076718,0.267521,0.11718055,0.6073777,0.0069986884,0.000035757406],"about_ca_topic_score_codex":0.0007295304,"about_ca_topic_score_gemma":0.0008746343,"teacher_disagreement_score":0.0026518032,"about_ca_system_score_codex":0.0008733985,"about_ca_system_score_gemma":0.0019423742,"threshold_uncertainty_score":0.010817826},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035378292,0.00007309973,0.962026,0.00007866328,0.00002241991,0.00007458131,0.00013449497,0.0009906573,0.0012217391],"genre_scores_gemma":[0.6584253,0.0002999542,0.33867928,0.00007059735,0.00005002661,0.00039519527,0.0008042789,0.0003755101,0.00089985365],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99638784,0.00097293744,0.00029526578,0.00056025886,0.0014419298,0.00034168336],"domain_scores_gemma":[0.98153573,0.013774159,0.001881071,0.0016104252,0.0009960968,0.00020256532],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036961245,0.0007266984,0.0005909917,0.0011372053,0.00051965617,0.0021684635,0.0013293739,0.0009157411,0.0025270213],"category_scores_gemma":[0.021973675,0.00072711747,0.0013525446,0.0007530599,0.002417825,0.0029837892,0.0014939266,0.0017415076,0.0003416681],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007796005,0.00018677111,0.00576976,0.00070928596,0.00015509732,0.0010086067,0.0010189468,0.23695666,0.07798895,0.5466238,0.001452402,0.12735014],"study_design_scores_gemma":[0.00028662264,0.00030767955,0.0011416941,0.00015115176,0.0001599782,0.00026968002,0.00016197885,0.60096055,0.09309347,0.29758662,0.005809411,0.000071078706],"about_ca_topic_score_codex":0.0021173167,"about_ca_topic_score_gemma":0.0027609738,"teacher_disagreement_score":0.0036961245,"about_ca_system_score_codex":0.00088047585,"about_ca_system_score_gemma":0.0019214209,"threshold_uncertainty_score":0.019547224},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14098357,0.00020196561,0.8303678,0.0005834357,0.00007623239,0.00009216585,0.00062816625,0.00061790925,0.026448712],"genre_scores_gemma":[0.8348084,0.00036008708,0.15198408,0.0002046866,0.00009999096,0.00022081613,0.0014714177,0.00028003953,0.010570441],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972045,0.000374092,0.00018592956,0.00064231,0.0011333067,0.00045978898],"domain_scores_gemma":[0.99489874,0.0025211293,0.00071430975,0.00080497033,0.00070694584,0.00035381387],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010101253,0.00075613626,0.0013797481,0.001481278,0.0009391848,0.0055357264,0.0014435332,0.00068947097,0.0033177494],"category_scores_gemma":[0.007246126,0.0007420226,0.0010194076,0.001586752,0.0038519497,0.005721321,0.0018681715,0.0028349308,0.000741526],"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.00026415568,0.00009064199,0.00074124045,0.00014868964,0.00004596567,0.00021974149,0.000326071,0.03646696,0.00707384,0.9244968,0.0014487368,0.028677167],"study_design_scores_gemma":[0.000034923305,0.00009328686,0.0005584506,0.000043476186,0.000023942515,0.00021116876,0.00023919407,0.13534856,0.00924567,0.84950656,0.0046546697,0.00004020115],"about_ca_topic_score_codex":0.0025039823,"about_ca_topic_score_gemma":0.0017787928,"teacher_disagreement_score":0.0055357264,"about_ca_system_score_codex":0.0015627362,"about_ca_system_score_gemma":0.0011285486,"threshold_uncertainty_score":0.011338472},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034225695,0.00010585178,0.9570048,0.00047464707,0.000051993244,0.00027637393,0.00007010361,0.0018560044,0.005934551],"genre_scores_gemma":[0.45819417,0.00013452311,0.5370593,0.00025488253,0.00003317579,0.00034088548,0.00026615825,0.00031788237,0.0033990804],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99635714,0.0016767049,0.00021187833,0.0004656967,0.0009108435,0.00037766786],"domain_scores_gemma":[0.98919964,0.00791902,0.00076939224,0.0009768162,0.0008561857,0.00027880544],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038819443,0.00066001894,0.00046926158,0.0008319792,0.0007426419,0.0014643379,0.0014828884,0.0007475683,0.0035855526],"category_scores_gemma":[0.01601358,0.00054234365,0.00060180237,0.00068717595,0.0021075937,0.0016916984,0.0013347378,0.0010027268,0.0005201738],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012243983,0.00046946702,0.00525443,0.00062688824,0.00011960504,0.0027059459,0.0029738566,0.29010218,0.03357996,0.2232845,0.007941163,0.4317176],"study_design_scores_gemma":[0.00031406415,0.00034757765,0.0008630972,0.00013076644,0.0001066262,0.00048608123,0.0005138063,0.7766513,0.03598205,0.16731389,0.017226439,0.00006429712],"about_ca_topic_score_codex":0.004065621,"about_ca_topic_score_gemma":0.0043267477,"teacher_disagreement_score":0.004065621,"about_ca_system_score_codex":0.0010177438,"about_ca_system_score_gemma":0.0025059315,"threshold_uncertainty_score":0.020529926},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009496147,0.0036330782,0.9736188,0.0023147755,0.0003204739,0.0001030561,0.000115169525,0.0003892581,0.018555744],"genre_scores_gemma":[0.08006047,0.00954105,0.8950462,0.0024541293,0.0010167569,0.0011226793,0.0007738583,0.0004048493,0.009580078],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99373674,0.0031439539,0.00055849703,0.00065645686,0.0016523892,0.00025180008],"domain_scores_gemma":[0.99073994,0.0056394422,0.0007207108,0.0014990971,0.0010873709,0.00031338286],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0070571424,0.0016862947,0.001018698,0.0028526224,0.0012531852,0.004282704,0.0017853124,0.0026841403,0.005528688],"category_scores_gemma":[0.012335217,0.0009874414,0.0018108289,0.002813469,0.0055916854,0.009920407,0.0033727346,0.0064939247,0.0020953165],"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.0000055611467,0.000010983257,0.0000554524,0.00009847774,0.0000107649985,0.000057656645,0.00025290516,0.0016139626,0.00033314942,0.97849977,0.0018433015,0.017218055],"study_design_scores_gemma":[0.00001162974,0.00002184402,0.000054518703,0.00018685829,0.000013513308,0.000102839665,0.00011159968,0.0053714,0.00046842228,0.911342,0.08229463,0.000020644457],"about_ca_topic_score_codex":0.001996747,"about_ca_topic_score_gemma":0.0016736997,"teacher_disagreement_score":0.0070571424,"about_ca_system_score_codex":0.0023590478,"about_ca_system_score_gemma":0.0026665626,"threshold_uncertainty_score":0.037322223},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018302258,0.00020758259,0.9760484,0.00033615972,0.00003607599,0.00014836193,0.0005216483,0.0021537747,0.0022457726],"genre_scores_gemma":[0.5171297,0.00042478694,0.47723776,0.0002995028,0.000044920173,0.0005755032,0.0013521058,0.000269048,0.002666569],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968929,0.0014397161,0.0002022262,0.00047041787,0.0007262969,0.00026835062],"domain_scores_gemma":[0.9914077,0.0070806597,0.00042566264,0.00063712837,0.00035380025,0.00009500046],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024952022,0.0010015158,0.0012160249,0.0015948664,0.0008468981,0.0021688545,0.0018415361,0.0014177327,0.004079639],"category_scores_gemma":[0.011528856,0.0008534465,0.0024123725,0.0013503483,0.0022539254,0.0024889163,0.0023697093,0.0016710486,0.0004369269],"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.00025348918,0.00010367124,0.00185824,0.00032296637,0.0002022787,0.00041232933,0.0001838224,0.81983113,0.00462761,0.13723914,0.0014747855,0.033490445],"study_design_scores_gemma":[0.000042968535,0.000024589857,0.00007484411,0.00002091002,0.000028709906,0.000038201375,0.000014608339,0.9630975,0.0030648576,0.032467525,0.0011164504,0.000008775522],"about_ca_topic_score_codex":0.008411084,"about_ca_topic_score_gemma":0.013584259,"teacher_disagreement_score":0.008411084,"about_ca_system_score_codex":0.0021084493,"about_ca_system_score_gemma":0.0028977466,"threshold_uncertainty_score":0.016724229},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006352574,0.00009345411,0.98897666,0.00014938384,0.000034666184,0.00006933571,0.00003333121,0.00050452637,0.003786103],"genre_scores_gemma":[0.30339086,0.00045549864,0.6890493,0.00044548392,0.00013914955,0.0009675267,0.00019723871,0.00057080097,0.0047841445],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99006337,0.0034738947,0.0011293686,0.0014556685,0.0030771922,0.0008005227],"domain_scores_gemma":[0.96415275,0.02218617,0.0020623538,0.0074330736,0.003228435,0.00093718537],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007352488,0.0014300689,0.0011757951,0.0014681905,0.0019790395,0.0040810267,0.002887554,0.0024923969,0.0045324164],"category_scores_gemma":[0.0312511,0.0014719506,0.0028641326,0.0015672924,0.0075369333,0.012403652,0.006972949,0.0067479233,0.0008990408],"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.000061052735,0.00006141726,0.00079719804,0.00011808673,0.000024526134,0.00032615956,0.0009800224,0.022559086,0.0029769645,0.9566241,0.00055059383,0.01492076],"study_design_scores_gemma":[0.000060594768,0.00004489895,0.00014358979,0.00008425115,0.000053429936,0.00024610985,0.00012706278,0.1702741,0.009392851,0.8037095,0.015813189,0.000050302424],"about_ca_topic_score_codex":0.0032463432,"about_ca_topic_score_gemma":0.002727482,"teacher_disagreement_score":0.007352488,"about_ca_system_score_codex":0.0019578144,"about_ca_system_score_gemma":0.002507385,"threshold_uncertainty_score":0.038884103},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003956828,0.00004901011,0.992428,0.000209222,0.0000328494,0.00008313757,0.000085971544,0.0012657437,0.0018891577],"genre_scores_gemma":[0.20936365,0.0001799756,0.78640306,0.00021417152,0.00006575167,0.00043935483,0.0004290483,0.00060579006,0.0022992124],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99544156,0.0015657736,0.00038042528,0.00046012568,0.0016760118,0.0004760757],"domain_scores_gemma":[0.995142,0.0018147359,0.0003848182,0.0015629559,0.0009605264,0.00013499086],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004727198,0.00078223215,0.0007706845,0.0018385199,0.0013340254,0.0041213296,0.0024951322,0.001816644,0.003628587],"category_scores_gemma":[0.007184517,0.0008776627,0.0017481594,0.0007795024,0.004883074,0.004068219,0.0024446598,0.0029962442,0.00086394],"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.00009770356,0.00011617267,0.00056181586,0.00032456635,0.000048832662,0.00041224,0.00091485743,0.05679014,0.010844657,0.9078429,0.0016680823,0.020378135],"study_design_scores_gemma":[0.00015636125,0.00018129559,0.0004268532,0.0002594323,0.00014611548,0.0003905907,0.00038180474,0.40426934,0.038118634,0.49550897,0.060032852,0.00012780541],"about_ca_topic_score_codex":0.003569598,"about_ca_topic_score_gemma":0.0025224665,"teacher_disagreement_score":0.004727198,"about_ca_system_score_codex":0.0022890433,"about_ca_system_score_gemma":0.003835911,"threshold_uncertainty_score":0.025000095},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00034730762,0.00008592408,0.9940743,0.00004115329,0.000067949324,0.0000694374,0.000052830434,0.0011088393,0.004152279],"genre_scores_gemma":[0.0151774315,0.00023691374,0.9680769,0.000086945496,0.00005397148,0.00025009958,0.00024907297,0.00095408707,0.014914608],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986953,0.00020798006,0.00010277003,0.00035652675,0.00051617227,0.000121251105],"domain_scores_gemma":[0.9988066,0.0005402772,0.00004016468,0.0003106898,0.00025256682,0.000049816812],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012886224,0.0015798016,0.00095038,0.0015338616,0.0014546016,0.0022288423,0.0015881049,0.000895878,0.021032225],"category_scores_gemma":[0.0031758135,0.0013908413,0.0022244747,0.001148715,0.0019943586,0.0036530592,0.0021038004,0.0030397854,0.0071358164],"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.00014023857,0.00009405578,0.00013823684,0.0004422132,0.00004691163,0.00019826398,0.0006916744,0.004688824,0.019125022,0.55101264,0.019867973,0.403554],"study_design_scores_gemma":[0.00016867302,0.00008221885,0.0001623798,0.00026503956,0.00013339546,0.0009270162,0.00015396772,0.079323605,0.048800875,0.59844714,0.27143502,0.0001007061],"about_ca_topic_score_codex":0.002936303,"about_ca_topic_score_gemma":0.003992303,"teacher_disagreement_score":0.021032225,"about_ca_system_score_codex":0.0011023355,"about_ca_system_score_gemma":0.0018020708,"threshold_uncertainty_score":0.07035977},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011763473,0.00011393075,0.98477834,0.00012587338,0.000015513499,0.00006333526,0.000020363892,0.00040056763,0.0027187173],"genre_scores_gemma":[0.65213174,0.00041985314,0.344086,0.00006188252,0.000017195698,0.00038552808,0.00009153532,0.00008144356,0.0027248196],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994611,0.00018060984,0.000040341452,0.000084348816,0.00017899185,0.000054575892],"domain_scores_gemma":[0.9992193,0.00046348132,0.00011179362,0.0000862214,0.000086062195,0.00003301939],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010568298,0.0005083757,0.00051333883,0.00036529667,0.00034664795,0.0012943612,0.0012119614,0.0006290223,0.0010306564],"category_scores_gemma":[0.0017287879,0.00035932226,0.00085282215,0.0002486183,0.001406094,0.00073641835,0.0010636445,0.0006791092,0.0001300358],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042638912,0.00004591866,0.00045622428,0.00011768546,0.000039515744,0.00016374339,0.00023058665,0.89043,0.007074312,0.07672165,0.00032404935,0.024353756],"study_design_scores_gemma":[0.000023786068,0.000035571065,0.000058318707,0.000012701349,0.000015693962,0.000022331478,0.00001382931,0.98316646,0.0022669926,0.012625297,0.0017513608,0.000007685976],"about_ca_topic_score_codex":0.0036715916,"about_ca_topic_score_gemma":0.0034027677,"teacher_disagreement_score":0.0036715916,"about_ca_system_score_codex":0.00085995335,"about_ca_system_score_gemma":0.0014516783,"threshold_uncertainty_score":0.0073004365},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02929065,0.00013330765,0.96536404,0.00015782361,0.000040383446,0.00018425215,0.000050048853,0.0012259355,0.003553484],"genre_scores_gemma":[0.3378244,0.00022614516,0.659596,0.00009850799,0.000023482846,0.00030824848,0.00022226955,0.00033857653,0.001362357],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99396163,0.002938485,0.00042547646,0.00045688095,0.0019477038,0.0002697187],"domain_scores_gemma":[0.97811925,0.018046035,0.0009916248,0.0015813932,0.0010664809,0.00019531333],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034191501,0.0010246983,0.0007189137,0.0014412414,0.00039325864,0.0012324889,0.0013428426,0.0010160413,0.0034689016],"category_scores_gemma":[0.020333968,0.00051710854,0.00097047846,0.0008427207,0.002687552,0.0013256314,0.0012886635,0.0011525634,0.00043585215],"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.00046496693,0.00040633374,0.0025198855,0.0014008431,0.00013329246,0.0024731846,0.0016040471,0.37007156,0.06394895,0.25644284,0.0015920919,0.29894197],"study_design_scores_gemma":[0.000290099,0.00053325284,0.0004544211,0.00031048435,0.00013142222,0.0007119994,0.00022872206,0.7795263,0.10315093,0.100452416,0.014154347,0.0000556152],"about_ca_topic_score_codex":0.001137638,"about_ca_topic_score_gemma":0.0011548976,"teacher_disagreement_score":0.0034689016,"about_ca_system_score_codex":0.0008257232,"about_ca_system_score_gemma":0.0012571358,"threshold_uncertainty_score":0.01808238},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011247624,0.000041827585,0.98541,0.00003670427,0.000012954875,0.000038129292,0.000015493442,0.00019335788,0.003003866],"genre_scores_gemma":[0.63449836,0.00028399462,0.36121064,0.00007542416,0.000012905103,0.00024293305,0.00010431658,0.000099680554,0.0034717456],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99948466,0.000098090444,0.000033171593,0.00011260142,0.00021220032,0.0000592944],"domain_scores_gemma":[0.99923444,0.0003303893,0.00010043435,0.00014902682,0.00014118433,0.00004464345],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065391685,0.00050192315,0.00051938725,0.00041619482,0.0004687177,0.00075601594,0.0006657271,0.00059334014,0.002981074],"category_scores_gemma":[0.0019687675,0.0003110393,0.00060834485,0.00019946726,0.0011586518,0.00080655195,0.0016819703,0.0008928967,0.000538542],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000753513,0.00004829405,0.0006092369,0.00026006927,0.000032074826,0.00018332286,0.0003211552,0.73028964,0.02955307,0.15753947,0.0005475879,0.0805407],"study_design_scores_gemma":[0.000017029748,0.00011381325,0.00010630417,0.000039937848,0.000009637945,0.000065680375,0.00007261763,0.9313172,0.011472987,0.052291814,0.0044748816,0.00001809995],"about_ca_topic_score_codex":0.0006459912,"about_ca_topic_score_gemma":0.000696518,"teacher_disagreement_score":0.002981074,"about_ca_system_score_codex":0.00042057663,"about_ca_system_score_gemma":0.0005715638,"threshold_uncertainty_score":0.009972632},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04076321,0.00023966897,0.9534947,0.0003867347,0.000049097234,0.00015851638,0.000062515894,0.0012210184,0.0036244628],"genre_scores_gemma":[0.4791893,0.000304299,0.5169249,0.00033632896,0.0000385201,0.00042062762,0.0002640371,0.00024491857,0.0022771247],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99659747,0.0016549419,0.00021962548,0.00040789062,0.0008443316,0.0002757265],"domain_scores_gemma":[0.9894593,0.0076914257,0.0005037771,0.0015976585,0.0006262388,0.00012171251],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039550937,0.0011639196,0.0011251715,0.0012305446,0.0011733779,0.0018456674,0.0019178542,0.0015242854,0.002774532],"category_scores_gemma":[0.012725026,0.0009748241,0.0014455506,0.0010503973,0.0023453082,0.0033020268,0.0015380511,0.002039443,0.0005518965],"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.0010281046,0.00039423304,0.0038607125,0.00049114425,0.0001375771,0.00076554314,0.0008076222,0.4164992,0.028301246,0.25082135,0.0032483325,0.29364488],"study_design_scores_gemma":[0.00012228383,0.00023752116,0.00027714486,0.000074946984,0.00008965395,0.00016900584,0.000105605235,0.8414881,0.028760573,0.123741485,0.0048915707,0.000042117008],"about_ca_topic_score_codex":0.0030958343,"about_ca_topic_score_gemma":0.00567557,"teacher_disagreement_score":0.0039550937,"about_ca_system_score_codex":0.0009902196,"about_ca_system_score_gemma":0.0024997934,"threshold_uncertainty_score":0.02091682},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.055764865,0.00006815468,0.93885624,0.00012213549,0.00002295996,0.00011683082,0.00019107072,0.0037720217,0.0010857596],"genre_scores_gemma":[0.7406991,0.00014473055,0.25647026,0.0001141727,0.000024418976,0.00028145537,0.00049060344,0.0006188789,0.0011562649],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973104,0.00086321984,0.00014545498,0.00044250878,0.0009203424,0.0003181216],"domain_scores_gemma":[0.98718333,0.009333836,0.0009469644,0.0017305111,0.0006581789,0.0001471165],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019459133,0.0011091945,0.00089222274,0.00087303156,0.00074773753,0.0015715342,0.001696505,0.0008249442,0.0021929846],"category_scores_gemma":[0.009460491,0.0006110351,0.0018926158,0.0005385081,0.0017635293,0.003589449,0.0013375661,0.0014748051,0.00025460048],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006566648,0.00024159696,0.0054859463,0.00044191914,0.00022595921,0.00060949725,0.00048990315,0.7639799,0.042010866,0.07076989,0.0017282672,0.11335953],"study_design_scores_gemma":[0.00005489689,0.000041607713,0.00013102272,0.000016252781,0.00003279372,0.00005278602,0.000020049514,0.9677278,0.014271432,0.017047543,0.0005921445,0.000011752156],"about_ca_topic_score_codex":0.017970938,"about_ca_topic_score_gemma":0.025267515,"teacher_disagreement_score":0.017970938,"about_ca_system_score_codex":0.0020261307,"about_ca_system_score_gemma":0.0035454351,"threshold_uncertainty_score":0.035732687},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033710543,0.00008695833,0.95870817,0.00014694252,0.00003753638,0.0001813211,0.00015894927,0.004200744,0.0027689054],"genre_scores_gemma":[0.66475403,0.00019641648,0.33115128,0.00015053082,0.000033706758,0.00046823538,0.00053909264,0.0005392045,0.002167584],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98956597,0.0032985117,0.000704275,0.0013227003,0.004139001,0.00096957985],"domain_scores_gemma":[0.9843099,0.008572187,0.0010388775,0.004171767,0.0017559824,0.00015120272],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0053747394,0.001007308,0.0009441629,0.0009869011,0.00084902236,0.0012571729,0.0021198126,0.0012978325,0.0042233113],"category_scores_gemma":[0.020880427,0.00093385734,0.0020073997,0.0006172227,0.002715444,0.0041536414,0.00391774,0.001731369,0.0007527346],"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.0006244,0.00021367852,0.004532999,0.0007942296,0.00022213286,0.001105858,0.0015664597,0.23197511,0.09436446,0.5286492,0.0037794327,0.13217199],"study_design_scores_gemma":[0.00024852238,0.00019679753,0.0005526292,0.00011612849,0.00009284911,0.00028527516,0.00012401961,0.76880145,0.07910016,0.140133,0.0102893915,0.000059729446],"about_ca_topic_score_codex":0.004328254,"about_ca_topic_score_gemma":0.0042554215,"teacher_disagreement_score":0.0053747394,"about_ca_system_score_codex":0.0015536745,"about_ca_system_score_gemma":0.0029185752,"threshold_uncertainty_score":0.02842468},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04329016,0.000049067097,0.9528658,0.00012306384,0.000019497451,0.00015623291,0.0003490663,0.0021791423,0.0009679657],"genre_scores_gemma":[0.41761827,0.000155079,0.57995796,0.00012596235,0.000025140702,0.00042278285,0.00071309,0.00024121521,0.00074046594],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9936186,0.001968578,0.000627814,0.0011510534,0.002184979,0.00044900354],"domain_scores_gemma":[0.9780783,0.015366849,0.0023736777,0.0017006592,0.0023269698,0.00015343266],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0051952205,0.00075977336,0.0006059232,0.0009142212,0.0006778351,0.0019450133,0.0014261527,0.00079005037,0.0022029066],"category_scores_gemma":[0.023823028,0.00058407814,0.0012331489,0.0008578639,0.0018336079,0.002269204,0.0007849146,0.001126896,0.00035764833],"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.00084594474,0.0002964814,0.0059138606,0.0010503908,0.0002758255,0.0010431813,0.0008035432,0.64317775,0.08590541,0.122927755,0.0020760593,0.13568373],"study_design_scores_gemma":[0.00022398362,0.0001960174,0.0005673104,0.000065515684,0.00007602127,0.00019257415,0.00009948288,0.8884348,0.077258304,0.02960416,0.0032380188,0.000043739106],"about_ca_topic_score_codex":0.0074335923,"about_ca_topic_score_gemma":0.007028718,"teacher_disagreement_score":0.0074335923,"about_ca_system_score_codex":0.0012687112,"about_ca_system_score_gemma":0.0040551834,"threshold_uncertainty_score":0.027475238},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032998705,0.00007534398,0.9948264,0.00007924225,0.000015726062,0.00015035,0.0000343199,0.0011019164,0.0004168983],"genre_scores_gemma":[0.14467388,0.00016925625,0.8528836,0.00012071526,0.000028408589,0.0003603449,0.00021627426,0.00034300293,0.0012045612],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9789969,0.00896518,0.0018675003,0.0020456454,0.007346843,0.0007779822],"domain_scores_gemma":[0.9667351,0.016063506,0.0022172628,0.009066759,0.005553764,0.00036363487],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.016700272,0.0007802366,0.0009399112,0.0019555963,0.0010019743,0.004989014,0.0045376453,0.0016102922,0.0025736147],"category_scores_gemma":[0.03379002,0.0013494156,0.0018756015,0.00085677614,0.0033708261,0.005534204,0.0034295109,0.0028301978,0.00081864867],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031775335,0.0002596761,0.0027985866,0.00067657535,0.00024925813,0.0011002946,0.001956821,0.098673105,0.04003146,0.6685079,0.002149668,0.18327892],"study_design_scores_gemma":[0.00018915244,0.00032854205,0.0005103659,0.00030027423,0.00021992177,0.0008065061,0.00029614771,0.67609835,0.10941981,0.17327902,0.038398277,0.00015365289],"about_ca_topic_score_codex":0.0023708774,"about_ca_topic_score_gemma":0.0014198661,"teacher_disagreement_score":0.016700272,"about_ca_system_score_codex":0.0017267993,"about_ca_system_score_gemma":0.0036178967,"threshold_uncertainty_score":0.08832049},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01239344,0.0037216684,0.94162846,0.015480458,0.0008164738,0.0000604171,0.00006569219,0.0012020149,0.024631437],"genre_scores_gemma":[0.52976793,0.00512124,0.44422844,0.006164012,0.00090420083,0.00033577182,0.00027162605,0.0011234331,0.012083312],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9912718,0.0040176185,0.0003242372,0.0016943607,0.002164107,0.0005277737],"domain_scores_gemma":[0.98325676,0.009767579,0.00058945623,0.0041061398,0.0017761221,0.0005039305],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0105892215,0.0013938461,0.0010242546,0.0020564818,0.0024785555,0.007866693,0.0035513667,0.00470873,0.0085213445],"category_scores_gemma":[0.023001634,0.0013258612,0.0018983515,0.0008373301,0.024557855,0.033455797,0.008203592,0.008382514,0.0018339254],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004498228,0.000025799243,0.00018487708,0.00014245529,0.00001369247,0.00006174962,0.0010204831,0.0031024516,0.00074442365,0.97349936,0.0015482802,0.019611567],"study_design_scores_gemma":[0.000032582248,0.00008893974,0.00008864539,0.000154816,0.000018289575,0.00014008353,0.0005327351,0.017595658,0.0016664787,0.91783226,0.061804637,0.000044832435],"about_ca_topic_score_codex":0.0026655481,"about_ca_topic_score_gemma":0.0010333434,"teacher_disagreement_score":0.0105892215,"about_ca_system_score_codex":0.003202459,"about_ca_system_score_gemma":0.0023479783,"threshold_uncertainty_score":0.056001842},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03984863,0.0005788585,0.956593,0.00021351606,0.000042073327,0.000058646125,0.00004942004,0.00029336967,0.0023226202],"genre_scores_gemma":[0.71801966,0.0014611596,0.27368444,0.00020291869,0.00019808863,0.00033540692,0.000371919,0.00028454923,0.005441934],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99751353,0.0006786921,0.00013504748,0.0006714587,0.0007911464,0.00021011509],"domain_scores_gemma":[0.98860896,0.008685871,0.0007921034,0.0009020932,0.0008905832,0.00012042818],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026414858,0.0006578013,0.0007798025,0.0016287302,0.0011110981,0.0014550262,0.0011070627,0.0008112708,0.0027130186],"category_scores_gemma":[0.013094544,0.00044700468,0.0013398412,0.0013300868,0.002022082,0.0038617088,0.0008584085,0.0011623612,0.00021188133],"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.00017401253,0.000115011535,0.009397413,0.00063287874,0.00013555225,0.00060798554,0.0011114357,0.2860247,0.020959726,0.5710647,0.0008758353,0.10890082],"study_design_scores_gemma":[0.000028319142,0.000125573,0.0014179612,0.000098960096,0.00012531114,0.0002884451,0.00016926405,0.7699132,0.016052194,0.20348267,0.008259714,0.000038432463],"about_ca_topic_score_codex":0.0026193473,"about_ca_topic_score_gemma":0.0016568438,"teacher_disagreement_score":0.0027130186,"about_ca_system_score_codex":0.0019112435,"about_ca_system_score_gemma":0.0013877506,"threshold_uncertainty_score":0.01396966},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008282005,0.00008441733,0.9891031,0.00020197025,0.0000217006,0.00005980453,0.00007316951,0.0012153499,0.0009585603],"genre_scores_gemma":[0.26376554,0.0002932121,0.73242944,0.00035201866,0.000050499297,0.00032827238,0.00035497584,0.00047497824,0.0019510104],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99684083,0.0010579297,0.00023459794,0.0004628634,0.0011107965,0.0002930045],"domain_scores_gemma":[0.9915348,0.0058590807,0.00046820857,0.0010857031,0.0009413781,0.00011076273],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035225614,0.0009956269,0.0010521319,0.0018416159,0.0007836979,0.0022428178,0.0023064197,0.0011627781,0.0023363438],"category_scores_gemma":[0.014613087,0.00087488524,0.0023809648,0.0011307924,0.0034519501,0.004311657,0.003175069,0.00360023,0.00050385686],"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.00028296962,0.00012389374,0.0018022401,0.00037153502,0.00010855908,0.0005676065,0.0007786249,0.34424058,0.011755285,0.5619836,0.0022301946,0.075754926],"study_design_scores_gemma":[0.000056206583,0.000038294667,0.000060385057,0.000050196788,0.0000342585,0.00006637562,0.000054462227,0.70616823,0.010427728,0.27957433,0.0034462966,0.000023194414],"about_ca_topic_score_codex":0.0057248077,"about_ca_topic_score_gemma":0.0064339126,"teacher_disagreement_score":0.0057248077,"about_ca_system_score_codex":0.0019926215,"about_ca_system_score_gemma":0.0023251139,"threshold_uncertainty_score":0.018629313},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010180635,0.00009691878,0.9871553,0.000038979546,0.000029471836,0.000048700233,0.000017520837,0.00046199592,0.0019703829],"genre_scores_gemma":[0.48921537,0.00026103706,0.5079868,0.00007301055,0.000030294243,0.00024075556,0.00011584233,0.00010547937,0.0019714776],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99926144,0.00012865223,0.00005853065,0.00012493588,0.00036905013,0.000057381596],"domain_scores_gemma":[0.9993376,0.00041107036,0.000065747736,0.00008742417,0.000080082515,0.000018040375],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000751398,0.0007055404,0.00047776045,0.00041444236,0.00033214575,0.0006981595,0.0006625781,0.0005264598,0.0021187337],"category_scores_gemma":[0.0017643899,0.00032616235,0.00054927083,0.00027721256,0.0007825617,0.0006521185,0.0005703848,0.0008654613,0.00023436142],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011530107,0.00007233725,0.00031430964,0.00036927706,0.000058083715,0.00017960451,0.0003117606,0.6607093,0.059515513,0.16702093,0.00066080556,0.11067275],"study_design_scores_gemma":[0.00004797832,0.00010602218,0.00007067734,0.000026367663,0.000030135969,0.00003605572,0.000026776686,0.9342749,0.021761235,0.038446713,0.0051602763,0.000012779297],"about_ca_topic_score_codex":0.0009645871,"about_ca_topic_score_gemma":0.0013962607,"teacher_disagreement_score":0.0021187337,"about_ca_system_score_codex":0.0005670846,"about_ca_system_score_gemma":0.0007088698,"threshold_uncertainty_score":0.0070878863},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043434348,0.0005241051,0.9275628,0.00035752298,0.00007304223,0.00010087175,0.0003727533,0.0023645042,0.025210112],"genre_scores_gemma":[0.8019946,0.00076898717,0.18035382,0.00010276289,0.0001450782,0.00022208196,0.0011258338,0.0011081385,0.014178729],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99752206,0.0005192118,0.00012372437,0.00033405772,0.0011948381,0.00030618368],"domain_scores_gemma":[0.99422944,0.0039151134,0.00032184625,0.0008294071,0.00061492505,0.00008930557],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012615763,0.0011246487,0.00092812575,0.0023068003,0.0008097571,0.0023391296,0.0013961582,0.00069489825,0.011384968],"category_scores_gemma":[0.008758079,0.00062614103,0.0015641765,0.0019600014,0.002799437,0.0035213716,0.0017392683,0.001961864,0.0014241488],"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.0003253471,0.00007813806,0.0015361855,0.00047176023,0.00009691238,0.00029737942,0.00057101314,0.113085985,0.013680471,0.75209033,0.0033886903,0.11437777],"study_design_scores_gemma":[0.000023788098,0.00004547025,0.0005549102,0.00008961453,0.000066479544,0.00008411218,0.00009662557,0.35814154,0.015644467,0.6193876,0.0058399714,0.000025412437],"about_ca_topic_score_codex":0.0013956479,"about_ca_topic_score_gemma":0.0014611079,"teacher_disagreement_score":0.011384968,"about_ca_system_score_codex":0.0015774365,"about_ca_system_score_gemma":0.0013844715,"threshold_uncertainty_score":0.038086474},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004995574,0.00016356229,0.9910874,0.0001600378,0.00007582395,0.00005148739,0.00009857622,0.00020762165,0.0031600005],"genre_scores_gemma":[0.27920896,0.00063942117,0.714026,0.00024632493,0.00017467968,0.00042521372,0.000426247,0.00018382358,0.004669331],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979937,0.0008813971,0.00019173273,0.0002843496,0.0005391039,0.00010967695],"domain_scores_gemma":[0.9974306,0.0017692511,0.00016647202,0.00028429678,0.0002642964,0.00008499356],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002206491,0.0005176258,0.0005130419,0.0010204293,0.0007582374,0.0019692115,0.0006796855,0.00084553583,0.0070385695],"category_scores_gemma":[0.0058746603,0.00022131698,0.00085557986,0.0011183977,0.00143254,0.0022918198,0.0011114082,0.0014903729,0.001015347],"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.00004970439,0.000022341435,0.00017559732,0.0001041286,0.000010041927,0.0001325539,0.00018936401,0.013219499,0.0025175381,0.9399857,0.0010793656,0.042514138],"study_design_scores_gemma":[0.000029547176,0.000035317975,0.00010288399,0.000048882317,0.000016747703,0.00012543684,0.00005877996,0.09381793,0.0043404107,0.8751828,0.02622043,0.00002081671],"about_ca_topic_score_codex":0.0006688521,"about_ca_topic_score_gemma":0.00065766246,"teacher_disagreement_score":0.0070385695,"about_ca_system_score_codex":0.0009165075,"about_ca_system_score_gemma":0.00074054266,"threshold_uncertainty_score":0.023546338},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0039186664,0.000042424257,0.9945246,0.000032304357,0.000020092197,0.000017125984,0.000017538368,0.00033567043,0.0010916211],"genre_scores_gemma":[0.21875188,0.00024351195,0.77567244,0.0001306907,0.00006618385,0.00013438136,0.00017343451,0.00069295254,0.0041344874],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987331,0.0004507125,0.000115872936,0.00020085747,0.00042087623,0.000078564626],"domain_scores_gemma":[0.9978435,0.001151302,0.00010210711,0.000638712,0.00021664926,0.000047765676],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015915767,0.0008718972,0.00091662415,0.0010744685,0.0005157595,0.0008842528,0.0017283058,0.00078800827,0.0041987635],"category_scores_gemma":[0.0051211673,0.00050694676,0.0018876888,0.000611463,0.0010881356,0.0035132577,0.0025646042,0.0019431501,0.00087414985],"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.00025237916,0.00025965122,0.0023601393,0.00035926493,0.00024590868,0.00033438078,0.00032930708,0.36053014,0.04069717,0.287288,0.0018078168,0.30553582],"study_design_scores_gemma":[0.00002617431,0.00005395909,0.0001958961,0.000022395996,0.00004013538,0.000052807096,0.0000129958225,0.9290023,0.009616749,0.0578133,0.003145936,0.000017332779],"about_ca_topic_score_codex":0.0015468672,"about_ca_topic_score_gemma":0.0023735927,"teacher_disagreement_score":0.0041987635,"about_ca_system_score_codex":0.00047899873,"about_ca_system_score_gemma":0.0007113883,"threshold_uncertainty_score":0.014046252},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0048960303,0.0005498045,0.968983,0.0007151734,0.00015795424,0.00039722346,0.00078239234,0.0044151624,0.019103281],"genre_scores_gemma":[0.26156908,0.0011960767,0.71998376,0.0007041687,0.00025315618,0.00094049645,0.0015236307,0.0006361894,0.013193405],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99368894,0.0024672602,0.0006383394,0.001099984,0.0014942999,0.00061103463],"domain_scores_gemma":[0.99328774,0.0043610185,0.00062810944,0.0006596324,0.00084747677,0.00021604754],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006001117,0.0014084304,0.00084676465,0.0018653558,0.0010290311,0.004875117,0.002237837,0.0013990992,0.014012952],"category_scores_gemma":[0.012215553,0.00073561806,0.0019107969,0.0011722182,0.0026215706,0.005442495,0.0017699207,0.0025178003,0.0043479665],"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.0002107827,0.00010556322,0.00030891207,0.0002834966,0.00006316586,0.00031272037,0.00030321666,0.02527643,0.0027661757,0.9129814,0.006215912,0.051172305],"study_design_scores_gemma":[0.0003279786,0.000106443425,0.00011734466,0.00017861385,0.00013177545,0.00031197126,0.00010851758,0.23869854,0.01641679,0.66838163,0.07513456,0.00008582041],"about_ca_topic_score_codex":0.0031260177,"about_ca_topic_score_gemma":0.0025881776,"teacher_disagreement_score":0.014012952,"about_ca_system_score_codex":0.0024390507,"about_ca_system_score_gemma":0.0032782198,"threshold_uncertainty_score":0.04687804},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011268362,0.00015217773,0.99330974,0.00031938197,0.000103116006,0.000112455105,0.00014322248,0.0009517887,0.0037811946],"genre_scores_gemma":[0.08119834,0.0007390454,0.90972275,0.00061174604,0.00025556562,0.0012310359,0.0010202031,0.00079800346,0.004423312],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9887117,0.0042177862,0.002247497,0.0011463922,0.0030113065,0.00066522305],"domain_scores_gemma":[0.99036086,0.0037600875,0.00096061715,0.0025227128,0.0019647423,0.00043097243],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009548809,0.0017764601,0.0012973968,0.0023498836,0.0016607163,0.008070885,0.0039779884,0.0030161778,0.0053002955],"category_scores_gemma":[0.014169874,0.0013779537,0.0035665128,0.0025219554,0.0049312324,0.0124244355,0.0037097933,0.004648354,0.0025219123],"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.000012989414,0.0000128940965,0.000052857424,0.000078235105,0.000010864879,0.00008266545,0.0003967463,0.0031874992,0.0006995643,0.9885754,0.000998746,0.005891635],"study_design_scores_gemma":[0.000036524027,0.000047387104,0.000028255849,0.000121289704,0.00003380718,0.00021451976,0.00015053991,0.032214113,0.0034959032,0.8856237,0.077994354,0.000039572344],"about_ca_topic_score_codex":0.0022632384,"about_ca_topic_score_gemma":0.0016982993,"teacher_disagreement_score":0.009548809,"about_ca_system_score_codex":0.002759572,"about_ca_system_score_gemma":0.0033008282,"threshold_uncertainty_score":0.05049956},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007235272,0.00008984369,0.98930687,0.00004239082,0.000023037468,0.00009149608,0.0001504286,0.0014937074,0.0015668024],"genre_scores_gemma":[0.14512967,0.00015928323,0.8505046,0.000052372478,0.0000142283,0.00017574457,0.00082503713,0.000264887,0.0028742685],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986303,0.00018653396,0.00014120516,0.00027002126,0.00063373876,0.00013827739],"domain_scores_gemma":[0.99864167,0.0005134902,0.00010358689,0.00038715478,0.00032447142,0.000029568699],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00095732766,0.0009294899,0.0009234832,0.0014880961,0.00067974447,0.0010486696,0.0009560324,0.00051569584,0.004051495],"category_scores_gemma":[0.0030478174,0.0005818729,0.001386977,0.001317432,0.0007967938,0.0020197136,0.0016502724,0.0008441653,0.0010655918],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031076814,0.0001291299,0.0017311728,0.00052946,0.00012068723,0.00024760675,0.00022912136,0.12779605,0.036371488,0.07964474,0.0042968965,0.74859285],"study_design_scores_gemma":[0.000117043724,0.00012829913,0.0006502513,0.000061288025,0.0001470156,0.00029828877,0.00007699398,0.74322504,0.11981543,0.102876194,0.03253949,0.000064652784],"about_ca_topic_score_codex":0.0021427344,"about_ca_topic_score_gemma":0.002494749,"teacher_disagreement_score":0.004051495,"about_ca_system_score_codex":0.0008395663,"about_ca_system_score_gemma":0.0016994268,"threshold_uncertainty_score":0.013553619},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027185245,0.000059016922,0.9896936,0.00013880932,0.000057759033,0.0000993546,0.00019655073,0.0027007358,0.004335722],"genre_scores_gemma":[0.21436648,0.0004415876,0.7714992,0.00040098905,0.0001248371,0.0007622582,0.0019717102,0.0029491875,0.0074837683],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99226636,0.0029179112,0.0008847241,0.0011300356,0.0022733298,0.0005276421],"domain_scores_gemma":[0.99227166,0.0029089954,0.0005171857,0.0030656375,0.0010814631,0.00015499379],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004621891,0.0010306004,0.0008115291,0.0014142267,0.0008898697,0.0043677804,0.003178822,0.0015500173,0.0062420308],"category_scores_gemma":[0.013722133,0.0010527516,0.002605784,0.001400643,0.003059934,0.00585825,0.0043987534,0.0024538997,0.0023962294],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007999341,0.000041776926,0.00034357948,0.00019437964,0.000033925946,0.00022860353,0.000610499,0.016556134,0.0037612147,0.9337261,0.0034237825,0.04100006],"study_design_scores_gemma":[0.000046464476,0.00006752397,0.00008968647,0.00010247333,0.000040878134,0.000212815,0.00015469472,0.13490522,0.01609719,0.78603375,0.06221093,0.000038377548],"about_ca_topic_score_codex":0.0026707405,"about_ca_topic_score_gemma":0.0023772903,"teacher_disagreement_score":0.0062420308,"about_ca_system_score_codex":0.002274904,"about_ca_system_score_gemma":0.0027372115,"threshold_uncertainty_score":0.02444321},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036627654,0.00006806032,0.95713264,0.00009856211,0.00003266619,0.00008031887,0.00004831877,0.0022432238,0.0036685492],"genre_scores_gemma":[0.67755884,0.00012355964,0.31776655,0.0001224964,0.000041705774,0.00031721275,0.0002165811,0.00035868207,0.0034944438],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963492,0.0017246244,0.00034519556,0.000330434,0.0009517975,0.00029865067],"domain_scores_gemma":[0.99164516,0.0061628507,0.00046791026,0.0007289224,0.00084516086,0.00015004711],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028445798,0.0006049362,0.00043334308,0.0009770343,0.0006393903,0.0022306333,0.0015500535,0.0014489216,0.0035723604],"category_scores_gemma":[0.007638761,0.0004985233,0.00091066543,0.00056298455,0.0019874005,0.0028109404,0.0018113875,0.001405812,0.00079876377],"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.00037513024,0.00035263438,0.003744381,0.0004114004,0.00008099071,0.0013728716,0.0017916008,0.073543936,0.046468828,0.81884086,0.0016029631,0.05141434],"study_design_scores_gemma":[0.00015474277,0.0002970986,0.0003255123,0.00017982276,0.000099458724,0.0006513596,0.00023386662,0.61682945,0.09205977,0.26753697,0.021560537,0.000071453076],"about_ca_topic_score_codex":0.0006967487,"about_ca_topic_score_gemma":0.00075826125,"teacher_disagreement_score":0.0035723604,"about_ca_system_score_codex":0.0009256623,"about_ca_system_score_gemma":0.0011077606,"threshold_uncertainty_score":0.015043795},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014278562,0.00024124746,0.98033077,0.00023191358,0.000028960281,0.0000631729,0.00007903349,0.00037425366,0.0043720943],"genre_scores_gemma":[0.6564489,0.00074205035,0.3353741,0.00017353857,0.00014331596,0.00037623593,0.00036799937,0.00030597174,0.0060679354],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975847,0.0010229195,0.00013242556,0.00023209138,0.0008244008,0.00020340904],"domain_scores_gemma":[0.99538594,0.0032472662,0.00029632365,0.00043375007,0.00053292833,0.00010391063],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021067897,0.0010276091,0.00055376923,0.0017056763,0.0010121448,0.0022788274,0.0014655698,0.00095027627,0.0061479583],"category_scores_gemma":[0.007246047,0.00048644614,0.0014644021,0.0011965061,0.004257212,0.0031198869,0.0024934676,0.002430107,0.00057479605],"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.00007528484,0.00008102838,0.00056056515,0.00024151464,0.000072231414,0.00026814573,0.00046009844,0.19109367,0.004039552,0.7824804,0.0006454404,0.019981991],"study_design_scores_gemma":[0.000027156548,0.000029360202,0.0001008036,0.000058329075,0.000036226742,0.000056686993,0.00006204954,0.49449342,0.0047407006,0.49576104,0.0046183635,0.000015878146],"about_ca_topic_score_codex":0.003648085,"about_ca_topic_score_gemma":0.0025512269,"teacher_disagreement_score":0.0061479583,"about_ca_system_score_codex":0.003008023,"about_ca_system_score_gemma":0.0025729977,"threshold_uncertainty_score":0.021824837},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03427515,0.0005842879,0.94946414,0.00011784646,0.00007276391,0.000060841074,0.00016259695,0.0006755472,0.014586861],"genre_scores_gemma":[0.6351042,0.0010428617,0.3489565,0.00006560855,0.00013885011,0.00018834048,0.0004729193,0.00017504623,0.013855647],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994129,0.00017212695,0.000051881983,0.000112996284,0.00018091228,0.00006928277],"domain_scores_gemma":[0.99903905,0.00048083693,0.0001166799,0.00019824009,0.000114112096,0.000051040217],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00096043065,0.00055190787,0.00034740707,0.0005885981,0.00040312708,0.0021255,0.0013704252,0.00061092933,0.004208764],"category_scores_gemma":[0.0022573369,0.0005476051,0.0008091122,0.00067308405,0.001140067,0.0042362595,0.0010648658,0.00095881644,0.00072240084],"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.000088041605,0.000051600957,0.00050012197,0.00011124506,0.000020880867,0.00022373152,0.0004963516,0.061933205,0.0050609736,0.905342,0.0007113453,0.025460484],"study_design_scores_gemma":[0.000039135295,0.00009153156,0.00027931275,0.00006866841,0.00005494316,0.0002203109,0.00016958534,0.30305287,0.007798702,0.6680506,0.020140555,0.000033877404],"about_ca_topic_score_codex":0.0010358879,"about_ca_topic_score_gemma":0.0011948182,"teacher_disagreement_score":0.004208764,"about_ca_system_score_codex":0.0006527826,"about_ca_system_score_gemma":0.00054618716,"threshold_uncertainty_score":0.01407975},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.054398514,0.004846321,0.922314,0.0006894812,0.0000660366,0.0004090493,0.000082037295,0.0006352947,0.016559282],"genre_scores_gemma":[0.33256721,0.0041376743,0.65847766,0.00016345696,0.000047106056,0.00059180404,0.00034007127,0.00032286916,0.0033521657],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9661936,0.021423686,0.0024583328,0.0008316468,0.008517216,0.0005754634],"domain_scores_gemma":[0.8594215,0.12465028,0.0029365364,0.00542779,0.0070499736,0.0005139193],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.03161673,0.00057974044,0.00055438903,0.0030055887,0.0008817465,0.002727381,0.0013195253,0.0011180622,0.0048264363],"category_scores_gemma":[0.055939566,0.00057413545,0.0011317472,0.0036036647,0.0020897544,0.0035933803,0.0011901236,0.0014221999,0.00048277748],"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.0007092504,0.00033018837,0.006409102,0.0022831394,0.00015064582,0.00023876796,0.005720106,0.044164542,0.007952457,0.4233593,0.0019174177,0.5067652],"study_design_scores_gemma":[0.0006865684,0.0041297395,0.014245503,0.004373696,0.0005517395,0.0023799657,0.009863559,0.45819864,0.04500598,0.19496751,0.26517645,0.00042069584],"about_ca_topic_score_codex":0.002520386,"about_ca_topic_score_gemma":0.0022466797,"teacher_disagreement_score":0.03161673,"about_ca_system_score_codex":0.0022888866,"about_ca_system_score_gemma":0.0025046447,"threshold_uncertainty_score":0.16720724},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00065849617,0.000111196074,0.99688655,0.00004784664,0.00003416212,0.000039142196,0.00005739325,0.00034114343,0.0018240381],"genre_scores_gemma":[0.019319845,0.00029472553,0.9765277,0.00008267914,0.000043933847,0.00017920915,0.0003422691,0.00025244383,0.002957202],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99763906,0.0006546314,0.00020659712,0.000458783,0.0008391381,0.00020180477],"domain_scores_gemma":[0.9986407,0.0004010437,0.000072827526,0.00040114086,0.0004254254,0.00005875118],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016096652,0.0012360346,0.0009122294,0.0024350074,0.0006721353,0.0014585917,0.0015044493,0.00086151564,0.0064488724],"category_scores_gemma":[0.0032159265,0.000800635,0.0031014287,0.0014448108,0.0009140374,0.0027423122,0.0024413688,0.003152993,0.003068578],"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.00017782982,0.00021550184,0.00070301234,0.00057392835,0.00015423608,0.00039935525,0.00042421577,0.12333357,0.041083276,0.43059313,0.010350979,0.391991],"study_design_scores_gemma":[0.000059747876,0.000060812523,0.00030705385,0.00010924302,0.00010063593,0.00032346806,0.000045539087,0.74356174,0.010508935,0.19402984,0.050841223,0.000051716255],"about_ca_topic_score_codex":0.0028476678,"about_ca_topic_score_gemma":0.003658058,"teacher_disagreement_score":0.0064488724,"about_ca_system_score_codex":0.0009557547,"about_ca_system_score_gemma":0.0017291526,"threshold_uncertainty_score":0.021573603},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024572033,0.000028280521,0.9730555,0.000058020007,0.000016366152,0.00007595382,0.00005376013,0.0009948234,0.0011453438],"genre_scores_gemma":[0.49301592,0.00010103822,0.50447553,0.00008572745,0.00002076255,0.00028553346,0.00024760104,0.00024485425,0.0015231356],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968579,0.00089890364,0.00027075544,0.0004814902,0.001198485,0.00029260016],"domain_scores_gemma":[0.99501246,0.0027335219,0.00043592125,0.001142993,0.00061358744,0.00006153041],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039397236,0.000870418,0.00050900027,0.0010784946,0.0006632307,0.0009550375,0.0015846685,0.00071809714,0.0026639781],"category_scores_gemma":[0.0073311473,0.0005341277,0.0016624817,0.0006083495,0.0033794553,0.003686991,0.0015285013,0.0015092726,0.0003981231],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002998365,0.00021765963,0.0012532162,0.00034906823,0.00006073433,0.0004758748,0.00052499236,0.17396563,0.05509895,0.6804253,0.0009722768,0.086356506],"study_design_scores_gemma":[0.00014969578,0.0003065711,0.00035454097,0.000053746462,0.000053524825,0.0002463986,0.000061514285,0.66061205,0.092354216,0.23855573,0.007169555,0.00008248448],"about_ca_topic_score_codex":0.0022455289,"about_ca_topic_score_gemma":0.0012341453,"teacher_disagreement_score":0.0039397236,"about_ca_system_score_codex":0.0012193751,"about_ca_system_score_gemma":0.002366787,"threshold_uncertainty_score":0.02083546},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026768941,0.00008809744,0.9689279,0.00015307326,0.00005206595,0.00012398424,0.00013732813,0.0017033607,0.0020452866],"genre_scores_gemma":[0.60553205,0.00017289296,0.39117438,0.0000846873,0.000027389679,0.00027383945,0.00032908563,0.00026679828,0.0021388815],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958853,0.0015950794,0.0003427146,0.00040848384,0.0013503133,0.00041805295],"domain_scores_gemma":[0.98688823,0.0091434885,0.00082304067,0.0016056362,0.0013682657,0.0001713956],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0042809597,0.0008246809,0.0008751733,0.0011710648,0.0007660153,0.0017721311,0.0016478029,0.0012802199,0.003703713],"category_scores_gemma":[0.015920954,0.0008334348,0.0017062991,0.00044146585,0.0028229014,0.00195421,0.0025168243,0.0016036243,0.00049183064],"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.00036448563,0.00010718137,0.0015819372,0.00037502346,0.00009442193,0.0003467398,0.00029332848,0.65959907,0.01271552,0.2757965,0.00075109553,0.04797472],"study_design_scores_gemma":[0.00008230068,0.00005634245,0.00013363751,0.000054845823,0.00003641824,0.00004857398,0.000036687707,0.90394455,0.014885258,0.077743575,0.0029568376,0.00002100286],"about_ca_topic_score_codex":0.004937566,"about_ca_topic_score_gemma":0.004545691,"teacher_disagreement_score":0.004937566,"about_ca_system_score_codex":0.0012713912,"about_ca_system_score_gemma":0.0028949676,"threshold_uncertainty_score":0.022640109},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011225564,0.00005202157,0.99462104,0.00006119738,0.000035772522,0.00014312066,0.000048547598,0.0015697982,0.0023459077],"genre_scores_gemma":[0.035876386,0.00012430726,0.95916986,0.00007572982,0.000026157024,0.0004945802,0.0003027405,0.0006403173,0.0032899063],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99675936,0.0008268434,0.0002968047,0.00057138846,0.0012691201,0.00027642402],"domain_scores_gemma":[0.99728405,0.0011027956,0.00010514648,0.001027551,0.00043048552,0.000050005794],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024130475,0.0014854246,0.0009857992,0.0021121746,0.0014226123,0.0030051703,0.0023450905,0.0012735255,0.012650498],"category_scores_gemma":[0.0060652783,0.0010491038,0.0016900942,0.0017440892,0.001571707,0.0041445037,0.0031550648,0.0027193036,0.003952215],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022534333,0.00021908325,0.0005035386,0.00036191958,0.00011410602,0.00034714103,0.0002759077,0.04741732,0.016606905,0.35591418,0.012679753,0.56533474],"study_design_scores_gemma":[0.00024077395,0.00016947706,0.0002692751,0.00012318166,0.00013782724,0.0009730625,0.0001415167,0.49997246,0.049554866,0.35719904,0.09108079,0.00013768312],"about_ca_topic_score_codex":0.0011609299,"about_ca_topic_score_gemma":0.0011494046,"teacher_disagreement_score":0.012650498,"about_ca_system_score_codex":0.0013041676,"about_ca_system_score_gemma":0.0022311076,"threshold_uncertainty_score":0.042320132},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0042624334,0.0096620275,0.122397274,0.006570011,0.01627298,0.0009011742,0.0045647295,0.0077808453,0.82758856],"genre_scores_gemma":[0.08297422,0.0141675295,0.041267797,0.0032345182,0.004011139,0.0008133998,0.012777222,0.0034156463,0.8373385],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997554,0.000631653,0.00021449183,0.00050330523,0.000910054,0.0001864074],"domain_scores_gemma":[0.99493533,0.0015907778,0.00025210335,0.0014873892,0.0013997722,0.00033454434],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0022897753,0.0012695065,0.0011577515,0.0016960494,0.0011759906,0.0035104405,0.001249197,0.0010321941,0.43016812],"category_scores_gemma":[0.010081403,0.0005802515,0.0011272347,0.0022295467,0.0011691098,0.003350815,0.0029316312,0.001629266,0.19981337],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026229283,0.000086867316,0.00037658738,0.0017839968,0.00003803641,0.00033436992,0.00036837984,0.0016113503,0.0034242943,0.13757338,0.47082797,0.38331246],"study_design_scores_gemma":[0.000019736115,0.00006427995,0.0001879929,0.00023511799,0.000014748013,0.00016826826,0.00006266713,0.0005006364,0.00072231033,0.013737192,0.9842758,0.000011199535],"about_ca_topic_score_codex":0.0016416633,"about_ca_topic_score_gemma":0.00237964,"teacher_disagreement_score":0.43016812,"about_ca_system_score_codex":0.0025225638,"about_ca_system_score_gemma":0.002035836,"threshold_uncertainty_score":0.812796},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004086492,0.00032906057,0.98855644,0.0007994407,0.00006020386,0.000068185305,0.000055068056,0.0006227624,0.005422496],"genre_scores_gemma":[0.31855157,0.0012470352,0.67378587,0.0007851718,0.0002373339,0.00041480068,0.00032643904,0.00036238864,0.0042894036],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9937125,0.0021044787,0.0002782293,0.0006670448,0.002919392,0.00031826217],"domain_scores_gemma":[0.9870854,0.009694752,0.00054740073,0.0017442682,0.0007645924,0.00016357811],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004200664,0.0010903629,0.0009221103,0.0019308378,0.0006272664,0.0035306634,0.0022190877,0.0015802123,0.0032130384],"category_scores_gemma":[0.015450723,0.00059955183,0.0017894632,0.0012782095,0.0043945014,0.005553229,0.0024900106,0.0029932589,0.00047721452],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047823978,0.00008160293,0.0004223002,0.00018087075,0.00003210661,0.00012388447,0.00017278899,0.058137167,0.0033027576,0.890506,0.0012508214,0.0457418],"study_design_scores_gemma":[0.000037696183,0.00005104974,0.00010145215,0.00011055965,0.00003228602,0.00015474194,0.000032930755,0.32121778,0.0064424393,0.661204,0.010592063,0.000023078139],"about_ca_topic_score_codex":0.00258762,"about_ca_topic_score_gemma":0.0017218728,"teacher_disagreement_score":0.004200664,"about_ca_system_score_codex":0.0025373527,"about_ca_system_score_gemma":0.0018769152,"threshold_uncertainty_score":0.022215545},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005723897,0.000082603045,0.9915677,0.0001505893,0.00002257389,0.00018569228,0.0000546916,0.0008224935,0.0013897864],"genre_scores_gemma":[0.11712251,0.0002807633,0.8807742,0.00007429172,0.000022589362,0.0006218364,0.00027089106,0.00016470253,0.0006681684],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9728205,0.01269505,0.0017947182,0.0012731004,0.010814646,0.0006019863],"domain_scores_gemma":[0.9541224,0.028972782,0.0036737185,0.007022614,0.0057282257,0.00048030482],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.017040197,0.002029814,0.0010304487,0.002807657,0.0010690836,0.0044648093,0.0039719264,0.0023323714,0.0024742256],"category_scores_gemma":[0.05256343,0.0011933242,0.0018030737,0.0012566139,0.0034653347,0.007440981,0.0021313508,0.0034830235,0.0005841088],"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.00025309325,0.00047937964,0.003415754,0.0009391255,0.0002601389,0.0003915694,0.0011251476,0.44383943,0.025279505,0.40218034,0.0014242458,0.12041215],"study_design_scores_gemma":[0.0000966983,0.000566586,0.00044094888,0.00036133084,0.00018060247,0.00031799782,0.0003448029,0.822176,0.04066097,0.121152446,0.013553418,0.0001481912],"about_ca_topic_score_codex":0.00300537,"about_ca_topic_score_gemma":0.0020499015,"teacher_disagreement_score":0.017040197,"about_ca_system_score_codex":0.0033755824,"about_ca_system_score_gemma":0.004893904,"threshold_uncertainty_score":0.09011823},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.057350125,0.00021665604,0.9121958,0.0006058945,0.0001330481,0.00007861083,0.0001913705,0.00072502583,0.028503377],"genre_scores_gemma":[0.5971721,0.00038933448,0.37510833,0.00022496127,0.0001512166,0.00020986423,0.00051873724,0.0004441237,0.025781237],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989454,0.00028573556,0.000083355226,0.00015293184,0.00037117087,0.00016140474],"domain_scores_gemma":[0.997954,0.0016399305,0.00009755384,0.00010939618,0.00012858147,0.00007045737],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012461477,0.00069708907,0.0008599074,0.00047588674,0.00072971993,0.0023678613,0.0013307977,0.0008346647,0.010382292],"category_scores_gemma":[0.0043712654,0.00079922826,0.0014089644,0.00080671336,0.0022660193,0.0031536974,0.0023955149,0.003042703,0.0010665165],"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.00006317558,0.00005430103,0.00025200803,0.00018119444,0.000030663174,0.00015205314,0.00038163725,0.0628087,0.0018097151,0.900078,0.0020044972,0.032184064],"study_design_scores_gemma":[0.000060115286,0.000024026549,0.00004447579,0.000027157781,0.000011686567,0.000055139375,0.00017556178,0.17604381,0.0026328843,0.81626385,0.004644902,0.000016321505],"about_ca_topic_score_codex":0.001979356,"about_ca_topic_score_gemma":0.0025222194,"teacher_disagreement_score":0.010382292,"about_ca_system_score_codex":0.0010558175,"about_ca_system_score_gemma":0.0010051242,"threshold_uncertainty_score":0.034732223},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028333797,0.0001762376,0.98876953,0.00019290292,0.00014696192,0.00011561373,0.00011582219,0.0016657835,0.00598373],"genre_scores_gemma":[0.08278589,0.00044719156,0.9085692,0.00032579803,0.00016482432,0.00032328608,0.00043645682,0.0005104576,0.0064367745],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.995961,0.0009365225,0.00039937525,0.00036255424,0.0019843157,0.0003562325],"domain_scores_gemma":[0.9958104,0.0021042686,0.00033373298,0.00065649307,0.0009318385,0.00016335763],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008207604,0.0006190107,0.0009896891,0.0022631139,0.0013525737,0.0026543734,0.0018653681,0.00168251,0.003929259],"category_scores_gemma":[0.009115773,0.00092532183,0.002193574,0.0015847643,0.002856496,0.0031587337,0.0019239556,0.0023791895,0.0015511513],"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.00006031512,0.0000509756,0.00019738337,0.00018857242,0.00003155981,0.0004440478,0.0003815645,0.024628866,0.0042034322,0.9293912,0.0036742305,0.03674779],"study_design_scores_gemma":[0.0001826582,0.00007406774,0.00023158637,0.00018494285,0.000089737354,0.00048165902,0.00011805983,0.19031526,0.012251619,0.65693533,0.13902125,0.00011387079],"about_ca_topic_score_codex":0.0044824844,"about_ca_topic_score_gemma":0.003391464,"teacher_disagreement_score":0.008207604,"about_ca_system_score_codex":0.0019012124,"about_ca_system_score_gemma":0.0016859816,"threshold_uncertainty_score":0.043406487},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014868349,0.00006397962,0.9829039,0.00004527905,0.000015464064,0.00005452349,0.00011389851,0.00053819455,0.001396491],"genre_scores_gemma":[0.33582208,0.00019923964,0.661792,0.00006413781,0.000028259106,0.00027292033,0.00039498316,0.00022661,0.0011997293],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982856,0.0003811667,0.000110082125,0.0002573472,0.000786621,0.00017918022],"domain_scores_gemma":[0.9967175,0.0020544382,0.00038336523,0.00031463837,0.0004661289,0.0000639878],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015033745,0.00076743535,0.00055593014,0.0009903946,0.00056088984,0.00090000744,0.0013087179,0.00048638126,0.0027711883],"category_scores_gemma":[0.004705064,0.0004458355,0.0009814617,0.0012284671,0.0011787994,0.0012371849,0.0008379235,0.0009593373,0.0002752951],"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.0002744133,0.000080849735,0.0020842375,0.00032850757,0.000104065286,0.00029832884,0.00018410539,0.6890154,0.03448053,0.1669367,0.0013638216,0.10484911],"study_design_scores_gemma":[0.000022024647,0.000040168947,0.0001267836,0.000013222611,0.00001896101,0.000046372483,0.000011497123,0.96626085,0.013393201,0.017914714,0.0021389958,0.000013297093],"about_ca_topic_score_codex":0.007163982,"about_ca_topic_score_gemma":0.007660675,"teacher_disagreement_score":0.007163982,"about_ca_system_score_codex":0.0010768468,"about_ca_system_score_gemma":0.0023877476,"threshold_uncertainty_score":0.014244556},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.071601674,0.000303048,0.9140744,0.00013398503,0.000048791648,0.00010303926,0.00022845133,0.001716712,0.011789864],"genre_scores_gemma":[0.42264542,0.00032024298,0.5721955,0.00008997863,0.000024612467,0.00017751337,0.00045298864,0.00018672919,0.0039070346],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995734,0.00008101432,0.00003334802,0.00006662162,0.0001842105,0.00006138374],"domain_scores_gemma":[0.99960345,0.0001865358,0.00005296958,0.00004727631,0.000096600146,0.000013102941],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028426741,0.0005234188,0.00036575893,0.00056983373,0.000271052,0.00054831064,0.00052960444,0.00036986033,0.002832279],"category_scores_gemma":[0.00087994075,0.0002257353,0.00039345308,0.00055804045,0.00027556033,0.0004965033,0.00029032797,0.00029308154,0.00041511786],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026815236,0.00014173205,0.000819226,0.0005754788,0.00004467608,0.00031425143,0.00015836902,0.29141825,0.24742413,0.06451768,0.0055137146,0.3888043],"study_design_scores_gemma":[0.00012499232,0.00022576854,0.00040192745,0.00003379822,0.000041748965,0.00015757939,0.000033055767,0.825378,0.14323626,0.015031392,0.015316585,0.000018983454],"about_ca_topic_score_codex":0.0013636267,"about_ca_topic_score_gemma":0.0027205765,"teacher_disagreement_score":0.002832279,"about_ca_system_score_codex":0.00044099306,"about_ca_system_score_gemma":0.00073825545,"threshold_uncertainty_score":0.009474993},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003484615,0.00006344657,0.98847735,0.00012576627,0.00003798727,0.000092181726,0.00011554496,0.006266947,0.0013360672],"genre_scores_gemma":[0.20120165,0.00038046748,0.7857531,0.00037829322,0.00012418749,0.0007770291,0.0011593029,0.001780865,0.008445098],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962935,0.0011145315,0.00027825797,0.00065559155,0.0013243622,0.0003337427],"domain_scores_gemma":[0.9877963,0.008132417,0.0005579513,0.0023236934,0.0010377071,0.00015202463],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004472176,0.0007934943,0.00067291694,0.0014853787,0.0009282911,0.0020898837,0.0017490367,0.0014100799,0.011076406],"category_scores_gemma":[0.0135415215,0.0007544657,0.0011268663,0.00073914806,0.0016950156,0.0043577887,0.0020834426,0.0027177227,0.0026073349],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009350381,0.00015336918,0.0015092441,0.00046387527,0.00009856535,0.00053288956,0.0006400422,0.034747228,0.05680453,0.46813393,0.014310735,0.42167053],"study_design_scores_gemma":[0.00032929733,0.0003858961,0.0005533754,0.00020212674,0.00018181547,0.0007592389,0.000087318665,0.59307575,0.17028274,0.17250337,0.061528202,0.00011083398],"about_ca_topic_score_codex":0.00153424,"about_ca_topic_score_gemma":0.0013626459,"teacher_disagreement_score":0.011076406,"about_ca_system_score_codex":0.0012694406,"about_ca_system_score_gemma":0.0019839155,"threshold_uncertainty_score":0.0370543},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07618698,0.0014119999,0.87219036,0.0067842244,0.00017671278,0.00035963045,0.0011623327,0.0039500543,0.037777744],"genre_scores_gemma":[0.72460055,0.0013656523,0.24582523,0.0025105055,0.0007330027,0.0006932676,0.0025045187,0.0017332825,0.020033866],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9849043,0.002562092,0.0007883077,0.0032081972,0.0056521483,0.0028849868],"domain_scores_gemma":[0.9015588,0.07553159,0.0029731581,0.011681019,0.0056129186,0.002642423],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010559707,0.0015780907,0.0015309367,0.0031111417,0.0027137864,0.0066533894,0.004742336,0.002158308,0.021445313],"category_scores_gemma":[0.060361344,0.0017077918,0.0034705836,0.002136216,0.0054004346,0.023732502,0.010791412,0.00883249,0.0027102062],"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.00073075877,0.00023119297,0.002544759,0.0009297327,0.00019295758,0.00030088183,0.00090349204,0.029920874,0.016219933,0.900339,0.009155342,0.038531087],"study_design_scores_gemma":[0.00014215383,0.0001370414,0.0010923314,0.00011451264,0.00024255207,0.00029077617,0.00008374617,0.16280761,0.014516683,0.8100711,0.010423299,0.00007819129],"about_ca_topic_score_codex":0.0022863052,"about_ca_topic_score_gemma":0.0028971734,"teacher_disagreement_score":0.021445313,"about_ca_system_score_codex":0.006215684,"about_ca_system_score_gemma":0.0044961576,"threshold_uncertainty_score":0.0717417},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0067028617,0.00004177107,0.99104226,0.00008831338,0.0000113083615,0.000042835476,0.000061432525,0.0006420272,0.0013672062],"genre_scores_gemma":[0.32579756,0.00016588326,0.671444,0.00009714079,0.000025060994,0.0001903672,0.0002478066,0.00013510892,0.0018970706],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992434,0.00031228986,0.000054829095,0.000104955936,0.00022885342,0.000055795394],"domain_scores_gemma":[0.9984837,0.00075659464,0.0001668666,0.0002812923,0.00027898405,0.000032585434],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011175947,0.00045605155,0.00023466817,0.0006222115,0.0002883086,0.00092494185,0.0010426333,0.0006467587,0.0029199712],"category_scores_gemma":[0.0035993287,0.00020765568,0.00043330115,0.00059253233,0.0008682308,0.0014637224,0.00048664765,0.0008319676,0.0006144669],"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.0003291528,0.00014623145,0.0009439991,0.000185948,0.000023681863,0.00034122003,0.0003525908,0.45386893,0.0446844,0.3325058,0.0024946758,0.16412337],"study_design_scores_gemma":[0.000027082238,0.00010298377,0.000069780595,0.00003616291,0.000015085443,0.000096451804,0.000019398301,0.92873925,0.022086317,0.044354875,0.0044356133,0.000016925826],"about_ca_topic_score_codex":0.0012907418,"about_ca_topic_score_gemma":0.0011915098,"teacher_disagreement_score":0.0029199712,"about_ca_system_score_codex":0.00085707096,"about_ca_system_score_gemma":0.0009382305,"threshold_uncertainty_score":0.009768307},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.050327245,0.00003687009,0.94531316,0.00007593776,0.000022645618,0.000110522495,0.000036741763,0.0024032565,0.0016735648],"genre_scores_gemma":[0.6888306,0.00005562806,0.30879495,0.00008403393,0.00001788858,0.0001977073,0.00008343446,0.00020741511,0.0017283745],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99790925,0.0005886656,0.000120923774,0.00028389797,0.00087560853,0.00022145978],"domain_scores_gemma":[0.99823016,0.0007883996,0.00022370073,0.00038084178,0.0003147834,0.00006212181],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002440931,0.00066436845,0.00052786246,0.00045635767,0.0007396354,0.00092763064,0.0010413503,0.0008431403,0.0019636669],"category_scores_gemma":[0.003079447,0.0006111547,0.0011825683,0.00018548324,0.0014986885,0.00125144,0.0013097186,0.0009943102,0.00038842697],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00082335563,0.00032287964,0.0045751473,0.0004908334,0.0001517551,0.0017156163,0.0012969568,0.35084495,0.332453,0.21771601,0.0017960585,0.0878134],"study_design_scores_gemma":[0.000112637295,0.00024334204,0.0004100998,0.00003562875,0.000088469154,0.00022153354,0.00006882806,0.7996755,0.16739121,0.026843606,0.004865238,0.00004401351],"about_ca_topic_score_codex":0.002369643,"about_ca_topic_score_gemma":0.002135646,"teacher_disagreement_score":0.002440931,"about_ca_system_score_codex":0.00066330977,"about_ca_system_score_gemma":0.0017545703,"threshold_uncertainty_score":0.012908995},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0998571,0.000051836952,0.89203614,0.00024033623,0.00005669379,0.00013892756,0.00013306172,0.0017281745,0.0057577584],"genre_scores_gemma":[0.8980882,0.00006161875,0.097691834,0.00015638841,0.000017817392,0.00011996916,0.00013793453,0.00019805186,0.003528197],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99742967,0.0006902548,0.00011372311,0.00040791504,0.0010065779,0.00035180472],"domain_scores_gemma":[0.9950932,0.003474079,0.0002517858,0.00060946256,0.00050225673,0.00006918242],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016898899,0.00044939984,0.0006178054,0.0002794823,0.00075631065,0.001129812,0.0012507227,0.001185739,0.003957164],"category_scores_gemma":[0.008356233,0.00037563566,0.0007635637,0.00016509063,0.0014768414,0.002064902,0.0011056804,0.0011923322,0.00062097335],"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.00074110343,0.00020653203,0.005109095,0.0005184763,0.00012223623,0.001602485,0.0008369187,0.3170544,0.13831851,0.46325445,0.002646165,0.06958953],"study_design_scores_gemma":[0.00013213222,0.00021903557,0.0004250544,0.00004107832,0.00004781192,0.00024845445,0.000100880156,0.8317811,0.10616898,0.053143207,0.0076559247,0.00003633033],"about_ca_topic_score_codex":0.0024085634,"about_ca_topic_score_gemma":0.0013046471,"teacher_disagreement_score":0.003957164,"about_ca_system_score_codex":0.0008434802,"about_ca_system_score_gemma":0.0019444461,"threshold_uncertainty_score":0.013238013},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002349099,0.00009725107,0.99484444,0.00003108758,0.000020879932,0.000044241282,0.000010046218,0.00056556356,0.0020373873],"genre_scores_gemma":[0.17023106,0.0002709461,0.82612956,0.00008896389,0.00005251328,0.00015047351,0.000096894204,0.00028889012,0.0026907038],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99735177,0.00045047648,0.00018875791,0.00048661648,0.0013470668,0.00017533368],"domain_scores_gemma":[0.997846,0.0011354143,0.00013031688,0.00029012767,0.00054574787,0.00005236669],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016614604,0.0007295162,0.0011873472,0.0019827217,0.0006450053,0.0021792287,0.0019770062,0.001101727,0.004806889],"category_scores_gemma":[0.0051171877,0.0005184705,0.0009651806,0.00081092614,0.0014604046,0.003138007,0.0010583022,0.0015034383,0.0012971084],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028111346,0.00014392419,0.0012194674,0.00038140512,0.00011534057,0.0006421127,0.00046166198,0.12654535,0.04541535,0.22017078,0.0032792592,0.60134417],"study_design_scores_gemma":[0.00007762895,0.00011803364,0.00024159528,0.0000819067,0.000102294565,0.0005023489,0.000055734676,0.83280945,0.049405757,0.10115949,0.015378195,0.00006757017],"about_ca_topic_score_codex":0.001395168,"about_ca_topic_score_gemma":0.0008133143,"teacher_disagreement_score":0.004806889,"about_ca_system_score_codex":0.0006922771,"about_ca_system_score_gemma":0.00087487814,"threshold_uncertainty_score":0.016080618},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18026088,0.00018064231,0.8070832,0.0008304345,0.00008379348,0.00020045802,0.00022417327,0.00303088,0.0081055295],"genre_scores_gemma":[0.9700523,0.00007717404,0.027077192,0.00008124087,0.0000360367,0.0001143944,0.00013626348,0.00030519866,0.0021201724],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9902154,0.003507143,0.00048933405,0.0009419783,0.0029561056,0.0018900374],"domain_scores_gemma":[0.9592413,0.027419038,0.002123648,0.0061656283,0.004401466,0.0006490175],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.013847731,0.001365041,0.0012230607,0.0019925162,0.0016384231,0.0034007002,0.0026992797,0.001562234,0.0056139054],"category_scores_gemma":[0.035929967,0.00075855444,0.001639084,0.00084860617,0.0052259103,0.0070035267,0.002746795,0.0025018537,0.000709011],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0021544963,0.00040114918,0.007888685,0.00052309065,0.00017934138,0.0007171217,0.0011320816,0.3531733,0.028514892,0.5640054,0.0023604936,0.03894999],"study_design_scores_gemma":[0.00008693556,0.00020549787,0.0007236692,0.000040996772,0.00011986699,0.00007666667,0.00012575582,0.83401495,0.023788923,0.1399722,0.00079790206,0.000046710516],"about_ca_topic_score_codex":0.005241044,"about_ca_topic_score_gemma":0.0031648038,"teacher_disagreement_score":0.013847731,"about_ca_system_score_codex":0.0029393535,"about_ca_system_score_gemma":0.004517208,"threshold_uncertainty_score":0.07323462},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022270897,0.00006319261,0.9626393,0.00008958059,0.000030904364,0.00013322747,0.00013292934,0.01310727,0.0015328146],"genre_scores_gemma":[0.35272226,0.00010586263,0.6435644,0.00010918829,0.000024818095,0.0002113608,0.00045465666,0.0010277661,0.0017796115],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970651,0.0013052766,0.0002162698,0.000278016,0.0008990927,0.00023626615],"domain_scores_gemma":[0.989521,0.0067588817,0.00057077827,0.0022498614,0.00078819925,0.0001111988],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030021202,0.0008275348,0.00053983356,0.0010045953,0.00033433945,0.0011339346,0.0015679402,0.00067525054,0.0037776255],"category_scores_gemma":[0.013316054,0.0006024446,0.0005427346,0.00045500352,0.000857716,0.0021051383,0.0015677365,0.0010454202,0.0011443725],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00085254625,0.00050843187,0.006173993,0.00068770756,0.00012196593,0.00081407104,0.00032268374,0.22481763,0.112542495,0.11661362,0.008363567,0.5281814],"study_design_scores_gemma":[0.00018426942,0.00022057738,0.0003692821,0.000055132303,0.00005261895,0.00025905934,0.00003071441,0.8504488,0.1159818,0.0231959,0.009173452,0.000028525417],"about_ca_topic_score_codex":0.000813705,"about_ca_topic_score_gemma":0.0013907837,"teacher_disagreement_score":0.0037776255,"about_ca_system_score_codex":0.00045796786,"about_ca_system_score_gemma":0.0012626919,"threshold_uncertainty_score":0.015876949},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013031675,0.00010732689,0.9968892,0.0000664023,0.000024294872,0.000049829403,0.000011120055,0.00044436444,0.001104334],"genre_scores_gemma":[0.056116857,0.0005357887,0.9403669,0.0002160892,0.00004148995,0.00021872044,0.00010057326,0.00027589197,0.0021276877],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99511343,0.0013746026,0.00035072945,0.0007783329,0.0021097318,0.00027304757],"domain_scores_gemma":[0.99598324,0.00168962,0.00034766077,0.0011247754,0.000791225,0.00006353244],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0051700138,0.0008040514,0.0006094005,0.001269789,0.00089913746,0.0018657277,0.00245719,0.0014174484,0.0038373708],"category_scores_gemma":[0.008318885,0.0008117089,0.0013475984,0.00069109024,0.003930823,0.0045861513,0.00197858,0.0034337007,0.0018389409],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014105123,0.000103271486,0.0008255867,0.00058430777,0.00006060709,0.00044463412,0.001110034,0.01881263,0.048199926,0.766568,0.002256723,0.16089325],"study_design_scores_gemma":[0.00023984053,0.0008316932,0.0010085966,0.00075753976,0.00029927192,0.00151904,0.00030298685,0.23510914,0.2256674,0.33771583,0.19630806,0.00024056557],"about_ca_topic_score_codex":0.0013327365,"about_ca_topic_score_gemma":0.00079835823,"teacher_disagreement_score":0.0051700138,"about_ca_system_score_codex":0.0008137492,"about_ca_system_score_gemma":0.0018477917,"threshold_uncertainty_score":0.027342021},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12417518,0.00028825976,0.86914086,0.00059569225,0.000043846667,0.00029270374,0.00038298653,0.000552195,0.0045282925],"genre_scores_gemma":[0.8615552,0.00020136831,0.13569824,0.00012650568,0.00002764863,0.0004075149,0.00040106918,0.00006930174,0.0015131704],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99831414,0.0005579247,0.00011329329,0.00026164422,0.00059383863,0.000159207],"domain_scores_gemma":[0.98718923,0.010214611,0.00071086286,0.0010599465,0.00059643656,0.00022885011],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002636338,0.0007753304,0.0008962708,0.00078377814,0.0004386314,0.0009935346,0.0011645051,0.00075584016,0.002603927],"category_scores_gemma":[0.017208051,0.00041742617,0.00057619147,0.00086413755,0.0016835852,0.0025457032,0.0016714671,0.0018389025,0.00023600277],"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.0003043413,0.00010265781,0.0007828287,0.0001515125,0.000041047206,0.0002002723,0.00020252893,0.8794257,0.0035500797,0.06704315,0.0006337887,0.047562182],"study_design_scores_gemma":[0.000043530068,0.00009582265,0.00015702742,0.000026234282,0.000011328098,0.000033779645,0.00003878673,0.9184276,0.0038921037,0.07662103,0.00064217113,0.0000107118685],"about_ca_topic_score_codex":0.0011229347,"about_ca_topic_score_gemma":0.0010336466,"teacher_disagreement_score":0.002636338,"about_ca_system_score_codex":0.0013441311,"about_ca_system_score_gemma":0.00094214146,"threshold_uncertainty_score":0.01394248},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00083175575,0.00006594731,0.9943268,0.00010480829,0.00003195418,0.000095926596,0.000042797845,0.0025278574,0.0019721924],"genre_scores_gemma":[0.038671616,0.00020679196,0.95638025,0.00017802388,0.00004007744,0.00033030738,0.00017705339,0.0005694912,0.0034463666],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99362,0.0021097865,0.0005179295,0.0004698927,0.0029087453,0.00037366003],"domain_scores_gemma":[0.995843,0.0017485796,0.00022270462,0.0013955431,0.0007255963,0.00006455615],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004153474,0.0016424763,0.001007535,0.002150811,0.0014985437,0.0030717829,0.0030346627,0.0020976178,0.008104184],"category_scores_gemma":[0.0071431273,0.0016674314,0.0029370904,0.0013272004,0.0028996293,0.0035056218,0.0038111326,0.0042073373,0.003738406],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022383485,0.00021218356,0.00072810886,0.0014767249,0.00014325192,0.0005790785,0.0009604111,0.04944478,0.04327252,0.5498527,0.009627414,0.34347898],"study_design_scores_gemma":[0.00017519474,0.00025857572,0.0002615722,0.00043092496,0.00021880097,0.0007633736,0.00017623571,0.43054652,0.08092149,0.3633827,0.1227369,0.00012773542],"about_ca_topic_score_codex":0.0027405315,"about_ca_topic_score_gemma":0.0043587717,"teacher_disagreement_score":0.008104184,"about_ca_system_score_codex":0.0015951846,"about_ca_system_score_gemma":0.0034492214,"threshold_uncertainty_score":0.027111173},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32539842,0.0004785177,0.66919655,0.00041434675,0.000018785902,0.000101901394,0.00041656315,0.00084380875,0.00313122],"genre_scores_gemma":[0.8553316,0.00035237786,0.14100793,0.00009049673,0.000023475606,0.00016329058,0.0006007506,0.00013962536,0.0022904803],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985808,0.00036253905,0.00012171915,0.00038336974,0.00034007285,0.00021139227],"domain_scores_gemma":[0.99263656,0.006326621,0.0004454763,0.00026333553,0.00020860981,0.000119331715],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013149118,0.0005209625,0.0006422021,0.00091552,0.000993962,0.0014110093,0.0010780154,0.000829241,0.0018336716],"category_scores_gemma":[0.008596687,0.0005693592,0.0010461395,0.00087904616,0.0018751677,0.0037980154,0.0018098208,0.001176636,0.00014975257],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042427657,0.000083748346,0.0034457832,0.0004768714,0.00008456811,0.0006620552,0.0013071778,0.70401835,0.01201949,0.23556888,0.0009678133,0.040940985],"study_design_scores_gemma":[0.000049284678,0.00005734334,0.0005353019,0.000044004504,0.000042020958,0.00018090293,0.00037337933,0.6556478,0.0055935928,0.336139,0.0013016865,0.00003560957],"about_ca_topic_score_codex":0.0038504773,"about_ca_topic_score_gemma":0.0023259171,"teacher_disagreement_score":0.0038504773,"about_ca_system_score_codex":0.0014202908,"about_ca_system_score_gemma":0.0010457634,"threshold_uncertainty_score":0.010304987},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05943465,0.000040369767,0.936467,0.000081001715,0.000022362592,0.000095935495,0.00008304125,0.0018242768,0.001951393],"genre_scores_gemma":[0.694782,0.00009358652,0.3015692,0.00005536749,0.000015667658,0.00030068695,0.00029098714,0.00040253496,0.0024899314],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99900824,0.00023826606,0.00007370144,0.000109975605,0.00048801818,0.000081743456],"domain_scores_gemma":[0.99729353,0.0012794379,0.00024176898,0.0007315358,0.00041119193,0.000042452724],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010983276,0.00045443265,0.0003516764,0.00056510814,0.0002724103,0.0007109647,0.0011272271,0.0006746362,0.0014316746],"category_scores_gemma":[0.004813554,0.0003430149,0.00073090335,0.00027097808,0.00093976705,0.000786584,0.0010302651,0.00079221366,0.0002817696],"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.00015885601,0.000087185326,0.0012397945,0.00018718974,0.000043931526,0.0004124422,0.00035430392,0.8114409,0.028342452,0.11869734,0.00076517573,0.038270473],"study_design_scores_gemma":[0.000025551824,0.000054853695,0.00009313316,0.000011953251,0.000014472788,0.00003994712,0.000020170235,0.9638627,0.015156254,0.019425986,0.0012866172,0.000008271985],"about_ca_topic_score_codex":0.001148029,"about_ca_topic_score_gemma":0.001309272,"teacher_disagreement_score":0.0014316746,"about_ca_system_score_codex":0.00060721184,"about_ca_system_score_gemma":0.0008715708,"threshold_uncertainty_score":0.005808592},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000742606,0.00032083594,0.99349797,0.00050578994,0.000078954385,0.00009246174,0.00009727638,0.00046731887,0.004196837],"genre_scores_gemma":[0.089743905,0.0024910965,0.89976627,0.00096684165,0.0007725658,0.0010617792,0.0006932451,0.00048818113,0.0040161856],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98062056,0.008461005,0.0014872884,0.0019752532,0.006481493,0.0009743341],"domain_scores_gemma":[0.96223885,0.029845417,0.0015930776,0.0036708668,0.0022883154,0.00036349555],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.021799285,0.0022261709,0.0014990302,0.003720627,0.0018642357,0.0073799132,0.004609067,0.0019455077,0.007764778],"category_scores_gemma":[0.033997796,0.001459405,0.0055234237,0.0027583293,0.008974642,0.008798575,0.0067931614,0.0076817134,0.0026318228],"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.000014760115,0.00004249241,0.00019278939,0.00030339486,0.000049086542,0.000183079,0.0003110491,0.0140098585,0.0006791726,0.96476614,0.001766943,0.017681286],"study_design_scores_gemma":[0.000032467884,0.000026566442,0.000088424844,0.00015579084,0.00003500853,0.00013680887,0.000049637998,0.044375133,0.0016173004,0.9322486,0.021200122,0.000034225253],"about_ca_topic_score_codex":0.002540948,"about_ca_topic_score_gemma":0.0013681268,"teacher_disagreement_score":0.021799285,"about_ca_system_score_codex":0.0034989684,"about_ca_system_score_gemma":0.0045442865,"threshold_uncertainty_score":0.115287006},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015366294,0.000016000817,0.9833872,0.000022980235,0.0000039828346,0.000024642113,0.0000106927355,0.00027927075,0.0008890717],"genre_scores_gemma":[0.5161356,0.00008935635,0.4820242,0.000045002296,0.000015349156,0.00024545912,0.00011874778,0.00013876034,0.0011875554],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99857724,0.000367855,0.000084921434,0.00016304299,0.0007079672,0.00009908495],"domain_scores_gemma":[0.9982089,0.0009194092,0.00020386034,0.0004518502,0.00016928327,0.000046698842],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010847393,0.0007448242,0.0006597922,0.00065492163,0.00050281244,0.0005993473,0.00071518,0.00048950216,0.0012230695],"category_scores_gemma":[0.0035799555,0.00043228499,0.0013307629,0.0005068253,0.0013830035,0.0011354777,0.0017067654,0.0013797304,0.00035715496],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001957548,0.0001792001,0.00093383424,0.00014735328,0.000073270334,0.0003014014,0.0003896685,0.6840257,0.060384534,0.15061316,0.00049163634,0.10226447],"study_design_scores_gemma":[0.000016532467,0.00009274055,0.00013201922,0.000011145982,0.00001762556,0.00009848484,0.000027546559,0.9270432,0.019840822,0.051542576,0.0011653991,0.000011853392],"about_ca_topic_score_codex":0.0008878079,"about_ca_topic_score_gemma":0.0010136889,"teacher_disagreement_score":0.0012230695,"about_ca_system_score_codex":0.00057708373,"about_ca_system_score_gemma":0.00080957345,"threshold_uncertainty_score":0.0057367682},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03125475,0.000072540635,0.9634889,0.00008432703,0.00003908373,0.00007842795,0.000042721782,0.002393622,0.0025456585],"genre_scores_gemma":[0.6613423,0.00006608706,0.33517608,0.000051972995,0.000023281766,0.00016553205,0.00014843023,0.0008785956,0.002147713],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9957812,0.0013030712,0.00018036336,0.0004480961,0.0017076763,0.00057958474],"domain_scores_gemma":[0.9917971,0.0042396486,0.00047193677,0.0021587983,0.0011188671,0.00021359327],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031314162,0.0011333115,0.0012487789,0.0012187898,0.001027449,0.0015829863,0.0021083069,0.00076833984,0.006038005],"category_scores_gemma":[0.012314478,0.00061487383,0.00073338026,0.0010446382,0.0029007888,0.0028511754,0.0031771935,0.0014702842,0.0010237532],"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.0018114053,0.00030743578,0.0017091937,0.0004603928,0.00009317567,0.00021345014,0.0009165719,0.48200724,0.08460415,0.14968486,0.003277542,0.27491465],"study_design_scores_gemma":[0.00020407734,0.00016834191,0.00030577905,0.000044173816,0.00006380277,0.00005324092,0.00012871562,0.87266797,0.055281147,0.06799519,0.0030469093,0.000040667823],"about_ca_topic_score_codex":0.0047732196,"about_ca_topic_score_gemma":0.0062414035,"teacher_disagreement_score":0.006038005,"about_ca_system_score_codex":0.0015985903,"about_ca_system_score_gemma":0.0027565619,"threshold_uncertainty_score":0.02019918},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017749894,0.00008466797,0.9742113,0.00014523386,0.000046360034,0.00019647875,0.00009137685,0.0048177233,0.0026569848],"genre_scores_gemma":[0.3275408,0.0003262233,0.66414165,0.00016941795,0.000024920228,0.00030636258,0.00037211538,0.0015735822,0.005545],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958182,0.002017073,0.0003759128,0.00033065755,0.0012900215,0.00016810223],"domain_scores_gemma":[0.99284744,0.0039789635,0.0005640473,0.001057503,0.0014419518,0.00011000932],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0066521536,0.0006271749,0.00052223826,0.0006497908,0.0006210408,0.0014756283,0.0010588292,0.00096815627,0.002411176],"category_scores_gemma":[0.012493963,0.0005482166,0.00088475674,0.00034293873,0.0016808314,0.0015786032,0.0011964866,0.0010139684,0.00053676526],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014304016,0.00032980755,0.004072277,0.0014914093,0.00017050817,0.004730808,0.00636768,0.22224802,0.20855136,0.30426,0.00889747,0.23745027],"study_design_scores_gemma":[0.000170121,0.00028006488,0.00044022902,0.0003343866,0.00007116033,0.00102591,0.00032422954,0.7324047,0.18544921,0.040383443,0.039000336,0.000116266296],"about_ca_topic_score_codex":0.0012060617,"about_ca_topic_score_gemma":0.0010483499,"teacher_disagreement_score":0.0066521536,"about_ca_system_score_codex":0.0009050955,"about_ca_system_score_gemma":0.001357931,"threshold_uncertainty_score":0.03518033},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010485109,0.00009476594,0.9841967,0.00019858615,0.00006530988,0.00008013404,0.000051712334,0.0017631197,0.0030644652],"genre_scores_gemma":[0.24588515,0.0002989377,0.75016135,0.00012427349,0.00003926298,0.00029231972,0.0002068054,0.0007002405,0.002291592],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9957753,0.0013261423,0.0003497078,0.00040530736,0.0018135753,0.00032996794],"domain_scores_gemma":[0.99230814,0.004003796,0.00046951088,0.0023885788,0.0007432564,0.00008672895],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0045058834,0.0007577513,0.0007549677,0.00088372594,0.0007836154,0.0024626427,0.0019254293,0.001315973,0.0051283394],"category_scores_gemma":[0.017117348,0.0009593917,0.0016942589,0.0005355901,0.0027715666,0.0033175584,0.002540566,0.0018965501,0.0013246079],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017376633,0.0001276253,0.00087293534,0.0005505298,0.00008850797,0.0003827173,0.0005946102,0.18281238,0.028637627,0.6810982,0.002588338,0.102072716],"study_design_scores_gemma":[0.00012439633,0.00012298214,0.00016311095,0.00015351684,0.000066964545,0.00016160178,0.00010718552,0.64689475,0.049800787,0.2850889,0.017270317,0.000045406334],"about_ca_topic_score_codex":0.0008536186,"about_ca_topic_score_gemma":0.0012269241,"teacher_disagreement_score":0.0051283394,"about_ca_system_score_codex":0.0012290013,"about_ca_system_score_gemma":0.0023119398,"threshold_uncertainty_score":0.023829699},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1339125,0.00009868668,0.85165954,0.00011537069,0.000044416458,0.00009693309,0.00018914323,0.0040707323,0.0098126875],"genre_scores_gemma":[0.8420525,0.00013602956,0.151334,0.000078006145,0.000016195181,0.00010886891,0.00022375591,0.00022182989,0.005828748],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999413,0.00012956485,0.000030040626,0.000095595096,0.00028083756,0.000050962706],"domain_scores_gemma":[0.9994259,0.00025636857,0.00008704552,0.00013151005,0.00008033047,0.000018832025],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071070425,0.00033157028,0.00020836292,0.00027219328,0.0004172205,0.0011754967,0.0007529297,0.0005313491,0.0024074167],"category_scores_gemma":[0.0013511459,0.0003345939,0.00047107085,0.00015871429,0.000984754,0.0009033874,0.0005693687,0.00070190174,0.0002753773],"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.00043688042,0.00015502649,0.0043359497,0.00023251123,0.00006734123,0.00096742157,0.00043109962,0.64698046,0.13791916,0.17208944,0.0012289613,0.035155796],"study_design_scores_gemma":[0.000052569958,0.00017926766,0.00061616476,0.000028239672,0.000037727066,0.00017776253,0.00004608534,0.8960509,0.07530343,0.015600465,0.011890068,0.000017343886],"about_ca_topic_score_codex":0.0037664298,"about_ca_topic_score_gemma":0.004147112,"teacher_disagreement_score":0.0037664298,"about_ca_system_score_codex":0.0006312952,"about_ca_system_score_gemma":0.0011633975,"threshold_uncertainty_score":0.008053541},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0036110713,0.00029435963,0.9883746,0.00093362486,0.000056134693,0.000045774963,0.000037046015,0.00040420447,0.006243315],"genre_scores_gemma":[0.44717902,0.0011774901,0.5453375,0.0011508961,0.0002730054,0.00043303976,0.0001871401,0.0004883017,0.0037736055],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9949149,0.0021168154,0.00032342738,0.0007321905,0.0014834148,0.00042928557],"domain_scores_gemma":[0.9887028,0.007103902,0.0006719908,0.0023998017,0.00089439296,0.00022721982],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0073876795,0.00091479457,0.00081351155,0.0020989538,0.0010783836,0.003723652,0.0030096981,0.0017884959,0.005255961],"category_scores_gemma":[0.021780994,0.0008002696,0.0018154614,0.0013236193,0.011986918,0.017311731,0.0046607535,0.0050093094,0.0009686194],"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.000016465723,0.0000193523,0.00014445871,0.000085714746,0.00001086961,0.000091144764,0.0004113307,0.0055692624,0.00073628244,0.98051524,0.0007899715,0.011609858],"study_design_scores_gemma":[0.000007360979,0.0000118259,0.000038320704,0.000031553544,0.000007142137,0.000047932004,0.00006562165,0.014637178,0.00068774435,0.9815399,0.0029154955,0.00000990119],"about_ca_topic_score_codex":0.001338757,"about_ca_topic_score_gemma":0.0010520107,"teacher_disagreement_score":0.0073876795,"about_ca_system_score_codex":0.0021655776,"about_ca_system_score_gemma":0.0014080147,"threshold_uncertainty_score":0.03907025},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009466926,0.00012528703,0.9877751,0.00005494189,0.00004049338,0.000048275193,0.000043740543,0.0017869567,0.0006583624],"genre_scores_gemma":[0.3050077,0.00012971667,0.69323903,0.00009084314,0.000025436571,0.0002628914,0.00022766266,0.00026810524,0.00074862235],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977385,0.0006844418,0.00020265114,0.00048716183,0.00072875136,0.00015851844],"domain_scores_gemma":[0.99152464,0.0058621163,0.00080484356,0.0010093362,0.00059609,0.00020295537],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021541202,0.0009684846,0.0009402435,0.0014707973,0.000714206,0.0009392944,0.0017056405,0.0013713934,0.0020826387],"category_scores_gemma":[0.0104718525,0.000638781,0.0013097472,0.0008680302,0.0020146922,0.001906238,0.0013482877,0.0014593906,0.00053570676],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013508083,0.00038644526,0.0056315064,0.0013055097,0.00024512963,0.0020047168,0.0011066601,0.18601426,0.30209568,0.11589876,0.004474169,0.37948635],"study_design_scores_gemma":[0.00024172608,0.0006678028,0.0010408151,0.00021935462,0.00019633741,0.0011007844,0.00009009708,0.75569254,0.17219344,0.05902478,0.009439356,0.00009297028],"about_ca_topic_score_codex":0.0011458877,"about_ca_topic_score_gemma":0.0010913735,"teacher_disagreement_score":0.0021541202,"about_ca_system_score_codex":0.00057054893,"about_ca_system_score_gemma":0.0011357572,"threshold_uncertainty_score":0.011392236},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36132067,0.0006150406,0.6196296,0.00022890355,0.00015490406,0.00018956665,0.00022666628,0.0047918577,0.01284269],"genre_scores_gemma":[0.94145894,0.00015126976,0.05508331,0.00009062325,0.000028287512,0.00007069939,0.00015291997,0.00025177302,0.0027121499],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99633694,0.0006991957,0.0002007878,0.00040861958,0.002120294,0.00023405845],"domain_scores_gemma":[0.9923476,0.0032694712,0.0012839034,0.0013536045,0.0015850575,0.00016041836],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014730877,0.00071618933,0.0005031195,0.0012696952,0.00042453175,0.0008221075,0.0009558671,0.0007388636,0.0026289232],"category_scores_gemma":[0.010484939,0.00021786305,0.0002830453,0.00046997966,0.0007512004,0.0019001983,0.00091044774,0.00060341426,0.00077362446],"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.0017618559,0.00034328125,0.02450864,0.0006297813,0.00015021316,0.00090482633,0.00078464154,0.10150255,0.51220375,0.031233277,0.002868373,0.32310885],"study_design_scores_gemma":[0.000058660084,0.0014334122,0.0063854647,0.00006362569,0.000053406184,0.0012097508,0.000088304354,0.2718605,0.7037661,0.007405772,0.007578875,0.00009601605],"about_ca_topic_score_codex":0.00024574876,"about_ca_topic_score_gemma":0.00028551547,"teacher_disagreement_score":0.0026289232,"about_ca_system_score_codex":0.0006869628,"about_ca_system_score_gemma":0.0003500648,"threshold_uncertainty_score":0.008794606},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.048288215,0.00011049161,0.94694716,0.00010145103,0.00003520038,0.00008587616,0.00013396057,0.0026140958,0.001683625],"genre_scores_gemma":[0.6510034,0.0001552028,0.34616786,0.00013356752,0.000046742938,0.00017944325,0.00044423682,0.00031608331,0.001553517],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996083,0.0009993451,0.0002885435,0.0009204598,0.001264497,0.00044414104],"domain_scores_gemma":[0.98972684,0.007364176,0.0009828645,0.0011493415,0.0006543419,0.0001225236],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002797944,0.0010303333,0.0008480735,0.001726786,0.00070891913,0.0017508009,0.0017050448,0.000951377,0.002679818],"category_scores_gemma":[0.010217832,0.00077613874,0.0018911859,0.0010461808,0.0027265823,0.0044385795,0.0023255795,0.0015522328,0.00030967084],"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.0017241604,0.00042023993,0.008357123,0.0009495412,0.00043945594,0.0032478445,0.0012299771,0.27668235,0.112455964,0.32397923,0.002936344,0.2675778],"study_design_scores_gemma":[0.0002556579,0.00044297928,0.0009626766,0.00008281235,0.00017957084,0.00081128255,0.00008269855,0.7296731,0.13218805,0.1310939,0.00415984,0.000067428904],"about_ca_topic_score_codex":0.002428889,"about_ca_topic_score_gemma":0.0025210727,"teacher_disagreement_score":0.002797944,"about_ca_system_score_codex":0.0013160387,"about_ca_system_score_gemma":0.0015416964,"threshold_uncertainty_score":0.014797151},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026673977,0.000050543134,0.99551696,0.00002272212,0.000011187981,0.00004753457,0.00004087233,0.00021975988,0.0014230611],"genre_scores_gemma":[0.19474274,0.0002643891,0.8011719,0.00008936234,0.00004922976,0.00047846607,0.00047909436,0.00021018072,0.0025146538],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989109,0.0003159108,0.000068606154,0.00012209766,0.00048354382,0.00009886505],"domain_scores_gemma":[0.998896,0.00052976614,0.00007428949,0.0001571169,0.0002976444,0.000045133427],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011830898,0.0013865352,0.0008694855,0.0015314332,0.0007193777,0.0009264678,0.00084148534,0.0005224653,0.005053358],"category_scores_gemma":[0.002681687,0.00052957865,0.0016419363,0.000797137,0.0012363301,0.0012299693,0.0011500682,0.0016408548,0.0016348338],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023303914,0.0001610139,0.0004202168,0.00043489638,0.000104815226,0.0002831993,0.00033248353,0.49004912,0.042947825,0.27375782,0.002722243,0.1885533],"study_design_scores_gemma":[0.000018004304,0.000049608567,0.0000604199,0.000024490546,0.000018171766,0.00003378216,0.000019621493,0.92967397,0.007212045,0.061046693,0.0018232114,0.000020096251],"about_ca_topic_score_codex":0.00235513,"about_ca_topic_score_gemma":0.0039247693,"teacher_disagreement_score":0.005053358,"about_ca_system_score_codex":0.0010984156,"about_ca_system_score_gemma":0.0012948933,"threshold_uncertainty_score":0.016905189},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0067045493,0.00021379025,0.97908247,0.00034101348,0.000058840167,0.00023794048,0.0004911962,0.0020722342,0.010798049],"genre_scores_gemma":[0.27296737,0.0011864828,0.6914028,0.0004978766,0.00013362413,0.0017221012,0.0031781585,0.001167935,0.027743673],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985323,0.00034052832,0.00023021136,0.00022804459,0.00052741304,0.00014152104],"domain_scores_gemma":[0.9986129,0.000562205,0.00017117217,0.00026599923,0.00029216585,0.00009558536],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015435853,0.0010949861,0.00047843246,0.0009769218,0.0007979977,0.00299913,0.0014660507,0.0012487979,0.0062762965],"category_scores_gemma":[0.002410419,0.000786852,0.0014383503,0.000754392,0.0017513235,0.003330978,0.0012424013,0.0015835749,0.0015741136],"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.00014611601,0.000052779546,0.0004678152,0.00022061766,0.000021188818,0.00055536476,0.0006399645,0.05959903,0.005205592,0.91422176,0.0026937895,0.01617603],"study_design_scores_gemma":[0.0001410626,0.00018022851,0.00023763382,0.00024666663,0.000078189834,0.000675952,0.00020756602,0.42904013,0.010648674,0.43185067,0.12661345,0.00007978927],"about_ca_topic_score_codex":0.0035453746,"about_ca_topic_score_gemma":0.0031176421,"teacher_disagreement_score":0.0062762965,"about_ca_system_score_codex":0.0015337988,"about_ca_system_score_gemma":0.001923201,"threshold_uncertainty_score":0.020996332},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0065223915,0.000064827174,0.98806316,0.0002246852,0.000038675353,0.00006662833,0.00001674163,0.0012150491,0.0037878817],"genre_scores_gemma":[0.43653455,0.00021455706,0.5572732,0.00026024246,0.0000430225,0.00028640172,0.000106584936,0.00039747552,0.0048839063],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985852,0.0004313914,0.00007045509,0.0001966928,0.0005693232,0.00014691426],"domain_scores_gemma":[0.9979352,0.0009238962,0.00014779893,0.00053424656,0.00031591931,0.00014302162],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011482359,0.0009960149,0.0007353006,0.0007808647,0.00073352427,0.0012674315,0.001345262,0.0013696979,0.004638767],"category_scores_gemma":[0.0067245625,0.00046655466,0.00057712174,0.00043306657,0.0013018269,0.0016710216,0.002880488,0.0019100796,0.0012158637],"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.0003911451,0.00015884166,0.0011352671,0.00018163346,0.000046315712,0.0003942437,0.00086280407,0.3756145,0.04377215,0.37040567,0.005358734,0.20167878],"study_design_scores_gemma":[0.000052007254,0.00010828394,0.000102951,0.000034744455,0.000017879098,0.00008079029,0.000071563125,0.8931796,0.009153578,0.0865659,0.010609262,0.000023390143],"about_ca_topic_score_codex":0.0020982646,"about_ca_topic_score_gemma":0.002305102,"teacher_disagreement_score":0.004638767,"about_ca_system_score_codex":0.00073043373,"about_ca_system_score_gemma":0.0015836194,"threshold_uncertainty_score":0.0155181885},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.064203165,0.00005772892,0.92452437,0.0001438036,0.000025607747,0.00015426976,0.00024393115,0.007633231,0.0030138863],"genre_scores_gemma":[0.67141944,0.00007285637,0.32437298,0.00008064511,0.000011261128,0.00023815257,0.0006254068,0.000693927,0.0024853416],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99942434,0.00017336318,0.000032399144,0.00011122598,0.00020528512,0.00005343826],"domain_scores_gemma":[0.9977278,0.0014670276,0.00019231116,0.00042279594,0.0001601638,0.000029886076],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050386676,0.0004123193,0.0002647432,0.00035799132,0.0002510089,0.0005285925,0.00052298297,0.0003523155,0.0041554486],"category_scores_gemma":[0.0033710408,0.00023804982,0.00038295667,0.0002517015,0.000534283,0.00088505354,0.000645905,0.00051986997,0.00058324396],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007853822,0.0001677346,0.005800273,0.00061160757,0.000047381116,0.001191089,0.0005155967,0.14625064,0.31558704,0.11263289,0.00458879,0.41182163],"study_design_scores_gemma":[0.00012164426,0.00022614063,0.0013285936,0.000038596783,0.000044158172,0.00041603984,0.000060571634,0.67598534,0.2721851,0.03726842,0.012293577,0.00003181046],"about_ca_topic_score_codex":0.000581141,"about_ca_topic_score_gemma":0.0010249253,"teacher_disagreement_score":0.0041554486,"about_ca_system_score_codex":0.00036146393,"about_ca_system_score_gemma":0.0005454549,"threshold_uncertainty_score":0.0139014125},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015389464,0.0025145223,0.9656025,0.0019145081,0.00024700683,0.00018943874,0.00036132903,0.0016828901,0.012098323],"genre_scores_gemma":[0.3532241,0.0023851614,0.6267462,0.0015183132,0.0005915547,0.0010600403,0.0013991214,0.0029723046,0.010103172],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98016125,0.0057250476,0.00080103957,0.0037346405,0.0072073424,0.0023707189],"domain_scores_gemma":[0.8831693,0.09419667,0.0044198423,0.0082597155,0.007949891,0.0020045666],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01617758,0.0048511657,0.003367379,0.0049572797,0.003154161,0.006185596,0.0064082122,0.0036281578,0.011267615],"category_scores_gemma":[0.10073802,0.002116377,0.005662606,0.0031700854,0.008509299,0.013763956,0.008157456,0.014751154,0.0024209288],"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.0011066549,0.00027255906,0.004096344,0.0011642469,0.0003104041,0.00042433766,0.00080533436,0.43801716,0.010260507,0.46596384,0.0066742343,0.07090441],"study_design_scores_gemma":[0.000026674834,0.000058773607,0.00018024491,0.00013695554,0.000049122365,0.00007007684,0.000034367025,0.8510823,0.0028150554,0.14420673,0.001302668,0.000037060345],"about_ca_topic_score_codex":0.005331166,"about_ca_topic_score_gemma":0.0066006095,"teacher_disagreement_score":0.01617758,"about_ca_system_score_codex":0.0068935542,"about_ca_system_score_gemma":0.00576643,"threshold_uncertainty_score":0.08555627},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00060358684,0.004715813,0.9852643,0.00092035386,0.00018805287,0.00017856676,0.00014018874,0.00060612435,0.00738299],"genre_scores_gemma":[0.03788636,0.012035908,0.937908,0.00076723273,0.0004660479,0.0013416798,0.0008284269,0.00042480143,0.008341586],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9926117,0.0030817927,0.0011419513,0.00060571235,0.0022656657,0.00029318896],"domain_scores_gemma":[0.9904694,0.0068751173,0.0006041783,0.0010069619,0.00092185603,0.00012256934],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009274302,0.002121319,0.0014025498,0.0039033734,0.0013496341,0.004148014,0.002393001,0.0022003006,0.008484352],"category_scores_gemma":[0.014364319,0.0013491863,0.0025466816,0.0036458983,0.0056865974,0.005912226,0.003031022,0.0056612184,0.0034584536],"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.000011760985,0.000021932865,0.000075763375,0.00056711363,0.000030160973,0.000179021,0.0007350087,0.007695017,0.0012322369,0.94605666,0.0040675243,0.0393279],"study_design_scores_gemma":[0.00004390487,0.000026945609,0.00005404415,0.0004189276,0.00002781323,0.00034812858,0.00015387879,0.018050216,0.001379675,0.85467035,0.12478844,0.00003777664],"about_ca_topic_score_codex":0.0022430825,"about_ca_topic_score_gemma":0.0019874005,"teacher_disagreement_score":0.009274302,"about_ca_system_score_codex":0.002887381,"about_ca_system_score_gemma":0.003413525,"threshold_uncertainty_score":0.049047768},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00038455683,0.00004129887,0.99744046,0.000029679726,0.000033632372,0.000039133738,0.000048974773,0.0014234894,0.00055872835],"genre_scores_gemma":[0.045596894,0.00026812276,0.9472238,0.00016984573,0.000052548858,0.00043773348,0.0005935808,0.0011644618,0.004493037],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962669,0.0010801994,0.00041944112,0.00049436436,0.0015067421,0.00023234737],"domain_scores_gemma":[0.99661237,0.0016129381,0.00019902698,0.0008067391,0.0006921245,0.00007683747],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003186478,0.0013163277,0.001010451,0.0012983951,0.00075492816,0.0020303223,0.0029405484,0.0013023218,0.007859004],"category_scores_gemma":[0.007008271,0.0010559296,0.002220989,0.0011546027,0.0013291624,0.003320221,0.0019297152,0.0024758265,0.0020514354],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030059746,0.00018075736,0.0006853719,0.00095843547,0.00017415872,0.0008505045,0.00054737827,0.124349184,0.031745933,0.51230836,0.013900033,0.31399927],"study_design_scores_gemma":[0.00023624754,0.00009827031,0.00012702869,0.0001628128,0.00013577996,0.00071260135,0.00004695671,0.77442396,0.036596164,0.09530247,0.0920366,0.00012115937],"about_ca_topic_score_codex":0.0022295627,"about_ca_topic_score_gemma":0.002452321,"teacher_disagreement_score":0.007859004,"about_ca_system_score_codex":0.0010879989,"about_ca_system_score_gemma":0.0027029032,"threshold_uncertainty_score":0.026290953},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006296883,0.00010548111,0.9906928,0.00007801506,0.000014751713,0.000080913356,0.00005032167,0.0009510907,0.0017297779],"genre_scores_gemma":[0.29555467,0.00045573464,0.70064235,0.00015900096,0.000034216268,0.00032417843,0.00025402167,0.00040279623,0.0021730629],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977397,0.0005881375,0.000100168356,0.00023089546,0.0012020016,0.00013920548],"domain_scores_gemma":[0.9970438,0.0017335383,0.00021814744,0.0005757877,0.0003705155,0.000058269736],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016667434,0.0009810472,0.00069011946,0.0012095113,0.0005402528,0.00097383925,0.0014240572,0.0005282943,0.0018539841],"category_scores_gemma":[0.0055442145,0.0004882228,0.0015057742,0.00062547246,0.0009368919,0.0013195887,0.0014110995,0.002577825,0.0004084257],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003576639,0.00029069828,0.0024549784,0.00041466576,0.00008943806,0.0005540785,0.00040442642,0.30943534,0.062985964,0.272589,0.0035025082,0.34692124],"study_design_scores_gemma":[0.000032297736,0.00006985052,0.00019487634,0.000029700203,0.000028964703,0.00009757956,0.000015031047,0.9416751,0.025092708,0.02910508,0.003638973,0.000019834588],"about_ca_topic_score_codex":0.0028158915,"about_ca_topic_score_gemma":0.003139845,"teacher_disagreement_score":0.0028158915,"about_ca_system_score_codex":0.00079662097,"about_ca_system_score_gemma":0.0013916462,"threshold_uncertainty_score":0.0088146925},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007812136,0.0001644117,0.99377936,0.0004887151,0.000056226167,0.00026901654,0.0003080395,0.0012479782,0.0029050973],"genre_scores_gemma":[0.014928292,0.0007022764,0.97742337,0.00036533302,0.0000703853,0.0011780516,0.001225543,0.0006913115,0.0034154162],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98767406,0.0036855992,0.0029154045,0.0011846571,0.0041054566,0.00043491524],"domain_scores_gemma":[0.9842024,0.0064656883,0.0016619029,0.0052246414,0.0021926493,0.00025259907],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009273261,0.0020356781,0.0011033645,0.0030590396,0.0015059664,0.0040783626,0.0029834784,0.0025200227,0.0116501395],"category_scores_gemma":[0.027110688,0.002038046,0.0030408562,0.0044156606,0.0030443089,0.008033868,0.004006796,0.0054798853,0.0067762337],"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.00005911156,0.00011963945,0.0008279714,0.00073832076,0.000058527003,0.00043188786,0.00088004227,0.008072195,0.004158659,0.84234226,0.01347989,0.12883148],"study_design_scores_gemma":[0.00008398805,0.00006209094,0.00021316293,0.00055669085,0.000055096836,0.00073311426,0.00024205925,0.054976165,0.0072590834,0.7849122,0.15083712,0.00006922743],"about_ca_topic_score_codex":0.002366635,"about_ca_topic_score_gemma":0.0021779432,"teacher_disagreement_score":0.0116501395,"about_ca_system_score_codex":0.0017491566,"about_ca_system_score_gemma":0.0039296024,"threshold_uncertainty_score":0.049042284},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031081667,0.00025731957,0.9664093,0.000052754232,0.00003944145,0.000029650608,0.000030918734,0.0005600916,0.0015388448],"genre_scores_gemma":[0.8944744,0.00025224162,0.10348132,0.00003510376,0.000017139919,0.00007700429,0.00006739449,0.000039230148,0.0015561164],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999777,0.000030880623,0.000016548543,0.00005152421,0.00010367746,0.000020271524],"domain_scores_gemma":[0.9996846,0.00010308041,0.00009651609,0.000042376236,0.00006407523,0.000009382835],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025982724,0.0004043562,0.00031301845,0.00018849724,0.00021768532,0.00035408477,0.00050968095,0.00030588242,0.0009855062],"category_scores_gemma":[0.00089839415,0.00018281753,0.00032774362,0.0001707485,0.0002695457,0.00035316864,0.0003458444,0.00051816145,0.0001667095],"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.00011224868,0.000031842854,0.00029668832,0.00030830363,0.000039166513,0.0001874679,0.00018417923,0.78235286,0.11629909,0.0143814655,0.0004675869,0.08533907],"study_design_scores_gemma":[0.00002235788,0.00020014097,0.00019754776,0.000014580455,0.000019997202,0.00007101079,0.000022145736,0.9738283,0.020083623,0.0030026329,0.0025267506,0.000010831019],"about_ca_topic_score_codex":0.0013358193,"about_ca_topic_score_gemma":0.0011187866,"teacher_disagreement_score":0.0013358193,"about_ca_system_score_codex":0.00024195308,"about_ca_system_score_gemma":0.00030908093,"threshold_uncertainty_score":0.003296852},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010086505,0.000072655974,0.98610026,0.00012505743,0.000052940326,0.0002822212,0.000025170033,0.0011859633,0.0020692404],"genre_scores_gemma":[0.30502853,0.00022921039,0.6893378,0.00013269564,0.00003162381,0.0008533821,0.00011101049,0.00019271947,0.004083003],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991518,0.00019552889,0.000068785455,0.00015153112,0.000365759,0.00006654236],"domain_scores_gemma":[0.99934477,0.00015292487,0.000065526365,0.00013377338,0.0002502476,0.000052726584],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010663138,0.0005138382,0.00039018146,0.0006311051,0.00069484295,0.0012765853,0.0015530969,0.001008492,0.0021389255],"category_scores_gemma":[0.0018831266,0.00043211156,0.00043969764,0.0004185277,0.000886613,0.0011187478,0.000891412,0.0010938481,0.0006550664],"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.00040903589,0.0002764494,0.001495445,0.0006841706,0.00016315383,0.0013871634,0.0010972184,0.18783592,0.22760776,0.41605923,0.0037470313,0.15923737],"study_design_scores_gemma":[0.00013609393,0.00047875335,0.0005440309,0.0000707224,0.00020856505,0.00089154457,0.00016532498,0.7441733,0.14431441,0.04434211,0.064590976,0.00008419256],"about_ca_topic_score_codex":0.0014740553,"about_ca_topic_score_gemma":0.0014746196,"teacher_disagreement_score":0.0021389255,"about_ca_system_score_codex":0.00085376785,"about_ca_system_score_gemma":0.0015248371,"threshold_uncertainty_score":0.007155359},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011834054,0.00017280826,0.99106836,0.00032848306,0.000058191927,0.00017571014,0.000514904,0.0007790078,0.005719072],"genre_scores_gemma":[0.08845018,0.0011707606,0.88554335,0.0005627655,0.00012572334,0.0013931057,0.0043520737,0.00078237726,0.017619768],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.994159,0.0021948859,0.00079074275,0.000546912,0.0019988667,0.00030965812],"domain_scores_gemma":[0.99323034,0.0031281062,0.0005588638,0.0015766508,0.0012887174,0.00021738937],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0058483994,0.0011573534,0.0006929322,0.001888307,0.00090827496,0.0037500886,0.0037378005,0.002571279,0.005747295],"category_scores_gemma":[0.0091437,0.0012712555,0.0020228964,0.0016342339,0.0019467366,0.0062755346,0.0022880929,0.0028125993,0.0030552014],"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.000043110318,0.00003552559,0.00032444583,0.00018082913,0.00002394442,0.00036322005,0.00083532085,0.026078654,0.0019256615,0.9477649,0.0042202286,0.018204307],"study_design_scores_gemma":[0.000094900715,0.00009633049,0.0001727113,0.00040376544,0.00008192563,0.00063749374,0.00040109002,0.28265363,0.008062554,0.29965952,0.40765804,0.0000781017],"about_ca_topic_score_codex":0.004631751,"about_ca_topic_score_gemma":0.004445281,"teacher_disagreement_score":0.0058483994,"about_ca_system_score_codex":0.0014148882,"about_ca_system_score_gemma":0.0027827888,"threshold_uncertainty_score":0.030929625},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03809428,0.00008647182,0.95806193,0.000086017804,0.000015281126,0.0000879379,0.00022124227,0.002489791,0.00085713016],"genre_scores_gemma":[0.5283644,0.00015758225,0.4692912,0.00008808091,0.000012037506,0.00022904918,0.00048074455,0.00022449347,0.0011523684],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979381,0.00063643174,0.00019826388,0.00045472712,0.00057359814,0.00019877467],"domain_scores_gemma":[0.99377656,0.0045367246,0.0004824602,0.0007003245,0.00042943362,0.00007438159],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002131003,0.00074563525,0.0007868902,0.001481611,0.0006091325,0.0011955019,0.0012863538,0.00062923273,0.0021128112],"category_scores_gemma":[0.007603678,0.000590758,0.00132586,0.00059937616,0.0014389011,0.0022457703,0.0014260977,0.00096257834,0.00021389163],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005152035,0.00012302754,0.0048802057,0.00040955446,0.00016624558,0.0005697803,0.00027618874,0.74505866,0.022704037,0.1119722,0.0010653434,0.112259634],"study_design_scores_gemma":[0.000083600884,0.000072486386,0.00020387769,0.00003503752,0.000048057325,0.000082893195,0.000026388372,0.91618896,0.02833433,0.052429542,0.0024731057,0.000021639291],"about_ca_topic_score_codex":0.00556545,"about_ca_topic_score_gemma":0.0065670577,"teacher_disagreement_score":0.00556545,"about_ca_system_score_codex":0.0012539111,"about_ca_system_score_gemma":0.0021908507,"threshold_uncertainty_score":0.011269927},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11743109,0.000277638,0.8753074,0.00013773168,0.000020610642,0.00007184168,0.00011938272,0.00028440557,0.0063499087],"genre_scores_gemma":[0.94231415,0.00031935156,0.05401815,0.000032997075,0.000019051873,0.00013873434,0.0001808217,0.000043020747,0.0029335697],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999358,0.00013325119,0.00003200338,0.00015961895,0.00019772175,0.000119276556],"domain_scores_gemma":[0.9991412,0.0005430373,0.00012756014,0.00006616539,0.00007728167,0.000044681452],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051002356,0.0006092925,0.00056410854,0.00043235256,0.0004752337,0.001058975,0.000588078,0.00062949484,0.0027163492],"category_scores_gemma":[0.001707974,0.0002562934,0.00072664855,0.00043500666,0.0017628277,0.0014652552,0.0013164531,0.0009099269,0.0002098851],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014592613,0.000058298323,0.0004212646,0.00012745832,0.000033444438,0.00025716738,0.00017476885,0.7977555,0.0149980765,0.16044435,0.00039311367,0.025190644],"study_design_scores_gemma":[0.000027543505,0.00012292874,0.0002751354,0.00001580421,0.00001043125,0.000043162425,0.00008401196,0.89785963,0.0048223156,0.095398314,0.0013237032,0.000017008464],"about_ca_topic_score_codex":0.0040740594,"about_ca_topic_score_gemma":0.0023894906,"teacher_disagreement_score":0.0040740594,"about_ca_system_score_codex":0.0007702301,"about_ca_system_score_gemma":0.00077753153,"threshold_uncertainty_score":0.009087145},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00033207083,0.00010505095,0.9954216,0.000152527,0.00004374171,0.00009168118,0.000110684836,0.00094800745,0.0027946837],"genre_scores_gemma":[0.022940293,0.0004769875,0.96875095,0.00014125234,0.00007654217,0.00054676714,0.00051753427,0.0002966637,0.006253124],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99823487,0.0005406649,0.0001709366,0.00026239504,0.00069121004,0.00009992995],"domain_scores_gemma":[0.99866986,0.00048326835,0.0001267339,0.00039318504,0.00026918246,0.000057690573],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020841814,0.0011550587,0.0008819435,0.0016074873,0.0010967859,0.0036521256,0.002607041,0.0017190163,0.0121415015],"category_scores_gemma":[0.0036762413,0.00064349116,0.002372659,0.0016113835,0.0018785516,0.004949214,0.0018009937,0.003451891,0.0039860676],"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.000034167144,0.00005680392,0.000108427856,0.0002168916,0.000023932947,0.00024270281,0.00025311654,0.035007205,0.003989593,0.90226454,0.004402835,0.05339991],"study_design_scores_gemma":[0.00005663121,0.0000827519,0.00007805186,0.00018097082,0.00007161915,0.00054923753,0.00009008078,0.40189597,0.007889957,0.4353938,0.1536404,0.00007055427],"about_ca_topic_score_codex":0.003872469,"about_ca_topic_score_gemma":0.0031727988,"teacher_disagreement_score":0.0121415015,"about_ca_system_score_codex":0.0014703163,"about_ca_system_score_gemma":0.0030873471,"threshold_uncertainty_score":0.040617347},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00937526,0.00012683673,0.9843976,0.000106191445,0.000025981202,0.00011440051,0.000033514254,0.0012417827,0.0045783278],"genre_scores_gemma":[0.24011107,0.00036175927,0.7484845,0.0001298879,0.000023964461,0.00058920763,0.00026636606,0.0004337718,0.00959949],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99856913,0.0003340998,0.0001198557,0.00020790855,0.0006571965,0.000111770656],"domain_scores_gemma":[0.99871695,0.00058917684,0.00014993601,0.00018585281,0.0002942657,0.00006385036],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013845084,0.00047678102,0.0003436774,0.00045932428,0.00042845507,0.001470693,0.0015479856,0.00084496115,0.0034868426],"category_scores_gemma":[0.0035775749,0.00061064237,0.0007225268,0.00029483624,0.0013790597,0.0014417246,0.0011133162,0.000848145,0.00072730426],"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.00015418025,0.00020191124,0.001429891,0.00080858526,0.00007913114,0.0006210052,0.00137059,0.17584515,0.04625709,0.5837292,0.0036466233,0.1858567],"study_design_scores_gemma":[0.00015389192,0.0002872487,0.0005086567,0.0001389179,0.00007247887,0.00040170478,0.00018213803,0.6813016,0.059609182,0.17521459,0.08208475,0.000044791],"about_ca_topic_score_codex":0.0013313746,"about_ca_topic_score_gemma":0.0014508705,"teacher_disagreement_score":0.0034868426,"about_ca_system_score_codex":0.0009132348,"about_ca_system_score_gemma":0.0015335607,"threshold_uncertainty_score":0.011664629},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00338556,0.000075781354,0.9897856,0.00025063776,0.00005631082,0.00018888485,0.00012336217,0.0021420182,0.0039918413],"genre_scores_gemma":[0.12144103,0.00030806282,0.8679292,0.00039332194,0.00017556206,0.00041307442,0.0006540017,0.00082276633,0.007862959],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963812,0.00090105576,0.00040664148,0.0007011867,0.00112878,0.00048114132],"domain_scores_gemma":[0.99546707,0.0031662616,0.00018204587,0.00058703515,0.0004236631,0.00017396254],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0047612535,0.00095521164,0.0012700846,0.0021839454,0.0022228241,0.00537092,0.0033104601,0.002163701,0.00890666],"category_scores_gemma":[0.009719669,0.0014437869,0.003885117,0.0017417968,0.005255699,0.0065516275,0.004423138,0.00512652,0.0024048977],"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.00021363416,0.00017521091,0.000331024,0.0002544538,0.00005968703,0.00027680714,0.0006674709,0.0071186638,0.007196367,0.88404757,0.0051734145,0.094485626],"study_design_scores_gemma":[0.00012924454,0.0001086728,0.00025362035,0.00008975657,0.00016031967,0.00023699882,0.0001249817,0.08700964,0.020118339,0.8692275,0.022432083,0.00010883916],"about_ca_topic_score_codex":0.002693489,"about_ca_topic_score_gemma":0.0019682157,"teacher_disagreement_score":0.00890666,"about_ca_system_score_codex":0.0019105315,"about_ca_system_score_gemma":0.0036211675,"threshold_uncertainty_score":0.029795766},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017230555,0.0016475029,0.98165715,0.00050192093,0.00021104774,0.000078161655,0.000025434563,0.0007487817,0.013407005],"genre_scores_gemma":[0.12769382,0.005972414,0.8402995,0.00043711616,0.00029156503,0.00023426904,0.00015863353,0.0005500277,0.024362661],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99867344,0.00047221745,0.000102026584,0.00015025254,0.00052192196,0.000080201964],"domain_scores_gemma":[0.9954823,0.0036399493,0.0001227663,0.000452067,0.00024353137,0.00005929218],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026740436,0.0010366327,0.00042664728,0.00092186785,0.0004538476,0.0021160739,0.0014210619,0.001243159,0.009839607],"category_scores_gemma":[0.0074731885,0.0007359182,0.0010394433,0.00048199945,0.0026677777,0.002325718,0.002177096,0.0027226422,0.0016866253],"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.000053125466,0.00008787289,0.00026530251,0.0010204088,0.00004422101,0.00020180091,0.0010032657,0.032032054,0.011070937,0.6213154,0.0063980916,0.3265075],"study_design_scores_gemma":[0.00004835354,0.000107945714,0.000154876,0.0007970945,0.00004558221,0.00030845773,0.00016561094,0.09406355,0.016271459,0.73984206,0.14815578,0.000039315386],"about_ca_topic_score_codex":0.0007552476,"about_ca_topic_score_gemma":0.0006197489,"teacher_disagreement_score":0.009839607,"about_ca_system_score_codex":0.0008681312,"about_ca_system_score_gemma":0.0013143083,"threshold_uncertainty_score":0.032916725},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004670342,0.00048125462,0.9874277,0.000095466836,0.000121631616,0.000060697457,0.00008065284,0.0011020163,0.005960314],"genre_scores_gemma":[0.06139836,0.00051436876,0.92934006,0.0001673206,0.00005310248,0.00010691272,0.00025883087,0.00018372909,0.007977285],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994474,0.000073085,0.00004675148,0.00013390493,0.00026298122,0.000035921777],"domain_scores_gemma":[0.9997367,0.00007427548,0.000029509685,0.00006674476,0.00007999806,0.000012741159],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031875202,0.0007465592,0.00033458468,0.0011404488,0.00032181738,0.0008392496,0.00092330325,0.00029876575,0.005864527],"category_scores_gemma":[0.000627081,0.0003470294,0.00060770917,0.0005339704,0.0003805272,0.0010342814,0.0007091955,0.0006600995,0.0009132387],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001402653,0.00007760915,0.0007177656,0.0005075155,0.0000595277,0.00018849234,0.00008056572,0.030767672,0.12256648,0.06685862,0.0048279883,0.77320755],"study_design_scores_gemma":[0.00019857382,0.0006522535,0.00086964434,0.00020038486,0.00015707329,0.001519428,0.00008702583,0.42262527,0.25726703,0.03799289,0.27835816,0.00007227373],"about_ca_topic_score_codex":0.0007183443,"about_ca_topic_score_gemma":0.0019163087,"teacher_disagreement_score":0.005864527,"about_ca_system_score_codex":0.0005744948,"about_ca_system_score_gemma":0.0009801026,"threshold_uncertainty_score":0.01961881},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00071084633,0.0002241349,0.9920597,0.00029343282,0.00006628525,0.000024755667,0.000053081472,0.00018138696,0.0063862302],"genre_scores_gemma":[0.18088849,0.0019554563,0.7927715,0.0005843055,0.0007878562,0.00025143792,0.00038797743,0.00055578543,0.021817211],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9966239,0.0009358753,0.00024350021,0.00044568986,0.001525902,0.00022511477],"domain_scores_gemma":[0.9948939,0.003231352,0.00033649534,0.0008616039,0.0005393554,0.00013724415],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036967166,0.0014657121,0.0013248767,0.0030564535,0.0013366466,0.005345631,0.00339061,0.0016575537,0.012630776],"category_scores_gemma":[0.0077727516,0.0011280257,0.0036169463,0.0025163526,0.0048938813,0.009583344,0.0027559681,0.0043588895,0.0027303682],"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.000008566969,0.000018705574,0.000081441205,0.000079262005,0.000015770445,0.000051315903,0.000082444916,0.007751601,0.0005718535,0.9766714,0.0008737837,0.013793818],"study_design_scores_gemma":[0.0000045952447,0.000009431708,0.000050684084,0.000020541967,0.000019601022,0.00007639454,0.000018280321,0.034960303,0.0008981656,0.9556955,0.008231954,0.000014519406],"about_ca_topic_score_codex":0.0016488582,"about_ca_topic_score_gemma":0.0016099726,"teacher_disagreement_score":0.012630776,"about_ca_system_score_codex":0.00243488,"about_ca_system_score_gemma":0.0018464978,"threshold_uncertainty_score":0.04225421},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12127718,0.00022212575,0.8730484,0.00030876554,0.00005147346,0.00017168345,0.00020564128,0.0027792754,0.0019354641],"genre_scores_gemma":[0.79191715,0.00016406977,0.20565695,0.0001368965,0.000050317147,0.00021406182,0.0003657782,0.00018177327,0.0013129431],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9948078,0.001509057,0.00043277733,0.0007043372,0.0021407614,0.0004052775],"domain_scores_gemma":[0.9778411,0.016351268,0.0020448377,0.0014857922,0.0018907058,0.00038635702],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00582275,0.00076649984,0.00087996246,0.0017826767,0.0009523183,0.0024173316,0.0021643064,0.0010576975,0.0016931761],"category_scores_gemma":[0.029307267,0.0007558477,0.0014040099,0.0009761894,0.0023268047,0.0038099738,0.0015407129,0.0012174475,0.00019156569],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0019025978,0.0003476821,0.012540682,0.000782288,0.00030272463,0.002169371,0.0015981712,0.5618797,0.0255424,0.2506865,0.002750616,0.13949728],"study_design_scores_gemma":[0.000104192186,0.00007684101,0.0003679122,0.000037951006,0.000056528665,0.00009666991,0.000051321957,0.9392545,0.011685113,0.04741727,0.00082238327,0.000029198536],"about_ca_topic_score_codex":0.011609524,"about_ca_topic_score_gemma":0.011775357,"teacher_disagreement_score":0.011609524,"about_ca_system_score_codex":0.0026592491,"about_ca_system_score_gemma":0.003036465,"threshold_uncertainty_score":0.030794024},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19533569,0.0015413276,0.7414803,0.011799305,0.00015431432,0.00046415182,0.0015940855,0.0021498553,0.045481082],"genre_scores_gemma":[0.79902583,0.0016481854,0.18624601,0.0007476328,0.00026531972,0.0007404802,0.0020286536,0.0004088669,0.008889014],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99270755,0.0023677747,0.00068828993,0.0009360997,0.0026920016,0.0006083019],"domain_scores_gemma":[0.9545491,0.033553246,0.003269355,0.0052799676,0.0023497515,0.0009986205],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040838476,0.0006407932,0.0009309172,0.0012931298,0.0016390894,0.004577665,0.0016503078,0.0022375507,0.0061446317],"category_scores_gemma":[0.04195455,0.0009964894,0.0016673917,0.0015920753,0.004742386,0.009430898,0.0033245618,0.0047857943,0.0009150905],"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.000074617834,0.000038317805,0.0013342582,0.00023237833,0.000026124368,0.00037168228,0.0008346236,0.055275355,0.0012102115,0.91950166,0.0023104243,0.01879022],"study_design_scores_gemma":[0.00002608791,0.000021293794,0.00029487917,0.00003677932,0.000015935666,0.00019727762,0.00016179739,0.07414849,0.0006963789,0.91984427,0.0045310915,0.000025846262],"about_ca_topic_score_codex":0.004104425,"about_ca_topic_score_gemma":0.0036666007,"teacher_disagreement_score":0.0061446317,"about_ca_system_score_codex":0.0029531857,"about_ca_system_score_gemma":0.002491674,"threshold_uncertainty_score":0.021597683},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032570086,0.00011434988,0.96590817,0.000079862504,0.000010165238,0.000038157305,0.000024286943,0.00018347656,0.0010714823],"genre_scores_gemma":[0.6856716,0.00038311217,0.31128466,0.000104778395,0.000048450773,0.00020122009,0.00009879263,0.00010230993,0.0021050985],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998681,0.00036396936,0.00009736429,0.00014033647,0.00056620355,0.0001510463],"domain_scores_gemma":[0.99589986,0.0026440977,0.00051047595,0.0005355651,0.0003108913,0.000099074634],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020553402,0.00073855807,0.0003756887,0.0010420603,0.0004956411,0.0011250913,0.0015178272,0.0008632479,0.0014114906],"category_scores_gemma":[0.0034352231,0.0004026804,0.0011753706,0.0006852327,0.0033299034,0.004705647,0.0015505664,0.0013595251,0.00017429737],"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.00013253595,0.000070444774,0.0009823171,0.00014376162,0.00003391233,0.00028480304,0.00069273735,0.07529278,0.025099482,0.8707768,0.00023853376,0.026251918],"study_design_scores_gemma":[0.000045042627,0.00012542987,0.00020970183,0.00003740723,0.00004436664,0.00019583713,0.00009463817,0.3819459,0.024081064,0.5897525,0.0034193078,0.000048747814],"about_ca_topic_score_codex":0.0008765295,"about_ca_topic_score_gemma":0.0007968112,"teacher_disagreement_score":0.0020553402,"about_ca_system_score_codex":0.0006208009,"about_ca_system_score_gemma":0.00076389516,"threshold_uncertainty_score":0.010869861},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014938583,0.00008278628,0.9975673,0.00007259012,0.000010331674,0.000051159423,0.00003195527,0.00018885039,0.0005011963],"genre_scores_gemma":[0.081565306,0.00028068083,0.91660464,0.00011441122,0.000018240395,0.0002899219,0.00014845558,0.000073449715,0.00090488046],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99661213,0.0013832859,0.00030219406,0.00038474644,0.0011199168,0.00019767592],"domain_scores_gemma":[0.99672,0.0018187572,0.00026466814,0.0007291661,0.00037382182,0.00009347648],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003212756,0.00094076415,0.00076256675,0.00135774,0.00078741566,0.0012424416,0.0024077743,0.0011463452,0.0032122675],"category_scores_gemma":[0.0068087187,0.001012114,0.0022371153,0.0008733282,0.0035013282,0.0017479014,0.0020579551,0.0027268103,0.0006026858],"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.000073387964,0.00007328893,0.000712648,0.00048545797,0.000116731564,0.00024139065,0.0005547264,0.49448955,0.012271105,0.43919477,0.001012022,0.05077489],"study_design_scores_gemma":[0.000061514926,0.0001285898,0.0002546037,0.00012006628,0.00008534575,0.00008311912,0.000059609807,0.72462827,0.009048692,0.25182512,0.013661211,0.000043889177],"about_ca_topic_score_codex":0.006157732,"about_ca_topic_score_gemma":0.0069271703,"teacher_disagreement_score":0.006157732,"about_ca_system_score_codex":0.0015363048,"about_ca_system_score_gemma":0.002464541,"threshold_uncertainty_score":0.01699084},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15515466,0.00015422989,0.83373713,0.0010272822,0.000056858473,0.00012683519,0.00061882637,0.004010601,0.0051136306],"genre_scores_gemma":[0.91477406,0.000089510475,0.08172843,0.0002590388,0.000037033555,0.0001378258,0.0008060116,0.00030672268,0.0018612199],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9951218,0.0016676367,0.00029665636,0.00066803285,0.0016146358,0.000631219],"domain_scores_gemma":[0.9820495,0.013792512,0.0010814541,0.0016040079,0.0012055596,0.00026686976],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003364223,0.0005104776,0.0008314834,0.0010424714,0.00062011695,0.002941453,0.0021862397,0.0012657685,0.002692677],"category_scores_gemma":[0.019803,0.00052116514,0.0014891139,0.0013222018,0.0026348962,0.00498514,0.0026740397,0.0020338306,0.00033233073],"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.00081208814,0.00022811594,0.005140716,0.00033525148,0.00015653386,0.0013631723,0.0009079798,0.5182321,0.016663881,0.4081331,0.003921785,0.044105187],"study_design_scores_gemma":[0.00009578615,0.00003170864,0.00017216087,0.000021481612,0.000027513815,0.00006835892,0.00007233029,0.81816334,0.0056453664,0.17494269,0.0007427771,0.00001659456],"about_ca_topic_score_codex":0.010773666,"about_ca_topic_score_gemma":0.0105403345,"teacher_disagreement_score":0.010773666,"about_ca_system_score_codex":0.002731242,"about_ca_system_score_gemma":0.002372579,"threshold_uncertainty_score":0.02142191},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00082376297,0.00018486439,0.9943447,0.00028241056,0.000083592415,0.00009202175,0.00007048645,0.00062734034,0.0034907737],"genre_scores_gemma":[0.05612765,0.0006724375,0.93734974,0.00036358647,0.00024108178,0.0009075245,0.00043082424,0.0004708689,0.0034362965],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9903728,0.003524846,0.0016246849,0.0010882484,0.0028166056,0.00057284784],"domain_scores_gemma":[0.99458236,0.00229443,0.0005461882,0.0014163263,0.00086200336,0.00029870818],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010291521,0.002152444,0.0013083615,0.0027939435,0.002245859,0.0073591075,0.0035807888,0.002247009,0.0042715855],"category_scores_gemma":[0.010190467,0.0013209846,0.0034958555,0.0023516985,0.0058501107,0.010779777,0.0053777588,0.004870426,0.0016774045],"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.0000064876676,0.000010662645,0.000035528697,0.00005081069,0.000009653294,0.000061386556,0.00035181746,0.0025440166,0.00043333054,0.99056983,0.0005136619,0.0054128985],"study_design_scores_gemma":[0.000025638823,0.000030994852,0.000031148647,0.00009677292,0.000032824377,0.00013363276,0.00011566616,0.019955344,0.002033469,0.9120693,0.06544856,0.000026627202],"about_ca_topic_score_codex":0.0026167103,"about_ca_topic_score_gemma":0.0022055483,"teacher_disagreement_score":0.010291521,"about_ca_system_score_codex":0.002801721,"about_ca_system_score_gemma":0.0031838466,"threshold_uncertainty_score":0.054427385},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014508557,0.00004860098,0.9831912,0.000037666083,0.000024451489,0.000042816122,0.00009036476,0.0009938489,0.0010624201],"genre_scores_gemma":[0.32090086,0.0002568394,0.6752459,0.000065318425,0.000022973729,0.00018819197,0.0005712694,0.0002627482,0.0024859246],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994929,0.00010786993,0.00003576415,0.000110656765,0.00019287546,0.000059882947],"domain_scores_gemma":[0.9994735,0.00014730208,0.000048772912,0.00023294898,0.00007583518,0.000021729049],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044771706,0.0006711614,0.0006121907,0.00042012642,0.00028316918,0.00071036804,0.00086749106,0.00037771856,0.00223991],"category_scores_gemma":[0.0010842667,0.000276376,0.0016965258,0.00056403433,0.0005769435,0.0015888066,0.0007907727,0.0010645863,0.00039440635],"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.00031379703,0.00018670288,0.0011617348,0.00048576584,0.00014015503,0.00059988594,0.0004894439,0.5233277,0.19128355,0.16593178,0.0013604754,0.11471911],"study_design_scores_gemma":[0.00005947257,0.00026809933,0.00052681565,0.000030682135,0.00012554314,0.00022507821,0.00006966874,0.8599867,0.057935566,0.06711219,0.013616823,0.000043372274],"about_ca_topic_score_codex":0.0022978266,"about_ca_topic_score_gemma":0.0026682776,"teacher_disagreement_score":0.0022978266,"about_ca_system_score_codex":0.0006382013,"about_ca_system_score_gemma":0.0013369686,"threshold_uncertainty_score":0.0074932575},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0039283093,0.00028062912,0.99413484,0.00007178718,0.000053558088,0.000016784279,0.000009455034,0.000078105644,0.0014265843],"genre_scores_gemma":[0.22644766,0.0010274363,0.7695119,0.00013487974,0.000089037996,0.00015455576,0.000044786746,0.00012068459,0.0024692114],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988973,0.0005603062,0.0000642321,0.00008762063,0.00033548087,0.00005511701],"domain_scores_gemma":[0.9985789,0.0010285409,0.0000649945,0.0001958612,0.000107815285,0.000023800505],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019077965,0.0005818096,0.00055922224,0.00066736917,0.0004584151,0.0010518013,0.0006250699,0.00069877726,0.002276123],"category_scores_gemma":[0.004990323,0.00032539238,0.00073076447,0.00079453655,0.0016682103,0.0019968466,0.0010324022,0.0015370416,0.0006797415],"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.000076422635,0.00003985772,0.00043818814,0.00034898607,0.00003811922,0.00012040501,0.00023892066,0.18281588,0.0100917155,0.7171785,0.0006023168,0.08801074],"study_design_scores_gemma":[0.000024699486,0.00006918902,0.00009187725,0.00008056726,0.000016252088,0.0000802896,0.000029856523,0.80600023,0.007590496,0.17779772,0.00819477,0.000024067982],"about_ca_topic_score_codex":0.0008838018,"about_ca_topic_score_gemma":0.0007259775,"teacher_disagreement_score":0.002276123,"about_ca_system_score_codex":0.0006186727,"about_ca_system_score_gemma":0.00063468143,"threshold_uncertainty_score":0.010089517},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02217487,0.0002822289,0.96871984,0.00079527136,0.00011964418,0.00038100957,0.00030013986,0.0017119437,0.0055151656],"genre_scores_gemma":[0.10192838,0.0004917964,0.89344275,0.00025426433,0.000033936718,0.000640326,0.0011969107,0.000584043,0.0014275218],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.94877493,0.026610836,0.008468564,0.0028317918,0.012120811,0.0011930726],"domain_scores_gemma":[0.9260059,0.03173932,0.0071305423,0.018504929,0.015710961,0.0009084031],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.041497763,0.0014808245,0.0013536768,0.0051740203,0.0015704138,0.011819185,0.0043284185,0.003354062,0.002550444],"category_scores_gemma":[0.107765526,0.0013477132,0.0024127583,0.0037215727,0.002933296,0.018742124,0.006158911,0.0037537355,0.0009134423],"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.00033275143,0.00021541552,0.0052900016,0.0008279549,0.00021191248,0.00087056623,0.016512834,0.04016224,0.013654151,0.6889036,0.005014538,0.22800398],"study_design_scores_gemma":[0.00015638887,0.00062866206,0.0021020162,0.0015437618,0.00039166465,0.0012885077,0.009029006,0.2431245,0.042601004,0.5389986,0.15975507,0.00038080188],"about_ca_topic_score_codex":0.0047516217,"about_ca_topic_score_gemma":0.0031854,"teacher_disagreement_score":0.041497763,"about_ca_system_score_codex":0.0045005516,"about_ca_system_score_gemma":0.006205681,"threshold_uncertainty_score":0.21946377},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06103708,0.00010592171,0.93281466,0.000090453046,0.000039357594,0.00009366673,0.00012421186,0.002175079,0.003519626],"genre_scores_gemma":[0.42656472,0.0001742535,0.56995964,0.000055315228,0.000026136091,0.00014915697,0.00042293593,0.00021340213,0.002434412],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99839526,0.0004546234,0.000119449636,0.00028114003,0.0005959083,0.00015351333],"domain_scores_gemma":[0.9971347,0.0016412883,0.00027974663,0.0003734292,0.000495645,0.000075169526],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010915301,0.0007835956,0.0005706297,0.001558176,0.00051339954,0.0016894339,0.00063857215,0.0005628531,0.0043231444],"category_scores_gemma":[0.00674869,0.00030626878,0.0006897486,0.0009887278,0.0007887152,0.0027452623,0.00078927836,0.0006549285,0.0012450567],"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.0007703512,0.00017571662,0.0018836448,0.00036596513,0.00008324293,0.00026934748,0.0003830906,0.13963833,0.071569644,0.3176682,0.0022613849,0.464931],"study_design_scores_gemma":[0.00014998087,0.0003527616,0.00065294205,0.00007922687,0.000063936866,0.00027765907,0.00016078402,0.5480078,0.15487897,0.2837325,0.011567026,0.00007649031],"about_ca_topic_score_codex":0.0013197516,"about_ca_topic_score_gemma":0.0019367252,"teacher_disagreement_score":0.0043231444,"about_ca_system_score_codex":0.00080733275,"about_ca_system_score_gemma":0.0012327936,"threshold_uncertainty_score":0.014462411},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13353314,0.00024679833,0.8520238,0.0011385608,0.0001064667,0.00056565204,0.001545646,0.003169928,0.0076699895],"genre_scores_gemma":[0.8376384,0.00019231708,0.15563548,0.00028423153,0.00015151448,0.0012244761,0.0029284682,0.00038621068,0.0015589447],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99006385,0.0020812682,0.0011140448,0.0022339397,0.0030213094,0.0014855467],"domain_scores_gemma":[0.9359322,0.045018375,0.0057398,0.005581249,0.0057688383,0.0019594755],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0072174305,0.001517666,0.0018456648,0.0033531091,0.0017274652,0.0029223422,0.0030436488,0.0024824492,0.0071110115],"category_scores_gemma":[0.047345724,0.0017401081,0.0030948748,0.0016759472,0.005394884,0.009091036,0.0051357676,0.0056294375,0.0010190173],"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.0011186904,0.00053024746,0.007399682,0.0008317635,0.00021758108,0.0011262908,0.0011616619,0.118689105,0.030638117,0.80890197,0.0036419786,0.025742909],"study_design_scores_gemma":[0.00031329275,0.00019821805,0.0010370952,0.00015577242,0.00016076653,0.00025570745,0.00021842156,0.4019187,0.03159322,0.56109005,0.0029821054,0.00007676742],"about_ca_topic_score_codex":0.0017414959,"about_ca_topic_score_gemma":0.00264258,"teacher_disagreement_score":0.0072174305,"about_ca_system_score_codex":0.0029381434,"about_ca_system_score_gemma":0.0037105654,"threshold_uncertainty_score":0.03816992},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005688253,0.00023836346,0.9910822,0.000101016776,0.000035100216,0.000037882663,0.00004809069,0.0010092309,0.0017598958],"genre_scores_gemma":[0.37033904,0.000972909,0.6233989,0.00030697114,0.00013040227,0.00047722788,0.00042142993,0.0005154614,0.003437699],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973442,0.0010116997,0.00024040358,0.00037453353,0.00083692744,0.00019236247],"domain_scores_gemma":[0.99663746,0.0019194415,0.00026499145,0.00090346567,0.0002059646,0.00006864456],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028670263,0.0010215874,0.0009167303,0.0010791663,0.000749605,0.0013934678,0.0010720534,0.00079635804,0.0024711534],"category_scores_gemma":[0.0054900115,0.00079351733,0.0036358,0.0010453375,0.0031105855,0.003019588,0.002453348,0.002992321,0.0006186167],"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.00009032343,0.000026549442,0.00058363815,0.00027961994,0.000098304685,0.00029138636,0.0006544596,0.10413112,0.010435176,0.85780025,0.0011282039,0.024480887],"study_design_scores_gemma":[0.00003437443,0.00007798416,0.0001523336,0.000096787946,0.000088738714,0.00013944936,0.000047949343,0.27567172,0.008975726,0.70135075,0.013322337,0.000041848616],"about_ca_topic_score_codex":0.0022265965,"about_ca_topic_score_gemma":0.0019329278,"teacher_disagreement_score":0.0028670263,"about_ca_system_score_codex":0.0015427646,"about_ca_system_score_gemma":0.0014616777,"threshold_uncertainty_score":0.015162468},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014191611,0.00021972705,0.9703078,0.00055614515,0.00023684614,0.0003164721,0.00052014424,0.010184906,0.0034663405],"genre_scores_gemma":[0.19431522,0.0005867971,0.79623973,0.0004629892,0.00022893121,0.00058058684,0.0018963775,0.0025601296,0.003129222],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.95779234,0.019629974,0.0037967223,0.003143689,0.01422854,0.001408745],"domain_scores_gemma":[0.9002696,0.06589885,0.003794837,0.01806244,0.011607905,0.00036628902],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.027066553,0.0011172864,0.0013803225,0.0031669752,0.0015494839,0.006846322,0.0052874577,0.002204109,0.008090756],"category_scores_gemma":[0.11587384,0.0017536619,0.0032811128,0.001290453,0.003703753,0.0071482826,0.0033096797,0.0035354428,0.003779688],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005744392,0.0006957681,0.003460519,0.0020114018,0.00051569723,0.0017255452,0.0027096907,0.07964641,0.042289473,0.6268454,0.017674815,0.22185075],"study_design_scores_gemma":[0.0008524889,0.00047897198,0.0008977857,0.00056995475,0.000400928,0.0009950241,0.00070666097,0.453254,0.18027857,0.30053478,0.06077877,0.0002520694],"about_ca_topic_score_codex":0.00249588,"about_ca_topic_score_gemma":0.0021936826,"teacher_disagreement_score":0.027066553,"about_ca_system_score_codex":0.0021464813,"about_ca_system_score_gemma":0.005892982,"threshold_uncertainty_score":0.14314336},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.051636778,0.0003923126,0.93903553,0.0008851451,0.000052163556,0.000099299155,0.00021297135,0.00031694968,0.0073688794],"genre_scores_gemma":[0.8636205,0.00050833495,0.13026021,0.00025280297,0.000117364914,0.0003637854,0.0005429862,0.00014392224,0.0041900165],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99195194,0.0046878275,0.00039903703,0.00096973625,0.0012962912,0.00069521717],"domain_scores_gemma":[0.8988493,0.09155221,0.0021847314,0.004044914,0.0022185214,0.0011503613],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007984368,0.001160267,0.0016174266,0.0025049197,0.0016546801,0.0040450967,0.0028123748,0.002761907,0.0041719577],"category_scores_gemma":[0.046679847,0.001101215,0.0030292834,0.0016049875,0.008830637,0.008300892,0.004246857,0.0042437245,0.0004678346],"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.00019261753,0.00006579188,0.00096085377,0.00010868484,0.000044717974,0.00012917271,0.00039548907,0.07413798,0.00064571947,0.91506386,0.0003877274,0.007867486],"study_design_scores_gemma":[0.000029044199,0.000020966969,0.00009445404,0.00002670362,0.00001512783,0.000022196573,0.000052319112,0.1431646,0.00050385454,0.8556617,0.0003970123,0.000011927846],"about_ca_topic_score_codex":0.0055768727,"about_ca_topic_score_gemma":0.004080746,"teacher_disagreement_score":0.007984368,"about_ca_system_score_codex":0.0035841968,"about_ca_system_score_gemma":0.0034419717,"threshold_uncertainty_score":0.042225897},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0051286784,0.000025769166,0.9879859,0.00006481853,0.000019209941,0.00008637564,0.000044374214,0.0052691945,0.0013756484],"genre_scores_gemma":[0.2615128,0.00015202432,0.7324692,0.00012306552,0.000027822287,0.00039576064,0.00051884213,0.0020625454,0.002738003],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99218386,0.0021187456,0.0005204827,0.0005673719,0.004247059,0.00036237406],"domain_scores_gemma":[0.98247355,0.0076493183,0.0010349596,0.006177283,0.0025093253,0.00015558845],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006454949,0.0008638247,0.00080885325,0.0012790777,0.0008211378,0.0022681379,0.0032914695,0.0011612672,0.003278455],"category_scores_gemma":[0.021326737,0.0007950743,0.001257319,0.00067603035,0.0027569316,0.0038439163,0.0035533921,0.0026086187,0.0011765682],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00049216225,0.00051034364,0.0054488988,0.00096661435,0.00015612032,0.0012995551,0.0022379344,0.12299796,0.055200163,0.5472751,0.005437242,0.25797775],"study_design_scores_gemma":[0.00020506611,0.00018156176,0.0005626503,0.00018620306,0.00006713001,0.0004470627,0.00015033019,0.68277884,0.13736528,0.1428202,0.035143547,0.00009219653],"about_ca_topic_score_codex":0.0016078661,"about_ca_topic_score_gemma":0.0013036453,"teacher_disagreement_score":0.006454949,"about_ca_system_score_codex":0.0009870337,"about_ca_system_score_gemma":0.002891806,"threshold_uncertainty_score":0.034137428},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.062022828,0.00026843988,0.9291318,0.00047523042,0.00003681699,0.00021618229,0.0000957655,0.001831415,0.0059214886],"genre_scores_gemma":[0.3843515,0.00019644144,0.61196417,0.0002723991,0.000042870866,0.00023019496,0.00032916237,0.00023149505,0.002381868],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967386,0.0012770632,0.00016857323,0.00050703075,0.0010738834,0.00023481653],"domain_scores_gemma":[0.99219716,0.004732613,0.00043764175,0.00154806,0.00090944325,0.00017507847],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002332092,0.00086718786,0.0011754659,0.0009365001,0.00071101723,0.0015145801,0.0027774335,0.0014450428,0.0033110944],"category_scores_gemma":[0.010786266,0.0006055797,0.00058825966,0.0013211437,0.0013790145,0.0025532357,0.0026994068,0.0024455518,0.0008667467],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043125433,0.0005906057,0.006499,0.00036298373,0.00011459312,0.0004406057,0.00031315605,0.24258284,0.0150656,0.08336267,0.004190477,0.6460462],"study_design_scores_gemma":[0.000038966406,0.0001958236,0.00047430748,0.0000274712,0.000033777007,0.00020753768,0.00005062185,0.92054975,0.021239353,0.053004988,0.0041574296,0.000020037443],"about_ca_topic_score_codex":0.0013905341,"about_ca_topic_score_gemma":0.0029520541,"teacher_disagreement_score":0.0033110944,"about_ca_system_score_codex":0.0008361158,"about_ca_system_score_gemma":0.0015301221,"threshold_uncertainty_score":0.012333453},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014956341,0.00009899156,0.99694556,0.00011748522,0.00004466267,0.000048295406,0.000031340976,0.00037988112,0.0008381318],"genre_scores_gemma":[0.13675459,0.00042681157,0.8594926,0.00018297478,0.00013890374,0.00028697657,0.00017749802,0.00016599444,0.0023738104],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983577,0.0004789224,0.00010624785,0.00029235514,0.00059171405,0.00017302364],"domain_scores_gemma":[0.9969183,0.0021462198,0.00022116287,0.00023789621,0.0003490724,0.00012731578],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025828406,0.0012777591,0.0010351377,0.0010398498,0.000658382,0.0012759367,0.0014315908,0.0008733872,0.005910503],"category_scores_gemma":[0.006911355,0.0007224508,0.00146283,0.0010833348,0.000801149,0.0018843262,0.0015441314,0.0028631617,0.0009719076],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024602123,0.00022621804,0.0009115709,0.0005738765,0.00016002556,0.00028530485,0.00026107332,0.49740648,0.012935797,0.21211305,0.005827645,0.269053],"study_design_scores_gemma":[0.000045729124,0.0000736685,0.00006563908,0.00002658995,0.000027563348,0.0000725463,0.00001807176,0.9290512,0.0034290664,0.0630238,0.0041514304,0.000014565867],"about_ca_topic_score_codex":0.0028187234,"about_ca_topic_score_gemma":0.004083045,"teacher_disagreement_score":0.005910503,"about_ca_system_score_codex":0.0010148943,"about_ca_system_score_gemma":0.003513685,"threshold_uncertainty_score":0.019772649},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01102215,0.000043793934,0.9756251,0.00012656952,0.000058467613,0.00018824682,0.00079553726,0.008587895,0.003552194],"genre_scores_gemma":[0.2845736,0.0002392195,0.70236516,0.00041337643,0.000041623036,0.0008136136,0.004882266,0.0016859365,0.0049851662],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986733,0.0002800095,0.00017505875,0.00014730042,0.0005805512,0.00014390578],"domain_scores_gemma":[0.99708503,0.0014365719,0.00023186851,0.00060407975,0.0006035989,0.000038868628],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001182932,0.0005557344,0.00038901545,0.00071187655,0.00022576566,0.0009733276,0.00085652113,0.00059168215,0.004881608],"category_scores_gemma":[0.00550907,0.0003425136,0.0006918527,0.0003809175,0.00056628004,0.0006655072,0.00071887363,0.00083182263,0.0014972014],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00051732274,0.0002738167,0.0033059828,0.0009599366,0.000109171386,0.0020022928,0.0006119178,0.4482343,0.08181461,0.16470166,0.011613111,0.28585586],"study_design_scores_gemma":[0.00014984437,0.00014697276,0.0004182207,0.00008026767,0.00004306157,0.00021343639,0.00007942624,0.8217369,0.11260792,0.034928393,0.02956455,0.00003104251],"about_ca_topic_score_codex":0.0022486611,"about_ca_topic_score_gemma":0.0023026394,"teacher_disagreement_score":0.004881608,"about_ca_system_score_codex":0.0006163242,"about_ca_system_score_gemma":0.0011504112,"threshold_uncertainty_score":0.01633066},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036431067,0.00012491259,0.9557638,0.00019552135,0.0000428024,0.00006951823,0.00013517973,0.003864189,0.0033731086],"genre_scores_gemma":[0.6512118,0.00017474992,0.34487554,0.00014102075,0.000038308284,0.00017086275,0.00029841482,0.00075195066,0.0023373524],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99759895,0.00089502794,0.00018677134,0.00028219522,0.0007462188,0.00029070774],"domain_scores_gemma":[0.9947984,0.0024307044,0.0003673314,0.0018761535,0.0004239866,0.00010331724],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023601544,0.0005475364,0.00052365015,0.00085035944,0.0004711784,0.0015835658,0.0013434951,0.00073080417,0.0028901596],"category_scores_gemma":[0.0061853817,0.0004220041,0.000826924,0.00089500356,0.0018316278,0.0039345683,0.0019880694,0.001997589,0.0006293173],"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.0014547078,0.00026778725,0.003037454,0.00030710892,0.000083042185,0.0004448632,0.00046037065,0.24882491,0.038215622,0.5783811,0.0040819384,0.12444103],"study_design_scores_gemma":[0.00009580968,0.0001278988,0.00023891882,0.00006331094,0.00005270952,0.00013643038,0.00003401463,0.815292,0.051547434,0.122407906,0.009952911,0.00005059868],"about_ca_topic_score_codex":0.0019624636,"about_ca_topic_score_gemma":0.0015377406,"teacher_disagreement_score":0.0028901596,"about_ca_system_score_codex":0.0011265835,"about_ca_system_score_gemma":0.0015473879,"threshold_uncertainty_score":0.012481809},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012467427,0.00021250139,0.9838658,0.0003054789,0.00003753266,0.00011509665,0.00031193913,0.00082652736,0.0018576916],"genre_scores_gemma":[0.30393094,0.0005576316,0.6905686,0.0002009049,0.000052988184,0.00050715735,0.0011495698,0.0003155687,0.0027166326],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99867636,0.00046594944,0.00011890399,0.0001491248,0.0004967661,0.00009285863],"domain_scores_gemma":[0.99645436,0.0021656926,0.00040985583,0.0005871216,0.0003375999,0.000045455792],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013623779,0.00071656244,0.0004354452,0.0008667289,0.00041158433,0.0010167239,0.0008713453,0.00075702596,0.0045724357],"category_scores_gemma":[0.0078100627,0.00030860363,0.00078257284,0.0010807655,0.0009324445,0.002028114,0.00069511886,0.0011884561,0.00063071545],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004766442,0.00014546077,0.00068638433,0.00046114397,0.00003496933,0.0003969916,0.00033871757,0.2916494,0.022555334,0.41074008,0.0048957593,0.26761907],"study_design_scores_gemma":[0.00011336849,0.00020472232,0.0002044209,0.00013858547,0.00003971881,0.00027665452,0.000072253875,0.6721976,0.024686338,0.28789032,0.014136865,0.000039156424],"about_ca_topic_score_codex":0.0016406806,"about_ca_topic_score_gemma":0.002016601,"teacher_disagreement_score":0.0045724357,"about_ca_system_score_codex":0.0014431628,"about_ca_system_score_gemma":0.0010794747,"threshold_uncertainty_score":0.01529628},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016408057,0.00017239411,0.9822994,0.00031712817,0.000065958004,0.00005912325,0.0000556517,0.00036004058,0.015029536],"genre_scores_gemma":[0.17849767,0.00071260426,0.7940304,0.0005919718,0.00024063885,0.0004391189,0.00025945326,0.00022984488,0.024998257],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981205,0.00062787783,0.00014289861,0.000305435,0.0006431165,0.00016010265],"domain_scores_gemma":[0.99782157,0.0015794033,0.000079387275,0.00018890537,0.00026902257,0.00006168935],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015190438,0.0008419044,0.0007069377,0.0011528505,0.0008812614,0.003629011,0.0026649665,0.0014607204,0.01191428],"category_scores_gemma":[0.004205697,0.00068871735,0.0016729557,0.0011575939,0.002883404,0.0038062965,0.0015103293,0.003957572,0.002351694],"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.000020183938,0.000038252703,0.00004829451,0.000071930684,0.000015046177,0.00005299417,0.00011392409,0.01103779,0.0008901462,0.9641708,0.0011666921,0.022373967],"study_design_scores_gemma":[0.00002372156,0.000025299776,0.000026014406,0.000037478472,0.000028740838,0.00006227191,0.000031820673,0.08523736,0.0019479591,0.90035754,0.0122081535,0.000013541284],"about_ca_topic_score_codex":0.0015922269,"about_ca_topic_score_gemma":0.0016947476,"teacher_disagreement_score":0.01191428,"about_ca_system_score_codex":0.0015318547,"about_ca_system_score_gemma":0.0015365558,"threshold_uncertainty_score":0.03985727},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0070751323,0.00012557596,0.94686,0.00030345726,0.00039744182,0.00022134304,0.0010472415,0.011497888,0.032471903],"genre_scores_gemma":[0.17689021,0.0007741243,0.7662232,0.00044257162,0.000107384156,0.0005541161,0.0041299015,0.006946817,0.04393161],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99937576,0.00015454735,0.000060345028,0.00014900396,0.00018564581,0.00007466569],"domain_scores_gemma":[0.9987771,0.00067739,0.00005254638,0.00022777487,0.0002191764,0.000046071214],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007609483,0.0007922771,0.00041852688,0.0014569196,0.00082264614,0.0024903729,0.0008212117,0.001063718,0.024660569],"category_scores_gemma":[0.0035182172,0.0010615678,0.0012124273,0.0011884244,0.0013250117,0.0023716276,0.0024424025,0.0017570935,0.009295137],"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.00019251174,0.00016417853,0.00041459582,0.00052962115,0.000044045766,0.0006099885,0.0011736619,0.016931705,0.01980851,0.704028,0.03406122,0.22204186],"study_design_scores_gemma":[0.00011490086,0.00008902624,0.0003973654,0.00024148247,0.000054464163,0.00026041223,0.00035074513,0.07385979,0.041291703,0.64231056,0.24096638,0.000063172185],"about_ca_topic_score_codex":0.004747452,"about_ca_topic_score_gemma":0.0033249082,"teacher_disagreement_score":0.024660569,"about_ca_system_score_codex":0.00082603603,"about_ca_system_score_gemma":0.0009916481,"threshold_uncertainty_score":0.082497776},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05039501,0.00044694103,0.9382804,0.001384607,0.00015009983,0.00014410424,0.000104562176,0.001201889,0.007892274],"genre_scores_gemma":[0.69752973,0.00096583454,0.29603565,0.00045869083,0.00026147993,0.00027364865,0.00035444053,0.0005090602,0.0036113479],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9885113,0.0031826787,0.0009980287,0.0012213162,0.0050222883,0.001064414],"domain_scores_gemma":[0.9636895,0.022745607,0.0024833095,0.005747569,0.00476318,0.0005708097],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009510077,0.0010031335,0.0006981083,0.0015877965,0.0012190755,0.0037786984,0.0018235779,0.0018959776,0.0023104083],"category_scores_gemma":[0.031990662,0.0011378945,0.0024493365,0.0010291723,0.0073664985,0.007681248,0.0029970862,0.004668447,0.0004832374],"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.00012168699,0.00007437449,0.00242265,0.00020681915,0.000037981234,0.0013927228,0.0024639068,0.034797426,0.011009037,0.91569054,0.00081032683,0.030972533],"study_design_scores_gemma":[0.000082553284,0.00018480419,0.0005657802,0.00021045125,0.000110984016,0.00036171553,0.00063573045,0.13497506,0.040457163,0.8023285,0.020009086,0.00007811688],"about_ca_topic_score_codex":0.008115038,"about_ca_topic_score_gemma":0.0053933086,"teacher_disagreement_score":0.009510077,"about_ca_system_score_codex":0.002172699,"about_ca_system_score_gemma":0.003806423,"threshold_uncertainty_score":0.050294638},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0047283615,0.00014195511,0.9923022,0.00023755692,0.000022708116,0.000032445154,0.000012865238,0.00032803617,0.0021938502],"genre_scores_gemma":[0.354967,0.0010541938,0.6409673,0.00021098599,0.000054778833,0.00022954059,0.00009375859,0.000143858,0.002278575],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99555665,0.0022965812,0.00030364652,0.0003055591,0.0013586617,0.00017891584],"domain_scores_gemma":[0.989581,0.0069535063,0.0006321216,0.0020997883,0.0006662134,0.00006751071],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004690908,0.000585586,0.00039717427,0.000952975,0.00074612425,0.0019821632,0.0013214691,0.001066294,0.0019244096],"category_scores_gemma":[0.01610159,0.0005613019,0.0010611573,0.00050479744,0.0047654784,0.0028664963,0.0018308363,0.0017013848,0.00046802213],"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.00003958798,0.000038419203,0.00057909364,0.0003555324,0.000039508286,0.00041659942,0.0006690336,0.099252544,0.009550864,0.78864634,0.000688207,0.099724345],"study_design_scores_gemma":[0.000032580574,0.00010789549,0.00016291035,0.00020436515,0.000031896463,0.00035027185,0.0001185094,0.29697734,0.018655546,0.66364247,0.019677242,0.000038991835],"about_ca_topic_score_codex":0.0013626582,"about_ca_topic_score_gemma":0.00081002485,"teacher_disagreement_score":0.004690908,"about_ca_system_score_codex":0.0012214064,"about_ca_system_score_gemma":0.0015812643,"threshold_uncertainty_score":0.024808168},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016523473,0.00010433659,0.98112535,0.00002641859,0.00001938108,0.00004072206,0.00003688554,0.0015358331,0.000587707],"genre_scores_gemma":[0.47251925,0.00034580406,0.52440053,0.00008537346,0.000046855224,0.00017667301,0.00024892704,0.00048808855,0.0016885675],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99734604,0.0005949126,0.00020611774,0.00053321925,0.0010448213,0.00027485704],"domain_scores_gemma":[0.9981933,0.00080308603,0.00028211332,0.0002856844,0.00039612773,0.000039679486],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014436197,0.00076730194,0.00067967706,0.0022004982,0.00045218458,0.0013219543,0.0012489246,0.00046825036,0.001700355],"category_scores_gemma":[0.003118886,0.0006182206,0.0011979059,0.0013149155,0.0016460709,0.0024745974,0.0009804612,0.00074538373,0.0002742841],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005881518,0.00012613252,0.0074878107,0.0006526294,0.00019594564,0.000905624,0.0009726965,0.27267706,0.09744481,0.38052952,0.0014167505,0.23700288],"study_design_scores_gemma":[0.00007709084,0.00019363435,0.0010178385,0.00007773305,0.00016602656,0.0003231583,0.0001071629,0.8408893,0.061934255,0.08568272,0.009452158,0.00007890598],"about_ca_topic_score_codex":0.0027430477,"about_ca_topic_score_gemma":0.0018885578,"teacher_disagreement_score":0.0027430477,"about_ca_system_score_codex":0.00092076976,"about_ca_system_score_gemma":0.0012906239,"threshold_uncertainty_score":0.0076346993},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011296414,0.00031733583,0.98103964,0.00007774869,0.000036259124,0.000098410164,0.00020218296,0.0020932313,0.004838824],"genre_scores_gemma":[0.38112634,0.001258063,0.6090417,0.00009298517,0.000039839662,0.0007835339,0.0009694121,0.00037328282,0.00631485],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99912995,0.00021897697,0.00007066496,0.00006331696,0.0004418511,0.00007528461],"domain_scores_gemma":[0.99939847,0.00029040565,0.00008017199,0.0001283079,0.000090590154,0.000012129813],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081638445,0.000715676,0.00048736276,0.0008902132,0.0003265933,0.0008542536,0.0011392729,0.00077180384,0.0029325443],"category_scores_gemma":[0.0021653096,0.00044497888,0.0008279261,0.0004730724,0.0006164637,0.00077070796,0.0005478053,0.0007990112,0.0005937732],"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.000076957214,0.000044752134,0.0008446882,0.0005219877,0.00005061075,0.00046117158,0.00019786548,0.79632765,0.031319566,0.110516615,0.0019041635,0.057733953],"study_design_scores_gemma":[0.00005441865,0.000116358584,0.00042112736,0.00005944086,0.000027414142,0.0001928777,0.000021830376,0.9392413,0.017207272,0.020641463,0.02199676,0.000019831417],"about_ca_topic_score_codex":0.0034114996,"about_ca_topic_score_gemma":0.0031239279,"teacher_disagreement_score":0.0034114996,"about_ca_system_score_codex":0.0005786014,"about_ca_system_score_gemma":0.00094322144,"threshold_uncertainty_score":0.0098103285},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009910313,0.000018535084,0.9966966,0.0000995041,0.00002277525,0.0000943322,0.000023041122,0.0011408282,0.00091333],"genre_scores_gemma":[0.050291665,0.000077097975,0.9468611,0.00017931151,0.000024259307,0.00036601548,0.00016678909,0.00032891807,0.001704843],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99573576,0.0016169174,0.00033971423,0.00059217785,0.0014778667,0.00023754039],"domain_scores_gemma":[0.99529713,0.0020647228,0.00031367026,0.0014341581,0.0007859515,0.00010437458],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004545471,0.00094695296,0.0004648128,0.00083490805,0.00060710683,0.0015638979,0.0014652391,0.0009831215,0.0053749564],"category_scores_gemma":[0.007135539,0.00069098815,0.0016020073,0.0003884586,0.0018515456,0.0025317133,0.001932144,0.0022106406,0.001679371],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002959643,0.00031917586,0.0017139126,0.0011155375,0.00014152554,0.000976733,0.001722167,0.07291094,0.07572144,0.51344496,0.0067286496,0.32490897],"study_design_scores_gemma":[0.00023779899,0.00075722375,0.0005281031,0.00033956068,0.00018585799,0.0008071324,0.00021890152,0.5782993,0.10481514,0.14705096,0.16663617,0.00012381308],"about_ca_topic_score_codex":0.001078113,"about_ca_topic_score_gemma":0.0012546405,"teacher_disagreement_score":0.0053749564,"about_ca_system_score_codex":0.00081962545,"about_ca_system_score_gemma":0.0023608026,"threshold_uncertainty_score":0.02403903},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0080543915,0.00943348,0.94468105,0.0062156613,0.0013927879,0.00005852347,0.00014149403,0.00052270084,0.029500011],"genre_scores_gemma":[0.50160456,0.014540437,0.44244215,0.0069328705,0.0035121148,0.00076531473,0.00029387538,0.0007017989,0.029206924],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965404,0.0013281141,0.00023050666,0.00059687387,0.0010370025,0.00026712503],"domain_scores_gemma":[0.992251,0.006077957,0.0003115734,0.00084129,0.00037828708,0.00013996262],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0065960367,0.0016939444,0.0017567707,0.0024956318,0.002475558,0.0057355003,0.0032427933,0.0033022827,0.003900021],"category_scores_gemma":[0.0153446365,0.0008210466,0.0020491048,0.0016180073,0.018633828,0.017117266,0.003981192,0.008826443,0.0010814469],"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.000016257918,0.0000040068803,0.000032049218,0.00003917753,0.000006154424,0.0000305999,0.00014440942,0.00050285354,0.000098477925,0.9928203,0.0011155356,0.0051900856],"study_design_scores_gemma":[0.000015763226,0.000012571004,0.000020268139,0.000026472886,0.000006919353,0.00004211062,0.000026137232,0.0020790214,0.0005102303,0.9857658,0.011484759,0.000009977408],"about_ca_topic_score_codex":0.0011707798,"about_ca_topic_score_gemma":0.00078788254,"teacher_disagreement_score":0.0065960367,"about_ca_system_score_codex":0.0026512935,"about_ca_system_score_gemma":0.0021401665,"threshold_uncertainty_score":0.03488362},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009075631,0.0005133779,0.99540627,0.00021036403,0.000029941684,0.000027861357,0.000051544648,0.0001271319,0.00272608],"genre_scores_gemma":[0.17042911,0.002572321,0.8186672,0.00031770603,0.00018950191,0.0005655338,0.00043995684,0.00020835512,0.0066103917],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99788755,0.000968493,0.00016547344,0.00033753715,0.00053782185,0.000103195925],"domain_scores_gemma":[0.9933781,0.0057794433,0.00022205891,0.00022504423,0.00032086179,0.0000744766],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038434728,0.0015201741,0.0013130497,0.0008685725,0.00059583934,0.0017966152,0.0021125206,0.0016309066,0.0076340484],"category_scores_gemma":[0.010234662,0.0008448037,0.001846118,0.0011405711,0.0019035654,0.002420643,0.0018151212,0.0035498245,0.0015236267],"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.00003615007,0.00004799861,0.0002526474,0.00038305728,0.000097815144,0.000101636506,0.00022158527,0.26518267,0.0008861568,0.65544045,0.0028214396,0.074528486],"study_design_scores_gemma":[0.000018793837,0.000012653495,0.000042002102,0.000051365754,0.000016444183,0.000025597014,0.0000180187,0.5738129,0.00048947305,0.42255205,0.0029489193,0.00001179711],"about_ca_topic_score_codex":0.0034414565,"about_ca_topic_score_gemma":0.0034622338,"teacher_disagreement_score":0.0076340484,"about_ca_system_score_codex":0.0019207497,"about_ca_system_score_gemma":0.0017408396,"threshold_uncertainty_score":0.025538445},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032065113,0.00044535554,0.95561194,0.0009927569,0.00027631246,0.000055643995,0.00016148425,0.00055758015,0.038692404],"genre_scores_gemma":[0.16532438,0.0013847706,0.77461636,0.0010094261,0.00038804457,0.00020766273,0.0006463861,0.0005748748,0.055848084],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998672,0.00029195115,0.00010598797,0.0002789382,0.0005207113,0.00013045361],"domain_scores_gemma":[0.99881136,0.000549826,0.000057823407,0.0002098052,0.0002848938,0.00008623504],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023955693,0.00086600863,0.00078517414,0.0011101892,0.0014367548,0.0038365617,0.0019143221,0.0017420225,0.0071807154],"category_scores_gemma":[0.002383991,0.001088373,0.0020701252,0.0009214024,0.0040079607,0.0064920573,0.002329022,0.0062128133,0.0031992549],"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.0000067360425,0.000008652475,0.000019101777,0.000028386748,0.0000030573192,0.000018584697,0.00011621265,0.000740603,0.0005086788,0.99115235,0.0008121779,0.006585499],"study_design_scores_gemma":[0.000007867598,0.000010751402,0.00002449199,0.000028504106,0.000009227155,0.000037968937,0.00002991207,0.006714458,0.0012654014,0.9645962,0.027266568,0.00000866869],"about_ca_topic_score_codex":0.0024661524,"about_ca_topic_score_gemma":0.0024264986,"teacher_disagreement_score":0.0071807154,"about_ca_system_score_codex":0.0024465572,"about_ca_system_score_gemma":0.0019359778,"threshold_uncertainty_score":0.024021924},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02968055,0.0003870532,0.96463925,0.0010001735,0.00004370672,0.0000713197,0.000016526968,0.00033171047,0.003829708],"genre_scores_gemma":[0.68722486,0.0008132428,0.3079844,0.00022181177,0.00020810221,0.00034009715,0.00008224367,0.0002196252,0.0029056652],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9890721,0.003981274,0.00071087474,0.0008822276,0.004704137,0.0006494901],"domain_scores_gemma":[0.9612553,0.026554467,0.0037301513,0.004386947,0.003064024,0.0010090738],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0074714622,0.0009498101,0.00090784376,0.0016354978,0.0018618158,0.0044029127,0.0019657519,0.0016822618,0.0014023139],"category_scores_gemma":[0.033972327,0.00077108963,0.0013787217,0.0011131061,0.006543749,0.010785102,0.0047692414,0.0032069266,0.00025249878],"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.00011307927,0.000089897854,0.0016185459,0.00030437208,0.000065422544,0.0003331945,0.0023641028,0.17742291,0.010512806,0.74997175,0.00085886405,0.056345027],"study_design_scores_gemma":[0.000036753245,0.000109129454,0.0007001226,0.000071011,0.00004342783,0.00018533455,0.00036761607,0.36537185,0.0077893487,0.61613894,0.009087589,0.00009887357],"about_ca_topic_score_codex":0.0017515452,"about_ca_topic_score_gemma":0.0019482123,"teacher_disagreement_score":0.0074714622,"about_ca_system_score_codex":0.002397033,"about_ca_system_score_gemma":0.0021038884,"threshold_uncertainty_score":0.03951329},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011803962,0.0006147876,0.97581744,0.00016177219,0.00013253746,0.00009485206,0.00006202814,0.0008840472,0.010428604],"genre_scores_gemma":[0.5086577,0.0009957333,0.47830322,0.0002496545,0.0001190251,0.0003264667,0.00016748148,0.00015808149,0.011022659],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995728,0.00009403423,0.00003779955,0.000073532414,0.00015410241,0.000067825466],"domain_scores_gemma":[0.9994844,0.00029359054,0.00005836916,0.00006236137,0.000081879654,0.000019420118],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056168664,0.00036042216,0.0002703232,0.0004235362,0.0004129272,0.0011550515,0.0010538578,0.0005383616,0.0057165436],"category_scores_gemma":[0.0021006262,0.00020078715,0.00027092022,0.00048967014,0.0006649231,0.0014945797,0.0004603263,0.0009701761,0.00064713485],"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.00018617163,0.000053874115,0.00011386121,0.0002061483,0.00001848831,0.00010568449,0.00008465587,0.028092088,0.026190456,0.78932273,0.0026597434,0.15296608],"study_design_scores_gemma":[0.00022752404,0.00029603727,0.00017203594,0.00007416787,0.00008468249,0.00034478155,0.000039834664,0.5432493,0.05413037,0.33525503,0.06606209,0.00006415756],"about_ca_topic_score_codex":0.00051810517,"about_ca_topic_score_gemma":0.0007413533,"teacher_disagreement_score":0.0057165436,"about_ca_system_score_codex":0.0010283422,"about_ca_system_score_gemma":0.0007525578,"threshold_uncertainty_score":0.019123733},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.63661444,0.00019410874,0.35584977,0.00021847521,0.000042299405,0.00008075204,0.00021652051,0.0023202745,0.0044633388],"genre_scores_gemma":[0.95233417,0.000060981227,0.045889042,0.000032766402,0.000007902919,0.000039326285,0.00013886989,0.00005491476,0.0014419295],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989716,0.0004285349,0.000036463727,0.00016449345,0.00030317623,0.0000957838],"domain_scores_gemma":[0.9989631,0.0007114384,0.00007226646,0.00012657179,0.000097105025,0.00002947327],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011973224,0.00047870164,0.00035768584,0.00028642092,0.0005684415,0.00092220964,0.00087591365,0.00067999936,0.002171277],"category_scores_gemma":[0.0023625384,0.00025642733,0.0007166065,0.00024670284,0.0010685073,0.00091112324,0.00055105286,0.0006224138,0.00015427876],"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.00051206694,0.00015620228,0.0041283756,0.00028599994,0.00009799249,0.0008284203,0.0005045975,0.8437917,0.087941624,0.034456667,0.00080911536,0.026487142],"study_design_scores_gemma":[0.00009031269,0.00020537368,0.0005240946,0.00001441907,0.000035622597,0.00010595865,0.000053671938,0.95251966,0.037657674,0.006638015,0.0021425772,0.000012764407],"about_ca_topic_score_codex":0.0067218747,"about_ca_topic_score_gemma":0.0042172396,"teacher_disagreement_score":0.0067218747,"about_ca_system_score_codex":0.0011939558,"about_ca_system_score_gemma":0.0013297797,"threshold_uncertainty_score":0.013365507},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00095890777,0.0010878203,0.98581415,0.00087984046,0.000086682405,0.00020007876,0.0000849875,0.0005210737,0.0103665395],"genre_scores_gemma":[0.07969944,0.0018892032,0.9116119,0.0005612446,0.00024556989,0.0010782572,0.0002605906,0.0003286776,0.00432516],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9907368,0.004425004,0.0005699442,0.00090294995,0.002668138,0.0006972125],"domain_scores_gemma":[0.99183285,0.0052009393,0.00048222565,0.0015341374,0.000739046,0.00021063202],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008746968,0.0020965151,0.0016121385,0.0034863125,0.0019111307,0.006351789,0.0041433624,0.004598816,0.0065551973],"category_scores_gemma":[0.014533749,0.001343991,0.003285126,0.0027055473,0.009606135,0.006043634,0.0037003255,0.006702606,0.0021525833],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000149460375,0.000018796478,0.00012167794,0.00014449544,0.000017148599,0.00022858499,0.00017766989,0.0124291,0.00065526494,0.97035855,0.0013485859,0.014485279],"study_design_scores_gemma":[0.00007162622,0.000084914784,0.00012881622,0.0004250127,0.000059625367,0.0005005906,0.00014231485,0.15594359,0.0029232,0.73333615,0.10633093,0.000053344716],"about_ca_topic_score_codex":0.011235245,"about_ca_topic_score_gemma":0.005250041,"teacher_disagreement_score":0.011235245,"about_ca_system_score_codex":0.0035380393,"about_ca_system_score_gemma":0.00465547,"threshold_uncertainty_score":0.046258926},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005200208,0.001018298,0.97897494,0.0014679461,0.00010534003,0.000060006172,0.00012798814,0.0014004963,0.011644693],"genre_scores_gemma":[0.11594044,0.0013850539,0.87710166,0.00072189834,0.00017625515,0.0003162832,0.00041686505,0.0006988106,0.0032427097],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969704,0.0012612304,0.00018082124,0.0004260552,0.00087266293,0.00028884353],"domain_scores_gemma":[0.99379647,0.004161946,0.00020034765,0.0012494567,0.0004347858,0.00015699484],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003368642,0.00095134426,0.0013617513,0.002067483,0.0015383448,0.0038945356,0.002939387,0.0018369325,0.009242802],"category_scores_gemma":[0.011215144,0.0012244537,0.0018519316,0.0027315358,0.0038944986,0.008801182,0.004799388,0.0042685466,0.0023434164],"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.000103734805,0.00006862601,0.00033066067,0.00027711803,0.00003296866,0.00008244511,0.00022284905,0.028760165,0.0020499034,0.85404676,0.007601121,0.106423534],"study_design_scores_gemma":[0.000047390684,0.000029566161,0.00007254575,0.00010176118,0.000019662693,0.000097377364,0.000067134366,0.1676382,0.0023119668,0.8073207,0.022265324,0.00002836157],"about_ca_topic_score_codex":0.0020680714,"about_ca_topic_score_gemma":0.002609249,"teacher_disagreement_score":0.009242802,"about_ca_system_score_codex":0.0015174601,"about_ca_system_score_gemma":0.0017632423,"threshold_uncertainty_score":0.030920267},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11222906,0.0005899152,0.81076974,0.0009416055,0.0003354178,0.0001345077,0.0006312097,0.0017513507,0.072617166],"genre_scores_gemma":[0.9142424,0.00029635124,0.062383078,0.00020017677,0.00012798894,0.00022939767,0.00041184452,0.00023732777,0.021871518],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990128,0.0002508951,0.00008944593,0.0002618333,0.00027678328,0.00010818149],"domain_scores_gemma":[0.99692494,0.0017478713,0.00019021408,0.0005479223,0.00044180907,0.00014709347],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005924688,0.00061984605,0.00054420397,0.0010842955,0.0012045257,0.0025867021,0.00081080827,0.0011609204,0.007344168],"category_scores_gemma":[0.0041235965,0.0005296834,0.00096262834,0.0007318273,0.0018934375,0.0039941897,0.0015634797,0.0018847999,0.0012287614],"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.000028452143,0.000015403328,0.0002263779,0.000027321272,0.000006015554,0.000091425165,0.00033050717,0.0024131772,0.0016994566,0.98941725,0.00052603503,0.0052185305],"study_design_scores_gemma":[0.000023645154,0.000020855874,0.0001926376,0.000015739655,0.000019562482,0.0001272356,0.00009817259,0.030114355,0.0023535225,0.9581799,0.008839596,0.000014755515],"about_ca_topic_score_codex":0.0008504522,"about_ca_topic_score_gemma":0.00082727155,"teacher_disagreement_score":0.007344168,"about_ca_system_score_codex":0.0010176324,"about_ca_system_score_gemma":0.0006387712,"threshold_uncertainty_score":0.024568677},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.083440036,0.00033768362,0.90491956,0.00011625712,0.000075681855,0.00009034836,0.000288786,0.0009839115,0.009747812],"genre_scores_gemma":[0.64190555,0.00047564876,0.35358498,0.00006577999,0.000015987023,0.00012029048,0.00033994103,0.00009507651,0.0033966983],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996549,0.00009473236,0.00003272792,0.000054615793,0.00012598361,0.000037016584],"domain_scores_gemma":[0.9996592,0.00017495707,0.0000560467,0.00003908834,0.00005297809,0.000017755543],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040387598,0.00041147153,0.00029641343,0.00041215366,0.00021920679,0.00063698087,0.0002929201,0.00028353228,0.0018313637],"category_scores_gemma":[0.00088735286,0.00021076306,0.00043835092,0.00030704174,0.00027597207,0.0005040685,0.00019239822,0.0003304642,0.00033304817],"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.00039915112,0.000121681514,0.0011296081,0.0005395505,0.00010040856,0.00084825675,0.0002523532,0.34363842,0.1572254,0.31124073,0.0024404621,0.182064],"study_design_scores_gemma":[0.00018128126,0.00031189437,0.0003502383,0.00008493297,0.000090423266,0.00038043232,0.000043941836,0.7035527,0.19396958,0.06903556,0.031947277,0.000051737832],"about_ca_topic_score_codex":0.0010281305,"about_ca_topic_score_gemma":0.0013625342,"teacher_disagreement_score":0.0018313637,"about_ca_system_score_codex":0.0005372405,"about_ca_system_score_gemma":0.00056061486,"threshold_uncertainty_score":0.0061264634},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0034198207,0.0010315028,0.9030037,0.0010852284,0.00048797892,0.00007565122,0.0002860782,0.0015776162,0.08903236],"genre_scores_gemma":[0.24891742,0.0022400673,0.5930239,0.0012488237,0.0006919032,0.00051019347,0.0007086483,0.002301047,0.15035799],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995332,0.00014047137,0.000035493253,0.00008095299,0.0001515044,0.000058342954],"domain_scores_gemma":[0.99944526,0.00026790344,0.00003241695,0.00012437452,0.00009680673,0.00003314562],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000956514,0.0009112157,0.00053108175,0.0008144846,0.001001962,0.0017766816,0.0012054249,0.00091089314,0.0145940455],"category_scores_gemma":[0.0019327325,0.00057275675,0.00073539687,0.00081407727,0.002109204,0.0034537502,0.0012640788,0.0018776202,0.004461741],"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.000011103167,0.0000065507184,0.000012327472,0.00006277349,0.0000020544983,0.000061011247,0.00016166501,0.0007633744,0.0016736239,0.97456294,0.0039436547,0.018738924],"study_design_scores_gemma":[0.0000114520735,0.00002587068,0.00002501673,0.000063058826,0.000010680372,0.00019637495,0.000041512576,0.005827505,0.002806939,0.85481584,0.13615866,0.000017079756],"about_ca_topic_score_codex":0.00057124655,"about_ca_topic_score_gemma":0.00065616297,"teacher_disagreement_score":0.0145940455,"about_ca_system_score_codex":0.000687099,"about_ca_system_score_gemma":0.0007263113,"threshold_uncertainty_score":0.048821926},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8596258,0.0043968614,0.11547366,0.00055122783,0.00014754792,0.00053952966,0.001704415,0.0012570961,0.016303826],"genre_scores_gemma":[0.84423757,0.0009824556,0.15070178,0.000089916095,0.000054543732,0.00034498915,0.0011818595,0.00020218815,0.0022047646],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963251,0.0020516757,0.00023472088,0.00040222032,0.00071214896,0.00027421376],"domain_scores_gemma":[0.94140565,0.051648144,0.0011303985,0.0033990631,0.0019322659,0.00048444336],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037190805,0.0006990709,0.0010251919,0.0010923825,0.0007104818,0.0009721807,0.0013151041,0.0009228846,0.0045822044],"category_scores_gemma":[0.023525419,0.00045614957,0.00062525284,0.0023710816,0.000869449,0.0016005253,0.0007281902,0.001754444,0.00069853425],"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.006249632,0.0050286744,0.0092968065,0.0014126964,0.00029436467,0.00032468647,0.0008399207,0.4968156,0.01626228,0.03040078,0.0112246955,0.42184994],"study_design_scores_gemma":[0.0008388503,0.0030259136,0.0036700289,0.000109368775,0.0001117921,0.00023924041,0.00041057865,0.93409735,0.027341897,0.022632005,0.0074655875,0.000057414632],"about_ca_topic_score_codex":0.0017072391,"about_ca_topic_score_gemma":0.0018214041,"teacher_disagreement_score":0.0045822044,"about_ca_system_score_codex":0.0011814395,"about_ca_system_score_gemma":0.0009836499,"threshold_uncertainty_score":0.01966858},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016386285,0.0011135609,0.9319447,0.001387019,0.00021180972,0.00034945438,0.0008488754,0.005593878,0.04216441],"genre_scores_gemma":[0.15321758,0.0012271935,0.8303786,0.00046989752,0.00013019485,0.00042663398,0.0030270845,0.00079621165,0.010326627],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99676573,0.0010311394,0.00019532163,0.0005440933,0.0010476647,0.00041605972],"domain_scores_gemma":[0.99690825,0.001523001,0.0001193154,0.00087855296,0.0005046467,0.000066314155],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015852412,0.0012222752,0.0012240339,0.0014393205,0.0011611013,0.0023881292,0.002247519,0.0012514896,0.0240766],"category_scores_gemma":[0.0074613355,0.00077335467,0.0018304305,0.0020126048,0.000822645,0.0029119374,0.0023973056,0.00228386,0.0061393077],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019163947,0.00030933425,0.0012711867,0.00089476694,0.00021965602,0.00024931505,0.00023776565,0.13705574,0.013795379,0.2319747,0.047380075,0.5664205],"study_design_scores_gemma":[0.00019433362,0.000104087965,0.0005742829,0.00012921507,0.00011326401,0.00029283258,0.0002787384,0.6074497,0.017508376,0.28948718,0.08383291,0.00003508203],"about_ca_topic_score_codex":0.0031055182,"about_ca_topic_score_gemma":0.0069308197,"teacher_disagreement_score":0.0240766,"about_ca_system_score_codex":0.0015750006,"about_ca_system_score_gemma":0.0024891389,"threshold_uncertainty_score":0.08054429},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16479012,0.00074659544,0.82336473,0.00072406733,0.00004959511,0.00021565086,0.00040344466,0.0013058144,0.008400041],"genre_scores_gemma":[0.89353836,0.0006092027,0.101343215,0.00011419583,0.000041779007,0.00029271038,0.00070390484,0.00019064166,0.0031660695],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965766,0.001310193,0.0002561323,0.00074441254,0.0006947545,0.00041785566],"domain_scores_gemma":[0.9758494,0.018971613,0.0017436696,0.0021064528,0.0008801693,0.0004487457],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031773024,0.0008645485,0.0008308249,0.00084424607,0.0009853655,0.0035096784,0.0017971745,0.0013463263,0.0027550783],"category_scores_gemma":[0.018141646,0.0009946788,0.0010770172,0.0009864199,0.0029905306,0.0070009907,0.0018454584,0.0019447245,0.000280688],"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.00038078992,0.000120720906,0.0027869777,0.00032807613,0.00010560539,0.0003921595,0.00056136,0.54345924,0.0070138117,0.42268535,0.00072761957,0.021438237],"study_design_scores_gemma":[0.000046941594,0.000030480644,0.00031024887,0.000028103232,0.000039318093,0.00006349114,0.000087479755,0.73755336,0.0047847675,0.2542674,0.002764708,0.000023699464],"about_ca_topic_score_codex":0.006947071,"about_ca_topic_score_gemma":0.00505354,"teacher_disagreement_score":0.006947071,"about_ca_system_score_codex":0.0033338587,"about_ca_system_score_gemma":0.0017315049,"threshold_uncertainty_score":0.024188876},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021208223,0.00018921422,0.9740993,0.00034996358,0.000023015447,0.00007179002,0.00005282939,0.000887454,0.0031181874],"genre_scores_gemma":[0.57670707,0.00042513022,0.420405,0.00025836588,0.00006184402,0.00035835488,0.00017021311,0.00033767603,0.0012764067],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99563533,0.0020797416,0.000346756,0.0005413809,0.0010440347,0.0003527257],"domain_scores_gemma":[0.9892308,0.008151524,0.0006028723,0.0013769129,0.000442628,0.00019539359],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006279396,0.00069167634,0.00071710144,0.0018914317,0.0012130926,0.002709843,0.0014221267,0.0011907609,0.002037566],"category_scores_gemma":[0.013672684,0.0009899131,0.0022299848,0.0011627217,0.0072375345,0.007947199,0.0029647409,0.0022372706,0.00025914836],"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.00008846783,0.000053725427,0.0013410891,0.00014124505,0.00003928515,0.0005659444,0.0006418598,0.09166255,0.0038576783,0.88083285,0.00039452754,0.020380752],"study_design_scores_gemma":[0.000052126863,0.000059850663,0.00019331826,0.00011981456,0.000047948844,0.0001675147,0.00015452295,0.34534997,0.006821778,0.6427461,0.0042518117,0.000035197576],"about_ca_topic_score_codex":0.0030776982,"about_ca_topic_score_gemma":0.0031219013,"teacher_disagreement_score":0.006279396,"about_ca_system_score_codex":0.0012285988,"about_ca_system_score_gemma":0.0014899848,"threshold_uncertainty_score":0.033209026},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008588866,0.00024707298,0.97369087,0.00063906424,0.00011505729,0.00011250126,0.00022222078,0.00019719503,0.016187226],"genre_scores_gemma":[0.22240566,0.0008895507,0.75937366,0.0008429088,0.00042971905,0.00057279074,0.0011818575,0.00029063036,0.014013206],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980603,0.0007925613,0.00009871099,0.00032165338,0.00057063135,0.00015608735],"domain_scores_gemma":[0.9974511,0.0015936827,0.0002024954,0.00033977086,0.00029817145,0.00011469383],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031394255,0.0011765929,0.00068080216,0.0006043916,0.0005008402,0.0014401068,0.0014461371,0.00082931295,0.007652834],"category_scores_gemma":[0.005826679,0.0006848325,0.0014941833,0.00075149426,0.0015182877,0.0030312974,0.0016966576,0.00481453,0.001217604],"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.00024549343,0.00027079787,0.0003099505,0.0005602697,0.00008496317,0.00031986972,0.00043730641,0.22816153,0.008291162,0.6438201,0.011544208,0.105954275],"study_design_scores_gemma":[0.00008458431,0.00020250375,0.00018504677,0.00012290757,0.00002907142,0.00024285437,0.000099843615,0.55545336,0.0034864137,0.4162477,0.023796197,0.000049508308],"about_ca_topic_score_codex":0.000764162,"about_ca_topic_score_gemma":0.001002585,"teacher_disagreement_score":0.007652834,"about_ca_system_score_codex":0.00089059153,"about_ca_system_score_gemma":0.0010589346,"threshold_uncertainty_score":0.025601327},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027893297,0.00009995648,0.9534742,0.00022051865,0.000064190994,0.00011250023,0.00006568704,0.0027474668,0.015322175],"genre_scores_gemma":[0.6871338,0.00014941457,0.29658574,0.00021955314,0.000031488114,0.00018277332,0.00017107396,0.0005689399,0.014957272],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997678,0.0007254139,0.00014741093,0.00031957706,0.0008618037,0.00026787358],"domain_scores_gemma":[0.99845994,0.0006816457,0.000104260755,0.000405195,0.00029751813,0.000051370036],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001750591,0.0003681047,0.0003347426,0.00053702854,0.0006863431,0.0013403249,0.0006152062,0.0006655827,0.0058043697],"category_scores_gemma":[0.0029228327,0.00034016478,0.0006948344,0.00032152914,0.001119727,0.0020860347,0.0017836103,0.00085319043,0.0013711107],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00063265016,0.00023805903,0.0022941474,0.00027730712,0.000087099135,0.0013786777,0.000601269,0.082556464,0.09360097,0.54667836,0.006505746,0.2651493],"study_design_scores_gemma":[0.00012519814,0.00024907815,0.00071570335,0.00006645547,0.000059431273,0.0005229222,0.000138126,0.61858666,0.21024327,0.11824256,0.051003464,0.000047105692],"about_ca_topic_score_codex":0.0030658613,"about_ca_topic_score_gemma":0.002367893,"teacher_disagreement_score":0.0058043697,"about_ca_system_score_codex":0.00077292114,"about_ca_system_score_gemma":0.0013238713,"threshold_uncertainty_score":0.019417524},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19060849,0.0003595614,0.8002842,0.0005378846,0.00002949583,0.00020292179,0.000227194,0.00047944655,0.0072708493],"genre_scores_gemma":[0.9123717,0.00029687973,0.08464782,0.000070364775,0.00003292588,0.00026519425,0.00029863545,0.00006228541,0.0019542424],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977794,0.0007869126,0.000105811065,0.00043416512,0.0006702259,0.00022334482],"domain_scores_gemma":[0.9863582,0.011296929,0.000985876,0.0006904126,0.00043923777,0.0002292297],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023210228,0.0006724015,0.00062704104,0.0008603586,0.00079289376,0.0015144113,0.0014573067,0.0009154372,0.0025229598],"category_scores_gemma":[0.016394088,0.00057235884,0.00085335626,0.00060471776,0.0023060532,0.0034806943,0.0016466578,0.0015136313,0.00016246524],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000084907086,0.00007415326,0.0027034844,0.000098490375,0.00006486998,0.00028425956,0.0001867022,0.87194437,0.0037654918,0.11228166,0.00023390225,0.0082777515],"study_design_scores_gemma":[0.000012956374,0.000016007029,0.00044775987,0.00000745033,0.000013723068,0.00002527438,0.00004547098,0.9306616,0.0013980833,0.066553354,0.0008116518,0.0000065857816],"about_ca_topic_score_codex":0.0035080079,"about_ca_topic_score_gemma":0.0024549423,"teacher_disagreement_score":0.0035080079,"about_ca_system_score_codex":0.0018677027,"about_ca_system_score_gemma":0.0010909765,"threshold_uncertainty_score":0.013551176},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01374178,0.00012585681,0.9830367,0.00017369763,0.000015747148,0.000074071766,0.000115545474,0.00042668977,0.0022899613],"genre_scores_gemma":[0.35122353,0.0005945169,0.6452914,0.00015468769,0.000047318426,0.00030786326,0.00041421567,0.0001382485,0.0018281674],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978656,0.0005918478,0.00013700593,0.00034022777,0.0008595581,0.00020576893],"domain_scores_gemma":[0.99606186,0.00259981,0.0004955017,0.0002571964,0.0005223553,0.000063246785],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021141425,0.0006919634,0.0005736705,0.0010460333,0.0005801138,0.0017061578,0.001269043,0.0006895265,0.0024105099],"category_scores_gemma":[0.005563904,0.00039151462,0.0012203192,0.0011513853,0.0014145911,0.00254553,0.00071968074,0.0011863755,0.00032303864],"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.00023889543,0.00010207754,0.0015173154,0.0004896097,0.00014539433,0.0008454616,0.00028806753,0.59169644,0.024861163,0.30707955,0.0018462654,0.07088983],"study_design_scores_gemma":[0.000046411988,0.000052705094,0.00019726195,0.0000280387,0.000043944045,0.000116888106,0.00004366057,0.90603846,0.014724269,0.07541398,0.003269686,0.00002463693],"about_ca_topic_score_codex":0.008124793,"about_ca_topic_score_gemma":0.005858006,"teacher_disagreement_score":0.008124793,"about_ca_system_score_codex":0.0013414755,"about_ca_system_score_gemma":0.0025081807,"threshold_uncertainty_score":0.016155005},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0125900805,0.0001529711,0.98458993,0.00039566116,0.00004289319,0.00007826839,0.0000291378,0.00029411635,0.001826994],"genre_scores_gemma":[0.58708316,0.00048760584,0.40896824,0.00049478194,0.000118271004,0.00034303268,0.000099069366,0.00012969179,0.0022760718],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99702626,0.0010033926,0.00018521326,0.00057098904,0.0008674825,0.00034661085],"domain_scores_gemma":[0.98768973,0.007648759,0.0007745994,0.0028567058,0.0008396578,0.00019055034],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0058488213,0.0007205774,0.000695706,0.0012343081,0.0016141027,0.0024107506,0.0019201528,0.0014041389,0.001855097],"category_scores_gemma":[0.016932517,0.00056466856,0.001681329,0.0009587813,0.0067560393,0.0077503356,0.003979744,0.0026228926,0.00030134665],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012016253,0.00008890065,0.0015584994,0.00019126036,0.00007626888,0.0004340478,0.000991854,0.12373746,0.0066360277,0.77324104,0.0015542664,0.091370285],"study_design_scores_gemma":[0.00001717826,0.00003346437,0.00012879641,0.00004911594,0.000042866122,0.00009864988,0.000092650975,0.335278,0.007408627,0.6530772,0.0037413256,0.000032135813],"about_ca_topic_score_codex":0.004309932,"about_ca_topic_score_gemma":0.0027514398,"teacher_disagreement_score":0.0058488213,"about_ca_system_score_codex":0.0017938253,"about_ca_system_score_gemma":0.0028426289,"threshold_uncertainty_score":0.03093189},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026223114,0.0001238274,0.9680769,0.00016772581,0.00004114785,0.00030980166,0.0004945905,0.0028781397,0.0016847167],"genre_scores_gemma":[0.3576753,0.00049159606,0.63363,0.00020344762,0.00005395557,0.0015313444,0.0027010918,0.0006697107,0.0030436094],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99635184,0.0011765497,0.000335214,0.00022544923,0.0016888902,0.00022209858],"domain_scores_gemma":[0.9949845,0.0023716555,0.0005350486,0.0010591467,0.00096533116,0.00008421514],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004114968,0.0009348641,0.0006052569,0.0010424495,0.0004621899,0.0015609775,0.0017840526,0.00078928284,0.001639828],"category_scores_gemma":[0.0055453447,0.0005335766,0.001082028,0.00047313192,0.0015848019,0.0016251148,0.0008964425,0.0013308078,0.0004296733],"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.00033892615,0.0003089453,0.003700775,0.0007502479,0.00012438977,0.0011780352,0.00066753314,0.57891333,0.065162115,0.26367426,0.004723918,0.08045743],"study_design_scores_gemma":[0.00011029277,0.00021198124,0.00039092972,0.000090381254,0.00006309575,0.0002596795,0.00005057798,0.8984305,0.061003763,0.018687896,0.020654371,0.00004654284],"about_ca_topic_score_codex":0.003936598,"about_ca_topic_score_gemma":0.0027705966,"teacher_disagreement_score":0.004114968,"about_ca_system_score_codex":0.0011107177,"about_ca_system_score_gemma":0.0028597699,"threshold_uncertainty_score":0.021762311},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021319754,0.0002745439,0.9738995,0.000045805038,0.000016531303,0.00003666196,0.000039548482,0.0008710421,0.003496613],"genre_scores_gemma":[0.5160324,0.00049693714,0.47516805,0.00010061565,0.00002474701,0.00016138572,0.00023780877,0.00040844548,0.0073696217],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99978906,0.000053652864,0.000010096574,0.000058193607,0.00005703703,0.00003183417],"domain_scores_gemma":[0.99985135,0.00006212155,0.000025565338,0.00003319408,0.000021506565,0.0000063342713],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033518745,0.00069069513,0.0004039045,0.00039904134,0.0003205775,0.00032730273,0.00045038253,0.00026239012,0.003943509],"category_scores_gemma":[0.0006455994,0.00019776874,0.00045142422,0.0004474368,0.00043375324,0.00078200107,0.00042851083,0.00051814667,0.00039659085],"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.00022199308,0.000056457942,0.0003866204,0.00035745942,0.000049805672,0.00013917008,0.00014456335,0.457996,0.07151019,0.10677804,0.0023116607,0.36004812],"study_design_scores_gemma":[0.000035354922,0.00023799513,0.0003088706,0.000029137746,0.00006209356,0.000095116426,0.00003048837,0.9033089,0.035657424,0.048507657,0.011708751,0.000018247956],"about_ca_topic_score_codex":0.0015203593,"about_ca_topic_score_gemma":0.0029170453,"teacher_disagreement_score":0.003943509,"about_ca_system_score_codex":0.00068544917,"about_ca_system_score_gemma":0.0005380648,"threshold_uncertainty_score":0.013192356},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044399664,0.000057329293,0.95204616,0.00012461838,0.000016203645,0.00014433642,0.0002302551,0.0022014207,0.0007800588],"genre_scores_gemma":[0.4446885,0.00017764406,0.55298513,0.000121277975,0.000028122171,0.00041348094,0.0006749537,0.00023485103,0.0006760456],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.992644,0.0028016635,0.0006628031,0.0012505581,0.0020742014,0.00056679687],"domain_scores_gemma":[0.97344095,0.020081442,0.002684253,0.0018119392,0.0017950743,0.00018640069],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005469316,0.0007831051,0.0007908986,0.0009336879,0.0006673812,0.002390955,0.0015657285,0.0010165665,0.0020620772],"category_scores_gemma":[0.026333766,0.0006789892,0.001493896,0.00096371403,0.0020825653,0.002414663,0.0010512607,0.001148571,0.00034945557],"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.0009715525,0.00029166095,0.0053472198,0.0008536993,0.00032908222,0.0009487769,0.00070282473,0.69717497,0.06005331,0.11956473,0.0014538715,0.11230838],"study_design_scores_gemma":[0.00021801442,0.00015408684,0.00043757036,0.000049963786,0.00006983428,0.0001463554,0.00007262225,0.9161773,0.051422197,0.029232556,0.001983202,0.000036315403],"about_ca_topic_score_codex":0.006271468,"about_ca_topic_score_gemma":0.0061940374,"teacher_disagreement_score":0.006271468,"about_ca_system_score_codex":0.0012536896,"about_ca_system_score_gemma":0.0039118924,"threshold_uncertainty_score":0.028924882},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03429044,0.0005180921,0.953707,0.00033404236,0.00013912552,0.00008954343,0.00008946797,0.0011043949,0.009727972],"genre_scores_gemma":[0.36437953,0.0005153276,0.6288163,0.00022474448,0.00012353729,0.00015771664,0.00013459146,0.0002252454,0.005422943],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99894553,0.00024525227,0.00012351926,0.00022134648,0.00033867636,0.00012568211],"domain_scores_gemma":[0.99897635,0.0003988136,0.00015049346,0.00029406295,0.00013085837,0.000049399736],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010223541,0.0006665654,0.0006417845,0.0006478121,0.00045102547,0.0015979542,0.0013634267,0.0004674655,0.0045338473],"category_scores_gemma":[0.0029011515,0.00044603762,0.0008549592,0.00065774575,0.0015627504,0.00513539,0.0015442292,0.0010503468,0.000834747],"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.00017485887,0.00004685246,0.00029406286,0.0003644448,0.000035677414,0.0005198675,0.00030147855,0.015194746,0.033406984,0.77901834,0.001904897,0.1687377],"study_design_scores_gemma":[0.000119716344,0.0003181188,0.00029641527,0.00014652379,0.0001677912,0.0010251085,0.00013114019,0.20186417,0.117489986,0.61558217,0.0627839,0.000074916],"about_ca_topic_score_codex":0.00029611686,"about_ca_topic_score_gemma":0.00054381735,"teacher_disagreement_score":0.0045338473,"about_ca_system_score_codex":0.0006203159,"about_ca_system_score_gemma":0.0005243167,"threshold_uncertainty_score":0.015167236},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0039945133,0.0000886402,0.99170893,0.0000947384,0.000042624153,0.000075082746,0.000052080464,0.00163425,0.0023090343],"genre_scores_gemma":[0.21939449,0.00027595035,0.7768396,0.00016139605,0.00005840546,0.00027651846,0.00018397674,0.00027998604,0.0025296635],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997827,0.0006392839,0.00017807535,0.0002129897,0.0008980142,0.0002446328],"domain_scores_gemma":[0.99678266,0.0019075267,0.00019884846,0.0007582807,0.00028584956,0.00006681087],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026848554,0.0004965092,0.0006162023,0.0013837202,0.00047088027,0.0015379398,0.0013712824,0.0005449992,0.002415397],"category_scores_gemma":[0.0043698754,0.00046677064,0.00085874385,0.00062350923,0.0018027021,0.0021866863,0.0020110444,0.0012327771,0.00043455613],"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.00024162214,0.00018008935,0.0017556137,0.00048151825,0.000103449565,0.0004778852,0.00026872006,0.22195047,0.015991246,0.6015671,0.0025290363,0.1544532],"study_design_scores_gemma":[0.00017059888,0.00014676095,0.00034720832,0.00008694959,0.000073757416,0.00019857551,0.00004128949,0.6462582,0.031436507,0.2904827,0.030711487,0.00004598372],"about_ca_topic_score_codex":0.001954865,"about_ca_topic_score_gemma":0.0025493708,"teacher_disagreement_score":0.0026848554,"about_ca_system_score_codex":0.0009632711,"about_ca_system_score_gemma":0.0017352211,"threshold_uncertainty_score":0.014199078},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05085751,0.001688601,0.2650276,0.0029962026,0.0012044074,0.00020482905,0.0008451769,0.001119138,0.67605656],"genre_scores_gemma":[0.66775006,0.0018410654,0.05165571,0.0016587802,0.0011938714,0.0005030594,0.0017939581,0.0007493419,0.2728542],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994085,0.00009177123,0.000043924025,0.00017630924,0.00020762206,0.00007180956],"domain_scores_gemma":[0.99938846,0.00019529078,0.000036513575,0.00019116026,0.00014142561,0.000047168876],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055822154,0.0007381735,0.0007421867,0.0009452992,0.0017031125,0.0016516361,0.00056143216,0.00066434033,0.01534901],"category_scores_gemma":[0.0012120797,0.00048481324,0.00081344915,0.0006112526,0.0022877054,0.0038244145,0.0020760717,0.0025473272,0.005155787],"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.00005713509,0.000024392495,0.00012582293,0.00008324102,0.000010951988,0.00011637541,0.00030513614,0.0004049111,0.0030517546,0.95132446,0.009500858,0.034994997],"study_design_scores_gemma":[0.00001292312,0.00004447026,0.00015134047,0.000025188892,0.000014895756,0.00025196568,0.00009559965,0.0010561767,0.0030434965,0.93305516,0.062240545,0.000008222986],"about_ca_topic_score_codex":0.00029318215,"about_ca_topic_score_gemma":0.00029452043,"teacher_disagreement_score":0.01534901,"about_ca_system_score_codex":0.0005153251,"about_ca_system_score_gemma":0.0006690686,"threshold_uncertainty_score":0.051347494},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15391538,0.00032569136,0.8221178,0.002141007,0.000089458765,0.0004815587,0.0012353547,0.006530129,0.013163664],"genre_scores_gemma":[0.70017946,0.00026757477,0.28835022,0.0008401391,0.00008795669,0.00029808137,0.0025382722,0.0010067434,0.006431518],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99648464,0.0006479451,0.00017869262,0.00082131923,0.0013526834,0.0005148115],"domain_scores_gemma":[0.99602294,0.0024035051,0.0003635501,0.00063062576,0.00044991405,0.00012940519],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021649583,0.00092171674,0.0008363776,0.00091812975,0.0010464037,0.002365668,0.0021995835,0.0012417194,0.005436322],"category_scores_gemma":[0.0076380344,0.0007667139,0.0019789482,0.0012740939,0.0028930414,0.004022826,0.0024503353,0.00270573,0.00054722524],"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.0010560043,0.00055756845,0.0071450686,0.00076254405,0.00025060278,0.0031637861,0.0018202339,0.19486587,0.06929264,0.5916419,0.011794146,0.11764977],"study_design_scores_gemma":[0.00028711383,0.00021888752,0.0009098109,0.000066564295,0.00016322825,0.00065802294,0.0003822847,0.44055963,0.04156111,0.504163,0.010947315,0.00008292676],"about_ca_topic_score_codex":0.0103459535,"about_ca_topic_score_gemma":0.009963583,"teacher_disagreement_score":0.0103459535,"about_ca_system_score_codex":0.0018460548,"about_ca_system_score_gemma":0.0025597687,"threshold_uncertainty_score":0.02057147},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008627093,0.00010961891,0.98865706,0.000052689807,0.00003359856,0.000046367826,0.000038602142,0.0016999989,0.0007348419],"genre_scores_gemma":[0.33781207,0.00014235728,0.6604503,0.00009493699,0.000025597554,0.000299305,0.00020314739,0.00027509467,0.00069722586],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99709165,0.00092892756,0.00024126864,0.00054971356,0.000980616,0.000207782],"domain_scores_gemma":[0.9907962,0.0065965694,0.00079824426,0.0009738848,0.0006573161,0.0001777651],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025122436,0.001104375,0.0010599364,0.0017001979,0.00075762894,0.0011080286,0.0018306132,0.0014212312,0.0016642252],"category_scores_gemma":[0.012151999,0.0006506937,0.0015202465,0.00084721093,0.002195327,0.0021837011,0.0014864631,0.001867205,0.00047102128],"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.0012023462,0.00037158918,0.005748501,0.0013176011,0.00027988048,0.002149807,0.001306123,0.29159632,0.27729824,0.13994539,0.0030208335,0.2757634],"study_design_scores_gemma":[0.00018304987,0.00045059327,0.0007196093,0.0001959276,0.00015787245,0.0008020266,0.00008293905,0.80764365,0.1316519,0.05135183,0.0066729225,0.00008772842],"about_ca_topic_score_codex":0.0012198462,"about_ca_topic_score_gemma":0.001125528,"teacher_disagreement_score":0.0025122436,"about_ca_system_score_codex":0.00066557096,"about_ca_system_score_gemma":0.0012790889,"threshold_uncertainty_score":0.013286173},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020386592,0.00006152672,0.9779678,0.00010828274,0.000010379555,0.00008131998,0.00006197151,0.00038719559,0.00093487656],"genre_scores_gemma":[0.42588517,0.000119839184,0.571556,0.0000904842,0.00001489962,0.0003517335,0.00026755157,0.00020927627,0.0015050495],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980416,0.0007451775,0.00010241901,0.00027060814,0.0006604712,0.00017970179],"domain_scores_gemma":[0.99475807,0.0039734705,0.0004614692,0.0003098778,0.00038922508,0.00010795318],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002231633,0.0009376786,0.000705498,0.00094184215,0.00048517223,0.00070751185,0.0007177545,0.0005271821,0.0026768325],"category_scores_gemma":[0.0057746456,0.00040958836,0.0010735849,0.00072847446,0.0011417451,0.0009109505,0.0011291798,0.0011823176,0.00027603944],"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.000087607186,0.00007043397,0.0007433073,0.00012826081,0.000038723967,0.0000717116,0.0000572146,0.91489565,0.0049477485,0.023670942,0.00051847234,0.05476992],"study_design_scores_gemma":[0.000015449914,0.00004068306,0.00012384373,0.000011444496,0.000011298516,0.000019032828,0.000010142395,0.98278123,0.0033578975,0.0130205415,0.0006025278,0.0000059388603],"about_ca_topic_score_codex":0.003088341,"about_ca_topic_score_gemma":0.004408504,"teacher_disagreement_score":0.003088341,"about_ca_system_score_codex":0.0016374314,"about_ca_system_score_gemma":0.0022379637,"threshold_uncertainty_score":0.011880457},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09186911,0.0005101671,0.89900863,0.001101151,0.00008577925,0.00013466377,0.00006226168,0.0013471367,0.0058811004],"genre_scores_gemma":[0.7079326,0.0003610195,0.2874201,0.0004421001,0.000070269394,0.00028309724,0.00010689858,0.00029795518,0.003086],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9912177,0.0024258466,0.000773697,0.0016316555,0.0027880946,0.0011629964],"domain_scores_gemma":[0.9831866,0.0063785287,0.0014358343,0.005961488,0.0025168024,0.0005207004],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0063656843,0.0011004673,0.0017257006,0.00063716754,0.0009659119,0.0025668202,0.0021189293,0.0022922766,0.00417255],"category_scores_gemma":[0.022534389,0.0012881726,0.0014582999,0.0004412971,0.003250881,0.0059465067,0.00277563,0.0030448313,0.0010476051],"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.0004485883,0.00020005977,0.0072001573,0.0010229407,0.00042508732,0.00047412532,0.0010854203,0.10374686,0.046772093,0.65950584,0.0015152821,0.17760356],"study_design_scores_gemma":[0.00018608556,0.0009924833,0.003416945,0.0005627953,0.0005105462,0.00057695375,0.0009378613,0.38078287,0.07008275,0.52461934,0.017172199,0.00015922224],"about_ca_topic_score_codex":0.0011451315,"about_ca_topic_score_gemma":0.001342686,"teacher_disagreement_score":0.0063656843,"about_ca_system_score_codex":0.0010676719,"about_ca_system_score_gemma":0.002221434,"threshold_uncertainty_score":0.03366536},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021685902,0.00010691364,0.97548217,0.000059336508,0.000114904244,0.00005989286,0.00007237189,0.0010470909,0.0013715054],"genre_scores_gemma":[0.3813893,0.00042638398,0.61293936,0.00016600845,0.00014648083,0.00036275748,0.0003200763,0.00044499963,0.003804618],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99799675,0.00030972812,0.00022151235,0.0003594472,0.0009190613,0.00019342259],"domain_scores_gemma":[0.9960961,0.001648301,0.00040234686,0.0011624984,0.0005432602,0.00014762928],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012251997,0.00088818104,0.00083943474,0.0007818029,0.00082821125,0.0010985358,0.0013906792,0.00064124615,0.0013341994],"category_scores_gemma":[0.0051629115,0.0005557431,0.0016467888,0.0005731464,0.0010591707,0.0016539774,0.0016884732,0.0016950552,0.0005922111],"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.0005162128,0.0002162863,0.0019819678,0.0005981318,0.00024274073,0.0011899299,0.00093659165,0.22708133,0.17598,0.38240942,0.001642065,0.20720533],"study_design_scores_gemma":[0.00011239009,0.00031997546,0.00040840602,0.00008425387,0.00029695767,0.00052464555,0.00010226054,0.50837845,0.19999747,0.25365376,0.036002174,0.000119278746],"about_ca_topic_score_codex":0.0011697409,"about_ca_topic_score_gemma":0.001138848,"teacher_disagreement_score":0.0013906792,"about_ca_system_score_codex":0.0005123228,"about_ca_system_score_gemma":0.001316882,"threshold_uncertainty_score":0.0064795613},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005573625,0.000086638705,0.99744236,0.0002523169,0.000024433884,0.00008484223,0.000054811237,0.00050459075,0.0009926666],"genre_scores_gemma":[0.03846093,0.00019249662,0.95954454,0.00019829239,0.00006676568,0.00029757706,0.00025287233,0.000101299185,0.00088524626],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98360944,0.007108325,0.0018393344,0.002082286,0.004369481,0.0009910718],"domain_scores_gemma":[0.9804419,0.011697341,0.0017950851,0.0032632046,0.0020882864,0.0007141629],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.025029225,0.0019439157,0.0018540306,0.0046234513,0.0032511204,0.00929508,0.007892227,0.0034235714,0.005050896],"category_scores_gemma":[0.032483805,0.0027851295,0.0068944483,0.003219993,0.007894296,0.014418809,0.008254424,0.007948301,0.0011545143],"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.00007841748,0.000048680955,0.00034081913,0.0002754439,0.00011296027,0.0005027425,0.001001737,0.032268398,0.001416386,0.9335623,0.0017026879,0.028689519],"study_design_scores_gemma":[0.00010725867,0.000060619015,0.00011462915,0.00023098556,0.00012478526,0.0002808255,0.00021546244,0.18622549,0.0025611212,0.7891876,0.020805368,0.00008591978],"about_ca_topic_score_codex":0.011607342,"about_ca_topic_score_gemma":0.010781673,"teacher_disagreement_score":0.025029225,"about_ca_system_score_codex":0.0047484483,"about_ca_system_score_gemma":0.0049223634,"threshold_uncertainty_score":0.1323688},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01524506,0.00040807427,0.9818979,0.00005937986,0.000051170286,0.000042422027,0.000040816434,0.000561084,0.0016940812],"genre_scores_gemma":[0.38562906,0.00065047503,0.610052,0.000120495846,0.00006789654,0.00007061961,0.00021929249,0.00021313656,0.002977091],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99911886,0.00028166297,0.00008565072,0.00016737242,0.00025409096,0.000092389186],"domain_scores_gemma":[0.9990144,0.00041278565,0.000107794636,0.00034283113,0.00010204954,0.000020132842],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00089815847,0.00047865027,0.0005452202,0.0008266069,0.00044666603,0.0007976423,0.00074940897,0.00036541387,0.0024070698],"category_scores_gemma":[0.0015722301,0.00023878178,0.00059885054,0.0008528368,0.0009197219,0.0016816509,0.00055169617,0.0006865472,0.00037397095],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026129337,0.00004330732,0.0006703,0.00039914134,0.000037405483,0.00044293076,0.00032695502,0.056799382,0.058731742,0.42615125,0.001720708,0.4544156],"study_design_scores_gemma":[0.00009642038,0.00050918263,0.00048194788,0.00016004352,0.000112441674,0.001078429,0.00018708323,0.37769863,0.21322782,0.33977497,0.06655746,0.00011558457],"about_ca_topic_score_codex":0.0006303483,"about_ca_topic_score_gemma":0.00088502583,"teacher_disagreement_score":0.0024070698,"about_ca_system_score_codex":0.0005938233,"about_ca_system_score_gemma":0.00059789553,"threshold_uncertainty_score":0.008052468},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0847804,0.00014987413,0.9081783,0.00017024054,0.000051615083,0.00019251267,0.00014351695,0.0017763757,0.0045571444],"genre_scores_gemma":[0.8037206,0.00026914242,0.19251673,0.00007798674,0.000024351668,0.00027402773,0.00020831678,0.00019734101,0.0027114276],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981154,0.0005406597,0.0001392032,0.00019745556,0.00082982983,0.00017743136],"domain_scores_gemma":[0.99582386,0.0030040573,0.00024465844,0.0004902901,0.00038988332,0.000047248534],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002326457,0.0005190898,0.00032997556,0.0005814404,0.0005132926,0.0013239698,0.0007389822,0.00059717597,0.0020526405],"category_scores_gemma":[0.006857881,0.00037561348,0.0007512158,0.00023961556,0.0019018151,0.0011878603,0.00085273606,0.000872476,0.00027394565],"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.0002684382,0.00017458598,0.0024494187,0.0006388861,0.00008594755,0.0015771604,0.0007830029,0.45682073,0.07384909,0.41025728,0.0010273384,0.052068193],"study_design_scores_gemma":[0.0001558923,0.0002680278,0.00048215935,0.0001258611,0.00008299789,0.00041838986,0.00014312877,0.7744937,0.12733461,0.081501335,0.014943975,0.000049850027],"about_ca_topic_score_codex":0.0021941033,"about_ca_topic_score_gemma":0.0012579993,"teacher_disagreement_score":0.002326457,"about_ca_system_score_codex":0.00087965734,"about_ca_system_score_gemma":0.002452881,"threshold_uncertainty_score":0.01230365},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3518726,0.0010157941,0.6313424,0.002597413,0.00033491646,0.0005928794,0.00021460734,0.002287589,0.00974185],"genre_scores_gemma":[0.82819813,0.00033022344,0.16911772,0.00044909358,0.000043960517,0.00033100505,0.0001268529,0.0002691545,0.0011338579],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9745189,0.014038973,0.001090724,0.0017109861,0.007460545,0.001179805],"domain_scores_gemma":[0.8089565,0.16411793,0.005710969,0.015736869,0.005011699,0.0004659482],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.014753283,0.00096578716,0.0007549717,0.00092966703,0.0007195347,0.0013936735,0.0014125307,0.0014604992,0.0029135037],"category_scores_gemma":[0.1017702,0.00080281385,0.0011459684,0.0005368722,0.0021242425,0.0029318894,0.0014654023,0.0027160237,0.00036800696],"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.0015997138,0.0004266734,0.009173896,0.0011801891,0.00028753717,0.0011844964,0.00074266613,0.7563314,0.030219218,0.04826691,0.0011239566,0.14946334],"study_design_scores_gemma":[0.0003449844,0.00096049503,0.0024452782,0.0001854602,0.0002997159,0.00030888923,0.0002486541,0.8826992,0.06227063,0.04158337,0.008569458,0.00008393441],"about_ca_topic_score_codex":0.0016127479,"about_ca_topic_score_gemma":0.0014490652,"teacher_disagreement_score":0.014753283,"about_ca_system_score_codex":0.0015283019,"about_ca_system_score_gemma":0.0015279978,"threshold_uncertainty_score":0.07802373},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010256828,0.000048331403,0.9858949,0.00002662935,0.00003054398,0.00011603193,0.00012326293,0.001743569,0.0017599317],"genre_scores_gemma":[0.20978442,0.00020275243,0.78632736,0.00004607149,0.000020501207,0.0005005016,0.0005110913,0.00045594035,0.0021513172],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988174,0.0002221953,0.00010562729,0.00019874879,0.0005396368,0.00011646148],"domain_scores_gemma":[0.9982657,0.00089923444,0.00019897555,0.0002778659,0.00029090286,0.00006734187],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013017767,0.00084058655,0.0005944219,0.0007115219,0.00034094774,0.001125601,0.00083734764,0.000622261,0.0036199824],"category_scores_gemma":[0.0041872393,0.0005952791,0.0007997581,0.0004601177,0.0007161614,0.0008227661,0.0005971068,0.00091387844,0.0007336435],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006543975,0.0001989277,0.0011223807,0.0012417274,0.00010670388,0.0010125053,0.0006810937,0.3055397,0.21572326,0.26092824,0.0038818587,0.20890926],"study_design_scores_gemma":[0.00030386884,0.00030307224,0.0002467035,0.00010772787,0.00010682879,0.00018013088,0.000055442986,0.743476,0.18011118,0.055293303,0.019772502,0.00004318711],"about_ca_topic_score_codex":0.0011802685,"about_ca_topic_score_gemma":0.0015215353,"teacher_disagreement_score":0.0036199824,"about_ca_system_score_codex":0.0005050773,"about_ca_system_score_gemma":0.0015661983,"threshold_uncertainty_score":0.012109995},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10945597,0.0007659102,0.87799615,0.0007974519,0.00006837709,0.00011670601,0.0004113919,0.00029134395,0.0100966655],"genre_scores_gemma":[0.89024615,0.00046885316,0.10591455,0.00015589208,0.00010975368,0.000278981,0.0005285246,0.00007131313,0.0022259802],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99217755,0.0030885783,0.000653891,0.0013959209,0.0018869841,0.000797148],"domain_scores_gemma":[0.9766923,0.018141635,0.0019511762,0.0012304717,0.0015127254,0.0004717467],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0048930827,0.00076245406,0.0007543859,0.0014705502,0.0009624353,0.0029609755,0.0011936959,0.0012803967,0.003977125],"category_scores_gemma":[0.02764012,0.00053771725,0.0014782815,0.001289103,0.0032971043,0.0059230677,0.0030958564,0.0021483768,0.0003042708],"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.00009381923,0.00005321757,0.0012408961,0.00007279746,0.000036867234,0.00024714516,0.0006735664,0.030363401,0.0010609716,0.95184976,0.000265838,0.014041704],"study_design_scores_gemma":[0.000019413399,0.000034841556,0.00034734432,0.00002345621,0.000018717623,0.000050977054,0.000057126777,0.090883665,0.00068272336,0.90700334,0.0008649804,0.0000135066475],"about_ca_topic_score_codex":0.0022722497,"about_ca_topic_score_gemma":0.0012467181,"teacher_disagreement_score":0.0048930827,"about_ca_system_score_codex":0.0016296718,"about_ca_system_score_gemma":0.0011070563,"threshold_uncertainty_score":0.025877416},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019916208,0.00019967424,0.9670648,0.0002454293,0.00006111299,0.00033588338,0.00023242254,0.0033875334,0.008556931],"genre_scores_gemma":[0.45208368,0.00037230563,0.5364984,0.00026379785,0.000046274105,0.0009664355,0.0005965509,0.00034482952,0.008827619],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99854267,0.00044394878,0.000089810426,0.0001686099,0.0006387966,0.00011623663],"domain_scores_gemma":[0.999226,0.00027100916,0.000096796204,0.0001611232,0.00022221963,0.000022747368],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015576251,0.00043620585,0.00029566773,0.00039140263,0.0003358406,0.0010377379,0.0006510355,0.0006521611,0.0042225355],"category_scores_gemma":[0.0024018805,0.00031837876,0.00053779053,0.00019074204,0.0006113814,0.00065444957,0.000619683,0.00063795963,0.00092492334],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043833294,0.00026486022,0.0053403853,0.0014716071,0.00018432565,0.0014285665,0.0008968151,0.276868,0.14907895,0.30897295,0.0091824485,0.24587275],"study_design_scores_gemma":[0.00028762672,0.0006858956,0.0015936589,0.00018153916,0.00013944121,0.00071297586,0.00009682956,0.741173,0.11484514,0.03441199,0.1058182,0.000053714175],"about_ca_topic_score_codex":0.001993977,"about_ca_topic_score_gemma":0.0012289821,"teacher_disagreement_score":0.0042225355,"about_ca_system_score_codex":0.0005420718,"about_ca_system_score_gemma":0.0021978428,"threshold_uncertainty_score":0.014125824},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006891907,0.00005226365,0.9877538,0.00007964225,0.000039878185,0.0000622919,0.00009846048,0.0009014753,0.00412029],"genre_scores_gemma":[0.2489666,0.000277641,0.7329664,0.00016554899,0.00006362755,0.0006159532,0.0011542891,0.00079125486,0.014998646],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999008,0.0002766766,0.000088903435,0.00020419678,0.00030308755,0.00011909342],"domain_scores_gemma":[0.998665,0.00053924735,0.000044904016,0.000558892,0.00014026492,0.00005174812],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013147251,0.0005801592,0.00092422304,0.00066365814,0.0007301282,0.001283762,0.0019524142,0.0009556887,0.0073428713],"category_scores_gemma":[0.0027085943,0.0007346954,0.0021301645,0.00072244246,0.0014105003,0.0041516162,0.0043379413,0.0030323782,0.001744482],"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.00008729724,0.00007620186,0.00028242392,0.00025237945,0.00004427085,0.00022700628,0.0003870861,0.024369782,0.007963353,0.8784913,0.0028571612,0.08496165],"study_design_scores_gemma":[0.000023577617,0.000058075242,0.000085773594,0.000048934577,0.000032838212,0.00012385391,0.000048021797,0.09782608,0.010164634,0.8791903,0.012371698,0.000026131465],"about_ca_topic_score_codex":0.00045228977,"about_ca_topic_score_gemma":0.0006751048,"teacher_disagreement_score":0.0073428713,"about_ca_system_score_codex":0.00059611455,"about_ca_system_score_gemma":0.00089675473,"threshold_uncertainty_score":0.024564385},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03493635,0.00012736587,0.95788664,0.00021750088,0.000035105877,0.000112412104,0.00031222132,0.0018410749,0.0045313598],"genre_scores_gemma":[0.46196696,0.0002118641,0.53458077,0.00006620899,0.000017159855,0.00027457796,0.00036320434,0.00015782619,0.0023614196],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99877614,0.0003992881,0.00009175007,0.00022827655,0.00034055434,0.00016397327],"domain_scores_gemma":[0.99844486,0.0010284513,0.00012205907,0.00022110538,0.00013248414,0.000051022216],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012416833,0.0008970141,0.000672201,0.00050635665,0.00060932414,0.0014017506,0.0008950636,0.00075666246,0.0036223428],"category_scores_gemma":[0.0033991588,0.0006703016,0.0011158803,0.00062046136,0.0016291566,0.0019499543,0.0016387718,0.0015649816,0.00039579603],"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.00014162173,0.000038038062,0.00042857105,0.00012087341,0.00002627064,0.00013040622,0.0001344974,0.92545193,0.0029331231,0.04871983,0.0004916744,0.021383192],"study_design_scores_gemma":[0.000024082941,0.0000373967,0.000101715385,0.000019725989,0.000011357516,0.000019227,0.000035404024,0.9608608,0.0031263689,0.03346677,0.0022883127,0.000008885605],"about_ca_topic_score_codex":0.008119538,"about_ca_topic_score_gemma":0.009998068,"teacher_disagreement_score":0.008119538,"about_ca_system_score_codex":0.0011406781,"about_ca_system_score_gemma":0.0023240724,"threshold_uncertainty_score":0.016144514},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015407707,0.0003933304,0.9764214,0.00035656957,0.00013559718,0.00012262855,0.00021162203,0.0019165766,0.005034507],"genre_scores_gemma":[0.5541755,0.0005781062,0.43586686,0.00020486167,0.00050102855,0.00077167765,0.0008044191,0.0012195697,0.005877855],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.97616404,0.0070002475,0.0019968073,0.00401019,0.008886709,0.0019420706],"domain_scores_gemma":[0.9111642,0.055665966,0.00603324,0.01523424,0.008934767,0.0029674466],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.021053676,0.0031517178,0.0033174595,0.007350466,0.0020628327,0.0074672773,0.005452377,0.0031802605,0.0045736255],"category_scores_gemma":[0.07771518,0.0016678674,0.0026983556,0.004041078,0.008181167,0.016832536,0.0081658745,0.007803828,0.0013320404],"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.0004853795,0.00016053247,0.0014303601,0.00034604254,0.000108198954,0.00008733678,0.00037071275,0.13747668,0.0029948044,0.7744285,0.0031650432,0.07894644],"study_design_scores_gemma":[0.00004934518,0.00021186387,0.0003129491,0.000090111294,0.00011045479,0.000074377735,0.000052752177,0.59116846,0.0060709515,0.39918333,0.0026072704,0.000068178684],"about_ca_topic_score_codex":0.001243143,"about_ca_topic_score_gemma":0.0009940687,"teacher_disagreement_score":0.021053676,"about_ca_system_score_codex":0.0044398564,"about_ca_system_score_gemma":0.0039508916,"threshold_uncertainty_score":0.1113438},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002084241,0.00030317644,0.9933587,0.00020292825,0.00003451776,0.000046177578,0.00006888377,0.00020105623,0.0037002761],"genre_scores_gemma":[0.12823458,0.0009196142,0.86657,0.000173203,0.000058048285,0.0003000619,0.00031685748,0.00016645352,0.0032611627],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979163,0.00096471055,0.00011565921,0.00029118624,0.0005669259,0.00014523139],"domain_scores_gemma":[0.9974975,0.0019305537,0.00012337646,0.00019534574,0.00017552011,0.00007767539],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023311656,0.0012901556,0.0009211637,0.0009378439,0.0005125495,0.0022337555,0.0011808224,0.0011538683,0.0053298036],"category_scores_gemma":[0.0069376696,0.00078076095,0.0014099838,0.0013767285,0.0015128289,0.0018835596,0.001713731,0.002435977,0.0009597537],"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.00006806472,0.000047499798,0.00031697002,0.00025493873,0.000042285003,0.000046913472,0.00007046738,0.59777874,0.0011050709,0.33543763,0.0020226622,0.06280869],"study_design_scores_gemma":[0.000043990964,0.000031117816,0.000040557385,0.000041111296,0.000013347086,0.000021041255,0.000012589901,0.7817537,0.00093246845,0.20695315,0.010146441,0.000010518113],"about_ca_topic_score_codex":0.0031882082,"about_ca_topic_score_gemma":0.0033228558,"teacher_disagreement_score":0.0053298036,"about_ca_system_score_codex":0.0016726229,"about_ca_system_score_gemma":0.002404502,"threshold_uncertainty_score":0.017830014},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023771126,0.0018975686,0.98717695,0.00075135805,0.00022277048,0.00006634535,0.000045577057,0.0014163888,0.0060459566],"genre_scores_gemma":[0.13388154,0.0030157978,0.84922695,0.0007939301,0.00037582984,0.00050201215,0.00039200403,0.00067707524,0.011134896],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9979735,0.0011371357,0.00007678905,0.00031244615,0.0003768331,0.0001232463],"domain_scores_gemma":[0.99613935,0.002722353,0.00012218484,0.0004929241,0.00044871858,0.00007438997],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030403272,0.0010940117,0.0011668463,0.0007188113,0.0006282629,0.0026788968,0.0015360424,0.0018357001,0.014494518],"category_scores_gemma":[0.009409491,0.00073599635,0.00076513545,0.0010677181,0.0017414744,0.002046273,0.0013108442,0.0016278279,0.0037008915],"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.00031198395,0.00014284729,0.0009170292,0.0007401311,0.00012119362,0.00013357069,0.00016873988,0.19662188,0.0062857103,0.15465851,0.039443757,0.6004546],"study_design_scores_gemma":[0.00014760881,0.00013016745,0.00037768073,0.00020285879,0.000054224412,0.00021241361,0.000065358116,0.6814966,0.009023916,0.2273414,0.08089602,0.000051746432],"about_ca_topic_score_codex":0.0011058057,"about_ca_topic_score_gemma":0.0009635166,"teacher_disagreement_score":0.014494518,"about_ca_system_score_codex":0.00080733665,"about_ca_system_score_gemma":0.0013812035,"threshold_uncertainty_score":0.048488975},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024542412,0.0005850145,0.9648679,0.00055552105,0.00012529951,0.00008513572,0.000084376974,0.00054228725,0.008611922],"genre_scores_gemma":[0.72359717,0.0007430459,0.2661497,0.0002811272,0.00021643592,0.00026527036,0.00021603213,0.00037776984,0.008153423],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982876,0.00048363354,0.00011739905,0.00016308372,0.00068488484,0.00026328623],"domain_scores_gemma":[0.9959194,0.0029004388,0.00023080104,0.0004288089,0.00043716092,0.00008345582],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023771035,0.00077480637,0.00060158875,0.0012126518,0.0008998815,0.0021293387,0.0021065,0.0010521199,0.0043487838],"category_scores_gemma":[0.0060654883,0.0006922042,0.0013279244,0.0007698719,0.0031934648,0.0036301906,0.0016243273,0.00232523,0.00037929055],"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.000104318315,0.00010831489,0.00060456485,0.00024067405,0.000046118417,0.00032714847,0.00034329202,0.104911,0.010905825,0.8610093,0.0013213854,0.020078173],"study_design_scores_gemma":[0.000041358533,0.000048279253,0.00024000774,0.00006870509,0.00004185855,0.00017817822,0.0000849815,0.50961757,0.0065540355,0.47725984,0.005833034,0.000032063712],"about_ca_topic_score_codex":0.0020814687,"about_ca_topic_score_gemma":0.0022127882,"teacher_disagreement_score":0.0043487838,"about_ca_system_score_codex":0.0017052134,"about_ca_system_score_gemma":0.0018540977,"threshold_uncertainty_score":0.014548123},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011075126,0.00025263714,0.9841479,0.00026239586,0.000035227604,0.000058472873,0.000067501,0.00036622724,0.0037345488],"genre_scores_gemma":[0.7263196,0.0010858949,0.2665538,0.00026005504,0.00017005704,0.0003960711,0.0003306339,0.0002884986,0.0045954846],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966815,0.0010562844,0.000244692,0.00027590097,0.0014472035,0.00029447727],"domain_scores_gemma":[0.99227965,0.005536074,0.0005569457,0.000692515,0.0008371908,0.00009765733],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037525408,0.0006641067,0.00042767465,0.0013047173,0.0006064782,0.0019710436,0.0014614953,0.00059170974,0.0018071756],"category_scores_gemma":[0.0088405,0.00051831955,0.0015248669,0.0006833132,0.002928973,0.0027199944,0.0015592381,0.001761116,0.00034678646],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000083168816,0.00008701251,0.00085713394,0.00027065672,0.000049707243,0.00039491247,0.0004920168,0.2112431,0.0056055496,0.7548051,0.00086895167,0.025242684],"study_design_scores_gemma":[0.00003935379,0.00007313583,0.00026948476,0.00007335363,0.00004615668,0.00011986996,0.00010338612,0.5686544,0.008461741,0.41570586,0.0064223814,0.000030847223],"about_ca_topic_score_codex":0.0025311678,"about_ca_topic_score_gemma":0.001548461,"teacher_disagreement_score":0.0037525408,"about_ca_system_score_codex":0.0019142986,"about_ca_system_score_gemma":0.0018478286,"threshold_uncertainty_score":0.019845605},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013649055,0.0003102553,0.9724196,0.0005052713,0.00007849819,0.0002914354,0.00027130952,0.0033044592,0.009170146],"genre_scores_gemma":[0.11637422,0.0002072581,0.8765423,0.0004841275,0.000046183828,0.0002994869,0.0006489522,0.00085822167,0.0045392434],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983005,0.00067612727,0.00010877822,0.00030546266,0.00042454293,0.00018466884],"domain_scores_gemma":[0.9955094,0.0028389671,0.00034795213,0.0007654553,0.00042382133,0.000114470124],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029092208,0.0012834357,0.0011915528,0.0011249743,0.00091951824,0.0018535611,0.0033180066,0.0014278602,0.014297931],"category_scores_gemma":[0.0109276185,0.0010198953,0.0014362513,0.0015719899,0.0015845802,0.00350341,0.0028981874,0.003405751,0.002174659],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001074541,0.00053796824,0.0027572294,0.0011684501,0.00030095835,0.0006492033,0.0009333931,0.21973202,0.03201508,0.18086642,0.03455287,0.5254119],"study_design_scores_gemma":[0.0005252843,0.00038716896,0.00054274657,0.00018346928,0.00016513141,0.0005452828,0.00023717071,0.77367216,0.031718697,0.15426138,0.037654907,0.000106493804],"about_ca_topic_score_codex":0.002181857,"about_ca_topic_score_gemma":0.0040969127,"teacher_disagreement_score":0.014297931,"about_ca_system_score_codex":0.00078403845,"about_ca_system_score_gemma":0.0020364637,"threshold_uncertainty_score":0.047831357},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012373523,0.000110139685,0.9815143,0.00038329154,0.000029634706,0.000112008645,0.00011487336,0.0033932433,0.0019690355],"genre_scores_gemma":[0.3841012,0.00029600356,0.61158466,0.0003824172,0.00007069124,0.00028270212,0.000533546,0.00076854543,0.001980273],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9893156,0.0047496427,0.00052859506,0.0011993514,0.0034195126,0.0007871981],"domain_scores_gemma":[0.96986705,0.023730908,0.0012762557,0.0033332056,0.0015149344,0.00027763325],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007792159,0.00122889,0.0011993891,0.0017933046,0.0009824749,0.003234261,0.003010843,0.001517283,0.004344083],"category_scores_gemma":[0.03152787,0.001084076,0.003336804,0.0016137263,0.004477317,0.0067321085,0.005322571,0.0027603419,0.00047614786],"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.000967752,0.00036346362,0.0034137703,0.00061769015,0.00031311464,0.0009811664,0.0009198524,0.4481909,0.015057936,0.37002018,0.005450824,0.1537033],"study_design_scores_gemma":[0.00013010498,0.00007047734,0.000107201726,0.00004090091,0.000070892245,0.00014108696,0.00007298319,0.8302401,0.012389417,0.15286882,0.0038320005,0.000035972862],"about_ca_topic_score_codex":0.007958079,"about_ca_topic_score_gemma":0.006753093,"teacher_disagreement_score":0.007958079,"about_ca_system_score_codex":0.0021044451,"about_ca_system_score_gemma":0.0035249456,"threshold_uncertainty_score":0.0412094},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07780244,0.0021371795,0.8744231,0.00789199,0.0007962512,0.00036960642,0.00037422258,0.0059992047,0.030206012],"genre_scores_gemma":[0.56845194,0.0008278837,0.4173599,0.0010732182,0.00027949963,0.00026524597,0.0005813806,0.00083718606,0.010323761],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.981191,0.008191502,0.0010597053,0.0015088894,0.006937483,0.0011114092],"domain_scores_gemma":[0.933339,0.047823787,0.001666611,0.008028752,0.008118892,0.0010230144],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.014212422,0.0010683469,0.0013068726,0.00096383295,0.00082323747,0.0031691573,0.0046801385,0.0024861642,0.006785136],"category_scores_gemma":[0.037856773,0.00068848435,0.0011587819,0.0007946365,0.0028589526,0.005305477,0.0026490137,0.0035032837,0.0015184705],"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.00085334975,0.00064065866,0.006846217,0.0011529179,0.00018574254,0.0007597446,0.000805005,0.225011,0.023765853,0.2145472,0.01912096,0.5063113],"study_design_scores_gemma":[0.00011557683,0.00055111706,0.0010699447,0.00034450108,0.00008526305,0.0004898403,0.0005143277,0.7249617,0.03173939,0.21521388,0.024836313,0.00007814952],"about_ca_topic_score_codex":0.008862944,"about_ca_topic_score_gemma":0.009730189,"teacher_disagreement_score":0.014212422,"about_ca_system_score_codex":0.001933003,"about_ca_system_score_gemma":0.004984348,"threshold_uncertainty_score":0.075163305},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010822023,0.00038373002,0.98115015,0.000117948155,0.00009885698,0.00010421323,0.00004906552,0.0046254955,0.0026486262],"genre_scores_gemma":[0.4106971,0.00055793993,0.581751,0.00023734846,0.00017038739,0.00015036964,0.00026135074,0.0010249778,0.005149571],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99703276,0.00058571366,0.00025119763,0.00056242885,0.0013204468,0.0002474825],"domain_scores_gemma":[0.99189866,0.0038474167,0.0007949446,0.0024755523,0.0008023753,0.00018098792],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017616182,0.0013878028,0.0008090429,0.0010926792,0.00038710874,0.001348515,0.0028745213,0.0009509474,0.005097656],"category_scores_gemma":[0.007438329,0.00058998377,0.0009059168,0.0010228485,0.0004609674,0.0032509442,0.0013320196,0.0018627333,0.0010323564],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00083953876,0.0006059399,0.001968872,0.0006804246,0.0001838071,0.00034232636,0.0002415767,0.052665584,0.18893117,0.035970263,0.005324956,0.71224546],"study_design_scores_gemma":[0.0002349257,0.00049416913,0.0021398584,0.00013700612,0.0005071386,0.0009418381,0.00009668226,0.6909611,0.218913,0.064946845,0.020521697,0.00010572231],"about_ca_topic_score_codex":0.0005505069,"about_ca_topic_score_gemma":0.001042308,"teacher_disagreement_score":0.005097656,"about_ca_system_score_codex":0.0004979213,"about_ca_system_score_gemma":0.0010635579,"threshold_uncertainty_score":0.017053366},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.058179382,0.003495001,0.7069354,0.01097649,0.000959668,0.0001142113,0.00032091985,0.000551782,0.21846713],"genre_scores_gemma":[0.81474245,0.004281124,0.11255301,0.0017046597,0.0018438409,0.00034453036,0.00087499706,0.0010505625,0.06260483],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99788696,0.0005264468,0.00006323771,0.00041210552,0.0008158846,0.0002953225],"domain_scores_gemma":[0.9899906,0.0072322087,0.00034906983,0.0014557232,0.0006391746,0.0003332565],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018737295,0.00095315883,0.0013684514,0.0013452221,0.00164265,0.0030430777,0.0021561403,0.0025322228,0.013534109],"category_scores_gemma":[0.017740702,0.0009684819,0.001349557,0.0011035537,0.004052638,0.012868484,0.0053695673,0.0067135673,0.0016640153],"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.00004165753,0.00002527732,0.00016993556,0.000101925514,0.000015811942,0.000117466465,0.00018652223,0.004397276,0.0014507385,0.9711159,0.0045500044,0.017827423],"study_design_scores_gemma":[0.000007058627,0.000011425225,0.000051271985,0.000032175027,0.0000068356317,0.00007970234,0.00004113695,0.016969359,0.00069456216,0.97445446,0.007646005,0.0000060430184],"about_ca_topic_score_codex":0.0008070981,"about_ca_topic_score_gemma":0.00079176994,"teacher_disagreement_score":0.013534109,"about_ca_system_score_codex":0.0015909456,"about_ca_system_score_gemma":0.00082274457,"threshold_uncertainty_score":0.045276046},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002856896,0.00009056262,0.99492824,0.0000731719,0.000048806625,0.000043948654,0.000017682962,0.0012425345,0.0006982408],"genre_scores_gemma":[0.12702695,0.0002941913,0.86685956,0.000092371265,0.000084121995,0.00035802636,0.00006527467,0.0006718464,0.0045476123],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99345267,0.0015422886,0.00042699976,0.0013527165,0.0029163933,0.00030882788],"domain_scores_gemma":[0.97259855,0.020071598,0.0010988445,0.002728011,0.0032384642,0.00026459983],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0053714626,0.001528973,0.00143512,0.0016792989,0.0012355815,0.00374594,0.0018960942,0.0022454283,0.0054738387],"category_scores_gemma":[0.024526188,0.0012163665,0.0015227789,0.0007039781,0.0031334504,0.0038966655,0.0019725864,0.004254373,0.0014464828],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013318973,0.00033262678,0.004148074,0.0008658725,0.00027447508,0.00039321088,0.001725241,0.13575368,0.0792375,0.24576898,0.0032233745,0.526945],"study_design_scores_gemma":[0.00026983625,0.000388439,0.0010440275,0.00017374135,0.00012028585,0.0005895087,0.00012273176,0.7649409,0.14290662,0.06536469,0.023862861,0.00021649284],"about_ca_topic_score_codex":0.0023480218,"about_ca_topic_score_gemma":0.0021273617,"teacher_disagreement_score":0.0054738387,"about_ca_system_score_codex":0.0014280037,"about_ca_system_score_gemma":0.0027548843,"threshold_uncertainty_score":0.028407395},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021461906,0.0007420478,0.9539882,0.0005504196,0.0001814527,0.0001117336,0.00020591466,0.0028518506,0.019906525],"genre_scores_gemma":[0.4496136,0.0010581271,0.5307055,0.00034401898,0.00013320078,0.00017937376,0.0006552822,0.0011290958,0.016181814],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99687517,0.0008825963,0.000184025,0.00032802095,0.0014656292,0.00026448196],"domain_scores_gemma":[0.99668956,0.0022259476,0.00014529985,0.0005283298,0.00036420373,0.00004670333],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023420034,0.00095369306,0.0011895637,0.0012142018,0.0008772835,0.0030139578,0.0023759888,0.0010688056,0.0054264804],"category_scores_gemma":[0.0062594144,0.0011075505,0.0027009,0.001264254,0.0021408286,0.004178439,0.0017107715,0.0022259736,0.000963199],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002940308,0.00010452627,0.00040318942,0.00044667875,0.00010058235,0.00028800569,0.00025873192,0.14721015,0.0101528745,0.73814946,0.0036568285,0.09893491],"study_design_scores_gemma":[0.000071509356,0.000049615443,0.00011083584,0.000121273166,0.00008673559,0.00013748526,0.00006930732,0.38909066,0.020274432,0.5790663,0.010886805,0.000035100707],"about_ca_topic_score_codex":0.0043885782,"about_ca_topic_score_gemma":0.0050727446,"teacher_disagreement_score":0.0054264804,"about_ca_system_score_codex":0.0019290136,"about_ca_system_score_gemma":0.0021048386,"threshold_uncertainty_score":0.01815331},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1306493,0.00029540286,0.8492947,0.00039962138,0.00010991558,0.00011997608,0.00031025548,0.0046525523,0.014168294],"genre_scores_gemma":[0.9060354,0.00018049036,0.08953682,0.00009934048,0.000018121655,0.0000980974,0.00029514005,0.00024043093,0.0034961235],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99907684,0.00024044416,0.00004557577,0.000112580805,0.00039924437,0.00012528026],"domain_scores_gemma":[0.9984902,0.00080969953,0.00013471668,0.00033806358,0.00018487664,0.00004245975],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010217392,0.0005118067,0.00072439655,0.0006195525,0.00071037747,0.0014733206,0.0007051549,0.0005308859,0.003226141],"category_scores_gemma":[0.0030180055,0.0003292305,0.00115041,0.0004214196,0.0012897907,0.0014296358,0.001143917,0.0010727583,0.0002550159],"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.0003436799,0.000119217104,0.0026166006,0.00025655248,0.00009987291,0.00044400434,0.00027189613,0.7063725,0.015928283,0.2294427,0.0022946817,0.041810002],"study_design_scores_gemma":[0.00004802703,0.000049252303,0.00021105549,0.000025124735,0.000030227759,0.000039837603,0.000038387887,0.9237452,0.00787157,0.0654634,0.002460485,0.000017343153],"about_ca_topic_score_codex":0.013102366,"about_ca_topic_score_gemma":0.018485198,"teacher_disagreement_score":0.013102366,"about_ca_system_score_codex":0.0011245876,"about_ca_system_score_gemma":0.0020382602,"threshold_uncertainty_score":0.026052177},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020600911,0.00016215719,0.9759631,0.00018423385,0.00002740759,0.0002683362,0.0024870113,0.014956769,0.0038909412],"genre_scores_gemma":[0.07608387,0.0005605441,0.9019322,0.00044729613,0.00006818705,0.0009299982,0.010894089,0.0026429652,0.006440782],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967687,0.00059121917,0.00054066454,0.00072878355,0.0011873364,0.00018332958],"domain_scores_gemma":[0.99302447,0.002733584,0.0006678364,0.0021785959,0.0012743542,0.000121167424],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023023402,0.0014254269,0.0006096555,0.0021371676,0.0007098625,0.0029048368,0.002237852,0.0012023808,0.016917435],"category_scores_gemma":[0.01565026,0.0009923418,0.0028408153,0.0024728465,0.00094361475,0.002972472,0.0019356526,0.0017250133,0.009041245],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043019268,0.000198265,0.007968549,0.002026195,0.00024028833,0.0011796968,0.0005501876,0.082000814,0.01657023,0.21003918,0.055430938,0.6233655],"study_design_scores_gemma":[0.00010928812,0.00011881274,0.0007448973,0.00033043773,0.000111318404,0.0012435227,0.00017358155,0.6305154,0.038121432,0.20222998,0.12621666,0.000084705716],"about_ca_topic_score_codex":0.005064499,"about_ca_topic_score_gemma":0.0046541556,"teacher_disagreement_score":0.016917435,"about_ca_system_score_codex":0.0012199768,"about_ca_system_score_gemma":0.0029272162,"threshold_uncertainty_score":0.05659449},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013056319,0.00013692153,0.9831214,0.000110869325,0.00001794994,0.00003555271,0.000018034238,0.00032346134,0.0031794552],"genre_scores_gemma":[0.6427339,0.00023826087,0.3533218,0.00009948743,0.000036768914,0.00021299151,0.00005785136,0.00012091436,0.0031780025],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.99852717,0.0004040461,0.0000715328,0.0002496176,0.0005650417,0.00018251635],"domain_scores_gemma":[0.99919516,0.00043764827,0.00010447713,0.0000825907,0.00012690424,0.000053244778],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001883973,0.0006435494,0.0006111856,0.00055105845,0.00053780153,0.0011682415,0.0011306168,0.0007246835,0.0018931896],"category_scores_gemma":[0.0019911446,0.00045684076,0.0007574914,0.000409953,0.0019301663,0.0011956067,0.0010434939,0.0010656903,0.00019952051],"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.00010223577,0.00007992935,0.0002105418,0.00008698684,0.00003920505,0.00013926995,0.00012607768,0.6309536,0.0099809645,0.3329564,0.0005061911,0.024818618],"study_design_scores_gemma":[0.00004254905,0.000056556957,0.00007108344,0.000010051401,0.00001693143,0.000026970714,0.0000147585615,0.9078197,0.0022706704,0.087853186,0.0018047235,0.000012919061],"about_ca_topic_score_codex":0.004616592,"about_ca_topic_score_gemma":0.0045540663,"teacher_disagreement_score":0.004616592,"about_ca_system_score_codex":0.0014118421,"about_ca_system_score_gemma":0.0018730698,"threshold_uncertainty_score":0.010243654},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004776267,0.00004069209,0.9932133,0.000021313801,0.000013480369,0.000035822497,0.00007401996,0.00088508794,0.0009399948],"genre_scores_gemma":[0.40444902,0.00026310986,0.5909214,0.00007848289,0.000043067626,0.00044297337,0.00061983615,0.00079177425,0.0023903812],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974547,0.0005735647,0.00021129931,0.00036167327,0.0011246032,0.00027413486],"domain_scores_gemma":[0.9961966,0.0019928054,0.0005487,0.0007779854,0.00043764224,0.000046320012],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021383038,0.0013388705,0.0008521452,0.0026549909,0.00043856807,0.0016174028,0.0014115288,0.0007248489,0.0030815217],"category_scores_gemma":[0.007551096,0.00079670944,0.0026739712,0.0011733348,0.0013350078,0.002267101,0.0010705874,0.0015304849,0.000553953],"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.0000852963,0.00007045772,0.0012203208,0.00012376782,0.000069012756,0.00010669493,0.00004962788,0.8889534,0.0070909467,0.07362611,0.0005351211,0.028069308],"study_design_scores_gemma":[0.000009103075,0.000033756227,0.00012340145,0.000017286384,0.000038220478,0.00003414713,0.0000055036985,0.96684784,0.008084273,0.023624519,0.0011674099,0.000014482265],"about_ca_topic_score_codex":0.0045125014,"about_ca_topic_score_gemma":0.0025076116,"teacher_disagreement_score":0.0045125014,"about_ca_system_score_codex":0.0014731935,"about_ca_system_score_gemma":0.0020408847,"threshold_uncertainty_score":0.011308551},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0050727124,0.000064669184,0.9907403,0.00007919951,0.000056133555,0.000100902886,0.00017840652,0.0022382657,0.0014694011],"genre_scores_gemma":[0.17439453,0.00035541542,0.82016057,0.00021239041,0.000081983584,0.0005960041,0.0010106635,0.00083681976,0.002351662],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98875064,0.0042229635,0.0017577366,0.001190937,0.0036711723,0.00040656465],"domain_scores_gemma":[0.9791029,0.010453756,0.0021538164,0.005783547,0.002216503,0.00028948006],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008284751,0.0013314348,0.0006411258,0.002047512,0.0006915158,0.0034074408,0.0027089422,0.0017941182,0.0032822527],"category_scores_gemma":[0.02622902,0.0009286012,0.0020434172,0.0011015671,0.0031831977,0.006591795,0.0025082377,0.0019532049,0.0008164505],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020430372,0.00011241309,0.0025567417,0.00061866536,0.00012783914,0.0010700457,0.0011881349,0.25407588,0.016510537,0.6523274,0.0030430616,0.06816502],"study_design_scores_gemma":[0.00016224095,0.0002561621,0.00047973453,0.00032282068,0.00016244128,0.0005244214,0.00020158329,0.67193645,0.057448935,0.21622428,0.052171387,0.00010959894],"about_ca_topic_score_codex":0.00267219,"about_ca_topic_score_gemma":0.0023010133,"teacher_disagreement_score":0.008284751,"about_ca_system_score_codex":0.0013709487,"about_ca_system_score_gemma":0.0029950321,"threshold_uncertainty_score":0.04381448},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024940804,0.0002680907,0.9543539,0.0007668967,0.00012267802,0.00007674008,0.00037628502,0.0009515859,0.018143076],"genre_scores_gemma":[0.67657053,0.00059538626,0.30435443,0.00038300143,0.0002743863,0.00018772484,0.0015175544,0.00048475747,0.01563217],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985499,0.00046067522,0.00012305139,0.00020940971,0.00047722855,0.00017969095],"domain_scores_gemma":[0.9942101,0.0044751014,0.00024406266,0.00056440086,0.00036273117,0.00014351685],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002344497,0.00074606313,0.000627898,0.0014515587,0.0011854125,0.0030117375,0.0020503572,0.0010485247,0.008951236],"category_scores_gemma":[0.00732842,0.00078820356,0.002162718,0.0012534801,0.0029694834,0.0074723475,0.0021349103,0.0034908375,0.0009073387],"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.00003375871,0.000029688043,0.00026083266,0.000083383515,0.000020776055,0.000099899175,0.00028571996,0.015197973,0.000617104,0.97056186,0.0012933463,0.011515674],"study_design_scores_gemma":[0.000015196714,0.000005323225,0.000054988144,0.000025083762,0.000012909811,0.000029230538,0.000052631476,0.05989179,0.0007941101,0.9366288,0.0024817586,0.000008015547],"about_ca_topic_score_codex":0.0029217657,"about_ca_topic_score_gemma":0.004366798,"teacher_disagreement_score":0.008951236,"about_ca_system_score_codex":0.0025880383,"about_ca_system_score_gemma":0.0009887199,"threshold_uncertainty_score":0.029944897},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017562571,0.00016265681,0.97809017,0.0002912917,0.0002209986,0.00017397355,0.001716045,0.010495281,0.0070933704],"genre_scores_gemma":[0.058000326,0.0007717723,0.9116178,0.0009689119,0.00019091612,0.0013152169,0.0057466994,0.009345297,0.012043031],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99580824,0.0013446537,0.0005795102,0.00075879897,0.001124214,0.00038452446],"domain_scores_gemma":[0.9936899,0.003405785,0.0005382035,0.001141141,0.0010890471,0.00013596538],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037533822,0.0018635927,0.0008642767,0.0019172729,0.0009385774,0.003546463,0.002197667,0.0014791864,0.030912343],"category_scores_gemma":[0.014162909,0.0012808656,0.002595623,0.0018932555,0.002645929,0.0062219324,0.0028874727,0.003464477,0.008056929],"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.00026720754,0.00011361064,0.00066603033,0.0009371825,0.00005720885,0.000473915,0.0013921513,0.030008199,0.006591198,0.79732645,0.042131897,0.12003493],"study_design_scores_gemma":[0.00010135308,0.000083196195,0.00017709726,0.00038516044,0.0000623663,0.00037725156,0.0001837537,0.102867864,0.018888246,0.44405347,0.43273553,0.00008470273],"about_ca_topic_score_codex":0.00253259,"about_ca_topic_score_gemma":0.0022168725,"teacher_disagreement_score":0.030912343,"about_ca_system_score_codex":0.0021418098,"about_ca_system_score_gemma":0.0017864251,"threshold_uncertainty_score":0.10341209},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019576753,0.00019937458,0.9411847,0.0010911311,0.00027374324,0.00029420276,0.0005521205,0.009857545,0.026970373],"genre_scores_gemma":[0.51939607,0.0004362738,0.43362123,0.0010255716,0.00025048509,0.0010061775,0.0018423874,0.0053352346,0.037086587],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99656063,0.00045983383,0.0002588063,0.0006831564,0.0013281829,0.0007093217],"domain_scores_gemma":[0.99260265,0.0038711354,0.00044962196,0.0016410524,0.0011521761,0.00028333082],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023821376,0.001609089,0.0012362335,0.0012197695,0.0024520212,0.004602456,0.0018706083,0.0016588428,0.008860557],"category_scores_gemma":[0.009584425,0.0016552678,0.0024051918,0.0014124345,0.005024636,0.007981543,0.0056524607,0.0072192485,0.0044456837],"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.00077055814,0.00038446498,0.0010170398,0.0008322159,0.00009087506,0.0003665469,0.0010247867,0.023074301,0.024290042,0.76103246,0.017935807,0.16918093],"study_design_scores_gemma":[0.0001592407,0.0001151469,0.00021169889,0.00006776009,0.0000878725,0.00015770222,0.00013507393,0.06169773,0.05107865,0.8662559,0.019962143,0.00007102056],"about_ca_topic_score_codex":0.002686084,"about_ca_topic_score_gemma":0.004241116,"teacher_disagreement_score":0.008860557,"about_ca_system_score_codex":0.0021426925,"about_ca_system_score_gemma":0.0039366675,"threshold_uncertainty_score":0.029641509},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002063235,0.0000152410685,0.99670166,0.000019679332,0.0000058680935,0.000041887986,0.000044223805,0.00038780662,0.0007205145],"genre_scores_gemma":[0.19825913,0.00018528172,0.79750353,0.00010730659,0.00002157797,0.0005918914,0.0005648783,0.00032649975,0.0024398088],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979311,0.00057632645,0.00016381702,0.0003522183,0.00081702636,0.0001594546],"domain_scores_gemma":[0.9970227,0.0019434546,0.00019726084,0.00044866637,0.00034704417,0.000040840998],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016438734,0.0010638969,0.0007137661,0.00093713775,0.00074911374,0.001146273,0.0015250578,0.0006956175,0.005544157],"category_scores_gemma":[0.00547941,0.00068543776,0.0024423061,0.0006372468,0.002014876,0.0023871546,0.0021725728,0.0022497913,0.0009812743],"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.00014067622,0.000056874116,0.0006147492,0.00027970353,0.000053053373,0.0002455136,0.00023416619,0.5475377,0.014314529,0.37823358,0.0010898113,0.057199657],"study_design_scores_gemma":[0.000022738792,0.00004457953,0.000056473193,0.000033313972,0.000019106028,0.0000622454,0.000024191242,0.89610237,0.01078382,0.08872968,0.0040990785,0.00002234782],"about_ca_topic_score_codex":0.0029982163,"about_ca_topic_score_gemma":0.0025395297,"teacher_disagreement_score":0.005544157,"about_ca_system_score_codex":0.0012719847,"about_ca_system_score_gemma":0.0015716478,"threshold_uncertainty_score":0.018547058},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028442804,0.00017033755,0.9682708,0.00037596523,0.000018363888,0.00007674011,0.00016686588,0.0007940079,0.0016840532],"genre_scores_gemma":[0.74417573,0.00032501647,0.25171316,0.00020915153,0.00007713232,0.00028148966,0.0003675991,0.00027736404,0.0025733649],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98762566,0.0038906313,0.0007398921,0.001931269,0.0045245904,0.0012879547],"domain_scores_gemma":[0.94265676,0.042180043,0.0037028356,0.008204788,0.002272704,0.0009828104],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011053245,0.0012958735,0.0016140376,0.0020381662,0.0011027881,0.003791499,0.0030098697,0.0018781823,0.0033248477],"category_scores_gemma":[0.0639122,0.0016337787,0.0032239624,0.0017104173,0.0063410033,0.008091755,0.006168012,0.0044829673,0.0003941467],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018359917,0.000049308375,0.003214507,0.0001271102,0.0000758548,0.00017833947,0.0007157696,0.56861955,0.0014966127,0.41141707,0.00037014115,0.013552209],"study_design_scores_gemma":[0.000020719,0.000022429731,0.00016663014,0.000021093001,0.000025538406,0.000030630483,0.000024837562,0.7801328,0.0010511121,0.21764445,0.0008435189,0.0000161651],"about_ca_topic_score_codex":0.015585784,"about_ca_topic_score_gemma":0.011392204,"teacher_disagreement_score":0.015585784,"about_ca_system_score_codex":0.0051691434,"about_ca_system_score_gemma":0.0034718486,"threshold_uncertainty_score":0.058455884},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.081292845,0.0006000335,0.8864138,0.00036303813,0.0001971883,0.00012048455,0.00031055434,0.015860582,0.014841478],"genre_scores_gemma":[0.8184357,0.00043258816,0.16941343,0.000144052,0.00015586731,0.00011124876,0.00055177615,0.0014336613,0.009321525],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99807835,0.0003993011,0.000103153565,0.00035300324,0.0008732845,0.0001928155],"domain_scores_gemma":[0.99469453,0.0030095933,0.00042749316,0.0011902326,0.00053358986,0.00014460493],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019059179,0.00069924153,0.0006680724,0.0010067088,0.0004101809,0.0017932011,0.0013617533,0.0006651148,0.0046041384],"category_scores_gemma":[0.008490239,0.0004688064,0.0006005636,0.0007388607,0.0010441049,0.002538026,0.0014023741,0.0014458611,0.00080536155],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018667275,0.0003270354,0.0052485988,0.0005581654,0.00010109281,0.0008662134,0.00076935056,0.052927684,0.12197889,0.2379383,0.012347831,0.5650701],"study_design_scores_gemma":[0.00015406593,0.00023380519,0.0012983462,0.00013210473,0.00011868314,0.00048500896,0.000086954744,0.62259084,0.2171836,0.13896506,0.01869472,0.000056806373],"about_ca_topic_score_codex":0.0007069595,"about_ca_topic_score_gemma":0.0008097332,"teacher_disagreement_score":0.0046041384,"about_ca_system_score_codex":0.00093945506,"about_ca_system_score_gemma":0.00088753476,"threshold_uncertainty_score":0.015402377},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009045248,0.00016061388,0.98132265,0.00019574045,0.000048393005,0.00011747154,0.00008690727,0.0012752071,0.007747782],"genre_scores_gemma":[0.23177534,0.0002656284,0.75842017,0.00019166399,0.00003686229,0.00014243938,0.00041597066,0.0005170496,0.008234884],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985972,0.00041981164,0.00006256389,0.00016917304,0.0005398025,0.0002113417],"domain_scores_gemma":[0.9976361,0.0014782265,0.0000787924,0.00034100746,0.0004150017,0.00005081973],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011945576,0.00088948524,0.00084290694,0.0009088931,0.00067570247,0.0010852788,0.0021775113,0.00093719445,0.013875675],"category_scores_gemma":[0.005028032,0.00053768005,0.0010403785,0.0010627552,0.0009730092,0.0024365971,0.0024303915,0.0019594736,0.0020771082],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005649832,0.00048010633,0.0005864517,0.0009687081,0.00010105401,0.00021802784,0.0004037533,0.23470712,0.033301648,0.15960214,0.013599277,0.5554668],"study_design_scores_gemma":[0.00014070774,0.00008363748,0.00014588126,0.000058574828,0.00006471553,0.000117582196,0.000084736275,0.8747015,0.018548079,0.09752741,0.008504368,0.00002279187],"about_ca_topic_score_codex":0.0043882034,"about_ca_topic_score_gemma":0.0075362017,"teacher_disagreement_score":0.013875675,"about_ca_system_score_codex":0.0008771226,"about_ca_system_score_gemma":0.0022740825,"threshold_uncertainty_score":0.046418726},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023231544,0.00026056537,0.92857414,0.00038259284,0.00046743156,0.00051433564,0.0008680701,0.008300478,0.037400857],"genre_scores_gemma":[0.18108241,0.0008014904,0.7256587,0.00055149314,0.00018029107,0.0010675502,0.0041357726,0.0060630064,0.080459304],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979997,0.00030408267,0.00017656668,0.00042758754,0.00086015713,0.00023185338],"domain_scores_gemma":[0.9976241,0.00093369593,0.000113849674,0.00079276745,0.00042538074,0.00011022363],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013966911,0.0012405696,0.0008715172,0.002218146,0.001606882,0.002216202,0.00191562,0.0017515462,0.028800149],"category_scores_gemma":[0.0062387395,0.00070486224,0.0016144264,0.0017394935,0.0012934407,0.0055439486,0.0045575174,0.001528668,0.008037767],"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.0005444459,0.00027626625,0.0028953697,0.00079359015,0.000213336,0.0063407365,0.001324917,0.039413076,0.030924968,0.4887599,0.022394456,0.40611893],"study_design_scores_gemma":[0.000071820585,0.00027416568,0.00077654026,0.0002988854,0.0002093946,0.002260571,0.0007014968,0.1822813,0.05787361,0.37852105,0.37661776,0.00011342863],"about_ca_topic_score_codex":0.0010919861,"about_ca_topic_score_gemma":0.0018252444,"teacher_disagreement_score":0.028800149,"about_ca_system_score_codex":0.0005045158,"about_ca_system_score_gemma":0.00096434454,"threshold_uncertainty_score":0.09634614},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018152458,0.00008885626,0.99606305,0.00014082578,0.000011977841,0.000051619892,0.00003796808,0.00039407526,0.0013962921],"genre_scores_gemma":[0.20153001,0.0007355646,0.7924713,0.00032434225,0.00007855605,0.00042459444,0.00043666904,0.0003253989,0.0036737267],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99630606,0.0008107998,0.00019435787,0.0005953627,0.001854942,0.00023860007],"domain_scores_gemma":[0.9949464,0.0028538245,0.00028888902,0.0012799008,0.00054607017,0.000084898624],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002508091,0.001253228,0.00090154633,0.0022410164,0.00085193856,0.0020392325,0.002716025,0.0014029391,0.0037044252],"category_scores_gemma":[0.009061599,0.0008308791,0.0027469022,0.0012705475,0.0038426332,0.0038356176,0.0041312147,0.003988613,0.0008820873],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000116736344,0.00013935634,0.0008692703,0.000514258,0.00010512149,0.0007121153,0.0008021932,0.21376921,0.014112152,0.5738876,0.0020064586,0.19296557],"study_design_scores_gemma":[0.0000353581,0.00008372875,0.00014583208,0.00012840703,0.00006723387,0.0003601862,0.0000803671,0.4278015,0.011882332,0.5485393,0.010831465,0.000044354576],"about_ca_topic_score_codex":0.002031511,"about_ca_topic_score_gemma":0.0022699058,"teacher_disagreement_score":0.0037044252,"about_ca_system_score_codex":0.0013272833,"about_ca_system_score_gemma":0.002742804,"threshold_uncertainty_score":0.013264179},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018687619,0.000074356816,0.9800791,0.00003153466,0.000008532872,0.000032195105,0.00002733609,0.00043018363,0.0006291532],"genre_scores_gemma":[0.89590186,0.00008167678,0.10324652,0.000023097256,0.00001342247,0.00011101825,0.000085410604,0.000045805857,0.0004911738],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978746,0.00058526226,0.00010257702,0.0005135206,0.00075157796,0.00017248334],"domain_scores_gemma":[0.9942153,0.003535127,0.0009373449,0.0006865798,0.00050852454,0.000117088646],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019219302,0.0007170578,0.00072353176,0.00040126083,0.00042635435,0.0008997704,0.0012479037,0.00054311444,0.0012477314],"category_scores_gemma":[0.0068225716,0.00040883274,0.000715076,0.00023910278,0.0017590759,0.00066449796,0.0012264368,0.00096894987,0.00018154408],"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.00010524798,0.000050912848,0.001113008,0.00013268035,0.00003719961,0.00010023839,0.00014704204,0.9424828,0.009283629,0.027155515,0.00024661593,0.019145168],"study_design_scores_gemma":[0.000026260052,0.00009223779,0.00020263932,0.000012096288,0.000013730622,0.000025639218,0.00001478914,0.98389095,0.0058372403,0.009418906,0.0004571912,0.000008275095],"about_ca_topic_score_codex":0.001613459,"about_ca_topic_score_gemma":0.0015447778,"teacher_disagreement_score":0.0019219302,"about_ca_system_score_codex":0.0007740478,"about_ca_system_score_gemma":0.0017591562,"threshold_uncertainty_score":0.0101643205},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017781565,0.00079200405,0.97767806,0.00024409882,0.000035528956,0.000115590934,0.00010241423,0.0021359876,0.0011146977],"genre_scores_gemma":[0.4879243,0.0020675613,0.5056513,0.00025779518,0.000055161003,0.00040268397,0.0008867535,0.00056513736,0.0021892737],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99130005,0.003919082,0.0005707149,0.0007409081,0.002997876,0.00047133194],"domain_scores_gemma":[0.9791878,0.015602812,0.0013599141,0.0019686667,0.0017073052,0.00017351276],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0069701695,0.0011183347,0.0010556701,0.0014395178,0.00062236364,0.0019491563,0.0032470282,0.0012243873,0.0015265747],"category_scores_gemma":[0.019682035,0.001305243,0.0035210787,0.0009846016,0.002729532,0.0029822886,0.0019292699,0.002626189,0.00034325224],"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.00012673213,0.000065462096,0.0016804587,0.0005916695,0.00019519844,0.0002488805,0.00033384186,0.8608985,0.007882054,0.059406053,0.0012995,0.06727174],"study_design_scores_gemma":[0.000057943085,0.000078980076,0.00028523363,0.00012793473,0.000097106866,0.00007776644,0.00003242016,0.93694633,0.007335312,0.050043896,0.004885826,0.000031201573],"about_ca_topic_score_codex":0.012137933,"about_ca_topic_score_gemma":0.009486506,"teacher_disagreement_score":0.012137933,"about_ca_system_score_codex":0.0021029196,"about_ca_system_score_gemma":0.0037620275,"threshold_uncertainty_score":0.036862195},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11790477,0.00055432034,0.87527585,0.00010314645,0.00014647907,0.00013175885,0.00010670848,0.0018676777,0.003909239],"genre_scores_gemma":[0.541481,0.0004526111,0.44997674,0.00006376919,0.000032050764,0.00022895461,0.00017527727,0.00014556113,0.0074439216],"study_design_codex":"bench_or_experimental","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997212,0.000025366304,0.000015167887,0.00008240375,0.00013271233,0.000023047874],"domain_scores_gemma":[0.999532,0.00017321247,0.00008044618,0.00007174641,0.00011147563,0.000031084764],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037006172,0.00040988345,0.00044036694,0.000337953,0.0003048056,0.000617808,0.0005196495,0.00036373726,0.0028204366],"category_scores_gemma":[0.00086934504,0.00036664042,0.00035492293,0.00015411145,0.00042095786,0.00031252584,0.00027164677,0.000517451,0.00048700543],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028332826,0.0001054614,0.000729827,0.00042734112,0.000048332902,0.00034565298,0.00032584023,0.06973372,0.75848806,0.012376922,0.00064525043,0.15649016],"study_design_scores_gemma":[0.00017989779,0.00085015345,0.0011517077,0.000053963675,0.00008058105,0.00023500896,0.000082586586,0.2343411,0.7377031,0.0034847101,0.021795299,0.00004192967],"about_ca_topic_score_codex":0.0011619522,"about_ca_topic_score_gemma":0.001390264,"teacher_disagreement_score":0.0028204366,"about_ca_system_score_codex":0.0003452142,"about_ca_system_score_gemma":0.00071871537,"threshold_uncertainty_score":0.009435296},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28208277,0.0035804429,0.67013603,0.0009757261,0.00013654497,0.0007029473,0.00025131306,0.0011405637,0.040993683],"genre_scores_gemma":[0.78392434,0.0015162291,0.1940197,0.00013345928,0.000028339506,0.0003084013,0.00018020466,0.00018136394,0.01970803],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99679995,0.0014444625,0.0001596638,0.00021345417,0.0012117721,0.00017062317],"domain_scores_gemma":[0.9953921,0.0032905093,0.00022066577,0.0005313743,0.00041428077,0.0001510335],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029674259,0.0006115661,0.0003789842,0.0010561635,0.0010420801,0.001285429,0.0011587368,0.0023844682,0.004234747],"category_scores_gemma":[0.0063894587,0.00039492425,0.0006057667,0.00078303163,0.0012492791,0.0011104192,0.0010502702,0.0010289307,0.00060249364],"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.0019256058,0.002637582,0.0109657105,0.0034362474,0.00018119582,0.029751481,0.010511757,0.114065856,0.08527796,0.120507956,0.008287644,0.6124509],"study_design_scores_gemma":[0.0011380858,0.0041160975,0.010055686,0.0012764903,0.00040360747,0.028723825,0.007045326,0.3547987,0.24148102,0.092744134,0.2580124,0.00020459703],"about_ca_topic_score_codex":0.0015282967,"about_ca_topic_score_gemma":0.0026180223,"teacher_disagreement_score":0.004234747,"about_ca_system_score_codex":0.0006253568,"about_ca_system_score_gemma":0.0011140996,"threshold_uncertainty_score":0.015693486},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012677411,0.00083815947,0.9586019,0.0010465839,0.00013190495,0.00009448494,0.0002790229,0.00063962786,0.025690917],"genre_scores_gemma":[0.37594348,0.0023969302,0.5730624,0.00042809048,0.00027864127,0.00082428986,0.001244821,0.0006320996,0.045189276],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970925,0.0012107389,0.00016510068,0.00048200396,0.0008405929,0.0002090618],"domain_scores_gemma":[0.9980527,0.0009885071,0.00008841986,0.0004345766,0.00036169463,0.00007408004],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030554016,0.0015390011,0.0015446895,0.001365017,0.0016388975,0.005642944,0.001685952,0.0023022362,0.010503935],"category_scores_gemma":[0.0071170935,0.0008905674,0.0032477737,0.0016204045,0.004287294,0.0048388494,0.0032190322,0.005603321,0.0023337887],"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.00007124663,0.00003229657,0.00034355058,0.00010353478,0.000038517046,0.00010451185,0.000430728,0.08066313,0.0009929913,0.90200436,0.0011270447,0.014088126],"study_design_scores_gemma":[0.00006777128,0.00004395786,0.00021558261,0.00006540739,0.000028197092,0.00009764483,0.00013953482,0.38791716,0.0013740036,0.5866896,0.0233299,0.000031303058],"about_ca_topic_score_codex":0.013490164,"about_ca_topic_score_gemma":0.0068134307,"teacher_disagreement_score":0.013490164,"about_ca_system_score_codex":0.0038507022,"about_ca_system_score_gemma":0.0026966943,"threshold_uncertainty_score":0.035139203},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.049638186,0.00037040867,0.94213086,0.00020990855,0.00011331258,0.00010925467,0.00009844804,0.001010738,0.006318914],"genre_scores_gemma":[0.5321915,0.00051692536,0.44719467,0.00013319404,0.000045397708,0.00021362955,0.00029813574,0.00036939187,0.01903708],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991085,0.00014065935,0.000043672542,0.00021220058,0.00041096122,0.000083970954],"domain_scores_gemma":[0.9991738,0.00028501917,0.00006614895,0.00011755797,0.0003029731,0.000054438795],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010282026,0.0009341901,0.0006417129,0.00091285247,0.00089772884,0.0032708177,0.00085374626,0.0015278719,0.0047458345],"category_scores_gemma":[0.0018171292,0.00075050816,0.0015866751,0.00037007354,0.0014274849,0.0013440928,0.0008101707,0.0015859787,0.0007865015],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039710084,0.00012335974,0.0065006698,0.0007354558,0.000218605,0.0015010919,0.001673615,0.26147422,0.15634839,0.4606594,0.00242631,0.10794173],"study_design_scores_gemma":[0.000112996415,0.0003995963,0.004377811,0.00020031203,0.00013115216,0.001431758,0.0005490008,0.7971786,0.08470486,0.052972954,0.057815928,0.00012493733],"about_ca_topic_score_codex":0.011425268,"about_ca_topic_score_gemma":0.005175319,"teacher_disagreement_score":0.011425268,"about_ca_system_score_codex":0.001486369,"about_ca_system_score_gemma":0.0016438242,"threshold_uncertainty_score":0.022717535},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023118553,0.000062011706,0.99161655,0.0002634202,0.000039249175,0.000056912464,0.000055735934,0.0002657976,0.0053285398],"genre_scores_gemma":[0.24199006,0.00028269115,0.7470233,0.0004893837,0.00015932572,0.00038485703,0.00021966995,0.0001724007,0.009278351],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99644595,0.0014686423,0.00029541316,0.0005253179,0.0009948814,0.0002698611],"domain_scores_gemma":[0.9930219,0.0053713564,0.00022412646,0.0004945034,0.00072984525,0.000158389],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029835352,0.0008039384,0.000828993,0.0016560197,0.0010636658,0.0043224753,0.0029912998,0.0015778294,0.011379098],"category_scores_gemma":[0.009311996,0.0007291603,0.0023737948,0.0011299864,0.003582591,0.004767345,0.0021190695,0.003906673,0.001676371],"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.000039022143,0.000064099564,0.0001318513,0.00008469611,0.000030282907,0.000078637,0.00015277452,0.027204268,0.00095247704,0.9521734,0.00069187436,0.018396452],"study_design_scores_gemma":[0.00003879634,0.00003496854,0.000036613845,0.000038241473,0.00004690169,0.000050621926,0.000043535365,0.19724612,0.0020306874,0.7956509,0.0047632833,0.000019284058],"about_ca_topic_score_codex":0.0025354275,"about_ca_topic_score_gemma":0.0026178728,"teacher_disagreement_score":0.011379098,"about_ca_system_score_codex":0.0018531511,"about_ca_system_score_gemma":0.0024619058,"threshold_uncertainty_score":0.038066864},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0310737,0.00015351445,0.9621701,0.00038549426,0.00007069687,0.00013728073,0.0001241924,0.0010987131,0.004786312],"genre_scores_gemma":[0.8120808,0.00027717205,0.180225,0.0002997922,0.00013162704,0.00047453446,0.00063237577,0.00046689136,0.0054117213],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99355906,0.0026076438,0.00038495078,0.00067184836,0.0022284107,0.0005482332],"domain_scores_gemma":[0.985862,0.010122584,0.0011544809,0.0016375809,0.0010042622,0.00021920663],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036371048,0.0010829185,0.0008972765,0.0014297481,0.0007646486,0.0027952432,0.0021826406,0.0019325119,0.0047510583],"category_scores_gemma":[0.018518515,0.00077371066,0.0023692066,0.00060252065,0.0034269711,0.0034357766,0.0017617055,0.0028175735,0.0005289874],"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.00027263098,0.00024730968,0.0010687136,0.00022374274,0.000081345905,0.00035059315,0.00056466274,0.25869194,0.006811175,0.7041353,0.0015251304,0.02602748],"study_design_scores_gemma":[0.000116076626,0.00012210544,0.00014777548,0.000088880115,0.000054546108,0.0000859178,0.00008508999,0.57138497,0.0059117107,0.4186757,0.0032938346,0.000033378266],"about_ca_topic_score_codex":0.0034951929,"about_ca_topic_score_gemma":0.0034324473,"teacher_disagreement_score":0.0047510583,"about_ca_system_score_codex":0.00242731,"about_ca_system_score_gemma":0.0021511007,"threshold_uncertainty_score":0.019235075},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017293809,0.00020922077,0.9666336,0.00036336252,0.00015391379,0.00020900181,0.000861302,0.0026275471,0.011648227],"genre_scores_gemma":[0.51827735,0.0007664172,0.46785775,0.00030445363,0.00017731903,0.001053976,0.0019524142,0.0006895473,0.0089207785],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998706,0.00032753547,0.00020537306,0.0003044381,0.0003145957,0.00014215306],"domain_scores_gemma":[0.9980421,0.0007793765,0.0002917926,0.00020040157,0.0005995692,0.00008677268],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017032478,0.0006475124,0.00045152535,0.0012182873,0.0008549409,0.0023870447,0.0008188343,0.00082342385,0.004547895],"category_scores_gemma":[0.0026399035,0.00035752493,0.0010862314,0.0012653508,0.0024150559,0.0027843015,0.00080364046,0.0011674389,0.0007706394],"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.000080490114,0.000018434872,0.00032117506,0.00010853452,0.000013097613,0.0005080231,0.00084958615,0.006671319,0.005439517,0.97155386,0.0013281383,0.013107866],"study_design_scores_gemma":[0.00011293156,0.00017454608,0.0006545487,0.00016395633,0.000067403016,0.00071639137,0.0003986934,0.08761076,0.020165885,0.8097216,0.080116265,0.00009707487],"about_ca_topic_score_codex":0.0030971356,"about_ca_topic_score_gemma":0.0014705776,"teacher_disagreement_score":0.004547895,"about_ca_system_score_codex":0.0012861921,"about_ca_system_score_gemma":0.0015965011,"threshold_uncertainty_score":0.015214205},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023529872,0.031101102,0.8652782,0.0055051423,0.0032818113,0.00012270255,0.00031092428,0.0009058351,0.09114128],"genre_scores_gemma":[0.46021453,0.09039473,0.35466403,0.014724369,0.01033093,0.0019028255,0.0013124482,0.0015548385,0.06490129],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99397707,0.0017196694,0.00043082156,0.0013894311,0.002152278,0.00033070907],"domain_scores_gemma":[0.9963649,0.0018093241,0.00019124501,0.0006547784,0.00087970274,0.000100134384],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003864733,0.001086469,0.00097501546,0.0019576913,0.001009347,0.003062891,0.0021699239,0.0016607493,0.0066140643],"category_scores_gemma":[0.009358759,0.0006820091,0.0014152027,0.0017704683,0.0061663496,0.0076781595,0.0031578015,0.00581005,0.0028283857],"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.000009453004,0.000005151365,0.000023561835,0.00014291433,0.000018109335,0.000014269594,0.000054182845,0.0022478006,0.0002104073,0.9753268,0.0037958527,0.018151501],"study_design_scores_gemma":[0.000010626218,0.000024241283,0.00006441984,0.00015069229,0.000019799787,0.00008617729,0.00001918289,0.0064592897,0.001146179,0.85743487,0.13455787,0.000026725314],"about_ca_topic_score_codex":0.0013216779,"about_ca_topic_score_gemma":0.00066943176,"teacher_disagreement_score":0.0066140643,"about_ca_system_score_codex":0.0034663475,"about_ca_system_score_gemma":0.0021524418,"threshold_uncertainty_score":0.02515024},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05203051,0.00006614218,0.9448193,0.00019337717,0.000032677803,0.00009625026,0.00009178502,0.0009069039,0.0017630128],"genre_scores_gemma":[0.8158468,0.00011515117,0.18232243,0.000102797836,0.000041144805,0.00015669418,0.00024007873,0.00012634453,0.0010485593],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9880762,0.003703307,0.0010824434,0.0011523304,0.0050264825,0.0009592314],"domain_scores_gemma":[0.9566965,0.032728072,0.003437062,0.0035819397,0.003037155,0.00051925244],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008411864,0.0010753026,0.0008873605,0.0014148254,0.0011146034,0.0039922725,0.0023937433,0.0016786307,0.0021731209],"category_scores_gemma":[0.03956204,0.0011599936,0.0021005014,0.0010737083,0.0036418317,0.0052057714,0.0033843496,0.0018737343,0.00047773955],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009922181,0.00038072406,0.006136666,0.0007016769,0.0002857517,0.0011482879,0.0011196246,0.44677168,0.026581291,0.4541877,0.0008787075,0.060815692],"study_design_scores_gemma":[0.0001908665,0.000121410216,0.00030713665,0.000049226615,0.000090981055,0.00016851012,0.00013053892,0.79116094,0.021116301,0.18522584,0.0013911973,0.00004705572],"about_ca_topic_score_codex":0.004685001,"about_ca_topic_score_gemma":0.00543895,"teacher_disagreement_score":0.008411864,"about_ca_system_score_codex":0.0015812063,"about_ca_system_score_gemma":0.0049048797,"threshold_uncertainty_score":0.04448676},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030038725,0.00014025188,0.96094424,0.00019691885,0.000047357255,0.00026927734,0.0006175054,0.033270236,0.0015103001],"genre_scores_gemma":[0.122636445,0.00036212636,0.8642681,0.00037841947,0.000056892743,0.0008271592,0.003044985,0.006400325,0.0020254457],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98614395,0.005751835,0.0010294205,0.0014726304,0.0047927094,0.00080946763],"domain_scores_gemma":[0.97411466,0.013949235,0.0019941276,0.0066956426,0.0029379812,0.0003085072],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011105364,0.0027089925,0.0014320674,0.0038537486,0.0012309256,0.0034073403,0.0052933213,0.002196789,0.010057941],"category_scores_gemma":[0.043396786,0.001991269,0.0036595403,0.0007721198,0.002779554,0.00445773,0.004455876,0.0034266133,0.0022633194],"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.00044290652,0.00043349597,0.006567219,0.0018825529,0.0005273294,0.0012986116,0.0007631381,0.4752934,0.02803821,0.16762167,0.034425683,0.28270584],"study_design_scores_gemma":[0.0001753475,0.00015693766,0.00062954205,0.00044668175,0.00009052597,0.0005888293,0.000102726604,0.86008626,0.03516627,0.058610354,0.04380924,0.00013729594],"about_ca_topic_score_codex":0.009235983,"about_ca_topic_score_gemma":0.009543624,"teacher_disagreement_score":0.011105364,"about_ca_system_score_codex":0.002797256,"about_ca_system_score_gemma":0.007436242,"threshold_uncertainty_score":0.058731437},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.050321452,0.00029881677,0.94442534,0.000091340444,0.000029738634,0.0000650881,0.00016842269,0.0034410954,0.0011586694],"genre_scores_gemma":[0.7700521,0.0003532001,0.2254946,0.000090946196,0.000031403648,0.00013934454,0.00036603303,0.00062151835,0.00285089],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99798656,0.0004170463,0.00009059167,0.00030811285,0.00101315,0.00018456377],"domain_scores_gemma":[0.99431014,0.003327134,0.0007630473,0.0007645981,0.00077507313,0.000059942864],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011865196,0.00075373345,0.0006760683,0.002027614,0.0004081762,0.00068694283,0.0010461465,0.0006610057,0.0023383975],"category_scores_gemma":[0.007999845,0.00043070797,0.00090669486,0.00071312836,0.0008115368,0.0013003448,0.0010949773,0.0008912006,0.00031098977],"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.00045184215,0.00018699476,0.017886223,0.0009865361,0.00023558742,0.0019405459,0.0012048394,0.583657,0.07862988,0.09907853,0.0035122128,0.21222973],"study_design_scores_gemma":[0.00002727707,0.00010047242,0.0011506655,0.00005693179,0.0000910757,0.00034846057,0.00009459416,0.91852385,0.045926917,0.030545346,0.003108477,0.000025939868],"about_ca_topic_score_codex":0.0019086964,"about_ca_topic_score_gemma":0.0029651525,"teacher_disagreement_score":0.0023383975,"about_ca_system_score_codex":0.0006548189,"about_ca_system_score_gemma":0.0014217638,"threshold_uncertainty_score":0.007822752},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.052685335,0.00039528767,0.9058177,0.0019162802,0.0009454907,0.0010121028,0.0010609057,0.014725849,0.021441069],"genre_scores_gemma":[0.47325388,0.0003681825,0.50754637,0.0010661641,0.00013087288,0.000678776,0.0016202657,0.0030154332,0.012320023],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9742305,0.010765478,0.0015919169,0.0019316067,0.009756701,0.0017238073],"domain_scores_gemma":[0.9522504,0.019005034,0.0019623414,0.016335638,0.009770917,0.0006757371],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.021326445,0.0010633112,0.000874039,0.0020147678,0.001983724,0.0046355207,0.0035294052,0.0026261865,0.009044881],"category_scores_gemma":[0.052523904,0.001181624,0.0021521377,0.00068335386,0.003325649,0.0050897878,0.0037999123,0.003697301,0.0029647565],"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.0019989402,0.0011574447,0.00731821,0.0016659361,0.00033034015,0.0014375148,0.0025595087,0.07695232,0.08256895,0.6093236,0.03528472,0.17940249],"study_design_scores_gemma":[0.00059096364,0.0010027526,0.0025342759,0.0012205521,0.00025198114,0.0008430621,0.0006055509,0.5373069,0.21079496,0.12999706,0.11449711,0.00035486577],"about_ca_topic_score_codex":0.012770179,"about_ca_topic_score_gemma":0.0078511,"teacher_disagreement_score":0.021326445,"about_ca_system_score_codex":0.0024054868,"about_ca_system_score_gemma":0.009809202,"threshold_uncertainty_score":0.11278635},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0077755623,0.00024321064,0.9828362,0.00023148656,0.00013806818,0.000103795195,0.00016535805,0.0032381993,0.0052681775],"genre_scores_gemma":[0.32875362,0.0012365407,0.6577414,0.0005975182,0.00014298322,0.000521962,0.0006603364,0.0007524325,0.009593207],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99878305,0.00029708527,0.00018405588,0.00028039888,0.00034154934,0.00011379794],"domain_scores_gemma":[0.99894565,0.00042244233,0.00017164726,0.00020493315,0.00022435968,0.00003106256],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011426558,0.0005963228,0.0003549811,0.0006383741,0.00032513132,0.0013295144,0.00081054406,0.0005026035,0.0038220137],"category_scores_gemma":[0.002392416,0.00025715865,0.00082596875,0.0004047756,0.0009894812,0.0018588046,0.0006501163,0.0014125132,0.0010378017],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036215453,0.000092574424,0.00097276445,0.0006794145,0.00006125324,0.0015765518,0.0011665522,0.025648218,0.073525146,0.7480125,0.005380979,0.14252193],"study_design_scores_gemma":[0.00021509959,0.0004967447,0.00092518784,0.00028654083,0.00015980446,0.0027137354,0.00040319137,0.23265117,0.22474393,0.31748807,0.21977514,0.0001414372],"about_ca_topic_score_codex":0.0012606838,"about_ca_topic_score_gemma":0.00056580047,"teacher_disagreement_score":0.0038220137,"about_ca_system_score_codex":0.0005875744,"about_ca_system_score_gemma":0.00079821405,"threshold_uncertainty_score":0.012785852},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017284304,0.00009771324,0.9754827,0.00038815726,0.00006859267,0.00014989621,0.00024292183,0.0033975695,0.0028881528],"genre_scores_gemma":[0.43613964,0.000235505,0.5538952,0.00034856383,0.000043043816,0.00027120212,0.0014980055,0.0009598505,0.006608974],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9955314,0.0011317073,0.00036209627,0.0008377679,0.0016860822,0.0004510338],"domain_scores_gemma":[0.9897383,0.0031188193,0.0005944559,0.005277742,0.0011012695,0.00016947002],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031980325,0.0010753804,0.0011569638,0.0009817703,0.0009833837,0.002198529,0.002747779,0.0016535626,0.008033906],"category_scores_gemma":[0.0146808885,0.0006589172,0.0021767933,0.00070949295,0.0018720198,0.0053455625,0.0051139593,0.0030173124,0.0016260257],"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.00084527885,0.00034139748,0.0037496598,0.0010752773,0.00025263647,0.0013918441,0.0018519192,0.28700337,0.045757245,0.42666945,0.012862391,0.21819957],"study_design_scores_gemma":[0.00010123831,0.00024826307,0.0004666892,0.00017183385,0.000119619166,0.00066558825,0.00052700937,0.5889522,0.0573019,0.3088368,0.04253216,0.00007669444],"about_ca_topic_score_codex":0.0021763926,"about_ca_topic_score_gemma":0.0016127342,"teacher_disagreement_score":0.008033906,"about_ca_system_score_codex":0.0015280697,"about_ca_system_score_gemma":0.002084354,"threshold_uncertainty_score":0.026876092},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0037489813,0.00045864316,0.95726347,0.0007712044,0.00017179512,0.00008296702,0.000064805594,0.0005460145,0.03689211],"genre_scores_gemma":[0.2484569,0.0019236956,0.7196211,0.00055202073,0.00067662157,0.00025687143,0.0002664827,0.00068161625,0.027564775],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9961521,0.001165946,0.00039047815,0.0006569147,0.0014004459,0.00023416593],"domain_scores_gemma":[0.9965004,0.0017198368,0.00023781825,0.0009135252,0.000548698,0.00007971887],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003299327,0.00074753124,0.0008893302,0.0013667092,0.0014618196,0.0040297117,0.0024901715,0.0014328212,0.0066893054],"category_scores_gemma":[0.006121746,0.0010414682,0.0026372091,0.001455654,0.0044886894,0.0059231576,0.00294165,0.0035598017,0.0020610697],"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.000013011143,0.000026615655,0.00004981624,0.00007365615,0.000014743344,0.00008185527,0.0001751608,0.002904987,0.0012625182,0.9795076,0.001216235,0.014673807],"study_design_scores_gemma":[0.000022032951,0.000026341062,0.000049736143,0.000038468064,0.000042328225,0.00017211506,0.00005492525,0.02488488,0.0025581352,0.9519477,0.020179963,0.000023254464],"about_ca_topic_score_codex":0.0010021462,"about_ca_topic_score_gemma":0.0011013251,"teacher_disagreement_score":0.0066893054,"about_ca_system_score_codex":0.0012955625,"about_ca_system_score_gemma":0.0013455099,"threshold_uncertainty_score":0.022377968},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41682106,0.011244763,0.4808237,0.0023793078,0.0011505932,0.00081648503,0.0030735286,0.05554081,0.02814977],"genre_scores_gemma":[0.47846472,0.0016931819,0.5036344,0.0007484093,0.00020354555,0.0004514314,0.0054241735,0.0058530043,0.0035271177],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9946051,0.0018070607,0.00064882525,0.0011903016,0.0011773546,0.0005714115],"domain_scores_gemma":[0.9828919,0.010544079,0.00085143064,0.004105806,0.0013046812,0.0003020794],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037529508,0.0031644579,0.0016790847,0.0025053082,0.0007801418,0.002812443,0.0034466756,0.0020446535,0.012626928],"category_scores_gemma":[0.024370542,0.0012664691,0.00212763,0.003630066,0.0011611013,0.004922833,0.0024178387,0.004814596,0.005246538],"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.0032607776,0.0013899528,0.005221515,0.0037746204,0.00056362763,0.0004938172,0.0003650021,0.22473569,0.07724642,0.013199311,0.026830748,0.64291865],"study_design_scores_gemma":[0.0011299584,0.0017971379,0.0034890098,0.0005249996,0.00056646694,0.0007374484,0.0005303029,0.7283712,0.18972225,0.034251776,0.038629387,0.00025009704],"about_ca_topic_score_codex":0.0015776204,"about_ca_topic_score_gemma":0.0028741346,"teacher_disagreement_score":0.012626928,"about_ca_system_score_codex":0.0010202485,"about_ca_system_score_gemma":0.0026580063,"threshold_uncertainty_score":0.042241216},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013614209,0.0006819131,0.96334857,0.0010142812,0.00014437182,0.00012586282,0.00034109136,0.0026629246,0.018066838],"genre_scores_gemma":[0.5582053,0.0013948638,0.41556317,0.0009683839,0.00025791203,0.00037406833,0.0014265645,0.0009484576,0.02086127],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9964749,0.00081831677,0.00026099657,0.00049477175,0.0016147587,0.00033629738],"domain_scores_gemma":[0.9940462,0.0040814267,0.00028012338,0.0008236413,0.00065906165,0.00010949386],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029147507,0.00074422825,0.0006759263,0.0008604058,0.000874087,0.0032999183,0.0021211707,0.0010241151,0.0044983053],"category_scores_gemma":[0.011081186,0.00072068966,0.0020988719,0.0008964289,0.004157823,0.00487828,0.0018983786,0.003410462,0.001138495],"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.00011682855,0.000060556013,0.00047069424,0.00029297234,0.000043000513,0.0005173133,0.0008317837,0.05337932,0.0057620537,0.88674456,0.0040284693,0.047752377],"study_design_scores_gemma":[0.00004281249,0.000036551388,0.00021813085,0.00014452054,0.000041488835,0.00013019104,0.000096418815,0.18550698,0.009624827,0.78813803,0.01598132,0.00003866709],"about_ca_topic_score_codex":0.009329776,"about_ca_topic_score_gemma":0.0054687536,"teacher_disagreement_score":0.009329776,"about_ca_system_score_codex":0.004084311,"about_ca_system_score_gemma":0.0029701316,"threshold_uncertainty_score":0.02963382},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026246589,0.000046042016,0.9936801,0.000045981815,0.000021956736,0.000057058645,0.00004377042,0.0012221907,0.0022581609],"genre_scores_gemma":[0.14936198,0.0001859563,0.84382606,0.000099557255,0.00006754168,0.0003058571,0.00033259767,0.00081399636,0.0050065313],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99735296,0.0005431024,0.00016096665,0.00048541173,0.0012632725,0.00019431363],"domain_scores_gemma":[0.99689305,0.001503584,0.00024584855,0.0007176848,0.00057588454,0.00006383096],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019981593,0.0009441889,0.000838656,0.0018450667,0.0009886073,0.0011779778,0.001642367,0.00068910077,0.009505492],"category_scores_gemma":[0.008589464,0.0007154407,0.002388894,0.0006701218,0.0017279037,0.002623258,0.0016764652,0.0014820159,0.0022819724],"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.00019025218,0.00009843926,0.0011554062,0.00055235723,0.00009976827,0.0003943933,0.0006418192,0.10615932,0.03472665,0.6520291,0.004160984,0.19979157],"study_design_scores_gemma":[0.000059130893,0.0000856211,0.00023618007,0.000070719274,0.00010083495,0.00030256933,0.00006375448,0.66231686,0.0295569,0.2853515,0.021802705,0.000053129494],"about_ca_topic_score_codex":0.0018078019,"about_ca_topic_score_gemma":0.0029391283,"teacher_disagreement_score":0.009505492,"about_ca_system_score_codex":0.00095956365,"about_ca_system_score_gemma":0.0018442508,"threshold_uncertainty_score":0.03179902},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0058775037,0.000051743762,0.9879688,0.0001121998,0.000031374097,0.00017773533,0.0003765337,0.0020032714,0.0034008662],"genre_scores_gemma":[0.17096117,0.00019931038,0.8197699,0.0001416246,0.00002432167,0.0006769483,0.0016903909,0.0006574606,0.005878765],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9928895,0.0019968082,0.0005415238,0.0004932284,0.0036394643,0.00043944764],"domain_scores_gemma":[0.98934937,0.00533137,0.00092330604,0.001987093,0.0022342922,0.00017457164],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007410313,0.0009220805,0.00056962087,0.0022271625,0.0010624805,0.0031885384,0.002015301,0.0014838058,0.00568266],"category_scores_gemma":[0.015100268,0.0010029098,0.0022552116,0.0010870512,0.001713607,0.0030358515,0.0023745096,0.0019114037,0.0015600682],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003332989,0.00026025757,0.005122066,0.0005456052,0.00017393687,0.001088124,0.001353031,0.25000316,0.028524414,0.6209487,0.006643334,0.085004106],"study_design_scores_gemma":[0.000047303754,0.00005631857,0.00033300623,0.00010013919,0.00003800735,0.00021370096,0.00014653901,0.88051265,0.026045145,0.06739265,0.025074093,0.000040549312],"about_ca_topic_score_codex":0.011031025,"about_ca_topic_score_gemma":0.011718881,"teacher_disagreement_score":0.011031025,"about_ca_system_score_codex":0.002238934,"about_ca_system_score_gemma":0.0051657604,"threshold_uncertainty_score":0.039189994},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.060122915,0.0003758512,0.86230314,0.0003342144,0.00024054314,0.0004068931,0.002139218,0.0035894,0.0704878],"genre_scores_gemma":[0.53833413,0.00087896036,0.39494735,0.0004480095,0.00009206187,0.0006530696,0.0068765283,0.0020463238,0.05572355],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99858665,0.0002514807,0.00012376774,0.00034444546,0.0003882778,0.0003053839],"domain_scores_gemma":[0.996458,0.0012060365,0.00026654312,0.0013123128,0.000510651,0.00024637365],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013301095,0.0009373552,0.00064352615,0.0013080449,0.0015073001,0.0025190231,0.00095435965,0.0010776786,0.021012839],"category_scores_gemma":[0.005545671,0.0010464012,0.0017598689,0.00097386516,0.00213005,0.0060137226,0.0028396025,0.0018587124,0.004559785],"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.00037862477,0.00012332457,0.0024709564,0.00073702395,0.00014854786,0.0011907142,0.0012475686,0.008816737,0.016953811,0.89664865,0.010164774,0.061119184],"study_design_scores_gemma":[0.00006439187,0.00009123555,0.0011549981,0.00024897794,0.00019176364,0.00056476775,0.0006341358,0.018778577,0.017184263,0.8997096,0.06132831,0.000048893733],"about_ca_topic_score_codex":0.002900877,"about_ca_topic_score_gemma":0.0049961247,"teacher_disagreement_score":0.021012839,"about_ca_system_score_codex":0.0011166098,"about_ca_system_score_gemma":0.002186861,"threshold_uncertainty_score":0.070294976},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021040759,0.00045170824,0.9886509,0.0010489748,0.00009572832,0.000064176216,0.00010619467,0.00022420668,0.007254041],"genre_scores_gemma":[0.22203185,0.0015642677,0.7597341,0.0013764006,0.0005643352,0.00046179286,0.000528501,0.00023169305,0.013507044],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975018,0.00078772893,0.00021115779,0.00043620964,0.00088498567,0.00017818173],"domain_scores_gemma":[0.9974215,0.0016246075,0.0002589728,0.00028272765,0.00028404326,0.000128199],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035260513,0.0012009054,0.00063178665,0.0015781891,0.0015256164,0.0034185394,0.0026471056,0.0018250889,0.005413987],"category_scores_gemma":[0.0057211528,0.0008001659,0.0025529976,0.0016371718,0.0041956804,0.009232245,0.0036490802,0.0044741873,0.0009617817],"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.000017861705,0.000018466326,0.00013280548,0.00009915484,0.000025713323,0.00015405295,0.00024084277,0.013733739,0.0007170659,0.9708182,0.0013617612,0.012680234],"study_design_scores_gemma":[0.000019466175,0.000023665028,0.000080583464,0.00007055257,0.000035682253,0.00015114214,0.00007070722,0.0735631,0.0010640123,0.9057126,0.019183517,0.000024979621],"about_ca_topic_score_codex":0.0031667256,"about_ca_topic_score_gemma":0.002307988,"teacher_disagreement_score":0.005413987,"about_ca_system_score_codex":0.002639818,"about_ca_system_score_gemma":0.0020562618,"threshold_uncertainty_score":0.019153297},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006354487,0.000038447524,0.98809963,0.00018172855,0.000029664701,0.00005550331,0.00026860504,0.0026871855,0.0022848211],"genre_scores_gemma":[0.181992,0.00016144676,0.8115593,0.00028255887,0.0000352316,0.00040877887,0.001226783,0.0007169782,0.0036168639],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99835205,0.0006336383,0.00020385614,0.0001642905,0.00045576924,0.00019038757],"domain_scores_gemma":[0.9971475,0.0010878816,0.00026907833,0.0009499881,0.00045203706,0.00009340134],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00256979,0.0006831654,0.00053751713,0.00090599235,0.00068202266,0.0030619157,0.0018913102,0.0011955315,0.004159857],"category_scores_gemma":[0.00570729,0.00067088165,0.0020874706,0.0010267015,0.0020876206,0.005282604,0.0026821194,0.0024658698,0.00128203],"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.00011380198,0.000048670205,0.001056732,0.00024052578,0.00003426353,0.00029080812,0.0010979386,0.09255177,0.0055307,0.8625114,0.0025442336,0.033979245],"study_design_scores_gemma":[0.000036035635,0.000063160245,0.00015573669,0.00014255742,0.000046953097,0.00016913877,0.00021079522,0.52936596,0.012235372,0.42487422,0.032643944,0.000056131386],"about_ca_topic_score_codex":0.0033062038,"about_ca_topic_score_gemma":0.0061688926,"teacher_disagreement_score":0.004159857,"about_ca_system_score_codex":0.0013988008,"about_ca_system_score_gemma":0.00215538,"threshold_uncertainty_score":0.013916135},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026419307,0.0003715158,0.97949433,0.0006772727,0.00012388651,0.00020856076,0.0007255934,0.008416913,0.0073399562],"genre_scores_gemma":[0.042477846,0.00020579442,0.9454821,0.00042436685,0.00007444621,0.00043286264,0.0022318638,0.0018541825,0.006816601],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9974571,0.0005930895,0.0002142404,0.0007182614,0.0006791535,0.00033814434],"domain_scores_gemma":[0.99488527,0.0028363122,0.00025903934,0.0010983002,0.0007835668,0.00013754799],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002173395,0.0022979677,0.0012637145,0.0013483923,0.0012402608,0.0032835978,0.0035446486,0.002689337,0.07364502],"category_scores_gemma":[0.010779339,0.0013881907,0.0026432225,0.0022499035,0.0009986165,0.005795626,0.0046352195,0.003368626,0.018123308],"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.00036617028,0.00032361288,0.001214806,0.000982464,0.00012927546,0.0002281929,0.00035189473,0.101249024,0.004661599,0.18645604,0.07742125,0.6266157],"study_design_scores_gemma":[0.00030128978,0.00006401037,0.00023465301,0.00010951494,0.000051457228,0.00018942256,0.00009590693,0.61186874,0.004812715,0.3459548,0.03627492,0.000042579955],"about_ca_topic_score_codex":0.0059215017,"about_ca_topic_score_gemma":0.011574902,"teacher_disagreement_score":0.07364502,"about_ca_system_score_codex":0.002851749,"about_ca_system_score_gemma":0.0033778853,"threshold_uncertainty_score":0.24636716},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0063288077,0.00017061294,0.9849089,0.00030587628,0.00005547069,0.00011428104,0.00017557308,0.0010644791,0.006876073],"genre_scores_gemma":[0.35061258,0.00079071504,0.6378406,0.00039350422,0.00011978,0.000654699,0.0011038341,0.00062621414,0.007858082],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9920735,0.0025940565,0.00045585216,0.0013516267,0.00314613,0.00037876045],"domain_scores_gemma":[0.98364717,0.01042389,0.00077888725,0.003629311,0.0013914661,0.00012922214],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007064458,0.0009556035,0.0009713647,0.0015554886,0.00081561116,0.0045952746,0.0028201754,0.001329629,0.0063962555],"category_scores_gemma":[0.026691718,0.00088961923,0.0025473214,0.0012901347,0.00488398,0.0067732567,0.0028717674,0.0026292047,0.001081284],"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.00012285227,0.00006983948,0.000648313,0.0005967854,0.00014899671,0.00023784008,0.0004920954,0.12125958,0.008345402,0.8099654,0.0020140652,0.05609887],"study_design_scores_gemma":[0.000079004334,0.0000699604,0.0002534825,0.00019305063,0.00009875203,0.00018722427,0.00007911895,0.35463423,0.020920366,0.6056873,0.017754791,0.000042657295],"about_ca_topic_score_codex":0.0030737564,"about_ca_topic_score_gemma":0.0015739886,"teacher_disagreement_score":0.007064458,"about_ca_system_score_codex":0.0027206386,"about_ca_system_score_gemma":0.003495628,"threshold_uncertainty_score":0.037360907},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10391084,0.0027653235,0.85228264,0.0025064133,0.00024144926,0.00010642046,0.00042407928,0.0005731306,0.03718972],"genre_scores_gemma":[0.8848626,0.0018759776,0.10048529,0.00053698727,0.0003161277,0.00032857974,0.0005299601,0.0007177294,0.010346836],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.992857,0.0019400152,0.0005365997,0.0014035864,0.002560238,0.00070263125],"domain_scores_gemma":[0.97491646,0.015606629,0.0024532017,0.002438065,0.0031882685,0.0013974276],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0046885577,0.0017774013,0.002142773,0.0038250105,0.0010696653,0.005107433,0.0016414571,0.0019365398,0.0076369317],"category_scores_gemma":[0.03415492,0.0010141989,0.0013320823,0.0036738059,0.0035427036,0.013028974,0.0035320714,0.005104008,0.00084777054],"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.00010214523,0.000037819696,0.00044992514,0.00012799268,0.000023724948,0.000020886997,0.00010153492,0.012966181,0.0010102228,0.95744604,0.0012307052,0.026482863],"study_design_scores_gemma":[0.000008964305,0.0000265438,0.00018406747,0.000031433134,0.000012600388,0.000026133894,0.000024502946,0.028712116,0.0011449524,0.9683234,0.0014947051,0.00001064563],"about_ca_topic_score_codex":0.0006934316,"about_ca_topic_score_gemma":0.0007557264,"teacher_disagreement_score":0.0076369317,"about_ca_system_score_codex":0.0047944295,"about_ca_system_score_gemma":0.0018568734,"threshold_uncertainty_score":0.034786224},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022512492,0.0012843274,0.924942,0.002688358,0.00048711366,0.00012012851,0.00079527806,0.0009727213,0.046197493],"genre_scores_gemma":[0.6594357,0.002301877,0.30680463,0.0012451509,0.0011047813,0.0005576937,0.0016055627,0.0012836604,0.025660926],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98663354,0.004115333,0.0013144828,0.0029601373,0.0038866284,0.0010899107],"domain_scores_gemma":[0.9632572,0.015778074,0.0027180112,0.013237978,0.0042808605,0.0007279048],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0080021955,0.0009923948,0.0015406521,0.0029303033,0.0035986188,0.007451408,0.0026974832,0.0026175093,0.009357932],"category_scores_gemma":[0.049606103,0.0014897593,0.0027633589,0.0023905423,0.011872477,0.02545145,0.0059327306,0.0065361746,0.0026338813],"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.000058074922,0.00001421661,0.00033821797,0.000100899975,0.000026543641,0.000060234448,0.0002651193,0.0015891116,0.0005351054,0.98311067,0.0016056983,0.012296208],"study_design_scores_gemma":[0.0000074631294,0.000015420976,0.00010372301,0.00004261483,0.000027951966,0.000084211686,0.00006449681,0.0036176138,0.0014568774,0.9881259,0.006439909,0.000013811466],"about_ca_topic_score_codex":0.002127452,"about_ca_topic_score_gemma":0.0018221177,"teacher_disagreement_score":0.009357932,"about_ca_system_score_codex":0.0026513997,"about_ca_system_score_gemma":0.0030833813,"threshold_uncertainty_score":0.042320132},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31467408,0.0012757368,0.6398547,0.0009646652,0.0001875438,0.00016788037,0.0031592064,0.0023477138,0.037368443],"genre_scores_gemma":[0.872994,0.0012053825,0.08535543,0.0002650441,0.00025893818,0.00042393446,0.0028717536,0.0007076327,0.035917804],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968119,0.0004525573,0.00018744987,0.00093333714,0.0011600733,0.0004546419],"domain_scores_gemma":[0.9886424,0.00804244,0.0008426426,0.001256468,0.000935419,0.00028058008],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027701396,0.0007695492,0.0012717649,0.00275816,0.002054986,0.005591327,0.0014822616,0.0009993932,0.016647981],"category_scores_gemma":[0.0126150735,0.0006844257,0.0020534066,0.001706434,0.0027595153,0.008389382,0.0017449587,0.0032037331,0.0022012177],"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.0013938821,0.00017960869,0.013536736,0.000521366,0.00015607901,0.00086556515,0.0029449079,0.04437385,0.020665381,0.78776324,0.0047165486,0.12288277],"study_design_scores_gemma":[0.00018687872,0.00026021837,0.014828493,0.00020733442,0.00017665904,0.0017706259,0.001234441,0.24713778,0.039541073,0.63928986,0.055220637,0.00014589161],"about_ca_topic_score_codex":0.0075051053,"about_ca_topic_score_gemma":0.0064009875,"teacher_disagreement_score":0.016647981,"about_ca_system_score_codex":0.002782437,"about_ca_system_score_gemma":0.0012363696,"threshold_uncertainty_score":0.05569309},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005438296,0.00009244565,0.9916677,0.000066549794,0.000034181543,0.00008829987,0.000055453453,0.0005931784,0.0019638697],"genre_scores_gemma":[0.19356619,0.00032592964,0.8003836,0.000119466924,0.000058921985,0.0005485718,0.00032956444,0.00028086727,0.0043868627],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9930246,0.0032570078,0.0007323866,0.0010272629,0.0015892239,0.0003695049],"domain_scores_gemma":[0.9917197,0.005001451,0.0005571115,0.0015940641,0.0010152478,0.0001123654],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007025564,0.00081930764,0.00055784447,0.0011676002,0.00060301216,0.0016209617,0.0015904005,0.0009243279,0.003224154],"category_scores_gemma":[0.012609646,0.0007344507,0.0021363513,0.0008147753,0.002909961,0.002545443,0.0021651234,0.0017345976,0.00065483735],"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.00016784246,0.00006320492,0.0007428658,0.00032880137,0.00006014239,0.00045910612,0.0011862,0.071133524,0.014591246,0.8689411,0.0008407387,0.0414853],"study_design_scores_gemma":[0.00026314825,0.00026101703,0.00042920347,0.00021038463,0.0000942109,0.00030443864,0.00015770199,0.4065846,0.026226776,0.5139824,0.051422145,0.00006396381],"about_ca_topic_score_codex":0.002894753,"about_ca_topic_score_gemma":0.0023609889,"teacher_disagreement_score":0.007025564,"about_ca_system_score_codex":0.0013263368,"about_ca_system_score_gemma":0.0016993395,"threshold_uncertainty_score":0.03715521},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009690467,0.00009701456,0.9861407,0.00011435613,0.000044324974,0.00008598917,0.00009848614,0.00066798157,0.0030606466],"genre_scores_gemma":[0.50870186,0.0004607237,0.48307973,0.0001792465,0.000112167465,0.00030823806,0.00050405395,0.00041707055,0.006236865],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975121,0.0007115912,0.00019255749,0.00028449984,0.0010355132,0.00026383746],"domain_scores_gemma":[0.9943469,0.0033449624,0.0005065665,0.00070343143,0.00096045306,0.0001375129],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025881184,0.00069680816,0.0005801036,0.0012781675,0.0006630945,0.0023282599,0.0012924019,0.0009466228,0.0058498965],"category_scores_gemma":[0.0062600374,0.0006984926,0.0017263315,0.0005797537,0.0019054292,0.0025869603,0.001241409,0.002384852,0.0008139291],"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.000084655,0.00009772926,0.0006008091,0.00028451972,0.000044063683,0.00037751324,0.00055954425,0.07368361,0.012751193,0.8825064,0.00082513265,0.028184902],"study_design_scores_gemma":[0.00011630267,0.00011730442,0.00043540422,0.00016304055,0.000118454795,0.00036270745,0.00011364753,0.35983598,0.028024435,0.58746743,0.023189861,0.000055392353],"about_ca_topic_score_codex":0.0039099064,"about_ca_topic_score_gemma":0.0035272795,"teacher_disagreement_score":0.0058498965,"about_ca_system_score_codex":0.0013881101,"about_ca_system_score_gemma":0.00219865,"threshold_uncertainty_score":0.019569874},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0051032067,0.008565005,0.883228,0.00069301383,0.00036999583,0.00005953566,0.00021271656,0.00077731203,0.10099119],"genre_scores_gemma":[0.27308244,0.018939704,0.56898665,0.0004539825,0.0005243417,0.0005465374,0.0009913592,0.00054116984,0.13593379],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99977535,0.00004283918,0.000016838929,0.00004855454,0.000098681274,0.000017782044],"domain_scores_gemma":[0.99982446,0.000103945444,0.000010691522,0.00003186221,0.000021331098,0.000007718086],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003013662,0.0009381674,0.0007724734,0.0005082052,0.00053990015,0.0013869829,0.00090584386,0.0006740065,0.0085580675],"category_scores_gemma":[0.0007009195,0.00059128925,0.0005362478,0.0010009321,0.0015453288,0.0018774316,0.00085491885,0.0017429986,0.0015641162],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022489334,0.000012996378,0.00005825151,0.0003189806,0.000013482866,0.000072373456,0.00024382566,0.04883224,0.0026566458,0.81188434,0.0070066233,0.12887782],"study_design_scores_gemma":[0.00001408067,0.000023210783,0.000090391935,0.00009672682,0.000011182066,0.000055601668,0.0000386806,0.0648283,0.0016124313,0.85506654,0.07814854,0.000014365934],"about_ca_topic_score_codex":0.0024118791,"about_ca_topic_score_gemma":0.0027628974,"teacher_disagreement_score":0.0085580675,"about_ca_system_score_codex":0.00084582146,"about_ca_system_score_gemma":0.00090118614,"threshold_uncertainty_score":0.028629601},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003344666,0.010756473,0.9294183,0.0018200134,0.00041227127,0.0001341883,0.00043588565,0.00066873606,0.05300951],"genre_scores_gemma":[0.25825682,0.029347885,0.63825047,0.0015121582,0.0011701949,0.0010589033,0.002464842,0.0006352196,0.06730339],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99878234,0.00032511374,0.000100134195,0.00019933844,0.0005064409,0.000086626365],"domain_scores_gemma":[0.99873537,0.0008322067,0.00007646352,0.00013673319,0.00019147454,0.000027847625],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017240298,0.0010397354,0.00048945966,0.0010577604,0.0005747413,0.002564609,0.001437333,0.00093376037,0.007511783],"category_scores_gemma":[0.0028420244,0.00040053375,0.0008864161,0.0010230556,0.0025682112,0.003063871,0.0010332213,0.002258497,0.0023802696],"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.000009257667,0.000022192238,0.00009721723,0.00037730744,0.000010401799,0.00014266177,0.0004497303,0.007316574,0.002252823,0.9514479,0.00434279,0.033531055],"study_design_scores_gemma":[0.000013433531,0.000020242576,0.00014161918,0.00029630208,0.000012167173,0.0002776287,0.000115430994,0.019702693,0.002369237,0.81272274,0.16430888,0.000019553485],"about_ca_topic_score_codex":0.0012818224,"about_ca_topic_score_gemma":0.0006897299,"teacher_disagreement_score":0.007511783,"about_ca_system_score_codex":0.0017660235,"about_ca_system_score_gemma":0.0012916162,"threshold_uncertainty_score":0.025129437},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029448438,0.0347364,0.44103903,0.0052670934,0.0014463841,0.00014564395,0.00024565455,0.0009335753,0.51324135],"genre_scores_gemma":[0.3092212,0.050948985,0.31240487,0.007784796,0.003906239,0.00088667276,0.000904916,0.0009999509,0.31294236],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984403,0.0005032151,0.000089566536,0.0002323002,0.00060935307,0.00012511473],"domain_scores_gemma":[0.99874216,0.0006525541,0.00007246038,0.00026268014,0.00020565902,0.000064497275],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018197923,0.001027659,0.00071141846,0.0017488211,0.002186138,0.0038896773,0.0014278847,0.0018616369,0.01711344],"category_scores_gemma":[0.002731598,0.00054918387,0.0015726247,0.002253546,0.005076315,0.012881209,0.0026244998,0.0052444334,0.0053772996],"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.0000013136504,0.0000025576053,0.000006447737,0.00003334479,0.0000013966835,0.000014206528,0.00014777954,0.00017743712,0.00009184456,0.9950276,0.0013436765,0.0031523432],"study_design_scores_gemma":[0.0000030428212,0.00000543781,0.000021220521,0.000070959046,0.000004183864,0.00008350978,0.00006279834,0.0010448758,0.00019600925,0.8768837,0.12161749,0.000006712173],"about_ca_topic_score_codex":0.0020296876,"about_ca_topic_score_gemma":0.0017479024,"teacher_disagreement_score":0.01711344,"about_ca_system_score_codex":0.003124492,"about_ca_system_score_gemma":0.0018532438,"threshold_uncertainty_score":0.0572502},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0037679689,0.0075278925,0.8958951,0.0016713444,0.0004363084,0.00008748587,0.00027382426,0.00073283614,0.08960719],"genre_scores_gemma":[0.34369335,0.024710383,0.52911997,0.0012337265,0.0013938956,0.00062670687,0.0012775032,0.00082940725,0.097115055],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989096,0.00026551605,0.000055292265,0.00015932292,0.00054388,0.00006653701],"domain_scores_gemma":[0.9981475,0.0011652625,0.000092082555,0.0002275232,0.00034353932,0.000024121553],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015496513,0.00092879764,0.00042441604,0.0013030266,0.00059213204,0.001875865,0.001100816,0.00074258575,0.0066820155],"category_scores_gemma":[0.0039279023,0.00043675367,0.0008254883,0.0007706775,0.00242355,0.0024713508,0.00086670625,0.0020778528,0.0019084105],"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.0000046873897,0.000012511368,0.000074263946,0.00016279129,0.000008471576,0.0000508472,0.00017555917,0.014409084,0.0010295361,0.9462836,0.006375318,0.031413242],"study_design_scores_gemma":[0.0000050604076,0.000015406114,0.00010789139,0.00017329467,0.000008997712,0.00013932574,0.00004236203,0.031893987,0.0015597785,0.8649408,0.10109648,0.00001660244],"about_ca_topic_score_codex":0.001371283,"about_ca_topic_score_gemma":0.000714671,"teacher_disagreement_score":0.0066820155,"about_ca_system_score_codex":0.0018793644,"about_ca_system_score_gemma":0.0013040167,"threshold_uncertainty_score":0.02235353},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039165277,0.00009800285,0.95674676,0.000060418177,0.000034394983,0.00007535718,0.00011398285,0.0009634939,0.002742473],"genre_scores_gemma":[0.69523543,0.00020348128,0.30194527,0.000044593184,0.000012536411,0.0002689956,0.0002736464,0.0001516062,0.0018644548],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99951077,0.00011847689,0.000045757002,0.00007801899,0.0001802595,0.000066666005],"domain_scores_gemma":[0.99931896,0.0003473913,0.000109497865,0.00013723465,0.00006799111,0.000018890423],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004565698,0.0006224426,0.00045752368,0.00034836988,0.00026680302,0.0006657083,0.00070604385,0.00048960245,0.0016822658],"category_scores_gemma":[0.0017035713,0.00031948858,0.0009275242,0.00034742148,0.00067279127,0.0006029389,0.0008208965,0.00058548746,0.00029152344],"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.00015133635,0.000053011147,0.00037364612,0.00024160568,0.000030954026,0.00024054464,0.00017967867,0.81872046,0.0421515,0.111403026,0.000301713,0.026152482],"study_design_scores_gemma":[0.00005249187,0.00008631119,0.00005937985,0.000020431573,0.000023829272,0.000041830095,0.000019690495,0.93968946,0.026507134,0.031187443,0.0023006776,0.000011339243],"about_ca_topic_score_codex":0.0013423389,"about_ca_topic_score_gemma":0.0017682196,"teacher_disagreement_score":0.0016822658,"about_ca_system_score_codex":0.0005477165,"about_ca_system_score_gemma":0.0011207509,"threshold_uncertainty_score":0.0056276917},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013658507,0.00097282475,0.9701774,0.00045992443,0.00016042602,0.00014546205,0.00020398613,0.002310615,0.0119107915],"genre_scores_gemma":[0.29600507,0.00073230785,0.6886036,0.00044946006,0.00024958362,0.000487831,0.0011258399,0.0010569688,0.011289402],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99828255,0.00069626333,0.00008297492,0.0002714068,0.0004594626,0.00020742118],"domain_scores_gemma":[0.99310994,0.005246103,0.00022795553,0.0006177115,0.0005570158,0.00024135524],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024154314,0.001304557,0.0016365397,0.0015654155,0.00068845256,0.0015769122,0.002943619,0.0019031895,0.014304056],"category_scores_gemma":[0.012684319,0.0008015594,0.0013018474,0.0018144145,0.001281856,0.0025528471,0.0020967128,0.004422565,0.0026042117],"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.00051118445,0.0002522055,0.0007116941,0.0003588816,0.00007594336,0.00007030314,0.00012918451,0.518254,0.0031168463,0.08370535,0.011797078,0.38101742],"study_design_scores_gemma":[0.000042043892,0.000044973953,0.00008531537,0.000038928283,0.000017488948,0.000020178535,0.000011746879,0.9487786,0.000736583,0.049037974,0.0011767007,0.00000952217],"about_ca_topic_score_codex":0.002707711,"about_ca_topic_score_gemma":0.004105716,"teacher_disagreement_score":0.014304056,"about_ca_system_score_codex":0.0022072815,"about_ca_system_score_gemma":0.0024375953,"threshold_uncertainty_score":0.0478518},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00066197186,0.0057307607,0.8707264,0.0014122557,0.00055886194,0.00024035058,0.0015616042,0.005945796,0.11316184],"genre_scores_gemma":[0.06489107,0.013062464,0.7403373,0.0012545234,0.0007173093,0.0012433623,0.0058494015,0.0043649543,0.16827969],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99635375,0.0011196393,0.0003003942,0.00045949727,0.0015879446,0.00017886572],"domain_scores_gemma":[0.99466985,0.0034624273,0.00014629554,0.00094524847,0.00071384205,0.000062331324],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0049468307,0.0016792567,0.0009151136,0.002594411,0.0010606202,0.0034559006,0.0024818375,0.0013505239,0.07895497],"category_scores_gemma":[0.010953319,0.0012261507,0.0019316983,0.0019011562,0.002182867,0.0049826624,0.0023668006,0.0031413916,0.037166994],"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.000033197324,0.00005725271,0.0002582298,0.001182663,0.00007800587,0.00015016047,0.00040002278,0.0034932727,0.0019607588,0.6353032,0.093812935,0.26327023],"study_design_scores_gemma":[0.000040770246,0.000020172114,0.00013361473,0.00060807803,0.00003480894,0.00029074683,0.00009338314,0.012269333,0.004113624,0.5179386,0.4644235,0.000033439315],"about_ca_topic_score_codex":0.0012748993,"about_ca_topic_score_gemma":0.0015066621,"teacher_disagreement_score":0.07895497,"about_ca_system_score_codex":0.0018433111,"about_ca_system_score_gemma":0.0017705796,"threshold_uncertainty_score":0.26413065},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0042476365,0.0054255095,0.9603552,0.0005717147,0.00016486186,0.00006503158,0.00019804189,0.00048533504,0.028486514],"genre_scores_gemma":[0.41815633,0.01990889,0.5172984,0.00061378785,0.000641936,0.00063839025,0.0011670272,0.00066113315,0.040914],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991425,0.00021134401,0.000057028203,0.00011428271,0.00041633632,0.000058446713],"domain_scores_gemma":[0.99863845,0.0009174439,0.00008316139,0.00014836011,0.00019585644,0.000016742195],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011052602,0.0009087382,0.000413169,0.0011380662,0.00043417624,0.0015311583,0.0010083416,0.00064556306,0.0043732584],"category_scores_gemma":[0.0028565342,0.00039702607,0.0008041698,0.0007677221,0.0017484657,0.0015307713,0.0007317338,0.0015256534,0.0012879837],"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.000011287884,0.000022100457,0.00015154747,0.0004121295,0.000018335173,0.00016023831,0.00027729876,0.05063091,0.0045078294,0.89093244,0.003539157,0.04933675],"study_design_scores_gemma":[0.00000924747,0.000024714494,0.00018161135,0.00022135398,0.000018267852,0.0002412255,0.00005753871,0.113951944,0.0038822615,0.8132698,0.06811903,0.000023002349],"about_ca_topic_score_codex":0.0011310374,"about_ca_topic_score_gemma":0.00062707445,"teacher_disagreement_score":0.0043732584,"about_ca_system_score_codex":0.001325266,"about_ca_system_score_gemma":0.0009485458,"threshold_uncertainty_score":0.01462996},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0035055452,0.0007219418,0.9845109,0.00015348222,0.000062586114,0.000041766827,0.00007802781,0.00009773263,0.010828001],"genre_scores_gemma":[0.27563393,0.0023102271,0.70441335,0.0001053383,0.00008062316,0.00043566435,0.00028076276,0.00021330491,0.016526727],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987047,0.0007091259,0.000058294485,0.00014874579,0.0003118903,0.000067161585],"domain_scores_gemma":[0.9988343,0.00091748254,0.000071428265,0.000054742555,0.000084156636,0.000037879698],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017817765,0.0011095004,0.0009593908,0.0009097137,0.00035216875,0.0016529661,0.0007620756,0.00073834276,0.00794293],"category_scores_gemma":[0.0030964026,0.00065438374,0.0011585811,0.0011775644,0.00080499635,0.001447025,0.0012036334,0.001380684,0.0010343101],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007683378,0.00004622131,0.00018514247,0.00033144967,0.00006519542,0.000057492853,0.00007157708,0.6071067,0.0023736916,0.2638706,0.0023879956,0.12342712],"study_design_scores_gemma":[0.000027707092,0.00005899605,0.00008841655,0.00011018761,0.000024966947,0.000039945233,0.00002196266,0.66767514,0.0015455639,0.31483847,0.015548552,0.000020130961],"about_ca_topic_score_codex":0.0009014644,"about_ca_topic_score_gemma":0.0009709723,"teacher_disagreement_score":0.00794293,"about_ca_system_score_codex":0.0011680351,"about_ca_system_score_gemma":0.0007845213,"threshold_uncertainty_score":0.02657181},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023282748,0.00002759785,0.975176,0.000041420113,0.0000075721805,0.00003103765,0.000025749698,0.00045939867,0.00094840344],"genre_scores_gemma":[0.56280667,0.0000851647,0.4349161,0.000052722044,0.000027305134,0.00016282024,0.00010109546,0.0002533452,0.0015948026],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99722314,0.00090924994,0.00013842613,0.00046326307,0.000986814,0.0002791292],"domain_scores_gemma":[0.99431396,0.0036987145,0.00064280705,0.00067325716,0.0005439172,0.00012738224],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029189694,0.00079553283,0.00080755516,0.0014407248,0.00068722473,0.002081654,0.0016903927,0.00055603636,0.0017186898],"category_scores_gemma":[0.008588429,0.0004198292,0.0018915641,0.00082149665,0.002921849,0.0029318235,0.0014062806,0.0017516571,0.00031075327],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002546737,0.00012141597,0.0031221136,0.00017120845,0.00012594573,0.00061613496,0.00092571357,0.47810638,0.022686226,0.44932735,0.00047114503,0.04407167],"study_design_scores_gemma":[0.000012625801,0.000030225941,0.00010156147,0.000012965546,0.000020872681,0.000047164165,0.000043793203,0.8828975,0.00601644,0.11006525,0.00073637813,0.00001526519],"about_ca_topic_score_codex":0.0029266109,"about_ca_topic_score_gemma":0.002354851,"teacher_disagreement_score":0.0029266109,"about_ca_system_score_codex":0.0014865184,"about_ca_system_score_gemma":0.0015466617,"threshold_uncertainty_score":0.015437186},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017827984,0.0013648933,0.9402398,0.0010718342,0.0004684295,0.00011416886,0.00021368175,0.0017754221,0.036923837],"genre_scores_gemma":[0.60104346,0.0025676878,0.36227977,0.0007124326,0.00029115035,0.00034265316,0.0005134805,0.0006443186,0.031604998],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994018,0.000117759184,0.000049894006,0.00014548171,0.00016504413,0.00012001766],"domain_scores_gemma":[0.9996026,0.0001738574,0.00004634913,0.00010536893,0.00004938396,0.000022506749],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010876294,0.0009661388,0.00048258586,0.00051677175,0.0004607223,0.0021733267,0.0019357344,0.0011531689,0.0053619915],"category_scores_gemma":[0.0017078894,0.0005937642,0.0016692287,0.00041110205,0.0024904427,0.0027597162,0.0022553501,0.0021946607,0.0012726227],"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.00008490635,0.00003798819,0.00017106648,0.00020352402,0.000032305343,0.000306018,0.0002056211,0.017501084,0.012684268,0.945679,0.0013187885,0.021775333],"study_design_scores_gemma":[0.00010888773,0.00008261667,0.00021216231,0.00017408891,0.000104955856,0.0004395971,0.0000668855,0.053327847,0.026910044,0.86510897,0.05340709,0.00005676255],"about_ca_topic_score_codex":0.0011961015,"about_ca_topic_score_gemma":0.00077406503,"teacher_disagreement_score":0.0053619915,"about_ca_system_score_codex":0.0008895916,"about_ca_system_score_gemma":0.00094025244,"threshold_uncertainty_score":0.01793772},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01196416,0.00022699623,0.97917914,0.00024328164,0.000074452306,0.00010245104,0.00015905926,0.0010516378,0.0069987276],"genre_scores_gemma":[0.35178998,0.00051649974,0.63374174,0.00023499796,0.00019722899,0.00025686444,0.0009223388,0.0007271231,0.0116132125],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99359363,0.0014342364,0.0007694076,0.0012232643,0.002378957,0.00060051645],"domain_scores_gemma":[0.97746253,0.013478295,0.00096147624,0.005307705,0.0023189106,0.00047111616],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0063241376,0.0008271387,0.0011464205,0.0016978541,0.002039278,0.0025683225,0.002932695,0.001486282,0.008184871],"category_scores_gemma":[0.028682,0.0013213985,0.0032840518,0.002060188,0.0051039015,0.009161494,0.0072589386,0.004896634,0.0015438102],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024828484,0.00006884437,0.0010600559,0.0003702041,0.0000648087,0.00027461452,0.0012753772,0.018715989,0.0056733023,0.88873833,0.0022744222,0.08123576],"study_design_scores_gemma":[0.00004498771,0.00004083311,0.00026599984,0.000058796646,0.00006800202,0.00015071734,0.00018682863,0.06699804,0.0063945344,0.9166325,0.009124459,0.000034331842],"about_ca_topic_score_codex":0.0035037666,"about_ca_topic_score_gemma":0.005243391,"teacher_disagreement_score":0.008184871,"about_ca_system_score_codex":0.0016094283,"about_ca_system_score_gemma":0.0021572278,"threshold_uncertainty_score":0.033445656},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007236557,0.000030832412,0.9970829,0.00007825968,0.000024257732,0.000052620293,0.00003534852,0.00065734447,0.0013148396],"genre_scores_gemma":[0.059950374,0.00029945554,0.9347257,0.00014262312,0.000069843125,0.00046084527,0.0003046639,0.0013675891,0.0026788125],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99360317,0.0024854955,0.000635737,0.0008337449,0.002035253,0.00040658095],"domain_scores_gemma":[0.9930884,0.002329908,0.00043659372,0.0032022432,0.00078228733,0.00016057945],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006142568,0.001363861,0.001108188,0.0017305813,0.0012659741,0.005235652,0.0036839184,0.0012984816,0.0046289316],"category_scores_gemma":[0.0114611825,0.0015620199,0.0040715085,0.00138673,0.0039111977,0.009976522,0.004702162,0.003951344,0.0013567628],"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.000048944992,0.0000605932,0.00028582913,0.00016298125,0.00007037131,0.00020137554,0.00070399937,0.06320033,0.0037109891,0.8923452,0.0017458968,0.03746346],"study_design_scores_gemma":[0.000044355897,0.00007421679,0.00008145555,0.00016001698,0.00008936447,0.00023616127,0.0001881405,0.28678203,0.013144164,0.6400256,0.059099406,0.0000751498],"about_ca_topic_score_codex":0.0026815836,"about_ca_topic_score_gemma":0.0027386176,"teacher_disagreement_score":0.006142568,"about_ca_system_score_codex":0.0023350448,"about_ca_system_score_gemma":0.004629195,"threshold_uncertainty_score":0.032485425},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009220592,0.00006472232,0.98722816,0.000036684636,0.000030739327,0.000111287016,0.000060644816,0.0021024118,0.0011447939],"genre_scores_gemma":[0.28294772,0.00013228679,0.71367466,0.00009562414,0.000042495365,0.0005071153,0.00047633165,0.00028362614,0.0018401091],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99850535,0.00032298913,0.00010327518,0.00026271204,0.0007038945,0.000101691694],"domain_scores_gemma":[0.99684757,0.0018042562,0.0001877736,0.00051741913,0.000565781,0.000077259196],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008424745,0.0008095807,0.0005655597,0.001241685,0.00034628267,0.0005895397,0.0022481903,0.0005348139,0.0022218102],"category_scores_gemma":[0.004977898,0.00039112067,0.0010453839,0.0006095233,0.00066066685,0.0010560338,0.0010067774,0.00087657914,0.00035791233],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008058046,0.00043616237,0.0063835527,0.0006772606,0.0001919908,0.0013546329,0.00055977714,0.123470224,0.12271058,0.06942469,0.004129961,0.6698554],"study_design_scores_gemma":[0.00014318519,0.00054297515,0.00093097636,0.000051509018,0.00018696571,0.0009503454,0.000055713448,0.90252656,0.059048023,0.023948228,0.011552408,0.000063058615],"about_ca_topic_score_codex":0.0016042877,"about_ca_topic_score_gemma":0.0016449938,"teacher_disagreement_score":0.0022481903,"about_ca_system_score_codex":0.00046328784,"about_ca_system_score_gemma":0.0009887367,"threshold_uncertainty_score":0.007432759},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030454613,0.0018221821,0.81135356,0.012691473,0.0012197118,0.00021935099,0.0018020546,0.0024090384,0.1380281],"genre_scores_gemma":[0.64303166,0.0029998391,0.28913835,0.0038526687,0.0007780152,0.00054209266,0.002091395,0.00052083394,0.057045035],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979944,0.00038706584,0.00015824729,0.00062726147,0.0006480779,0.00018495727],"domain_scores_gemma":[0.99597126,0.0016111098,0.00030714573,0.0010490278,0.00083947874,0.00022188885],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018816906,0.00041185025,0.00030798608,0.00070565304,0.0011415923,0.0029608153,0.0009614913,0.0016354697,0.010144719],"category_scores_gemma":[0.0061611156,0.00040477907,0.0007278999,0.0007399699,0.0039820885,0.0065718475,0.0014703072,0.0026089277,0.002502276],"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.000014069547,0.000004811005,0.0001375932,0.00004540073,0.000004713194,0.00007026246,0.0001388722,0.0016392593,0.000946275,0.9883022,0.002881247,0.005815283],"study_design_scores_gemma":[0.000019188496,0.000020032043,0.0001633209,0.000043845816,0.00000988495,0.00014522973,0.00008714727,0.00994772,0.0023333866,0.90962064,0.07759458,0.000015101049],"about_ca_topic_score_codex":0.0019018586,"about_ca_topic_score_gemma":0.0017054464,"teacher_disagreement_score":0.010144719,"about_ca_system_score_codex":0.0015796279,"about_ca_system_score_gemma":0.0015526725,"threshold_uncertainty_score":0.033937454},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013151936,0.00100975,0.98974437,0.0007111948,0.00013863639,0.000062536434,0.00009853761,0.0002018098,0.006718079],"genre_scores_gemma":[0.11068284,0.0022833138,0.8745837,0.00064314087,0.0003884379,0.00066706544,0.00053236244,0.0003188421,0.009900265],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99832207,0.00083870656,0.00008491884,0.00023325649,0.00040733104,0.000113654336],"domain_scores_gemma":[0.99750817,0.0019449424,0.00017892462,0.000110079825,0.00016291645,0.00009487465],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026158267,0.0014635029,0.0007577647,0.00061910064,0.00062863005,0.0023059258,0.001311824,0.0012314469,0.008590264],"category_scores_gemma":[0.006097903,0.0008544547,0.0012633295,0.0017131837,0.0016068913,0.0020424663,0.0014488796,0.003152221,0.0013827974],"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.00015624387,0.000098290424,0.00025448453,0.0004653255,0.000093979375,0.0001724595,0.00019198284,0.3800641,0.0014474617,0.51824677,0.011454972,0.08735392],"study_design_scores_gemma":[0.000047431426,0.000050827417,0.00005641513,0.00007709342,0.000024548735,0.00004202929,0.000023111292,0.732271,0.0007567715,0.25164506,0.014984648,0.000021131033],"about_ca_topic_score_codex":0.0051035723,"about_ca_topic_score_gemma":0.0056895125,"teacher_disagreement_score":0.008590264,"about_ca_system_score_codex":0.0020658427,"about_ca_system_score_gemma":0.0025898619,"threshold_uncertainty_score":0.028737247},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28027946,0.0004575202,0.59896785,0.0005415874,0.00023849262,0.00038108503,0.0005404402,0.0010182203,0.11757532],"genre_scores_gemma":[0.8659677,0.00035722065,0.09546255,0.00029494957,0.00003290097,0.0003870153,0.0006667478,0.0005043613,0.036326572],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997905,0.0005162668,0.00015786594,0.00045213892,0.0005812647,0.00038746808],"domain_scores_gemma":[0.99678975,0.0011153904,0.00030957282,0.00083408365,0.0006288553,0.00032237454],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009884326,0.00059937703,0.0007551663,0.0020348518,0.0025303601,0.0036539983,0.0015691073,0.0016631276,0.01074563],"category_scores_gemma":[0.0081034945,0.00093433383,0.0011955514,0.0016882883,0.0034454311,0.004934149,0.0032612262,0.00211947,0.0011408813],"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.000070649265,0.000018795037,0.00048708144,0.00004994489,0.0000097784405,0.00027661573,0.00049939624,0.0030230153,0.0011692842,0.9848245,0.00055714604,0.009013809],"study_design_scores_gemma":[0.000016842221,0.000019091784,0.00018581554,0.000056548524,0.000018838826,0.00022730908,0.00034849904,0.013944908,0.0035783665,0.9717307,0.009852237,0.000020944259],"about_ca_topic_score_codex":0.002661238,"about_ca_topic_score_gemma":0.0024457194,"teacher_disagreement_score":0.01074563,"about_ca_system_score_codex":0.0016827167,"about_ca_system_score_gemma":0.0012063214,"threshold_uncertainty_score":0.03594768},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025870964,0.00015849504,0.96779245,0.0001257932,0.00004000055,0.00008135665,0.0002369352,0.0013980457,0.0042959307],"genre_scores_gemma":[0.699054,0.00041512615,0.29435155,0.00020778895,0.00006398492,0.00021077653,0.0008909215,0.00023721262,0.004568627],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99840087,0.0004012163,0.00009532022,0.00022285967,0.0007060192,0.0001737342],"domain_scores_gemma":[0.9973073,0.0015433902,0.0002587321,0.00044579964,0.00040806574,0.000036829522],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001738669,0.0005242342,0.00024981017,0.0005154705,0.00043954578,0.0011339907,0.0011669763,0.00055765704,0.002516525],"category_scores_gemma":[0.0045652273,0.00032024697,0.000930587,0.00026642124,0.0015063651,0.0013309593,0.0007379548,0.00091765873,0.00049132056],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00044302014,0.00027624154,0.0021109567,0.0010279699,0.00012408319,0.0011582057,0.00064006733,0.25912738,0.11477195,0.506728,0.002999951,0.11059225],"study_design_scores_gemma":[0.00015522035,0.00032477747,0.0008019545,0.00016464792,0.00017223292,0.0005734268,0.000096404416,0.67275095,0.18119101,0.12120151,0.022507971,0.00005996937],"about_ca_topic_score_codex":0.0031255675,"about_ca_topic_score_gemma":0.0015623352,"teacher_disagreement_score":0.0031255675,"about_ca_system_score_codex":0.0009213678,"about_ca_system_score_gemma":0.0015658239,"threshold_uncertainty_score":0.009195089},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004915932,0.00020536126,0.9913799,0.000048395123,0.000026570184,0.0000338938,0.000044318895,0.0010282552,0.0023172838],"genre_scores_gemma":[0.12338947,0.0004503656,0.87216985,0.000076583055,0.000023976181,0.00014461364,0.00023307728,0.00024501834,0.0032669595],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99938715,0.00011334921,0.000050972376,0.00014094744,0.00024655342,0.00006091032],"domain_scores_gemma":[0.9994023,0.0002987664,0.000055438104,0.00015559273,0.000074392956,0.0000135830105],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006254394,0.0007635029,0.0004812475,0.0007721128,0.00049953145,0.0011711105,0.0009889625,0.00072952453,0.004818692],"category_scores_gemma":[0.0015705976,0.00053871557,0.0009290746,0.0006072246,0.0009710662,0.0013050615,0.0007618995,0.0011317488,0.0012797859],"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.00015159002,0.000074112875,0.00048904563,0.00080050604,0.00012767327,0.0003356286,0.00045170053,0.10204163,0.14746016,0.38001457,0.0038079612,0.36424533],"study_design_scores_gemma":[0.00016245675,0.00037393856,0.00046506905,0.00019918269,0.00016266697,0.00087131833,0.00009776988,0.35515326,0.2677529,0.27550793,0.09915655,0.00009693902],"about_ca_topic_score_codex":0.00085863343,"about_ca_topic_score_gemma":0.0013925093,"teacher_disagreement_score":0.004818692,"about_ca_system_score_codex":0.00063798693,"about_ca_system_score_gemma":0.0007214397,"threshold_uncertainty_score":0.016120076},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0064469827,0.00004730502,0.9888764,0.00015543443,0.00005889058,0.0001600305,0.000115768344,0.0025442466,0.001594981],"genre_scores_gemma":[0.3206113,0.00023534808,0.6744088,0.0003325882,0.00007679809,0.00087540253,0.0005154537,0.00072529376,0.0022190951],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9873568,0.0045906543,0.0010212642,0.0011631158,0.005200858,0.0006671996],"domain_scores_gemma":[0.97806555,0.012286902,0.0018911145,0.004034224,0.0035079387,0.00021421483],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008658233,0.001046159,0.00057338976,0.0010931799,0.0010996484,0.002364804,0.0015686324,0.0013112605,0.0046847565],"category_scores_gemma":[0.024186218,0.0007873305,0.001574499,0.00046382978,0.00311574,0.0035207258,0.0019691864,0.001968182,0.0014769519],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006099164,0.00026903293,0.004185317,0.001768846,0.00018826089,0.0016555191,0.0018041617,0.16871819,0.07188313,0.6212593,0.0056578,0.12200051],"study_design_scores_gemma":[0.00021678398,0.00033222354,0.00048554468,0.00033587453,0.00014539358,0.000364217,0.00013420613,0.7465887,0.110647306,0.10380197,0.036837563,0.000110315275],"about_ca_topic_score_codex":0.0031877505,"about_ca_topic_score_gemma":0.003280171,"teacher_disagreement_score":0.008658233,"about_ca_system_score_codex":0.0017040506,"about_ca_system_score_gemma":0.004084402,"threshold_uncertainty_score":0.04578966},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022736152,0.040496066,0.47646144,0.00704488,0.0024822503,0.00022333136,0.00030217454,0.0015378975,0.46917835],"genre_scores_gemma":[0.14408606,0.045308515,0.32284695,0.0029253897,0.002281765,0.00080014265,0.0010924067,0.0015936011,0.4790651],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9961708,0.0011338489,0.00018707685,0.00046416032,0.0018687509,0.00017544419],"domain_scores_gemma":[0.99428374,0.0038717312,0.00012051984,0.0009849769,0.00067248655,0.0000664519],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037022438,0.0012803943,0.0010814916,0.0016794133,0.0013895552,0.0052484274,0.0020940437,0.0021600246,0.018388107],"category_scores_gemma":[0.010519354,0.0012185061,0.00087358616,0.0015032466,0.006619976,0.0076300907,0.0018684026,0.0036719646,0.0075675985],"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.000015316467,0.00002689683,0.00009594875,0.0002451385,0.000011176823,0.000039318224,0.00027173362,0.0015504754,0.0003358151,0.8372768,0.037563942,0.12256737],"study_design_scores_gemma":[0.000009985325,0.0000138163305,0.00010846097,0.0003253603,0.000010769192,0.00012773248,0.00008395326,0.0034564754,0.0008873035,0.77567047,0.2192862,0.000019488294],"about_ca_topic_score_codex":0.00279655,"about_ca_topic_score_gemma":0.0027069063,"teacher_disagreement_score":0.018388107,"about_ca_system_score_codex":0.0028581046,"about_ca_system_score_gemma":0.0033820583,"threshold_uncertainty_score":0.061514378},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032575415,0.00005956023,0.99212885,0.00009010642,0.000036913814,0.00013875769,0.000113077636,0.0022005124,0.0019747138],"genre_scores_gemma":[0.13836968,0.00018080171,0.8578419,0.00015511332,0.00003440714,0.000386709,0.0007502096,0.00035685318,0.0019243388],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997077,0.0013113361,0.00015854482,0.00027954165,0.0010118483,0.0001616845],"domain_scores_gemma":[0.9970848,0.0014952155,0.00012260678,0.0009189766,0.0003494198,0.000028868511],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019641856,0.00094761356,0.0005772207,0.0012044746,0.0007149803,0.0012675257,0.0018412907,0.0007596094,0.0062299008],"category_scores_gemma":[0.0062227813,0.0005755973,0.0015636524,0.0010427013,0.0009196133,0.0018906181,0.0014255178,0.0020588436,0.0014745811],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026166713,0.00061387976,0.0018003724,0.0007299443,0.00024049853,0.0006800028,0.00030628534,0.19666263,0.051720563,0.33930156,0.008366396,0.39931625],"study_design_scores_gemma":[0.00009713311,0.00011970581,0.00027174657,0.00007424321,0.00008532027,0.0003065354,0.000043886037,0.875162,0.040876154,0.07082272,0.012106546,0.00003404065],"about_ca_topic_score_codex":0.0023528524,"about_ca_topic_score_gemma":0.0038608997,"teacher_disagreement_score":0.0062299008,"about_ca_system_score_codex":0.0009569356,"about_ca_system_score_gemma":0.0022589152,"threshold_uncertainty_score":0.020841122},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011790126,0.000024596644,0.9903549,0.00027964692,0.00008820317,0.0018370877,0.0007946367,0.004086702,0.0013552646],"genre_scores_gemma":[0.010214105,0.00006316719,0.9775608,0.00014732864,0.000025220204,0.008601574,0.0010621374,0.0010211334,0.0013045495],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9603637,0.027980749,0.0044645937,0.002071417,0.00450401,0.0006155084],"domain_scores_gemma":[0.8653806,0.09800536,0.005237637,0.016375339,0.014111046,0.0008901541],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.045462705,0.00220731,0.0009262507,0.0045205993,0.0015619061,0.005553484,0.0035637515,0.0014646142,0.016795872],"category_scores_gemma":[0.12016563,0.0013168262,0.0012593584,0.003568189,0.0028775774,0.0052981996,0.0048188134,0.004081536,0.0056714136],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00050525065,0.00041680297,0.0017435296,0.0039200773,0.00016302062,0.0009661887,0.03702573,0.018380484,0.018805835,0.2603054,0.08831613,0.5694516],"study_design_scores_gemma":[0.00046865863,0.0004432379,0.0013071591,0.003005808,0.00011114371,0.0012208157,0.0077172313,0.16511258,0.03807845,0.22397338,0.5580328,0.00052863336],"about_ca_topic_score_codex":0.0024298169,"about_ca_topic_score_gemma":0.002119945,"teacher_disagreement_score":0.045462705,"about_ca_system_score_codex":0.002582149,"about_ca_system_score_gemma":0.0075533725,"threshold_uncertainty_score":0.24043268},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0125560695,0.0000302206,0.9738897,0.00006164932,0.000026131262,0.00015441129,0.00023280947,0.011136136,0.0019128527],"genre_scores_gemma":[0.28850827,0.00008293362,0.7048361,0.00010380622,0.00001699233,0.0006385419,0.0011798029,0.0020635554,0.0025700706],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984578,0.00054709526,0.000112929636,0.00025992782,0.0005049859,0.00011717073],"domain_scores_gemma":[0.9965874,0.0021189274,0.00022667482,0.0005836453,0.00043174866,0.000051672832],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014371079,0.0011296845,0.00059500313,0.0009232945,0.00042517815,0.00089057244,0.0008470668,0.0008503534,0.004205583],"category_scores_gemma":[0.0059138495,0.0004543967,0.00096726243,0.0003805123,0.00096869183,0.00076722587,0.0009426617,0.00097005593,0.0012060468],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000809726,0.00028731974,0.0031490738,0.0008683697,0.00012223123,0.0013366694,0.0015844727,0.25665423,0.19325316,0.17549257,0.011474418,0.3549677],"study_design_scores_gemma":[0.00011084728,0.00013117398,0.0003873018,0.00005796563,0.000047510286,0.0002632285,0.0000618081,0.82088083,0.13238132,0.026954392,0.018674305,0.00004936718],"about_ca_topic_score_codex":0.0013544668,"about_ca_topic_score_gemma":0.0013905307,"teacher_disagreement_score":0.004205583,"about_ca_system_score_codex":0.0009064361,"about_ca_system_score_gemma":0.0009980581,"threshold_uncertainty_score":0.01406908},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004238126,0.00043100983,0.97959316,0.00019807051,0.00019044313,0.000076496224,0.0007220655,0.0018977548,0.0126529],"genre_scores_gemma":[0.155331,0.0011178488,0.82184523,0.0002871681,0.000139306,0.00028546999,0.0020033824,0.0004332263,0.018557308],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999496,0.000109578585,0.00006125361,0.00011313572,0.00016141009,0.00005864827],"domain_scores_gemma":[0.9994122,0.00019804953,0.000057914276,0.00015677918,0.00015494836,0.000020065934],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006071528,0.00056715513,0.0004200251,0.0011706459,0.0004922612,0.0018928447,0.0009473658,0.00066821085,0.010901073],"category_scores_gemma":[0.0015882091,0.00023387678,0.0007976864,0.00092478323,0.0006720466,0.0025223454,0.00087001425,0.00097083993,0.0018493773],"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.00016542895,0.000054978125,0.00049225223,0.0003531722,0.00003288716,0.0008758272,0.00033748022,0.057021797,0.008859429,0.6812957,0.008952687,0.2415583],"study_design_scores_gemma":[0.00005182974,0.00006465749,0.00021102079,0.00017578223,0.00007021603,0.0009678028,0.00010357027,0.27635726,0.012596999,0.35879475,0.3505563,0.000049811617],"about_ca_topic_score_codex":0.0017628756,"about_ca_topic_score_gemma":0.0020035498,"teacher_disagreement_score":0.010901073,"about_ca_system_score_codex":0.000614421,"about_ca_system_score_gemma":0.000736783,"threshold_uncertainty_score":0.03646767},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07731169,0.00014401658,0.9123975,0.00027423014,0.000042736458,0.000112435475,0.00018681139,0.0055355295,0.003994984],"genre_scores_gemma":[0.8952396,0.000077090896,0.101902805,0.00012884146,0.000031615447,0.00015933227,0.000269997,0.00019713015,0.0019936764],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967938,0.0008207854,0.00020745264,0.00077210984,0.0010429986,0.0003628716],"domain_scores_gemma":[0.9932967,0.0026277627,0.0007090255,0.0022950836,0.0008667463,0.00020472523],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024656772,0.00047668876,0.0006743531,0.0005713563,0.0006666607,0.001424005,0.0020721585,0.0006166709,0.0020977806],"category_scores_gemma":[0.008415205,0.00044130217,0.00078700867,0.00045920914,0.0012115055,0.0020832513,0.0022532297,0.0011814395,0.00045037526],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012818441,0.00023684202,0.007223605,0.00049444,0.00018946032,0.0012373445,0.0008438933,0.5140866,0.09555169,0.2459769,0.0039892267,0.12888817],"study_design_scores_gemma":[0.00009961051,0.000091691574,0.00040361885,0.000021445327,0.000053062005,0.00012591516,0.0000409174,0.9184502,0.021822494,0.05530057,0.0035684027,0.000022072543],"about_ca_topic_score_codex":0.0018035476,"about_ca_topic_score_gemma":0.002065195,"teacher_disagreement_score":0.0024656772,"about_ca_system_score_codex":0.0014037163,"about_ca_system_score_gemma":0.0019807026,"threshold_uncertainty_score":0.013039947},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012750102,0.000103629776,0.9848304,0.00008986233,0.000049081893,0.000055893564,0.000048325,0.001244691,0.0008279932],"genre_scores_gemma":[0.27058345,0.00051779114,0.7265756,0.00012276026,0.00005924472,0.0002446265,0.00025290827,0.0002668929,0.0013767509],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99236405,0.0028571847,0.0010771637,0.0006537573,0.0025064773,0.00054141175],"domain_scores_gemma":[0.9810121,0.013760386,0.0015550844,0.0026150662,0.000902756,0.00015476212],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00883601,0.0008171452,0.0011365202,0.0014921025,0.0011352083,0.0043917317,0.0026102965,0.0017914821,0.0018551268],"category_scores_gemma":[0.017787237,0.0011701599,0.002244779,0.0015345607,0.004866136,0.007063277,0.0016364324,0.0022196285,0.0005849256],"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.00030746995,0.00014267486,0.0019404992,0.00057504664,0.00013171972,0.0004668825,0.00064577453,0.12925209,0.02210979,0.7771954,0.000870471,0.066362254],"study_design_scores_gemma":[0.00021770035,0.00016524165,0.00030054353,0.000115941926,0.00010875389,0.0002903635,0.00011787516,0.42827296,0.06313019,0.49843097,0.008777764,0.000071667404],"about_ca_topic_score_codex":0.0028078705,"about_ca_topic_score_gemma":0.0035246608,"teacher_disagreement_score":0.00883601,"about_ca_system_score_codex":0.0019843027,"about_ca_system_score_gemma":0.0030817213,"threshold_uncertainty_score":0.046729863},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04206111,0.000080390055,0.9491463,0.00017880632,0.00003040732,0.00021317309,0.0003648501,0.004561484,0.003363496],"genre_scores_gemma":[0.6268688,0.000102005775,0.36897367,0.0000928148,0.00003627072,0.00031153558,0.0009397306,0.00036897935,0.0023061153],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99507785,0.0014415049,0.0003978261,0.00074586604,0.0019019757,0.00043489222],"domain_scores_gemma":[0.99222386,0.0048938477,0.00053766783,0.0016478434,0.00059097767,0.00010578689],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023980937,0.0006702202,0.00082924584,0.0008546583,0.00054413546,0.0014232729,0.0016739474,0.00075775996,0.0044439365],"category_scores_gemma":[0.011268618,0.00059928105,0.0021325052,0.00080074987,0.0021122391,0.002636379,0.002070672,0.0015742892,0.0007723685],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006710032,0.00019802405,0.0035718528,0.0006743044,0.00023827468,0.00083604763,0.0004608401,0.5307418,0.07105639,0.2424539,0.0024873065,0.14661032],"study_design_scores_gemma":[0.000055016633,0.000054123764,0.00030854106,0.000023913717,0.00003859116,0.000085366126,0.000030975465,0.9102462,0.03346337,0.052720264,0.002955728,0.000017830209],"about_ca_topic_score_codex":0.003472604,"about_ca_topic_score_gemma":0.0045134313,"teacher_disagreement_score":0.0044439365,"about_ca_system_score_codex":0.0020678195,"about_ca_system_score_gemma":0.0022288489,"threshold_uncertainty_score":0.015003145},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016841171,0.00014103374,0.98740095,0.00006348722,0.000042103347,0.000080161735,0.000084820414,0.0018214842,0.008681863],"genre_scores_gemma":[0.19774084,0.0011744946,0.77768564,0.00026208154,0.00010450311,0.0007717781,0.0011955774,0.001591939,0.019473216],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.995223,0.0013250025,0.00029462908,0.0006933828,0.0021676938,0.00029638226],"domain_scores_gemma":[0.99747235,0.0011281696,0.00014963224,0.0009230799,0.0003019649,0.000024937515],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002329034,0.001439986,0.00084824406,0.0017430766,0.0007314859,0.002311467,0.0016876608,0.0007356114,0.009808487],"category_scores_gemma":[0.005566437,0.0013442725,0.0021727176,0.0012586723,0.002359481,0.004231531,0.0023851534,0.0023279318,0.0030495625],"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.00012369022,0.0001095027,0.00044882766,0.0005704419,0.000094528754,0.00023363826,0.00037348963,0.060715847,0.010715742,0.6949022,0.005884984,0.22582722],"study_design_scores_gemma":[0.000088350265,0.00010963014,0.00027724318,0.00036284307,0.00014425504,0.0002181893,0.0000810277,0.28658593,0.063505456,0.5902638,0.05829915,0.00006417929],"about_ca_topic_score_codex":0.0015395742,"about_ca_topic_score_gemma":0.00125667,"teacher_disagreement_score":0.009808487,"about_ca_system_score_codex":0.00142747,"about_ca_system_score_gemma":0.0017146562,"threshold_uncertainty_score":0.032812655},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005087906,0.00025244243,0.9863744,0.00031319115,0.000078113946,0.0000427286,0.00006224153,0.0005298892,0.0072591878],"genre_scores_gemma":[0.31913805,0.00083130755,0.66874486,0.00040979608,0.00020394618,0.0001937522,0.00053620274,0.00059700425,0.009345088],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9960252,0.0011373428,0.00036295835,0.0009171141,0.0011883872,0.00036889073],"domain_scores_gemma":[0.9947837,0.0036402715,0.00018717015,0.00096560037,0.00034437733,0.000078893434],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034236882,0.0011198112,0.0014487823,0.0017457437,0.0012995785,0.0055072997,0.0045917183,0.0016379482,0.007367186],"category_scores_gemma":[0.011793348,0.0012339079,0.004231055,0.001598521,0.0051713483,0.012867641,0.0050994917,0.005093986,0.0014972612],"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.00007237112,0.000044466677,0.0001999708,0.0001871835,0.00004715197,0.00014407052,0.00030263764,0.0136609385,0.002140424,0.9303642,0.0013444631,0.051492173],"study_design_scores_gemma":[0.00001647087,0.00002330898,0.000039253395,0.00006851295,0.00004228862,0.000109381326,0.000050867715,0.06162952,0.0054474096,0.92764455,0.0049036103,0.000024730189],"about_ca_topic_score_codex":0.0014703878,"about_ca_topic_score_gemma":0.0014615101,"teacher_disagreement_score":0.007367186,"about_ca_system_score_codex":0.0023976797,"about_ca_system_score_gemma":0.001973206,"threshold_uncertainty_score":0.024645746},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03041707,0.00022967956,0.9656726,0.00019961034,0.000017991677,0.00015167605,0.00007639841,0.00093844923,0.0022964398],"genre_scores_gemma":[0.41563275,0.00014842741,0.5820345,0.00014105094,0.000025091067,0.00029220135,0.00027659792,0.0002690167,0.0011804055],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989635,0.0005119545,0.000048849426,0.00010666939,0.00028140866,0.000087686625],"domain_scores_gemma":[0.9965443,0.0025386002,0.00023585284,0.00036076107,0.00022133031,0.00009920864],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015134232,0.0005501277,0.00077772833,0.0012441677,0.00051230454,0.00060456817,0.0013616761,0.00084755936,0.0037119777],"category_scores_gemma":[0.006930173,0.0004110638,0.00088253483,0.0008857707,0.0011695096,0.0013871025,0.0015357463,0.0012708827,0.0004957318],"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.0003855699,0.00024378774,0.0025483386,0.0004639493,0.00009927841,0.00019022854,0.0004057133,0.56821316,0.01857003,0.11853874,0.0038343524,0.28650686],"study_design_scores_gemma":[0.00007135182,0.00010153088,0.00019801376,0.000019856772,0.000025556683,0.00004466326,0.000043558706,0.9572729,0.003506992,0.037043516,0.001656528,0.000015599828],"about_ca_topic_score_codex":0.0016510795,"about_ca_topic_score_gemma":0.005193084,"teacher_disagreement_score":0.0037119777,"about_ca_system_score_codex":0.0010747561,"about_ca_system_score_gemma":0.0017230428,"threshold_uncertainty_score":0.012417793},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022859305,0.0004908246,0.95156467,0.00044452623,0.000075662225,0.000096325326,0.00011711009,0.001561479,0.022790156],"genre_scores_gemma":[0.32555294,0.0007439291,0.6343542,0.00018392739,0.000028719107,0.00014350149,0.00026762733,0.00079328264,0.037931908],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990619,0.00032000174,0.00006713667,0.00013812662,0.00034258974,0.00007018686],"domain_scores_gemma":[0.9979036,0.001134503,0.000074852505,0.0006091652,0.00024110982,0.000036784266],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014541529,0.0006637065,0.00052114826,0.0005263378,0.0006613132,0.0026102033,0.0016014201,0.0016336272,0.007989997],"category_scores_gemma":[0.004094275,0.0005842123,0.0010332409,0.0009287419,0.0013745249,0.003144771,0.0011068755,0.0015612072,0.0018154684],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020369899,0.00021028098,0.0016577786,0.0005123403,0.00006198058,0.00092979433,0.0017280515,0.056872573,0.02207244,0.77249175,0.0042280555,0.13903132],"study_design_scores_gemma":[0.000053991807,0.00019920287,0.0010114692,0.0003353008,0.00013149955,0.0008013985,0.00046526338,0.44253996,0.054110836,0.41403753,0.08623103,0.00008244623],"about_ca_topic_score_codex":0.0026355567,"about_ca_topic_score_gemma":0.0026831909,"teacher_disagreement_score":0.007989997,"about_ca_system_score_codex":0.0009493523,"about_ca_system_score_gemma":0.0010990462,"threshold_uncertainty_score":0.026729226},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1460356,0.00025394684,0.8390635,0.0002449666,0.00007837879,0.00018090164,0.0004666647,0.00401265,0.009663332],"genre_scores_gemma":[0.883942,0.00021530638,0.11222879,0.000057575555,0.000015452597,0.00021869216,0.00042809235,0.00027021056,0.0026238568],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99830747,0.0007696658,0.0000895272,0.000150175,0.00051765644,0.00016548183],"domain_scores_gemma":[0.9972379,0.0018286703,0.0001861029,0.00037846365,0.00030797836,0.00006085258],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018055667,0.000637262,0.0004985717,0.00063376443,0.00042265875,0.0008829164,0.0009485342,0.0006672118,0.0023128937],"category_scores_gemma":[0.0046982453,0.00038699305,0.0009769389,0.00026272182,0.0012663461,0.0006250824,0.0010069294,0.00072930276,0.00028453613],"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.00015037885,0.000052592022,0.0014930104,0.00013999108,0.000034166485,0.0001769007,0.00012224512,0.94818264,0.012430779,0.027827058,0.00037409115,0.009016135],"study_design_scores_gemma":[0.000027835082,0.00003481473,0.0002163159,0.000020447542,0.000010766961,0.00002470451,0.000013932221,0.9837002,0.01012764,0.0038790996,0.0019369372,0.0000072155854],"about_ca_topic_score_codex":0.0068542412,"about_ca_topic_score_gemma":0.0045082066,"teacher_disagreement_score":0.0068542412,"about_ca_system_score_codex":0.0011604046,"about_ca_system_score_gemma":0.0013473886,"threshold_uncertainty_score":0.013628662},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005003775,0.00014100193,0.98733085,0.00018384369,0.00008611248,0.00011936292,0.00010289041,0.00060831016,0.0064238743],"genre_scores_gemma":[0.34229904,0.00071853586,0.6438068,0.00040663534,0.00028627823,0.0009335819,0.00077722553,0.00041009457,0.010361836],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9960129,0.0010794158,0.00042882957,0.00069969695,0.0015179628,0.00026108342],"domain_scores_gemma":[0.99660206,0.0016023084,0.0003304829,0.0009064083,0.00046473648,0.00009394934],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020531837,0.00070810545,0.00046804914,0.00091389986,0.00059608475,0.0015459821,0.001310227,0.00086916576,0.002714198],"category_scores_gemma":[0.006454044,0.00044311897,0.0016393305,0.0008371614,0.0022374676,0.0033312568,0.0022030922,0.0033913124,0.0007440612],"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.000040063904,0.000090355694,0.00015994902,0.00009186502,0.000021799906,0.00031403275,0.0004772878,0.017674226,0.005556766,0.9333395,0.0011623608,0.041071914],"study_design_scores_gemma":[0.000042082112,0.00008269782,0.000110770765,0.00003735258,0.000029415898,0.00022410438,0.000059631908,0.06337533,0.009759307,0.89631045,0.029944986,0.00002389854],"about_ca_topic_score_codex":0.001043132,"about_ca_topic_score_gemma":0.0009158829,"teacher_disagreement_score":0.002714198,"about_ca_system_score_codex":0.0010409019,"about_ca_system_score_gemma":0.0013307921,"threshold_uncertainty_score":0.010858417},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05583769,0.0014788609,0.92532766,0.0011224041,0.00014691404,0.00030051632,0.0003642335,0.0033740122,0.0120476335],"genre_scores_gemma":[0.31958923,0.0005255864,0.6730819,0.0007547639,0.00009647089,0.0004772591,0.0010379454,0.00063035195,0.0038065168],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980939,0.0008693718,0.000096628835,0.00029803798,0.00041006808,0.000232],"domain_scores_gemma":[0.9939434,0.004654277,0.00028649007,0.0004954124,0.00042333102,0.00019700167],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029922056,0.0013145274,0.0011772678,0.0013970014,0.0006936719,0.0013565375,0.0023856142,0.0013678226,0.0059833294],"category_scores_gemma":[0.010811002,0.00070782244,0.0010737092,0.0017391971,0.0011289906,0.0023373463,0.0013395057,0.003482911,0.0012373038],"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.0005428503,0.00032987155,0.0020347803,0.00035732237,0.00010577227,0.0001288117,0.000203023,0.6389019,0.003938026,0.065804996,0.010446698,0.27720588],"study_design_scores_gemma":[0.00008838598,0.000067144894,0.00013071173,0.000031035215,0.000021663427,0.000027591317,0.000029899036,0.95799464,0.0011292063,0.03856017,0.0019095833,0.000009987663],"about_ca_topic_score_codex":0.0043523572,"about_ca_topic_score_gemma":0.008227794,"teacher_disagreement_score":0.0059833294,"about_ca_system_score_codex":0.0020294597,"about_ca_system_score_gemma":0.0030891441,"threshold_uncertainty_score":0.020016193},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011597448,0.00080816087,0.9689566,0.0006215658,0.00008625806,0.00017953153,0.0028514855,0.0016231416,0.013275862],"genre_scores_gemma":[0.2087249,0.0020778675,0.7672675,0.00090076536,0.00022666251,0.0007981176,0.008261285,0.0009780247,0.010764965],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9958644,0.00078461994,0.00044665983,0.0013615426,0.0011892699,0.00035355342],"domain_scores_gemma":[0.9950053,0.00191259,0.00058386574,0.0017075643,0.0006257082,0.00016508222],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018531115,0.001062445,0.00086220715,0.0025215645,0.0011781197,0.0034871786,0.001895587,0.0013534706,0.008430027],"category_scores_gemma":[0.006440732,0.0008514119,0.0018718329,0.0039962106,0.002973818,0.01150943,0.002977904,0.0032708552,0.002317276],"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.000046923546,0.000030007935,0.00046538876,0.00018694585,0.00002221639,0.00009884536,0.00029727496,0.01152995,0.0018911217,0.9465016,0.0037202684,0.03520952],"study_design_scores_gemma":[0.00001339156,0.000044830507,0.00026345588,0.00007887495,0.000023220797,0.00028531073,0.00012578462,0.025613338,0.002336444,0.9206735,0.050515622,0.00002624562],"about_ca_topic_score_codex":0.0022878328,"about_ca_topic_score_gemma":0.0020876334,"teacher_disagreement_score":0.008430027,"about_ca_system_score_codex":0.0015742651,"about_ca_system_score_gemma":0.001545874,"threshold_uncertainty_score":0.028201282},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005051892,0.000107482185,0.9913743,0.00023661701,0.000027018092,0.000049267157,0.00006709278,0.00029249498,0.0027938068],"genre_scores_gemma":[0.36518934,0.00051217654,0.62480617,0.00031069253,0.00008894566,0.00045317598,0.00036423624,0.0005075555,0.0077677844],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99676776,0.001119159,0.00017008401,0.00056121004,0.000994659,0.00038714058],"domain_scores_gemma":[0.9901038,0.0067666206,0.00043271814,0.0011353733,0.001220046,0.0003414856],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030409864,0.0013560822,0.0016416063,0.0007704217,0.00090577395,0.0019966033,0.0018280057,0.001104424,0.0063126027],"category_scores_gemma":[0.01673712,0.0007473308,0.0018569008,0.0008524655,0.0028284935,0.0029601087,0.0030624631,0.0046359785,0.0017476853],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025314736,0.000109275104,0.00069506164,0.0002640107,0.00009086332,0.00011341626,0.00021263763,0.5360145,0.0022867243,0.38209844,0.0035103052,0.07435158],"study_design_scores_gemma":[0.000031580075,0.000024314542,0.000049689774,0.000017972825,0.000011421891,0.000019998879,0.000012616527,0.7724141,0.0010857157,0.2250459,0.0012729178,0.000013779535],"about_ca_topic_score_codex":0.0053768,"about_ca_topic_score_gemma":0.006102584,"teacher_disagreement_score":0.0063126027,"about_ca_system_score_codex":0.0020978216,"about_ca_system_score_gemma":0.0043438436,"threshold_uncertainty_score":0.021117806},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010979122,0.00007963412,0.99744797,0.000027464524,0.000020419342,0.0000118842545,0.000009293951,0.00007473232,0.0012307924],"genre_scores_gemma":[0.3581383,0.00088141236,0.63704973,0.000118702774,0.0001354039,0.00020721232,0.00013470376,0.00012055115,0.0032139814],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993868,0.00013934569,0.000049728376,0.00011005483,0.00026907015,0.000045019944],"domain_scores_gemma":[0.9994758,0.00029556744,0.000052484895,0.00007741297,0.000082642175,0.000016052069],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009592811,0.00067808194,0.00051198626,0.0007103643,0.00033354037,0.00083214603,0.0008626946,0.0004840827,0.0029091865],"category_scores_gemma":[0.0017283651,0.00032453766,0.0012664143,0.0004931655,0.0011101697,0.00086312986,0.0007570754,0.0017069125,0.00043026314],"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.000091599926,0.00005376374,0.0002255767,0.0002507186,0.000057453224,0.00015977169,0.00028160983,0.39426643,0.03210289,0.48127833,0.0008828885,0.09034891],"study_design_scores_gemma":[0.000024597543,0.00012702034,0.000103561004,0.000038688213,0.000038744114,0.000060838986,0.000022159722,0.8645432,0.009562152,0.11930866,0.0061463197,0.000024102304],"about_ca_topic_score_codex":0.0011855554,"about_ca_topic_score_gemma":0.0009111093,"teacher_disagreement_score":0.0029091865,"about_ca_system_score_codex":0.0008178564,"about_ca_system_score_gemma":0.00073262624,"threshold_uncertainty_score":0.009732187},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01166947,0.00018504521,0.98444796,0.0002582917,0.00002811381,0.00007271667,0.000060524737,0.00032148694,0.002956305],"genre_scores_gemma":[0.6023376,0.00028088884,0.3927191,0.00018024903,0.00004131664,0.00042887637,0.00019057035,0.00015894654,0.0036624665],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989416,0.00032780808,0.000054189557,0.00025063858,0.0002861042,0.00013964552],"domain_scores_gemma":[0.9969388,0.0024602076,0.00022087024,0.00010168226,0.00020254799,0.00007602892],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019753764,0.00095318013,0.00093718065,0.0005585483,0.00056689465,0.00097160396,0.0008920847,0.0008328735,0.002724441],"category_scores_gemma":[0.00543829,0.00058571633,0.0007097783,0.00041809122,0.0017375802,0.0011067652,0.0012503994,0.0014548857,0.00020386309],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000059520382,0.0000297963,0.00019215429,0.000080348946,0.000020389423,0.00008121502,0.000059322265,0.9184317,0.0011350518,0.066209175,0.00044800967,0.013253368],"study_design_scores_gemma":[0.00002362115,0.000014857308,0.000019990233,0.0000075170337,0.000005204445,0.00000695671,0.000006299685,0.97775877,0.0006435811,0.020920932,0.00058862363,0.0000036713864],"about_ca_topic_score_codex":0.0057138577,"about_ca_topic_score_gemma":0.0048547233,"teacher_disagreement_score":0.0057138577,"about_ca_system_score_codex":0.0019462485,"about_ca_system_score_gemma":0.002639946,"threshold_uncertainty_score":0.014121115},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0064872145,0.00055773166,0.9808967,0.0009386158,0.00013973203,0.000107500615,0.00019291112,0.00047264155,0.010206877],"genre_scores_gemma":[0.23068978,0.0014547538,0.7597437,0.0005998954,0.0002588557,0.0006704397,0.00067610573,0.00025723188,0.0056492286],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9955368,0.0015829366,0.0004493481,0.0006574171,0.001429071,0.000344492],"domain_scores_gemma":[0.9959591,0.0023773864,0.00026267362,0.00072226883,0.0005090476,0.00016951593],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005792333,0.00085914164,0.0007247601,0.0016330804,0.0020492256,0.003485986,0.0023355247,0.0017709555,0.0033746716],"category_scores_gemma":[0.006659875,0.0010504143,0.0025457055,0.0018374745,0.008384068,0.010748773,0.0040692794,0.0063692443,0.00097356923],"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.0000072968896,0.00000861961,0.000074282834,0.000030933756,0.000007433092,0.000091467096,0.00033926556,0.0019973118,0.00036885397,0.9927061,0.0004406898,0.003927726],"study_design_scores_gemma":[0.000015834152,0.000012630373,0.00006465983,0.0000268914,0.000015338968,0.000109832,0.0000792262,0.009960395,0.00072364556,0.9748635,0.0141113335,0.000016710552],"about_ca_topic_score_codex":0.0038107452,"about_ca_topic_score_gemma":0.00252734,"teacher_disagreement_score":0.005792333,"about_ca_system_score_codex":0.0016881644,"about_ca_system_score_gemma":0.0023909607,"threshold_uncertainty_score":0.030633152},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008062644,0.00013551867,0.9813417,0.0004124689,0.000047600795,0.00006294803,0.000057383746,0.000106556945,0.009773106],"genre_scores_gemma":[0.3034629,0.0005991642,0.68526596,0.000568697,0.00021998423,0.00048540818,0.0004129526,0.00024331105,0.008741624],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99538606,0.0021355643,0.0002669757,0.0006580508,0.0012793671,0.000274023],"domain_scores_gemma":[0.989183,0.008349336,0.0007403767,0.00090208,0.00064838823,0.0001767298],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005717918,0.00098324,0.00061398227,0.0007926887,0.000812016,0.0024322998,0.0015054984,0.00092826545,0.0065741516],"category_scores_gemma":[0.015536702,0.00072609476,0.0015266067,0.0008028287,0.00430336,0.0044073923,0.0024007212,0.0062504928,0.00091051625],"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.00004298746,0.000092591355,0.00013122626,0.00014794715,0.00002326163,0.00012927793,0.0003421559,0.036272127,0.0020248627,0.9321653,0.0012985987,0.02732974],"study_design_scores_gemma":[0.000026016987,0.000037192945,0.00005172167,0.000039319824,0.0000073898286,0.00009077799,0.00008772657,0.1128652,0.0028551747,0.8800831,0.0038354883,0.000020892161],"about_ca_topic_score_codex":0.00067303336,"about_ca_topic_score_gemma":0.0008821625,"teacher_disagreement_score":0.0065741516,"about_ca_system_score_codex":0.0010281835,"about_ca_system_score_gemma":0.0010818796,"threshold_uncertainty_score":0.030239582},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.071971714,0.0019437587,0.80361384,0.0029849058,0.0016353962,0.00047966588,0.0012448517,0.08270093,0.033424877],"genre_scores_gemma":[0.2887058,0.0007863188,0.68501425,0.00074045965,0.0001382213,0.0007309047,0.002911993,0.0057074362,0.015264611],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9984617,0.0003177192,0.00011664039,0.00026868063,0.0005794222,0.00025585075],"domain_scores_gemma":[0.9967849,0.0007213279,0.00017799408,0.0008381111,0.0012287193,0.00024898513],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012653527,0.0014074476,0.0007393587,0.0009070785,0.0009271963,0.0020990965,0.0032673017,0.00094874564,0.02713077],"category_scores_gemma":[0.0068324655,0.0007397961,0.00094348664,0.0012117658,0.0006071401,0.003290994,0.0013527748,0.0020402875,0.012121545],"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.0019246809,0.00040784583,0.0060502645,0.00093437714,0.00037599797,0.00044832163,0.000686765,0.052903373,0.03817097,0.04551698,0.16185427,0.69072616],"study_design_scores_gemma":[0.0007476067,0.0003998255,0.003040926,0.00022418598,0.00018652168,0.0003204358,0.0003227416,0.6690894,0.081069715,0.028094308,0.21633776,0.00016672548],"about_ca_topic_score_codex":0.013304,"about_ca_topic_score_gemma":0.017057888,"teacher_disagreement_score":0.02713077,"about_ca_system_score_codex":0.0018222706,"about_ca_system_score_gemma":0.0024046586,"threshold_uncertainty_score":0.09076148},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039665863,0.0004796753,0.34544063,0.0012866046,0.004396108,0.0003083598,0.0016185509,0.0044586007,0.6023456],"genre_scores_gemma":[0.53489834,0.0007868875,0.14943916,0.0018973586,0.00035027016,0.00033765237,0.0027746821,0.0045452276,0.3049704],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99951756,0.000035907997,0.000020576577,0.00011695977,0.00015717823,0.00015185717],"domain_scores_gemma":[0.99948704,0.000065987304,0.000023467433,0.00022241363,0.00014673512,0.000054220072],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004803645,0.0008807854,0.00059973134,0.0008351496,0.0015330752,0.0017095975,0.0010846355,0.0014692296,0.06577965],"category_scores_gemma":[0.0014107535,0.00039552525,0.0010758368,0.0006867998,0.001726741,0.0021359355,0.0029738983,0.001963607,0.018264141],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00044547758,0.00007790947,0.0006308378,0.00039416965,0.000028749195,0.0006766795,0.0003305683,0.010326448,0.02818241,0.6649281,0.07978363,0.21419504],"study_design_scores_gemma":[0.000073831216,0.00018437275,0.0005442974,0.00025799184,0.000060262388,0.0011865611,0.00045866394,0.032815583,0.08379835,0.44720477,0.43331513,0.00010022992],"about_ca_topic_score_codex":0.0015439346,"about_ca_topic_score_gemma":0.0016666775,"teacher_disagreement_score":0.06577965,"about_ca_system_score_codex":0.0006602382,"about_ca_system_score_gemma":0.001207065,"threshold_uncertainty_score":0.22005486},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015817836,0.000105820734,0.9778471,0.00047026484,0.00003996744,0.00011709234,0.00008851095,0.0010502639,0.004463236],"genre_scores_gemma":[0.5472808,0.00042040314,0.4445056,0.00077650754,0.00019513829,0.0005133718,0.0003758789,0.00093887455,0.004993337],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9850627,0.004785087,0.001123624,0.0030130108,0.004949792,0.0010657919],"domain_scores_gemma":[0.95651275,0.028763197,0.0019256312,0.009137384,0.0028752752,0.0007857773],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010388721,0.0009921025,0.0011362053,0.0014957594,0.0019305724,0.003103054,0.0022052096,0.0013664126,0.004429692],"category_scores_gemma":[0.0412915,0.001503976,0.0032935212,0.0011102454,0.0073977215,0.011397125,0.010848653,0.0053783604,0.0010517841],"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.00016024543,0.00012767609,0.0011735262,0.0002671696,0.00009655161,0.0003612497,0.0012445145,0.011031615,0.007982466,0.93956804,0.0012629157,0.036724035],"study_design_scores_gemma":[0.000096940836,0.00008827439,0.00029223054,0.00006270741,0.00010308419,0.0004079739,0.00011962608,0.05158261,0.031489275,0.9061494,0.009551709,0.000056225785],"about_ca_topic_score_codex":0.0013308529,"about_ca_topic_score_gemma":0.0008133166,"teacher_disagreement_score":0.010388721,"about_ca_system_score_codex":0.0014888084,"about_ca_system_score_gemma":0.0029044335,"threshold_uncertainty_score":0.054941416},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27405092,0.00056811457,0.66127086,0.0035346765,0.00021284181,0.00059939316,0.0033725689,0.00218917,0.054201514],"genre_scores_gemma":[0.7212376,0.00032507742,0.2616428,0.0008452841,0.00014197423,0.0004875436,0.0041307583,0.00066619675,0.010522805],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980939,0.0005515738,0.0001214135,0.00037903368,0.00059267407,0.00026142437],"domain_scores_gemma":[0.99608445,0.002721925,0.0002813981,0.0005537383,0.00022957387,0.00012897248],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009975258,0.00078400335,0.0007188983,0.000865557,0.0006826066,0.0017734913,0.0016424028,0.0010554706,0.0088410685],"category_scores_gemma":[0.0067788754,0.0005734655,0.0022261422,0.001307642,0.0010845233,0.0020784964,0.0021896022,0.0035002802,0.0007502161],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004169741,0.0006180546,0.002508295,0.0006176132,0.00016483082,0.0008443246,0.0005563725,0.27588722,0.016313193,0.60120684,0.021261264,0.07960489],"study_design_scores_gemma":[0.00017708515,0.000115226125,0.000878475,0.000054118875,0.00006750327,0.00039067245,0.00019263299,0.3684247,0.010357024,0.6074534,0.011844522,0.000044605793],"about_ca_topic_score_codex":0.0025505363,"about_ca_topic_score_gemma":0.004430546,"teacher_disagreement_score":0.0088410685,"about_ca_system_score_codex":0.0013241223,"about_ca_system_score_gemma":0.0013510418,"threshold_uncertainty_score":0.029576302},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.072883956,0.00004198988,0.9236758,0.00009708077,0.000028248585,0.00014486059,0.000052153588,0.0017027867,0.0013731786],"genre_scores_gemma":[0.8465016,0.000047493755,0.15235342,0.000047756635,0.000008752662,0.00013241479,0.00009315566,0.00013183942,0.0006836095],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976981,0.00060659304,0.00019660353,0.00043328703,0.00081793393,0.00024751993],"domain_scores_gemma":[0.99464095,0.0033444823,0.00050182303,0.00087495876,0.00054765487,0.00009011335],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002783305,0.0006084179,0.000557749,0.00050201314,0.00068018865,0.001279781,0.0013502365,0.0010565051,0.00195584],"category_scores_gemma":[0.007439815,0.00060829095,0.0011163381,0.00026300803,0.0020810014,0.0013790262,0.0017242087,0.0011016374,0.00026356732],"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.00023896857,0.00025694273,0.0029425484,0.00043532465,0.00010067291,0.0006920247,0.0007399199,0.77819467,0.058110487,0.10874011,0.0005450003,0.04900323],"study_design_scores_gemma":[0.00005124689,0.000076869386,0.0001645043,0.000021572301,0.000031849973,0.000042058047,0.000057741152,0.93986666,0.035291985,0.02323893,0.0011438217,0.000012864282],"about_ca_topic_score_codex":0.003273155,"about_ca_topic_score_gemma":0.0037638703,"teacher_disagreement_score":0.003273155,"about_ca_system_score_codex":0.0009463816,"about_ca_system_score_gemma":0.0024598446,"threshold_uncertainty_score":0.014719665},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024420178,0.0002243957,0.9687584,0.00022248898,0.000047839792,0.00007342949,0.00006606187,0.00056550134,0.0056217373],"genre_scores_gemma":[0.76834494,0.00035031573,0.22675572,0.00019564989,0.00008822232,0.00032543307,0.00020207583,0.00027359638,0.003464016],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963626,0.0014199091,0.00036802236,0.00059923163,0.00092616415,0.00032411548],"domain_scores_gemma":[0.993686,0.003663546,0.00062875566,0.0011680053,0.0006879304,0.00016577399],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029657756,0.00077057653,0.0004152556,0.0010252261,0.00072955375,0.0015439322,0.0011080523,0.0008652061,0.0033434997],"category_scores_gemma":[0.0061252974,0.00036095653,0.0011791072,0.00064782257,0.004549775,0.0031915999,0.0016136457,0.001966405,0.000554301],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004815205,0.000025012565,0.00038184316,0.000057549394,0.000018017454,0.0000959685,0.0003499051,0.04262083,0.0049488647,0.9453267,0.00030054105,0.00582646],"study_design_scores_gemma":[0.000038327464,0.00011122671,0.0002610235,0.000060134127,0.00004244345,0.00020597324,0.00014034934,0.20969632,0.01532766,0.75345165,0.020629324,0.000035663237],"about_ca_topic_score_codex":0.0014102637,"about_ca_topic_score_gemma":0.0009767578,"teacher_disagreement_score":0.0033434997,"about_ca_system_score_codex":0.0014275116,"about_ca_system_score_gemma":0.0009177375,"threshold_uncertainty_score":0.015684724},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006154663,0.00020740178,0.99124616,0.000025221329,0.00004154453,0.000033045104,0.000052833737,0.0005528457,0.0016862876],"genre_scores_gemma":[0.50589687,0.0006082047,0.48844066,0.0000650853,0.00004828539,0.00024368789,0.0002639606,0.00019696813,0.0042363857],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987903,0.00043623714,0.00009441667,0.00020042695,0.0003557925,0.00012284367],"domain_scores_gemma":[0.997962,0.0012103654,0.00015863078,0.00048364684,0.0001389778,0.0000465043],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013364167,0.0007645182,0.0008288256,0.0007479432,0.00040288753,0.0018207906,0.0011845981,0.0007951144,0.0035312388],"category_scores_gemma":[0.0030277285,0.0006127873,0.0013968905,0.0006588733,0.001520927,0.0017571888,0.0015685181,0.0021032249,0.00061834615],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002460972,0.00006106787,0.00041475167,0.00041226455,0.00010428472,0.00026070545,0.00042969867,0.4149927,0.01521193,0.5015217,0.0007277443,0.065617],"study_design_scores_gemma":[0.000049202063,0.00010624617,0.00011893095,0.000093957766,0.00009451586,0.000065783155,0.000047697376,0.72138107,0.008325463,0.25918832,0.010502494,0.00002628215],"about_ca_topic_score_codex":0.0012608267,"about_ca_topic_score_gemma":0.0016398411,"teacher_disagreement_score":0.0035312388,"about_ca_system_score_codex":0.0006879538,"about_ca_system_score_gemma":0.0010672585,"threshold_uncertainty_score":0.011813223},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014170989,0.000842535,0.97101384,0.0009633418,0.00008812475,0.00015557531,0.0001375015,0.0004296594,0.012198426],"genre_scores_gemma":[0.5142405,0.0031636008,0.4658193,0.0007499206,0.0005091437,0.0010060669,0.00064144627,0.0007747117,0.013095371],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.995261,0.0010867247,0.00039030414,0.0011170714,0.0017378286,0.0004071442],"domain_scores_gemma":[0.99212873,0.004939824,0.0005270067,0.0013160206,0.0008184187,0.00026993937],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035726742,0.0008763841,0.000750878,0.0023409307,0.0013441286,0.0023665922,0.0019469379,0.0011448746,0.0049909293],"category_scores_gemma":[0.010145687,0.0007162105,0.0016171157,0.00251454,0.00683124,0.00738201,0.0041754516,0.0046011475,0.0009285888],"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.000037208436,0.000036769543,0.0003400987,0.00009357314,0.00001389426,0.00017812099,0.0003691534,0.008326533,0.0023570252,0.96479887,0.00077609415,0.022672608],"study_design_scores_gemma":[0.00003099225,0.000084071755,0.00029718998,0.00006064558,0.000029756078,0.00068144477,0.00022336715,0.03913717,0.0084579885,0.9187819,0.032175723,0.00003969383],"about_ca_topic_score_codex":0.0012333738,"about_ca_topic_score_gemma":0.0006634102,"teacher_disagreement_score":0.0049909293,"about_ca_system_score_codex":0.001737849,"about_ca_system_score_gemma":0.0012276301,"threshold_uncertainty_score":0.018894315},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0067086183,0.00007564947,0.97582096,0.00021985343,0.000101388054,0.00017467169,0.00043033267,0.0144300265,0.0020384805],"genre_scores_gemma":[0.17978063,0.00020671355,0.8104599,0.0004673005,0.000097061886,0.0005752142,0.00198186,0.0018045781,0.0046267454],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99488443,0.0013548211,0.00040745968,0.00065687543,0.002333511,0.00036276935],"domain_scores_gemma":[0.99206513,0.0043226304,0.0006236308,0.0014049542,0.0014192485,0.00016437417],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033204218,0.0014528608,0.0012082303,0.0024456752,0.0010099665,0.0027251327,0.0038784,0.0016546084,0.00634777],"category_scores_gemma":[0.014024474,0.0009298876,0.0023987598,0.0012614081,0.0023923032,0.004105232,0.0030100541,0.0032367231,0.0012106241],"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.0008678076,0.00035074554,0.0042531984,0.0011533828,0.000396402,0.00072854577,0.0007364092,0.42932898,0.03163269,0.25652266,0.024353191,0.2496761],"study_design_scores_gemma":[0.00011233947,0.00010021166,0.00017166192,0.00006617374,0.00008522326,0.00010235309,0.000053000516,0.92797846,0.018243559,0.034319356,0.018724669,0.00004296675],"about_ca_topic_score_codex":0.010868032,"about_ca_topic_score_gemma":0.012294415,"teacher_disagreement_score":0.010868032,"about_ca_system_score_codex":0.0024258324,"about_ca_system_score_gemma":0.0071180677,"threshold_uncertainty_score":0.021609545},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.056149546,0.00006167584,0.9394494,0.00011232632,0.000029873961,0.0002232751,0.00009883632,0.0017500179,0.0021249207],"genre_scores_gemma":[0.64249676,0.00006688813,0.35453853,0.00009019255,0.000022458928,0.0004186503,0.0003822118,0.0010508765,0.0009334601],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9843508,0.005892357,0.0012030309,0.0016688928,0.00520044,0.0016844639],"domain_scores_gemma":[0.9632688,0.023240525,0.002242353,0.008342241,0.0023090518,0.00059712376],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0097049745,0.001468505,0.00214948,0.0018197517,0.0020353398,0.0035682807,0.0034578093,0.0021543857,0.00414572],"category_scores_gemma":[0.037216444,0.0022614617,0.002715449,0.0013179134,0.0039688884,0.008653172,0.009497665,0.0036261894,0.0005235908],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014329824,0.0004301568,0.0148285115,0.00071658863,0.00042400893,0.0025959082,0.0047708536,0.39929295,0.03572109,0.47229952,0.0025762438,0.064911224],"study_design_scores_gemma":[0.00014282633,0.00013178965,0.0005201651,0.0001366758,0.00021889756,0.00023680954,0.0007885288,0.79457027,0.03637894,0.16174185,0.0050668707,0.00006639249],"about_ca_topic_score_codex":0.0038743531,"about_ca_topic_score_gemma":0.0069358237,"teacher_disagreement_score":0.0097049745,"about_ca_system_score_codex":0.0020652588,"about_ca_system_score_gemma":0.0035184096,"threshold_uncertainty_score":0.05132544},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.082532585,0.0002673042,0.90466547,0.0003291176,0.00013281382,0.000029081095,0.000067433786,0.0003133544,0.0116629265],"genre_scores_gemma":[0.90522474,0.00032440253,0.08677618,0.000105980645,0.00006817125,0.000082125516,0.00011369185,0.00009883883,0.007205842],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993316,0.00014191584,0.000045129607,0.00008390804,0.0003039735,0.00009341872],"domain_scores_gemma":[0.9991172,0.00036028013,0.00011987266,0.00018619471,0.00009789806,0.00011862997],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00085015607,0.00047970607,0.00069385074,0.00064825674,0.00052923197,0.0020214866,0.00082054257,0.0006625983,0.002857061],"category_scores_gemma":[0.0022946084,0.0003756636,0.00085718243,0.00038554007,0.0019261616,0.0017078901,0.0031679915,0.0019909893,0.00024592268],"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.000050180548,0.000024661165,0.00026414116,0.000041402607,0.000022959697,0.00012997126,0.000316293,0.037551466,0.00433075,0.94907016,0.00032365072,0.007874354],"study_design_scores_gemma":[0.000037030033,0.000046078294,0.00021374707,0.000016096983,0.000017902199,0.00010197395,0.00012360743,0.3573959,0.0017350615,0.6362682,0.004021562,0.00002297292],"about_ca_topic_score_codex":0.0008336544,"about_ca_topic_score_gemma":0.00070332567,"teacher_disagreement_score":0.002857061,"about_ca_system_score_codex":0.0009977868,"about_ca_system_score_gemma":0.00052494096,"threshold_uncertainty_score":0.009557843},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018905561,0.00030542267,0.9150195,0.00024246766,0.000059260234,0.0003147286,0.0006854057,0.061597932,0.0028696717],"genre_scores_gemma":[0.24268845,0.0003031368,0.7439039,0.00038128372,0.00003773597,0.0005654644,0.0022705814,0.00679798,0.0030516111],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99377716,0.0023923132,0.0003395942,0.00084036664,0.00219986,0.00045066775],"domain_scores_gemma":[0.9879346,0.0057461457,0.0010841809,0.0037816467,0.0013062947,0.00014708337],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005754217,0.0017524577,0.00082022906,0.0018386741,0.00071195123,0.002058915,0.0034256736,0.0014955642,0.007552626],"category_scores_gemma":[0.02142581,0.0012046415,0.0017219564,0.0004455171,0.0015827157,0.002850201,0.003057526,0.002011432,0.0015387777],"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.00069636514,0.00042766763,0.010709809,0.0014134038,0.00039413697,0.0011129465,0.0008773078,0.36012894,0.0792243,0.06458023,0.035446823,0.44498807],"study_design_scores_gemma":[0.00016319935,0.00016787543,0.0010177884,0.00025542662,0.0000645922,0.00042987952,0.00006923435,0.8563004,0.093239374,0.01833343,0.029870506,0.000088388326],"about_ca_topic_score_codex":0.005482066,"about_ca_topic_score_gemma":0.0064427005,"teacher_disagreement_score":0.007552626,"about_ca_system_score_codex":0.0016473422,"about_ca_system_score_gemma":0.003920492,"threshold_uncertainty_score":0.030431569},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0060398467,0.00022550131,0.98875487,0.0002617548,0.00005036477,0.000080086764,0.00013248777,0.0002830873,0.004172057],"genre_scores_gemma":[0.46802267,0.0010486237,0.5235662,0.00044487225,0.00019567827,0.0005767738,0.0005365299,0.00016333557,0.0054454464],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99722064,0.000720175,0.00026799066,0.00042185423,0.0010471288,0.00032226302],"domain_scores_gemma":[0.99533504,0.0028274618,0.000615798,0.00047331004,0.00055712357,0.0001913544],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033613497,0.0008829596,0.00053892046,0.0013972179,0.00074577844,0.0022079537,0.0015262638,0.001046439,0.003086728],"category_scores_gemma":[0.0058772005,0.00040666983,0.0020723054,0.0010681837,0.0032311694,0.0026824803,0.0014205456,0.0030260533,0.00048632052],"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.00002030316,0.000044161283,0.00038544156,0.000075260206,0.0000147867195,0.00020565452,0.00022518572,0.03994995,0.0020055058,0.9478645,0.00035712493,0.008852107],"study_design_scores_gemma":[0.000052026775,0.00006991414,0.0002340168,0.00007380645,0.00004234017,0.00024694976,0.00006182559,0.33948186,0.0048732287,0.6390744,0.015755793,0.000033799886],"about_ca_topic_score_codex":0.003950102,"about_ca_topic_score_gemma":0.0024555975,"teacher_disagreement_score":0.003950102,"about_ca_system_score_codex":0.0021336074,"about_ca_system_score_gemma":0.0025870712,"threshold_uncertainty_score":0.017776728},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039056886,0.00011315785,0.9491255,0.00025246173,0.00003165684,0.00009176071,0.0002339204,0.009535251,0.0015594895],"genre_scores_gemma":[0.7580211,0.00014851523,0.23668784,0.00027121088,0.000042797034,0.00026708355,0.0007559,0.001763293,0.0020421636],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99132866,0.0026787792,0.00067895453,0.0013901326,0.002966776,0.00095674995],"domain_scores_gemma":[0.96695375,0.020568477,0.0023212198,0.0068731015,0.0029279403,0.0003554746],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0053763613,0.0010171642,0.00083055976,0.001052709,0.0009921853,0.0022750685,0.0020514014,0.0009960158,0.0029503426],"category_scores_gemma":[0.034164596,0.00084350555,0.0015319954,0.0007182128,0.0031463008,0.0048876544,0.002706336,0.0024605503,0.00076898],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014961999,0.0003559493,0.014236275,0.0012003131,0.00024439703,0.0017559655,0.0022396601,0.47047463,0.08445522,0.18425645,0.005690246,0.2335947],"study_design_scores_gemma":[0.00011246009,0.0001495032,0.0005287268,0.00010052133,0.000071211674,0.00018162058,0.0001312265,0.8575576,0.062289126,0.07520817,0.003630604,0.000039230927],"about_ca_topic_score_codex":0.0045630955,"about_ca_topic_score_gemma":0.0052302307,"teacher_disagreement_score":0.0053763613,"about_ca_system_score_codex":0.0022220532,"about_ca_system_score_gemma":0.0033415458,"threshold_uncertainty_score":0.028433204},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0035374663,0.0002651472,0.99229586,0.00016109728,0.00013128918,0.000059790687,0.00005147633,0.0009433814,0.0025545203],"genre_scores_gemma":[0.29136932,0.00081989897,0.69675404,0.00022037397,0.00027352662,0.0003472341,0.00018510807,0.00055072585,0.009479744],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977852,0.0006352201,0.00017434786,0.00028481614,0.0008976212,0.00022265982],"domain_scores_gemma":[0.9970694,0.0017613875,0.00011557429,0.0005535453,0.00040296093,0.00009724129],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036040875,0.0007655016,0.0010869675,0.0013900846,0.0009868587,0.0023827744,0.0016960665,0.0011682281,0.0031928353],"category_scores_gemma":[0.0071170875,0.0009354139,0.0016300434,0.0011469786,0.0031893314,0.0026612405,0.002195138,0.0029269475,0.0008868619],"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.00009039352,0.0000643139,0.00030276636,0.00015451734,0.00004538532,0.00034171072,0.00042024185,0.03649541,0.007040651,0.8839015,0.0020539125,0.06908921],"study_design_scores_gemma":[0.00008115373,0.000077331606,0.00021552206,0.0000913256,0.0001262591,0.00018973085,0.00004691893,0.31709677,0.009796742,0.6418284,0.03039573,0.000054041742],"about_ca_topic_score_codex":0.0040128464,"about_ca_topic_score_gemma":0.004151762,"teacher_disagreement_score":0.0040128464,"about_ca_system_score_codex":0.0013078887,"about_ca_system_score_gemma":0.0023125063,"threshold_uncertainty_score":0.019060433},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0061218627,0.00020934404,0.99024826,0.000085861706,0.000039443363,0.000051386523,0.000081467086,0.00018497022,0.0029774155],"genre_scores_gemma":[0.15738821,0.00036416447,0.83812416,0.00013691938,0.00005085273,0.00022878264,0.000318661,0.00025062743,0.003137633],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987232,0.000476083,0.000052745778,0.00018151077,0.000426322,0.0001400305],"domain_scores_gemma":[0.9984761,0.0008414961,0.00011681996,0.00027601712,0.00023582827,0.00005385839],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001561901,0.0010918916,0.0009286436,0.0010161665,0.0006398597,0.0013235487,0.0010865389,0.00075536064,0.0053924033],"category_scores_gemma":[0.004039048,0.0006283051,0.0011577328,0.0018441806,0.0009838655,0.0015156838,0.0018940016,0.0020651547,0.0006917966],"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.00007270324,0.00006469993,0.00070764055,0.00020021103,0.000052085914,0.0001263056,0.00011209592,0.7685734,0.004032414,0.10814635,0.0039172703,0.11399488],"study_design_scores_gemma":[0.000016101061,0.000024069368,0.00010005031,0.000020148798,0.000011304186,0.000048335834,0.000013655699,0.9605097,0.0020766128,0.032962736,0.0042078905,0.000009393654],"about_ca_topic_score_codex":0.0037728692,"about_ca_topic_score_gemma":0.004674955,"teacher_disagreement_score":0.0053924033,"about_ca_system_score_codex":0.0009133992,"about_ca_system_score_gemma":0.0014449086,"threshold_uncertainty_score":0.018039405},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15817587,0.0004695721,0.81787765,0.00040490055,0.00011737977,0.000119538825,0.0003774923,0.0007502793,0.021707311],"genre_scores_gemma":[0.8855492,0.00035610382,0.09667742,0.0003288744,0.00015584912,0.0004202442,0.0006322092,0.00021191193,0.0156683],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99612385,0.0009984028,0.00028875849,0.0012003387,0.00090621534,0.00048239314],"domain_scores_gemma":[0.9932041,0.0033961644,0.0010145144,0.00092897954,0.00088777015,0.0005684336],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023555737,0.00062881305,0.0006420277,0.0015109106,0.0015596249,0.0033396313,0.0014291322,0.0013524005,0.0065323045],"category_scores_gemma":[0.0077970815,0.000723609,0.0019966054,0.00087123195,0.0044018007,0.0064635174,0.0043005375,0.0023827269,0.0009776116],"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.0000478926,0.000018083281,0.00031312238,0.000029333592,0.000011444336,0.00015838124,0.00039948546,0.0032365713,0.0015034061,0.99101126,0.00013161433,0.0031394018],"study_design_scores_gemma":[0.00002368126,0.00005979084,0.00030794466,0.000029798226,0.000018069091,0.000116366646,0.00011840449,0.04451189,0.0023327149,0.9489694,0.0034852482,0.000026574566],"about_ca_topic_score_codex":0.0016149092,"about_ca_topic_score_gemma":0.001138258,"teacher_disagreement_score":0.0065323045,"about_ca_system_score_codex":0.0016165391,"about_ca_system_score_gemma":0.00091341796,"threshold_uncertainty_score":0.021852732},"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":"commentary","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015055431,0.020519985,0.027424376,0.60805696,0.028976435,0.00004239993,0.00043834466,0.0008034407,0.29868254],"genre_scores_gemma":[0.3444682,0.013452115,0.012172299,0.07713624,0.010889855,0.00010563258,0.00043573132,0.0013318921,0.54000807],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99580777,0.0015032425,0.0001362466,0.0007849218,0.0012265762,0.0005411778],"domain_scores_gemma":[0.99413884,0.0017319097,0.00032755386,0.0009837825,0.0021009047,0.0007169604],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005183107,0.0007210555,0.000827227,0.0009252526,0.0042119385,0.0076102973,0.0011816409,0.0036208027,0.056807283],"category_scores_gemma":[0.01950628,0.00026018047,0.0005212665,0.0008025537,0.0061607584,0.012259531,0.003831246,0.00543334,0.016576605],"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.00017306926,0.000042168962,0.000822939,0.00017560652,0.000030969328,0.00027130157,0.0026691172,0.00032261948,0.001444987,0.7297995,0.1807899,0.08345788],"study_design_scores_gemma":[0.000011793266,0.000020213502,0.00039049314,0.00016063999,0.000011370908,0.00027117372,0.00251087,0.00031721083,0.0007034583,0.20788075,0.7876915,0.000030490144],"about_ca_topic_score_codex":0.006169474,"about_ca_topic_score_gemma":0.0071828333,"teacher_disagreement_score":0.056807283,"about_ca_system_score_codex":0.00391804,"about_ca_system_score_gemma":0.0026668252,"threshold_uncertainty_score":0.19003928},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04353116,0.00018426997,0.9541913,0.00021498272,0.000024641226,0.000040063085,0.000045527795,0.00030357522,0.0014644953],"genre_scores_gemma":[0.62598634,0.0002592212,0.37093076,0.00008697392,0.000037574522,0.00011356754,0.00016353553,0.00013434463,0.0022876475],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9947582,0.0016521421,0.00034710797,0.0009887893,0.001829613,0.0004241349],"domain_scores_gemma":[0.98890066,0.007055511,0.0010229509,0.0015172455,0.0010101917,0.000493456],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0060217227,0.00081874494,0.001068797,0.0018340818,0.0009251786,0.0028190315,0.0019721573,0.0013939636,0.0022876651],"category_scores_gemma":[0.028536761,0.0009273889,0.0016944241,0.0011906622,0.0029255883,0.006774155,0.004038383,0.0031451392,0.00040313357],"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.00020604585,0.00005225548,0.0016995687,0.00012693922,0.000038422015,0.00009119064,0.00036053528,0.3074369,0.0031883817,0.6465677,0.00051106187,0.03972103],"study_design_scores_gemma":[0.000010263867,0.000032809217,0.00013454574,0.000011025455,0.000006938028,0.000039184895,0.000017701406,0.8016347,0.0012066092,0.19616586,0.0007235714,0.00001680657],"about_ca_topic_score_codex":0.0026837396,"about_ca_topic_score_gemma":0.0017975398,"teacher_disagreement_score":0.0060217227,"about_ca_system_score_codex":0.0038395408,"about_ca_system_score_gemma":0.001806387,"threshold_uncertainty_score":0.031846285},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015636578,0.00008654185,0.98017097,0.00023885812,0.00002895244,0.000069785405,0.00006588587,0.0013773377,0.002325061],"genre_scores_gemma":[0.61701757,0.00020802207,0.37920022,0.00021209037,0.000021372822,0.00026276888,0.00017393315,0.00029246468,0.0026115114],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992613,0.00026027104,0.000050511597,0.00012313672,0.00019292845,0.00011175281],"domain_scores_gemma":[0.99717015,0.0019605474,0.00025686846,0.00026176096,0.0002314674,0.0001192156],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011940502,0.0006920914,0.00047740334,0.00039010556,0.0004442387,0.0010895125,0.0012161331,0.00089209055,0.002528832],"category_scores_gemma":[0.006395522,0.0004360209,0.0007341806,0.0003934482,0.0013193161,0.0013806946,0.0011867638,0.0017220876,0.0004153552],"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.00016504596,0.00009844316,0.0008459283,0.00013464906,0.0000333378,0.0001762164,0.0002280699,0.86556506,0.0063332818,0.07145265,0.0011075987,0.05385974],"study_design_scores_gemma":[0.000020583971,0.000034385248,0.000035984813,0.000012447574,0.000010237864,0.000019036299,0.00001623561,0.9676693,0.0031473238,0.027858965,0.0011677211,0.000007874672],"about_ca_topic_score_codex":0.005760891,"about_ca_topic_score_gemma":0.007251036,"teacher_disagreement_score":0.005760891,"about_ca_system_score_codex":0.0009874748,"about_ca_system_score_gemma":0.0029531606,"threshold_uncertainty_score":0.011454701},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011121159,0.000045006258,0.98602146,0.00008979769,0.000019793606,0.000037949703,0.00004185454,0.00062455185,0.0019984504],"genre_scores_gemma":[0.88564193,0.00012874047,0.11104051,0.000111053014,0.000039758517,0.0001612413,0.000112327136,0.00012547476,0.002638885],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982185,0.00031304423,0.0001098786,0.00039312412,0.00079429307,0.00017114388],"domain_scores_gemma":[0.9971482,0.0009861575,0.00043507968,0.00089765363,0.00045507905,0.00007786338],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013168193,0.00073500734,0.0005279626,0.00039481942,0.000474912,0.0010801145,0.0016692932,0.00079702307,0.0018832413],"category_scores_gemma":[0.0041710604,0.00028422108,0.00072892895,0.00028967767,0.001814108,0.0016620347,0.0017584321,0.0012754726,0.00036267907],"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.00063351257,0.00014847705,0.0009121881,0.00047172004,0.00006510475,0.000584814,0.000819326,0.37553865,0.094260246,0.38826552,0.0017892038,0.13651127],"study_design_scores_gemma":[0.00007216068,0.00043464583,0.0003159505,0.00005674342,0.00003783238,0.00017620984,0.00006240009,0.7722864,0.06884721,0.15054876,0.007124242,0.000037460144],"about_ca_topic_score_codex":0.000537408,"about_ca_topic_score_gemma":0.00027442118,"teacher_disagreement_score":0.0018832413,"about_ca_system_score_codex":0.00057291944,"about_ca_system_score_gemma":0.0009874672,"threshold_uncertainty_score":0.0069640875},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026752593,0.000040184455,0.96896523,0.000087939916,0.000012756394,0.00008348183,0.00021485522,0.0028359483,0.0010069816],"genre_scores_gemma":[0.5445611,0.00013049094,0.45178127,0.0000671049,0.000028239438,0.00033293947,0.00091112865,0.00053581654,0.001651923],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99739194,0.00076142035,0.0001440134,0.00033091803,0.0011565915,0.00021503368],"domain_scores_gemma":[0.99404657,0.003799014,0.00042859564,0.001090178,0.0005660684,0.00006952565],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017479339,0.0008044492,0.00060710014,0.0012775041,0.00083311123,0.0013532941,0.001142898,0.00090348255,0.0031713801],"category_scores_gemma":[0.008448223,0.0005881856,0.0019024035,0.00044753167,0.0013407328,0.0019121979,0.0017705356,0.0012680794,0.000374644],"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.00010795415,0.00013164953,0.0031184496,0.00020572633,0.00007716142,0.0004767123,0.0003740122,0.78784907,0.020166399,0.122599736,0.0014400695,0.06345307],"study_design_scores_gemma":[0.000012402331,0.000015820855,0.000166268,0.00001537526,0.000011972928,0.000030591502,0.000017631168,0.9530467,0.006515957,0.03896445,0.00119412,0.000008874374],"about_ca_topic_score_codex":0.0039338525,"about_ca_topic_score_gemma":0.0043260823,"teacher_disagreement_score":0.0039338525,"about_ca_system_score_codex":0.0012373568,"about_ca_system_score_gemma":0.002674298,"threshold_uncertainty_score":0.010609329},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09187953,0.014581806,0.28450704,0.0025461381,0.0010750651,0.000100172976,0.0013202089,0.0007731458,0.60321695],"genre_scores_gemma":[0.81565857,0.006196979,0.04762696,0.0009608601,0.001260471,0.00034119532,0.0016433997,0.00052662735,0.12578493],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99908626,0.00024541482,0.000059435544,0.00015745615,0.00032902608,0.00012230742],"domain_scores_gemma":[0.99905676,0.0003920345,0.000082610284,0.00011073966,0.00023163877,0.00012621286],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006518184,0.0007375031,0.00087657454,0.0034409268,0.0016374859,0.003973649,0.00080310577,0.0007446262,0.009576461],"category_scores_gemma":[0.0016162774,0.0006321293,0.00085548405,0.0022315385,0.0027200617,0.0038124016,0.0023503343,0.0024291489,0.0020077683],"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.000004485385,0.0000016457512,0.000021095933,0.000013592362,0.0000016149451,0.0000069150356,0.00006776971,0.00009618901,0.00008708303,0.9971685,0.00052624836,0.0020049126],"study_design_scores_gemma":[0.0000021449132,0.000003896149,0.00007552489,0.000014543142,0.0000033521333,0.00003874419,0.000048900052,0.0006158574,0.00010331115,0.98789793,0.011190698,0.0000050512026],"about_ca_topic_score_codex":0.001680749,"about_ca_topic_score_gemma":0.0011697776,"teacher_disagreement_score":0.009576461,"about_ca_system_score_codex":0.0020562569,"about_ca_system_score_gemma":0.00090243807,"threshold_uncertainty_score":0.032036483},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011368861,0.000084260086,0.99741805,0.00033944333,0.000021491087,0.00010801559,0.000032610187,0.00021048325,0.000648772],"genre_scores_gemma":[0.044627216,0.0003635086,0.95308596,0.00031831575,0.00008880568,0.00039272127,0.00021280287,0.00013606026,0.0007746545],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9587653,0.01415468,0.0037490148,0.002625917,0.019458843,0.0012461987],"domain_scores_gemma":[0.92321974,0.045941416,0.0043558516,0.0161264,0.009302892,0.0010537894],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.031366013,0.0018277072,0.0018570148,0.0034759257,0.0015957375,0.0073199645,0.0060287514,0.0038310222,0.0023261162],"category_scores_gemma":[0.07137766,0.0021699953,0.004828555,0.0017657486,0.009477353,0.009926929,0.008257177,0.009527195,0.0015239082],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007315689,0.0003669621,0.0011805071,0.0010183495,0.00021695129,0.00069551554,0.0012656765,0.13114995,0.013622462,0.79077035,0.001740312,0.05789977],"study_design_scores_gemma":[0.00012235496,0.00021014904,0.00029871048,0.00043442953,0.000102820384,0.00035349352,0.0003957001,0.4110879,0.013160988,0.5562733,0.0174731,0.000087006425],"about_ca_topic_score_codex":0.004149176,"about_ca_topic_score_gemma":0.00410816,"teacher_disagreement_score":0.031366013,"about_ca_system_score_codex":0.0031078542,"about_ca_system_score_gemma":0.012693197,"threshold_uncertainty_score":0.16588128},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21952151,0.0024247016,0.7427453,0.006052517,0.00016794655,0.00013263512,0.0008245007,0.0037115924,0.024419377],"genre_scores_gemma":[0.89566714,0.0011991836,0.09579303,0.00080382795,0.00025313234,0.0002362031,0.0006707199,0.00065260753,0.004724116],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99574846,0.001110031,0.0001883844,0.0010948527,0.0010601733,0.0007981347],"domain_scores_gemma":[0.954884,0.036963154,0.0016858062,0.004930132,0.0010611258,0.0004758176],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039569596,0.0012137566,0.0013078388,0.001716391,0.0021720116,0.004566118,0.0027128123,0.0013306722,0.003689798],"category_scores_gemma":[0.021305073,0.0011290244,0.0030165005,0.0025933352,0.0072081983,0.013530323,0.0033352629,0.0068199616,0.00039913453],"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.0005281833,0.00009850025,0.0016945571,0.0003007515,0.00011133677,0.00028409698,0.00067934394,0.08049385,0.005438282,0.88990635,0.0017472031,0.018717447],"study_design_scores_gemma":[0.000062660554,0.000046145833,0.00048552197,0.00003886914,0.00006976949,0.000080819955,0.00006412778,0.17356704,0.0036071988,0.8195518,0.0023857811,0.00004030104],"about_ca_topic_score_codex":0.008637867,"about_ca_topic_score_gemma":0.007941498,"teacher_disagreement_score":0.008637867,"about_ca_system_score_codex":0.005398101,"about_ca_system_score_gemma":0.0025265827,"threshold_uncertainty_score":0.039166093},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034912135,0.00020173973,0.9429832,0.00073914044,0.00006029695,0.0003602702,0.001442742,0.012807738,0.006492726],"genre_scores_gemma":[0.28199917,0.00019533442,0.7045553,0.0005417729,0.00005880584,0.00038912514,0.0062199845,0.0014398517,0.004600678],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99778265,0.0005090273,0.000118909345,0.0005144193,0.0008368779,0.00023803573],"domain_scores_gemma":[0.98913515,0.006353007,0.00059414527,0.0026297623,0.0010224199,0.00026543275],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001754161,0.00090727035,0.00072242523,0.0015989701,0.00085317745,0.0021104317,0.0022547923,0.0012197602,0.010551311],"category_scores_gemma":[0.019340845,0.0007808045,0.0019497928,0.0012900438,0.0015044614,0.0034124046,0.0039024092,0.0022565834,0.0024590082],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007290966,0.00050891965,0.008986135,0.00072285306,0.000115019284,0.0011965162,0.00057814515,0.21385539,0.01163604,0.17093594,0.030190479,0.56054544],"study_design_scores_gemma":[0.00009850311,0.00010267349,0.00076844095,0.00007851308,0.00004826466,0.0002504763,0.00014254394,0.6836713,0.008744734,0.2909305,0.015134119,0.00002996124],"about_ca_topic_score_codex":0.0076681855,"about_ca_topic_score_gemma":0.016709851,"teacher_disagreement_score":0.010551311,"about_ca_system_score_codex":0.0014059164,"about_ca_system_score_gemma":0.0028652002,"threshold_uncertainty_score":0.035297632},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013766461,0.000084538995,0.9893834,0.00021566817,0.00008204755,0.00011539428,0.00072464836,0.00499769,0.003020025],"genre_scores_gemma":[0.05593711,0.0004227129,0.9252799,0.0006527529,0.00009501607,0.0009592852,0.0031041799,0.0021610723,0.011388008],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.995271,0.001163083,0.00091125513,0.00071303215,0.0016554234,0.00028625512],"domain_scores_gemma":[0.9958941,0.0018984125,0.00039757628,0.00080065645,0.00080823456,0.00020103417],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0042727273,0.0013042445,0.0007251501,0.0011633537,0.00069371355,0.0030668045,0.0026773214,0.0012549093,0.006005665],"category_scores_gemma":[0.0057865498,0.0013568378,0.0021407348,0.00079597335,0.0022085106,0.005823456,0.0032675688,0.0038857535,0.0023288755],"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.00021154938,0.00010534658,0.00060879724,0.0009353859,0.0000789574,0.0006060202,0.0019952245,0.029689234,0.0229357,0.83443546,0.020674825,0.087723546],"study_design_scores_gemma":[0.00014765016,0.00021479448,0.0002705202,0.00028116268,0.00010739104,0.0008013468,0.00034203252,0.12012248,0.028433021,0.2667794,0.58231026,0.00018997349],"about_ca_topic_score_codex":0.0036102575,"about_ca_topic_score_gemma":0.0056739743,"teacher_disagreement_score":0.006005665,"about_ca_system_score_codex":0.0011870537,"about_ca_system_score_gemma":0.002833121,"threshold_uncertainty_score":0.022596598},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0073018945,0.0003426282,0.9810783,0.00061257154,0.000116358,0.0004605732,0.00094541075,0.0038339363,0.00530824],"genre_scores_gemma":[0.111037396,0.00089066214,0.8786725,0.00024063926,0.0000837746,0.0009790055,0.0025432925,0.0006060691,0.0049466346],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99618775,0.0017498124,0.00044429154,0.00029616922,0.0010852239,0.00023689425],"domain_scores_gemma":[0.9891685,0.006501626,0.0012283807,0.001426702,0.0014635673,0.00021126037],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0052742567,0.001741167,0.0004829565,0.002761269,0.0010687633,0.0030881222,0.002088963,0.0017188878,0.0039951154],"category_scores_gemma":[0.011912114,0.0011152676,0.0018483477,0.0012783386,0.001119695,0.0040578763,0.0018570494,0.0020512275,0.001357046],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031133185,0.00042938566,0.0067494856,0.0014732288,0.00020430391,0.0015683464,0.006115391,0.20277004,0.019109385,0.6143995,0.016691435,0.13017806],"study_design_scores_gemma":[0.00013938689,0.0001581044,0.00095270184,0.0005152099,0.00018564856,0.0008786121,0.00045151898,0.5604084,0.015377533,0.20135571,0.21947236,0.000104827144],"about_ca_topic_score_codex":0.013974273,"about_ca_topic_score_gemma":0.015821783,"teacher_disagreement_score":0.013974273,"about_ca_system_score_codex":0.002026416,"about_ca_system_score_gemma":0.0040282495,"threshold_uncertainty_score":0.027893245},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04320721,0.0013362282,0.8410518,0.013343174,0.0018198534,0.0009564604,0.0010213703,0.01128293,0.08598095],"genre_scores_gemma":[0.6396599,0.0010642123,0.30910268,0.004984403,0.002813168,0.0015761869,0.0034813338,0.005442688,0.031875417],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9636646,0.009292623,0.0026014312,0.0072895302,0.012894062,0.004257655],"domain_scores_gemma":[0.9156056,0.0508673,0.0035943543,0.019452486,0.007671869,0.002808415],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.016877053,0.001549132,0.0021972354,0.0046529453,0.0040456136,0.010331902,0.0055338056,0.0067408984,0.03470284],"category_scores_gemma":[0.11365013,0.0020474137,0.0036734005,0.0050506326,0.013953125,0.03157539,0.018550284,0.009987789,0.0067911125],"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.00060107635,0.0001482778,0.00269357,0.00039283582,0.00010754323,0.000839558,0.0013504061,0.008670279,0.0013647641,0.9131056,0.01576303,0.054963015],"study_design_scores_gemma":[0.000084293446,0.000053512154,0.00024940833,0.00010072646,0.000055934706,0.00021157383,0.00036121343,0.05016283,0.0023784041,0.9317231,0.014580598,0.000038263],"about_ca_topic_score_codex":0.0059532444,"about_ca_topic_score_gemma":0.0053979247,"teacher_disagreement_score":0.03470284,"about_ca_system_score_codex":0.0025324912,"about_ca_system_score_gemma":0.0067762886,"threshold_uncertainty_score":0.11609256},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020719051,0.00016091915,0.97062284,0.0004664884,0.000035458066,0.00010966483,0.00023661436,0.00046590643,0.007182971],"genre_scores_gemma":[0.41304466,0.0005098055,0.5654015,0.00045441874,0.00016983983,0.0003856668,0.0010365683,0.00037644498,0.018621149],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982558,0.0003218121,0.00012703767,0.00036760053,0.0007073611,0.00022033045],"domain_scores_gemma":[0.99700147,0.0016723952,0.0002382378,0.0004679855,0.0005118554,0.00010801765],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002042476,0.0005659029,0.0006081203,0.0015791745,0.0012528277,0.0020262916,0.001160467,0.00079039525,0.0058062333],"category_scores_gemma":[0.0051827924,0.00050787564,0.002705236,0.0013268996,0.0027081387,0.0059201145,0.00248224,0.00353265,0.0010155041],"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.00007036549,0.000044686738,0.0007803799,0.00013355355,0.000026028432,0.00011720108,0.00047874273,0.01929524,0.007150022,0.9254057,0.0016348497,0.044863332],"study_design_scores_gemma":[0.000013122281,0.000038680653,0.00027943373,0.0000478265,0.000028444238,0.00008380711,0.00013246085,0.08019548,0.008649822,0.90067077,0.009832434,0.00002769736],"about_ca_topic_score_codex":0.0028157362,"about_ca_topic_score_gemma":0.003270086,"teacher_disagreement_score":0.0058062333,"about_ca_system_score_codex":0.002036708,"about_ca_system_score_gemma":0.0017046933,"threshold_uncertainty_score":0.019423783},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.048555885,0.00016360066,0.94716066,0.00034846712,0.00006173538,0.000048999893,0.000085222615,0.0011742308,0.0024011463],"genre_scores_gemma":[0.7492532,0.0002811322,0.24497858,0.00018095416,0.000096124924,0.0001227596,0.0003365681,0.000413275,0.0043374817],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9949202,0.0013720478,0.0005182018,0.0008533375,0.0015816108,0.0007546418],"domain_scores_gemma":[0.97023624,0.023252334,0.0013132446,0.0028533186,0.0016670806,0.00067789323],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0054234215,0.0007975237,0.0011010976,0.0013358747,0.0018259916,0.0044673556,0.0026726325,0.0022333653,0.003952887],"category_scores_gemma":[0.021467932,0.0011350731,0.0018805653,0.0013271398,0.0052578314,0.011784377,0.006096507,0.004820574,0.00048417455],"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.00021706315,0.000070311595,0.0013921225,0.00027691433,0.000056370423,0.0011769234,0.0013918782,0.092409655,0.009243797,0.8687634,0.0007308917,0.024270631],"study_design_scores_gemma":[0.00003178613,0.000021054879,0.00008057624,0.00003348526,0.00003964258,0.00010946607,0.000113578266,0.15303573,0.0064069363,0.8385032,0.0016010851,0.000023534469],"about_ca_topic_score_codex":0.0021660721,"about_ca_topic_score_gemma":0.002553871,"teacher_disagreement_score":0.0054234215,"about_ca_system_score_codex":0.0017791044,"about_ca_system_score_gemma":0.0021873333,"threshold_uncertainty_score":0.028682172},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027812429,0.000093687675,0.9694462,0.00010891503,0.000024997953,0.000021725164,0.000041367955,0.00028985733,0.0021608358],"genre_scores_gemma":[0.66927516,0.00017009041,0.32523808,0.00011068754,0.000050857718,0.00012333589,0.00023131867,0.00019606548,0.0046043983],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99778867,0.00077793153,0.00013914437,0.00044724703,0.00068845233,0.00015854364],"domain_scores_gemma":[0.99758995,0.001114629,0.00016562566,0.00051094976,0.00054032047,0.00007859214],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014629798,0.0005126482,0.00069572724,0.00093979615,0.0004916213,0.0015811273,0.001069437,0.00062532525,0.0027826233],"category_scores_gemma":[0.00620173,0.00035258647,0.00083998486,0.00071711105,0.0020486787,0.0020391732,0.0014414026,0.0012539946,0.00049504754],"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.00007872044,0.0000318617,0.0005216187,0.000081055245,0.00003329897,0.0000623034,0.00019505284,0.12137208,0.0066037937,0.82889485,0.0006977062,0.041427687],"study_design_scores_gemma":[0.0000066316256,0.000028533,0.00007091018,0.000016622436,0.0000067613137,0.000026154104,0.000035286754,0.5621905,0.0046267505,0.43164492,0.0013362262,0.00001071367],"about_ca_topic_score_codex":0.0010388809,"about_ca_topic_score_gemma":0.0011791162,"teacher_disagreement_score":0.0027826233,"about_ca_system_score_codex":0.001149911,"about_ca_system_score_gemma":0.00077225117,"threshold_uncertainty_score":0.009308755},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017713698,0.00008304088,0.99546117,0.000054672637,0.000035496825,0.000040970215,0.000050646886,0.0010611123,0.0014414908],"genre_scores_gemma":[0.12770426,0.00030977337,0.86753625,0.00011303673,0.00007690071,0.00016724491,0.0003384971,0.0007028775,0.003051196],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99733824,0.0005454905,0.00017304916,0.00044304135,0.0012119778,0.00028809792],"domain_scores_gemma":[0.99548316,0.0028059627,0.00028804073,0.0009352727,0.00042934174,0.000058204558],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022708718,0.0011762629,0.001271198,0.0021544336,0.00086617656,0.0022115717,0.003106401,0.0012065426,0.006790193],"category_scores_gemma":[0.0066479202,0.0009287941,0.0026842018,0.0014780648,0.002377858,0.0041521783,0.0021488788,0.002311422,0.0013502712],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011214319,0.0003147402,0.0010547978,0.0005768738,0.00012586445,0.00043407085,0.00027788442,0.2091108,0.027035462,0.5134761,0.0050205607,0.24246079],"study_design_scores_gemma":[0.00003738582,0.000058654885,0.00023316588,0.00008201856,0.000088706634,0.00029562702,0.00003099949,0.5803588,0.01784306,0.39180288,0.009133062,0.0000356313],"about_ca_topic_score_codex":0.0018445802,"about_ca_topic_score_gemma":0.0022766448,"teacher_disagreement_score":0.006790193,"about_ca_system_score_codex":0.0013568127,"about_ca_system_score_gemma":0.0020465448,"threshold_uncertainty_score":0.02271545},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0053256424,0.00024952425,0.9901945,0.00009187963,0.00007738686,0.000056175708,0.00005993896,0.0006634132,0.0032815961],"genre_scores_gemma":[0.3701069,0.0008939705,0.61520064,0.00021528688,0.0001368628,0.00023599931,0.00036200797,0.00042983217,0.012418522],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991652,0.0001643691,0.000051532472,0.00012379953,0.00040444345,0.00009056849],"domain_scores_gemma":[0.99916005,0.00036809008,0.00004281755,0.00026985237,0.00013739851,0.000021775704],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008267337,0.00067440997,0.00069856615,0.0008739654,0.0005754763,0.00079836545,0.0011080655,0.00037584093,0.0043572555],"category_scores_gemma":[0.0013771016,0.0004736346,0.0016103175,0.00058134866,0.0008387575,0.0012983134,0.00091847277,0.0020870962,0.0009615115],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034609175,0.0002266285,0.00044479192,0.00085049344,0.00016841656,0.0006029254,0.00049436366,0.12084923,0.10044508,0.51108027,0.0054346356,0.25905702],"study_design_scores_gemma":[0.00016148231,0.0003373817,0.0004827378,0.00009871536,0.00027070628,0.00071994396,0.00010170721,0.5127249,0.13174285,0.3123645,0.040889967,0.00010511083],"about_ca_topic_score_codex":0.001510791,"about_ca_topic_score_gemma":0.0023694097,"teacher_disagreement_score":0.0043572555,"about_ca_system_score_codex":0.0006922639,"about_ca_system_score_gemma":0.0012761621,"threshold_uncertainty_score":0.014576435},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023176994,0.00033553195,0.9556727,0.0005391752,0.00007491294,0.0003921906,0.00017441931,0.0010498357,0.018584264],"genre_scores_gemma":[0.34997156,0.00048887334,0.6368597,0.00041830228,0.00006169312,0.0008463884,0.0005342734,0.0003297006,0.010489555],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99755305,0.00079476763,0.00021497758,0.0005149186,0.0006151477,0.0003071548],"domain_scores_gemma":[0.99759513,0.0018821781,0.00012926494,0.0001502023,0.00016741149,0.00007574927],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017292522,0.0012831123,0.0009512305,0.00095720997,0.0008298308,0.0023300769,0.0013424634,0.0011203395,0.008235074],"category_scores_gemma":[0.00675634,0.0006575051,0.0020614746,0.00070152327,0.0027276897,0.0028229859,0.0021090184,0.0022962093,0.0011959255],"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.00016246499,0.00014638362,0.0004509195,0.00053010136,0.000066580375,0.00019965951,0.0006599389,0.112936035,0.006155251,0.8064868,0.001975705,0.07023017],"study_design_scores_gemma":[0.0001327246,0.0001185035,0.000098108976,0.000097834745,0.000057358895,0.000077508,0.00018222937,0.25061917,0.005858969,0.7337814,0.008943558,0.000032561347],"about_ca_topic_score_codex":0.002385544,"about_ca_topic_score_gemma":0.0032643264,"teacher_disagreement_score":0.008235074,"about_ca_system_score_codex":0.002458642,"about_ca_system_score_gemma":0.0020348858,"threshold_uncertainty_score":0.027549028},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15535094,0.00027117776,0.8340315,0.00021650793,0.0000277155,0.0003164758,0.0019686369,0.006683147,0.0011338623],"genre_scores_gemma":[0.6731004,0.00025118972,0.3182347,0.00006568692,0.000027931137,0.00030294264,0.0066951322,0.00043754402,0.0008845134],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976719,0.0004185232,0.00025190582,0.0004781714,0.0010040869,0.00017532893],"domain_scores_gemma":[0.9887593,0.007049199,0.0010818332,0.0013211193,0.0016278508,0.000160731],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015406734,0.0009872551,0.0006977451,0.0021449132,0.00033855086,0.00094643567,0.0012244951,0.000700998,0.0009318916],"category_scores_gemma":[0.016734138,0.00048593592,0.0012973766,0.0013390004,0.0005861,0.0014144233,0.0007096809,0.00076853315,0.00042705238],"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.00063436304,0.00037812506,0.039691105,0.0013286907,0.00032851228,0.002137399,0.0007836435,0.51541156,0.057465937,0.024990553,0.003917078,0.35293293],"study_design_scores_gemma":[0.00003467397,0.0000996154,0.0015692204,0.000029553075,0.00004574782,0.00022254806,0.00013007272,0.9584115,0.022438295,0.015268287,0.0017313763,0.000019117291],"about_ca_topic_score_codex":0.005201802,"about_ca_topic_score_gemma":0.0070325136,"teacher_disagreement_score":0.005201802,"about_ca_system_score_codex":0.000618058,"about_ca_system_score_gemma":0.0022484974,"threshold_uncertainty_score":0.010343075},"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":"commentary","genre_gemma":"commentary","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"commentary","genre_consensus":"commentary","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010606488,0.007943995,0.042141974,0.755149,0.14864759,0.00013078687,0.00040108696,0.0021596064,0.032819517],"genre_scores_gemma":[0.15949076,0.0065244525,0.02696047,0.51680547,0.060858347,0.00036888002,0.0008016199,0.0070531555,0.22113693],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.97455627,0.011311423,0.0010172758,0.002865597,0.008507691,0.001741745],"domain_scores_gemma":[0.9116257,0.043445732,0.003372791,0.0032548746,0.029584734,0.008716164],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.023507252,0.001227443,0.0005688106,0.0010791206,0.006433468,0.0096608,0.0019676462,0.012466596,0.020541243],"category_scores_gemma":[0.1181499,0.00065677863,0.0011973076,0.0011043898,0.004401216,0.0131745655,0.0043825633,0.016904958,0.011036473],"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.00020028009,0.00007501055,0.0018095912,0.0004383084,0.000038512975,0.0017668,0.017913867,0.00038682317,0.003662328,0.019010762,0.8904192,0.06427853],"study_design_scores_gemma":[0.000014674658,0.00009521325,0.00036962784,0.0003151005,0.000016592574,0.0006872792,0.009123472,0.0003016967,0.0012845377,0.003287546,0.98439354,0.00011060857],"about_ca_topic_score_codex":0.0019624524,"about_ca_topic_score_gemma":0.0025206844,"teacher_disagreement_score":0.023507252,"about_ca_system_score_codex":0.0030765028,"about_ca_system_score_gemma":0.002358452,"threshold_uncertainty_score":0.12431973},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14624931,0.0010605801,0.8223335,0.0009744574,0.00025778392,0.0003529034,0.00043997006,0.018489351,0.009842088],"genre_scores_gemma":[0.52432543,0.00030106583,0.4701031,0.00039218596,0.000065790846,0.00027939267,0.0008623962,0.0009375665,0.0027329715],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99736685,0.0008947984,0.00019137708,0.00042704525,0.00074331136,0.00037658212],"domain_scores_gemma":[0.98932916,0.005336556,0.00080979685,0.0032252944,0.0010317778,0.00026736807],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002452307,0.0014223108,0.0011485323,0.001633613,0.0008231339,0.001579961,0.0040435814,0.0010233456,0.009236298],"category_scores_gemma":[0.018919913,0.0011283101,0.0011623717,0.0018507597,0.0014129754,0.004698896,0.004284681,0.0028035212,0.001883764],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018865684,0.0004549293,0.007873099,0.0010097211,0.00021158466,0.00039029086,0.0006555647,0.14542764,0.058715243,0.06520959,0.0144136315,0.70375216],"study_design_scores_gemma":[0.0004011214,0.00069239613,0.00095395965,0.00010628927,0.00019801928,0.00024284396,0.00019969573,0.82776606,0.07753012,0.08024389,0.011591158,0.00007436225],"about_ca_topic_score_codex":0.00239424,"about_ca_topic_score_gemma":0.0053341277,"teacher_disagreement_score":0.009236298,"about_ca_system_score_codex":0.0011302114,"about_ca_system_score_gemma":0.0029755405,"threshold_uncertainty_score":0.030898511},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.111812264,0.00016291128,0.8847812,0.0001451937,0.00002085149,0.000058511083,0.00014328443,0.0013597165,0.0015161134],"genre_scores_gemma":[0.95843583,0.00011321665,0.040651545,0.000040791707,0.000012297493,0.00008089261,0.000119356504,0.000066081906,0.00048000272],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970144,0.0006815643,0.00016468299,0.00051028654,0.001299124,0.0003298946],"domain_scores_gemma":[0.99241006,0.004599003,0.0008822675,0.0010143453,0.0010121412,0.00008217008],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025972938,0.00055053947,0.00062580104,0.00077628,0.00042827215,0.00097461656,0.001241056,0.0004970801,0.0008729967],"category_scores_gemma":[0.008078378,0.00040415482,0.0013448482,0.00046352213,0.0013030085,0.0014890947,0.00101013,0.0009310751,0.00011705321],"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.00023701407,0.00007523221,0.007173374,0.00022890574,0.00014512386,0.00046355455,0.00024504523,0.88327,0.02365607,0.058524717,0.00045221532,0.025528723],"study_design_scores_gemma":[0.000012389854,0.00003296782,0.00036012926,0.000007697982,0.000021986218,0.00004574824,0.000009235685,0.9843961,0.0059561953,0.00890591,0.00024475117,0.0000069452612],"about_ca_topic_score_codex":0.008644199,"about_ca_topic_score_gemma":0.0054468154,"teacher_disagreement_score":0.008644199,"about_ca_system_score_codex":0.0010063952,"about_ca_system_score_gemma":0.0028941857,"threshold_uncertainty_score":0.017187774},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03118384,0.00026809538,0.93628365,0.00033441558,0.0001243827,0.00025338595,0.0012576755,0.003576554,0.02671806],"genre_scores_gemma":[0.14369696,0.0001946229,0.8395204,0.00023260458,0.00004763244,0.00031028394,0.0026347274,0.0006320804,0.012730616],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993259,0.00013138143,0.00005152513,0.00015251504,0.00024965408,0.00008894359],"domain_scores_gemma":[0.99841154,0.00078656385,0.00014014842,0.00026580412,0.0003228827,0.00007295163],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005297152,0.0009856222,0.0005495944,0.0019255549,0.0010170422,0.0015621225,0.0012112729,0.0006618548,0.016047651],"category_scores_gemma":[0.0040020836,0.00044307168,0.0008247929,0.001828828,0.00086300203,0.002697804,0.0013029726,0.0012230072,0.0042036646],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040006396,0.0002665153,0.0036611746,0.0008202339,0.000119385724,0.0005358519,0.0004963488,0.04801679,0.027755918,0.42967138,0.032227654,0.45602882],"study_design_scores_gemma":[0.00010802273,0.00021572193,0.0008517505,0.0001629041,0.00009326567,0.00071068306,0.00033317163,0.42010602,0.041224927,0.46439853,0.07169726,0.00009775873],"about_ca_topic_score_codex":0.0019886694,"about_ca_topic_score_gemma":0.007185588,"teacher_disagreement_score":0.016047651,"about_ca_system_score_codex":0.0008351834,"about_ca_system_score_gemma":0.0023731706,"threshold_uncertainty_score":0.05368477},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0040163677,0.00002595032,0.99474066,0.0000175809,0.0000056874096,0.000017886052,0.0000135684,0.00015894361,0.0010035223],"genre_scores_gemma":[0.5791766,0.00016439566,0.41821867,0.000047310874,0.000020071086,0.00025506705,0.00014516419,0.00014473469,0.0018279183],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991805,0.00015602012,0.000053509404,0.00014306782,0.00039794768,0.00006892651],"domain_scores_gemma":[0.99910957,0.0005098318,0.00011112968,0.00011928842,0.00012847857,0.000021619706],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011251159,0.00066709734,0.00053020316,0.00040326198,0.0003442977,0.00086559035,0.0008405029,0.00050993677,0.001905761],"category_scores_gemma":[0.002625301,0.000326339,0.00094251626,0.00025258883,0.0011902194,0.00089600787,0.0010188721,0.0011264066,0.00029365966],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010012953,0.000029029905,0.0002542437,0.00014853469,0.000026688467,0.00007761533,0.00025975218,0.7399797,0.014030428,0.18497233,0.00049207476,0.059629485],"study_design_scores_gemma":[0.000029835268,0.000067569395,0.000054810447,0.000021588341,0.0000133010535,0.000024422818,0.000020195159,0.9561229,0.0067210267,0.0348861,0.0020266925,0.000011543532],"about_ca_topic_score_codex":0.0017027493,"about_ca_topic_score_gemma":0.0012960457,"teacher_disagreement_score":0.001905761,"about_ca_system_score_codex":0.0007471086,"about_ca_system_score_gemma":0.0012706624,"threshold_uncertainty_score":0.006375432},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007577644,0.0012180944,0.65512824,0.0013969283,0.0012884672,0.0004951655,0.0043615024,0.043304052,0.28522998],"genre_scores_gemma":[0.26389048,0.0021828227,0.46797812,0.0023277546,0.0009814003,0.0010673201,0.018781565,0.0118634505,0.23092707],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968449,0.0004110489,0.0002441758,0.0006520882,0.0015281105,0.00031970264],"domain_scores_gemma":[0.9971507,0.0005626062,0.00019766905,0.0010219734,0.0009277422,0.00013928713],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016630033,0.0009375929,0.0006423524,0.0015523694,0.0008685196,0.0023295737,0.0019406307,0.0010811399,0.08135264],"category_scores_gemma":[0.006616628,0.00040821277,0.000999237,0.00076084817,0.0009786274,0.0023668502,0.0026716145,0.0013655059,0.04094497],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004374009,0.00010348629,0.0009200531,0.000775136,0.000049035254,0.00049404457,0.00027400107,0.017752133,0.011051674,0.34845093,0.12429873,0.4953933],"study_design_scores_gemma":[0.00006647428,0.00013430095,0.00035283575,0.00019601127,0.000033012897,0.00051041757,0.00008296933,0.03839113,0.013166015,0.07136198,0.8756459,0.000058971687],"about_ca_topic_score_codex":0.0016172396,"about_ca_topic_score_gemma":0.0015750808,"teacher_disagreement_score":0.08135264,"about_ca_system_score_codex":0.0010004343,"about_ca_system_score_gemma":0.0016754238,"threshold_uncertainty_score":0},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015319274,0.00013032513,0.97874326,0.000600621,0.00006066754,0.00011543602,0.0002852759,0.0019139006,0.0028311769],"genre_scores_gemma":[0.19648191,0.00022733603,0.7992312,0.00036321353,0.00010662325,0.00023388148,0.0009282416,0.0004312165,0.0019963568],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9927164,0.0022573946,0.00058995606,0.0013080811,0.00248422,0.0006440747],"domain_scores_gemma":[0.98598075,0.010838269,0.0008811182,0.001249092,0.00075884187,0.00029195007],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0059781508,0.0011686044,0.0013326153,0.0019630988,0.0017891276,0.004468316,0.0031189185,0.0019685933,0.005039737],"category_scores_gemma":[0.021844206,0.0011015047,0.0042433436,0.002452202,0.0037558957,0.00764404,0.005563949,0.0034565018,0.00096683175],"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.00036290623,0.00022072431,0.0024366113,0.00080168137,0.00020759446,0.0011244001,0.0011507877,0.35975844,0.011300357,0.5041411,0.0075343973,0.110961],"study_design_scores_gemma":[0.00006557319,0.000040446426,0.00020262288,0.00007360677,0.00007668769,0.00021308352,0.00021244002,0.6205233,0.013660999,0.35562867,0.009258819,0.000043780878],"about_ca_topic_score_codex":0.008148252,"about_ca_topic_score_gemma":0.01206907,"teacher_disagreement_score":0.008148252,"about_ca_system_score_codex":0.003003826,"about_ca_system_score_gemma":0.004250946,"threshold_uncertainty_score":0.031615853},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014120887,0.0024979543,0.95984054,0.00031568084,0.00030008072,0.00005820299,0.00028933107,0.002128784,0.03315731],"genre_scores_gemma":[0.1708786,0.008200415,0.7676312,0.0004743604,0.00023743128,0.00042407512,0.0021934747,0.0018599557,0.048100572],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99845695,0.00025510226,0.00008455959,0.00016251499,0.00095682155,0.00008411281],"domain_scores_gemma":[0.9987565,0.00073490903,0.00004015183,0.00024943502,0.00020100245,0.000018029645],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008428399,0.0014502613,0.0012477047,0.0018749883,0.0006373446,0.002269962,0.0019791487,0.0009310281,0.0141948275],"category_scores_gemma":[0.0032651005,0.0011803203,0.0016755571,0.0019402547,0.0019557462,0.0023877488,0.0018201405,0.0029070142,0.0043377765],"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.000119317425,0.00005915339,0.00017551475,0.0009863441,0.00007267226,0.00009317386,0.0001233547,0.09714177,0.004570754,0.5524525,0.017499365,0.3267061],"study_design_scores_gemma":[0.000057603876,0.000026671436,0.00009929792,0.00033147793,0.000051842922,0.00012475706,0.000022838738,0.31597653,0.009894778,0.60128474,0.07208943,0.000040022496],"about_ca_topic_score_codex":0.0027442586,"about_ca_topic_score_gemma":0.0034201937,"teacher_disagreement_score":0.0141948275,"about_ca_system_score_codex":0.002106137,"about_ca_system_score_gemma":0.0018180315,"threshold_uncertainty_score":0.047486365},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07075061,0.03541955,0.48055977,0.103833795,0.008797381,0.00014308943,0.0006875554,0.002469906,0.29733837],"genre_scores_gemma":[0.8899178,0.009033897,0.040775176,0.0065197274,0.00296873,0.00017766682,0.00036820862,0.00082268496,0.049416125],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99713266,0.0010604712,0.0001672884,0.00048386471,0.00080502155,0.00035072395],"domain_scores_gemma":[0.9919041,0.00429845,0.00047320273,0.0017249491,0.0012412807,0.0003580267],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0058853915,0.0007688704,0.0010490448,0.0010187542,0.0019048841,0.0032618062,0.0011656453,0.0023418174,0.012230901],"category_scores_gemma":[0.017582038,0.00036795088,0.00076750084,0.00091347063,0.0071176165,0.010926166,0.003047916,0.0029828616,0.0028689422],"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.00026588078,0.000041091975,0.00083045405,0.00046063217,0.000078855934,0.000046245295,0.00028054928,0.0050599263,0.0021139733,0.8663341,0.017239263,0.10724905],"study_design_scores_gemma":[0.000016492717,0.000050454863,0.00017462138,0.000096445474,0.000023790815,0.000039378843,0.00015834722,0.0024384225,0.0019377681,0.97801584,0.01703214,0.000016200147],"about_ca_topic_score_codex":0.0008341677,"about_ca_topic_score_gemma":0.00078777556,"teacher_disagreement_score":0.012230901,"about_ca_system_score_codex":0.0012922622,"about_ca_system_score_gemma":0.0010981167,"threshold_uncertainty_score":0.040916443},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006608965,0.00015966858,0.97840923,0.0005342416,0.00004681662,0.00012170843,0.00010058326,0.0003732737,0.0136455],"genre_scores_gemma":[0.48911095,0.00068238756,0.49852398,0.0006778894,0.00015399817,0.0011331708,0.0005565476,0.00045271238,0.008708373],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99633765,0.001238568,0.0002345493,0.0005151048,0.0013825706,0.0002916442],"domain_scores_gemma":[0.995203,0.0034485515,0.00032699137,0.00053841574,0.000375849,0.00010719001],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024681322,0.0009846915,0.00058503705,0.0009346624,0.0008920357,0.0025056014,0.0012996689,0.0010249662,0.0049194423],"category_scores_gemma":[0.0083807865,0.00062553387,0.001849402,0.0004871705,0.0050709667,0.0036826844,0.0023349538,0.0035337717,0.00088033447],"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.00007357261,0.00006569683,0.00020254198,0.0001740289,0.000037871247,0.0001708653,0.0002877615,0.08534306,0.004068504,0.8841219,0.00095365563,0.024500595],"study_design_scores_gemma":[0.000039343395,0.000041870288,0.00007751938,0.000053845633,0.000036066293,0.00006128137,0.00006377008,0.17373498,0.0060194163,0.8119021,0.007951428,0.00001837619],"about_ca_topic_score_codex":0.0031964823,"about_ca_topic_score_gemma":0.0031397748,"teacher_disagreement_score":0.0049194423,"about_ca_system_score_codex":0.0020196799,"about_ca_system_score_gemma":0.0025429574,"threshold_uncertainty_score":0.01645714},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006162268,0.00015609096,0.98601425,0.00015547086,0.000058995505,0.000075873046,0.000078844794,0.0015146605,0.00578351],"genre_scores_gemma":[0.18232319,0.0003664947,0.8144006,0.00013090011,0.00005191793,0.00032172538,0.00030344358,0.0005027882,0.0015988935],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988967,0.00041886602,0.00007338995,0.0001643552,0.00033170125,0.00011489172],"domain_scores_gemma":[0.9981129,0.0012919204,0.00017024338,0.00023410251,0.00015474766,0.00003601683],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011325506,0.0011145597,0.0006301993,0.00067394157,0.00041258294,0.0012208045,0.0007833642,0.0005822318,0.003995216],"category_scores_gemma":[0.0050749956,0.00069558405,0.0008033917,0.00075027643,0.0009879072,0.0010409154,0.0012817846,0.0016162421,0.0007904793],"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.000067782916,0.00006516718,0.00034956288,0.0002654563,0.000028092383,0.00012826323,0.000083478,0.859787,0.002580907,0.049934015,0.0024953939,0.08421494],"study_design_scores_gemma":[0.000016137927,0.000035877314,0.00005057824,0.00004742427,0.000012530197,0.000034790966,0.000026011125,0.96430224,0.0029828574,0.027863538,0.004620312,0.000007604922],"about_ca_topic_score_codex":0.0016659907,"about_ca_topic_score_gemma":0.0024974619,"teacher_disagreement_score":0.003995216,"about_ca_system_score_codex":0.00071444217,"about_ca_system_score_gemma":0.0017249195,"threshold_uncertainty_score":0.013365328},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002350124,0.00044621044,0.9841988,0.0004583433,0.00010007831,0.00015130363,0.00019026331,0.0011664291,0.010938436],"genre_scores_gemma":[0.16307835,0.0013692906,0.82496905,0.00060674094,0.000120516546,0.0008537422,0.0010262023,0.0008548939,0.0071212226],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99724966,0.0009769473,0.0002185951,0.0003908275,0.0009791102,0.00018486526],"domain_scores_gemma":[0.99463487,0.0036439034,0.0002979759,0.00082174287,0.0004999962,0.00010148868],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024950777,0.0010578961,0.0005316161,0.0007879096,0.00068614754,0.0025683492,0.0015736776,0.0011141878,0.0057981927],"category_scores_gemma":[0.008872671,0.0005287741,0.0014169457,0.0009959798,0.0029667825,0.0023184526,0.001862954,0.002312405,0.0014461868],"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.00006967931,0.00007630766,0.00036455176,0.0005999936,0.000046547906,0.00035060055,0.00041204505,0.23420374,0.006205636,0.67386,0.0044273213,0.07938354],"study_design_scores_gemma":[0.000054948734,0.000059847538,0.00008295104,0.00021915926,0.00005003039,0.00011221231,0.00009560599,0.38306868,0.010686052,0.5647489,0.040790714,0.000030945088],"about_ca_topic_score_codex":0.0033999665,"about_ca_topic_score_gemma":0.0046465653,"teacher_disagreement_score":0.0057981927,"about_ca_system_score_codex":0.0023568347,"about_ca_system_score_gemma":0.0031536538,"threshold_uncertainty_score":0.019396901},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015246108,0.00048152957,0.9661171,0.0004788634,0.00011862584,0.00013698486,0.00024014963,0.0016868149,0.015493875],"genre_scores_gemma":[0.27756402,0.00077916577,0.7014554,0.00023552525,0.00020538243,0.0005469218,0.0013951128,0.0011602973,0.01665814],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9964987,0.00088322564,0.00026634664,0.00048728925,0.0015281262,0.0003363101],"domain_scores_gemma":[0.9903223,0.00676066,0.00025624534,0.0019383344,0.0005487523,0.00017369608],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027851427,0.0013075573,0.0016930494,0.0022192209,0.0017160443,0.004512296,0.005025213,0.0018592203,0.018003218],"category_scores_gemma":[0.015780458,0.0013851646,0.0023815935,0.0039521432,0.0025843473,0.011410908,0.0063167857,0.007465737,0.002967934],"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.00022838767,0.00013076271,0.00026292953,0.00033802184,0.000048499965,0.000042110263,0.00039879957,0.018652238,0.0017363834,0.80308527,0.0045495243,0.17052695],"study_design_scores_gemma":[0.00004791441,0.000026321719,0.000059323585,0.00006907418,0.000033784094,0.000030640404,0.00005009831,0.09154819,0.002166618,0.90193063,0.004022483,0.000014828111],"about_ca_topic_score_codex":0.0009577272,"about_ca_topic_score_gemma":0.0017152816,"teacher_disagreement_score":0.018003218,"about_ca_system_score_codex":0.0028886348,"about_ca_system_score_gemma":0.0021532462,"threshold_uncertainty_score":0.060226798},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03014257,0.0010728233,0.93161994,0.0013720532,0.00026876398,0.00016980147,0.0002832445,0.0019615423,0.033109255],"genre_scores_gemma":[0.4408426,0.0011056903,0.5434531,0.0007915301,0.00029647737,0.00052245945,0.00094868825,0.0015722057,0.010467238],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9956086,0.0014643795,0.00016669885,0.0005765624,0.0017111247,0.0004725916],"domain_scores_gemma":[0.99043536,0.0066026496,0.0004853665,0.0016459262,0.0006480969,0.00018260287],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027279996,0.0013127483,0.00095841044,0.001623174,0.0010437702,0.0020024898,0.00293899,0.0013104472,0.014415867],"category_scores_gemma":[0.020569738,0.0007520459,0.0019419194,0.0014994072,0.0023149466,0.0040338705,0.0028734761,0.004949099,0.0017292111],"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.00018632649,0.00013660907,0.0007180277,0.0006047357,0.00010100009,0.00022166866,0.00030151935,0.17856742,0.006859356,0.6736135,0.012300372,0.12638943],"study_design_scores_gemma":[0.00006999246,0.00014478162,0.00030380063,0.00019969117,0.0000865849,0.00019372665,0.00008087072,0.4445041,0.008662719,0.5237946,0.021903338,0.000055671768],"about_ca_topic_score_codex":0.0019515752,"about_ca_topic_score_gemma":0.0027752526,"teacher_disagreement_score":0.014415867,"about_ca_system_score_codex":0.0024053461,"about_ca_system_score_gemma":0.0020436407,"threshold_uncertainty_score":0.04822588},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1877347,0.000134785,0.779226,0.0008476727,0.00037553813,0.0005639813,0.0020539865,0.020186836,0.008876539],"genre_scores_gemma":[0.87915826,0.000050203103,0.11283271,0.00032559937,0.00006323962,0.00022579692,0.0017071123,0.0009327982,0.0047043157],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98397195,0.003932531,0.0012948165,0.0029189228,0.0059588775,0.001922878],"domain_scores_gemma":[0.9493131,0.027015222,0.004214234,0.009381511,0.009030641,0.0010453601],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011106716,0.0010957004,0.0007300646,0.0013453901,0.0011357925,0.0038225385,0.003245621,0.0017185074,0.011086737],"category_scores_gemma":[0.04448408,0.00078906247,0.0024120398,0.00062938087,0.0035646392,0.0042213164,0.0044193305,0.0015409742,0.0021549147],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.004817702,0.001377105,0.121853895,0.003123878,0.00091023516,0.009054914,0.0058923867,0.19297983,0.07813426,0.34746343,0.023919307,0.21047308],"study_design_scores_gemma":[0.0009268522,0.0019341989,0.006030044,0.00025767548,0.0005382711,0.002892549,0.0010002832,0.59488815,0.19947499,0.1550155,0.03665973,0.00038175634],"about_ca_topic_score_codex":0.0077246646,"about_ca_topic_score_gemma":0.0066996003,"teacher_disagreement_score":0.011106716,"about_ca_system_score_codex":0.0017595842,"about_ca_system_score_gemma":0.0052444804,"threshold_uncertainty_score":0.05873865},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011981572,0.0001244672,0.85428977,0.00015662641,0.00009801486,0.000102697246,0.000740048,0.13755386,0.0057363757],"genre_scores_gemma":[0.14251369,0.000817865,0.7474977,0.0012083976,0.00022207283,0.0013682849,0.0066732597,0.0753451,0.024353689],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99846137,0.0004295626,0.0001796591,0.00024840832,0.00053590175,0.00014517912],"domain_scores_gemma":[0.9972133,0.0015704395,0.00021425217,0.0005406277,0.00032852517,0.00013282493],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020585016,0.0015925673,0.0009427269,0.0013794354,0.0004860235,0.002000105,0.002200958,0.001515064,0.03499686],"category_scores_gemma":[0.0067092604,0.00093330676,0.0015902505,0.0007616912,0.0011422117,0.0023638457,0.0026025057,0.00202288,0.01561243],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015386343,0.0003412351,0.0019135543,0.0024373592,0.00033218734,0.0022478777,0.0010071598,0.06344321,0.072395794,0.16703503,0.18132173,0.5059863],"study_design_scores_gemma":[0.00070513494,0.00023187323,0.00037066577,0.00030283345,0.00012946858,0.0010936399,0.00013034757,0.47550726,0.07895726,0.13938485,0.30301595,0.00017079065],"about_ca_topic_score_codex":0.00087070046,"about_ca_topic_score_gemma":0.0008958704,"teacher_disagreement_score":0.03499686,"about_ca_system_score_codex":0.00070260983,"about_ca_system_score_gemma":0.0014649531,"threshold_uncertainty_score":0.11707616},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7402136,0.007564364,0.2265211,0.0024232387,0.00020136902,0.00037992306,0.002132265,0.0030454297,0.017518666],"genre_scores_gemma":[0.9371627,0.00062838994,0.05807474,0.00028747873,0.00006792944,0.00018539492,0.0019478356,0.0006600843,0.0009854315],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98469144,0.0100569,0.00061239145,0.0017171585,0.00214503,0.00077704695],"domain_scores_gemma":[0.7480024,0.22354658,0.0064863632,0.016101705,0.0043040514,0.0015588107],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.020586228,0.0014940233,0.0011544323,0.0024700877,0.0010105054,0.0029269962,0.0019708234,0.0019487351,0.0035143995],"category_scores_gemma":[0.13938643,0.0006117524,0.00089963374,0.0031698626,0.0023900396,0.006441351,0.0015197585,0.004146618,0.00069708546],"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.0019991293,0.00093214074,0.084680244,0.00095324387,0.0007893935,0.00026894466,0.0009135645,0.67916983,0.003447696,0.042467706,0.015001907,0.16937612],"study_design_scores_gemma":[0.00027692787,0.0008786694,0.010819146,0.00015783087,0.00016335737,0.00039377218,0.00054356497,0.9195613,0.0048505855,0.056208313,0.0060738404,0.0000726413],"about_ca_topic_score_codex":0.0020148742,"about_ca_topic_score_gemma":0.0030723363,"teacher_disagreement_score":0.020586228,"about_ca_system_score_codex":0.0022786323,"about_ca_system_score_gemma":0.0016012272,"threshold_uncertainty_score":0.10887164},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08774035,0.00013520215,0.90781957,0.00035606636,0.000028242535,0.00012187489,0.00021131159,0.0009948496,0.0025925215],"genre_scores_gemma":[0.86956155,0.0001354365,0.12887596,0.0000712652,0.000031238866,0.00016950759,0.00029505976,0.00011100718,0.00074908213],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99090236,0.0038884878,0.0006691425,0.001288568,0.0025667422,0.0006846079],"domain_scores_gemma":[0.9724777,0.019113066,0.0017651756,0.0039564497,0.0022938666,0.00039378635],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0059354594,0.0006072677,0.00088564586,0.0009210211,0.0007208037,0.0021504038,0.0018396308,0.00095219223,0.0027749809],"category_scores_gemma":[0.02515253,0.0006430252,0.0017615947,0.00090072816,0.002454738,0.0059979097,0.0028505547,0.0018908465,0.00024879046],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00045469517,0.00016401114,0.0024678712,0.00035888123,0.00015806586,0.0007657254,0.00043738744,0.31251886,0.02819072,0.61117756,0.0009081727,0.042397935],"study_design_scores_gemma":[0.000056578476,0.00008483195,0.0003007165,0.000042754942,0.000034521072,0.00010673299,0.000061002072,0.76187986,0.016204389,0.21925864,0.0019447351,0.000025298195],"about_ca_topic_score_codex":0.002052786,"about_ca_topic_score_gemma":0.0013926731,"teacher_disagreement_score":0.0059354594,"about_ca_system_score_codex":0.001968731,"about_ca_system_score_gemma":0.0024537223,"threshold_uncertainty_score":0.03139007},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041463684,0.00025217803,0.9477977,0.00043806096,0.00010617907,0.0003079213,0.00051592203,0.004764958,0.004353427],"genre_scores_gemma":[0.25010705,0.00016714209,0.7430402,0.00024383939,0.00006654346,0.0003344125,0.0018459182,0.0009776076,0.003217264],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9933996,0.0010601678,0.0006815093,0.002492401,0.0017367668,0.0006295727],"domain_scores_gemma":[0.9807726,0.01368834,0.00091301254,0.002513965,0.0016073855,0.00050473417],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028900565,0.0017820055,0.0019331503,0.0018006499,0.0016915174,0.0033124024,0.0026157124,0.0025702799,0.01040638],"category_scores_gemma":[0.023608094,0.00096467946,0.0029651385,0.0013513402,0.0022066222,0.0076995147,0.00453204,0.0038009176,0.0025913294],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0020200345,0.00058996404,0.0051863617,0.0013060439,0.00028135825,0.000521818,0.000842691,0.16807762,0.046929523,0.2655193,0.013963703,0.49476156],"study_design_scores_gemma":[0.00019981618,0.00019784641,0.0006081193,0.00008771749,0.00008837883,0.00036746947,0.0002027448,0.59350145,0.03735417,0.36069137,0.0065979008,0.0001030716],"about_ca_topic_score_codex":0.0018217883,"about_ca_topic_score_gemma":0.002588478,"teacher_disagreement_score":0.01040638,"about_ca_system_score_codex":0.0034796656,"about_ca_system_score_gemma":0.0040718373,"threshold_uncertainty_score":0.034812808},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0065887487,0.00006113106,0.9908208,0.000107229025,0.000020285608,0.000045672663,0.00004637943,0.00039431464,0.0019155032],"genre_scores_gemma":[0.4441686,0.00021440761,0.55236167,0.00017453222,0.00003670003,0.00033392964,0.00022187241,0.00039476028,0.0020935552],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99465203,0.0016186489,0.00055516994,0.0007616426,0.0020848499,0.00032767357],"domain_scores_gemma":[0.9817821,0.012458023,0.0013106626,0.002870457,0.0013315438,0.0002472624],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0044245827,0.0009390178,0.0006479204,0.00061884406,0.0005403509,0.0025500862,0.0016706557,0.001065015,0.002487785],"category_scores_gemma":[0.024921972,0.00071000424,0.0011756293,0.0006353623,0.0032003587,0.0033740816,0.0019087527,0.0022346196,0.0005633439],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014898417,0.00008587803,0.00088338496,0.00031069806,0.000065139204,0.00026658262,0.0003537459,0.54312974,0.011084685,0.4022787,0.0005770155,0.040815413],"study_design_scores_gemma":[0.000056613502,0.00008916998,0.00010084183,0.000079031204,0.000053325257,0.000051263334,0.000068317255,0.76330745,0.014844701,0.2175896,0.003735198,0.000024461486],"about_ca_topic_score_codex":0.0020286767,"about_ca_topic_score_gemma":0.0028078305,"teacher_disagreement_score":0.0044245827,"about_ca_system_score_codex":0.0020897177,"about_ca_system_score_gemma":0.0025103707,"threshold_uncertainty_score":0.02339971},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5122638,0.0005488507,0.4666102,0.00042816318,0.00009174669,0.00019123148,0.00069209933,0.0013535573,0.0178204],"genre_scores_gemma":[0.9321264,0.00030278956,0.059068125,0.00012967519,0.000054863176,0.00016624555,0.00065483805,0.00009056189,0.0074064764],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993224,0.00011911624,0.00006151563,0.00021273966,0.00013399217,0.00015021159],"domain_scores_gemma":[0.99830097,0.0009572219,0.00028451474,0.00015415884,0.0001639742,0.00013908948],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053317525,0.0006749883,0.0004516076,0.0006620226,0.00069038686,0.001709495,0.0010018502,0.00055229594,0.004810159],"category_scores_gemma":[0.0022697828,0.00034053338,0.0010777587,0.0006799326,0.0014301213,0.0031279249,0.0016043832,0.0014948843,0.0005461851],"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.00044285296,0.00023077613,0.001964051,0.00035836964,0.00005320896,0.00095184497,0.00085179,0.19932418,0.025757963,0.7356899,0.0009454596,0.033429634],"study_design_scores_gemma":[0.00008067218,0.0002591502,0.000812241,0.000058685724,0.00007463185,0.00028812722,0.0002636059,0.46385977,0.020439913,0.5064095,0.0073876404,0.00006600593],"about_ca_topic_score_codex":0.0026874281,"about_ca_topic_score_gemma":0.0024781607,"teacher_disagreement_score":0.004810159,"about_ca_system_score_codex":0.00114773,"about_ca_system_score_gemma":0.00077046826,"threshold_uncertainty_score":0.016091585},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09472369,0.00027597093,0.89545804,0.00045062925,0.000060798662,0.00015790998,0.0007970469,0.0029521775,0.0051237373],"genre_scores_gemma":[0.9092707,0.00023149788,0.08760918,0.00013227032,0.000035950532,0.00017358772,0.00063910376,0.00013815804,0.0017695641],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99415046,0.0011830311,0.00036272893,0.0011051699,0.002780011,0.00041854888],"domain_scores_gemma":[0.9847232,0.010342071,0.0017591028,0.0011244103,0.0018707595,0.00018040855],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027568005,0.0006610211,0.00058095297,0.001975414,0.0005153688,0.0018265663,0.0010817096,0.0009899301,0.0031986146],"category_scores_gemma":[0.024626015,0.0002671288,0.00081366196,0.0007864689,0.0013102227,0.0017075398,0.001039265,0.00092522346,0.0004771313],"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.0010186827,0.00042607874,0.06479919,0.0013192929,0.0004023798,0.004722038,0.0013247287,0.4447422,0.10681208,0.23170333,0.0046092817,0.13812073],"study_design_scores_gemma":[0.000043630847,0.00016766954,0.0047649043,0.00008908029,0.000080951046,0.00140438,0.00010858926,0.88690555,0.029889926,0.07312827,0.003358252,0.00005883672],"about_ca_topic_score_codex":0.002050523,"about_ca_topic_score_gemma":0.0012137209,"teacher_disagreement_score":0.0031986146,"about_ca_system_score_codex":0.00091119396,"about_ca_system_score_gemma":0.0014431889,"threshold_uncertainty_score":0.0145795345},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06034791,0.00039789264,0.92979574,0.0009499094,0.000059265534,0.00013986893,0.0020048565,0.0018333116,0.004471219],"genre_scores_gemma":[0.877364,0.00031972016,0.11541021,0.00019210267,0.000066832814,0.0002757465,0.0030895078,0.00041388377,0.0028680663],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961588,0.0016994209,0.0002359321,0.00077753933,0.00085087446,0.0002775197],"domain_scores_gemma":[0.9437303,0.047168963,0.0025082084,0.0028032674,0.003004225,0.0007850079],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0064178477,0.0009361388,0.000963927,0.0018904508,0.00048723505,0.002039349,0.0018637177,0.0015986908,0.006761936],"category_scores_gemma":[0.07423412,0.0014862721,0.0015448895,0.0010338218,0.0015069713,0.0036041236,0.0023025419,0.0030437922,0.0011906622],"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.0016724642,0.00025000348,0.013217467,0.0006652168,0.00036052312,0.0007510455,0.00090586377,0.61212885,0.0062372168,0.1762618,0.0076011783,0.17994839],"study_design_scores_gemma":[0.00006562989,0.000045687455,0.0012138336,0.00007167241,0.000031101692,0.000050596005,0.00004399082,0.89025,0.0018060042,0.105052575,0.0013431344,0.000025748208],"about_ca_topic_score_codex":0.01227438,"about_ca_topic_score_gemma":0.023626212,"teacher_disagreement_score":0.01227438,"about_ca_system_score_codex":0.0017969959,"about_ca_system_score_gemma":0.0024361531,"threshold_uncertainty_score":0.03394121},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019532723,0.000058991758,0.9784878,0.000026613565,0.000009228505,0.000035580735,0.000024218089,0.0003587634,0.0014659883],"genre_scores_gemma":[0.7750861,0.0001095342,0.2224154,0.000043523978,0.000008648947,0.00022066123,0.00016171533,0.00014684719,0.0018075283],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993837,0.000090815185,0.000048878646,0.00011218939,0.0002812343,0.00008321067],"domain_scores_gemma":[0.99920267,0.00045378288,0.00010177902,0.0001143417,0.00010309648,0.000024362917],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008762889,0.00082828355,0.0006053829,0.00028867193,0.0004153326,0.0010130898,0.0011539536,0.0006976361,0.0014647893],"category_scores_gemma":[0.0022067796,0.00034166878,0.0008725995,0.00019106477,0.0010811327,0.0007604825,0.0012495166,0.0010231488,0.0002790765],"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.00019008265,0.000044852426,0.00045805704,0.0003120334,0.000049174065,0.00024344352,0.0004256117,0.7817571,0.042593252,0.1025446,0.0004820545,0.0708998],"study_design_scores_gemma":[0.000041001455,0.000109697125,0.0000759636,0.000023171766,0.000018844908,0.00003699195,0.000034565892,0.9502138,0.022278551,0.025725676,0.0014293463,0.000012440814],"about_ca_topic_score_codex":0.0015423431,"about_ca_topic_score_gemma":0.002105647,"teacher_disagreement_score":0.0015423431,"about_ca_system_score_codex":0.00062156015,"about_ca_system_score_gemma":0.0013368063,"threshold_uncertainty_score":0.004900217},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010456272,0.00042200426,0.9864893,0.00026883718,0.000039446637,0.00004295721,0.000052100557,0.00033818345,0.0018908465],"genre_scores_gemma":[0.4850879,0.0008017703,0.51069766,0.00031322768,0.00010908844,0.0003283437,0.00036196705,0.00040637437,0.0018936925],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961675,0.0016152938,0.00019880725,0.000659518,0.0010606619,0.0002982129],"domain_scores_gemma":[0.9824332,0.013048232,0.001299404,0.0018012698,0.00090489746,0.0005129635],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005236243,0.001885542,0.0016460662,0.0014966832,0.00056392926,0.0020875083,0.0017072521,0.0017339811,0.003941479],"category_scores_gemma":[0.03187687,0.0009857767,0.0012277821,0.0013787217,0.0020871488,0.004169411,0.0034376937,0.0051389574,0.00069577695],"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.00012200158,0.00010572805,0.000835722,0.00022004895,0.000044762823,0.000046525383,0.00011313751,0.809644,0.0024454198,0.09801037,0.0015336591,0.08687859],"study_design_scores_gemma":[0.000013797709,0.000032102824,0.000056884375,0.00002922276,0.000007110897,0.000010141505,0.000007754945,0.9313558,0.00085315906,0.06675198,0.0008758889,0.000006189943],"about_ca_topic_score_codex":0.0022911462,"about_ca_topic_score_gemma":0.0027135902,"teacher_disagreement_score":0.005236243,"about_ca_system_score_codex":0.0021416203,"about_ca_system_score_gemma":0.0024370712,"threshold_uncertainty_score":0.027692199},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00924953,0.000020740585,0.9886453,0.000038276416,0.0000090562,0.00003401013,0.00004596101,0.0005516944,0.0014055287],"genre_scores_gemma":[0.5127589,0.00010629869,0.48391974,0.0000819105,0.0000119582955,0.00025126597,0.00024614687,0.00023652634,0.0023871828],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99858993,0.00025262934,0.00011361395,0.00020693886,0.00069064007,0.00014627955],"domain_scores_gemma":[0.9974934,0.0014489266,0.00021990259,0.0004326946,0.0003338112,0.00007134612],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001595192,0.0004672663,0.0005128214,0.0004738132,0.00054475194,0.0012481343,0.0014176915,0.00057196105,0.0021771113],"category_scores_gemma":[0.0058373115,0.00045976063,0.0012224434,0.0004098143,0.0015980867,0.001306669,0.001257328,0.0011627377,0.00037270715],"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.00011869988,0.000042082982,0.0008658199,0.00011152056,0.000032540116,0.00014470187,0.00023029077,0.8043933,0.008362239,0.14767672,0.00037877305,0.037643306],"study_design_scores_gemma":[0.000020735528,0.000036153782,0.00007005553,0.0000127940275,0.000015395808,0.000023851882,0.000022484559,0.95622617,0.0064074732,0.035651077,0.0015016083,0.000012191787],"about_ca_topic_score_codex":0.006544651,"about_ca_topic_score_gemma":0.008129521,"teacher_disagreement_score":0.006544651,"about_ca_system_score_codex":0.0010865296,"about_ca_system_score_gemma":0.002752734,"threshold_uncertainty_score":0.0130131245},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06634988,0.0014902515,0.85801256,0.001413262,0.00029495682,0.00030078882,0.0024083506,0.013977425,0.05575248],"genre_scores_gemma":[0.28183314,0.0021104766,0.69643986,0.0008744259,0.000044563643,0.00049959176,0.0028941394,0.0033656212,0.011938093],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975262,0.00095089246,0.00028634258,0.00024057084,0.00082761643,0.00016831784],"domain_scores_gemma":[0.9919304,0.0047563887,0.0005943445,0.0015983619,0.000813953,0.00030656604],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004306021,0.0006175622,0.00059619267,0.0015219831,0.00081630546,0.0040189093,0.002296218,0.0011156996,0.0068997005],"category_scores_gemma":[0.009358891,0.00064604875,0.0009166512,0.0017385945,0.0012593877,0.0044752364,0.0024445364,0.0016653966,0.0020480647],"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.0014677021,0.0002856864,0.0040387623,0.0014277006,0.00012171559,0.00027809822,0.0016970412,0.024065593,0.022137342,0.7178537,0.012197123,0.21442956],"study_design_scores_gemma":[0.00045965603,0.0014651481,0.0041882726,0.0010247029,0.0002867033,0.0017221353,0.0036187347,0.28134286,0.046229467,0.27123967,0.38804668,0.00037598697],"about_ca_topic_score_codex":0.0049841115,"about_ca_topic_score_gemma":0.0045711384,"teacher_disagreement_score":0.0068997005,"about_ca_system_score_codex":0.0009902172,"about_ca_system_score_gemma":0.0029844104,"threshold_uncertainty_score":0.02308184},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006642002,0.000753335,0.96135455,0.001022143,0.00034098641,0.000056199136,0.00017019226,0.0010040955,0.02865657],"genre_scores_gemma":[0.612699,0.0025968899,0.34820926,0.0016582604,0.0017275712,0.0005319198,0.0005804643,0.00086886506,0.031127784],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971023,0.00053394475,0.0002506939,0.0005721815,0.001113038,0.00042786478],"domain_scores_gemma":[0.993562,0.0029264113,0.00059518666,0.0012586748,0.001280662,0.00037702345],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026561487,0.0009062513,0.0008898133,0.0020407233,0.0020545393,0.004894332,0.0022950973,0.0017482693,0.009452313],"category_scores_gemma":[0.009601342,0.00094479584,0.0016851696,0.0020020085,0.005494991,0.009405563,0.0032561633,0.004586717,0.0020290154],"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.0000067491296,0.000006596862,0.000052066243,0.000024245632,0.0000041035255,0.00003396983,0.00008252675,0.0016833674,0.00028939694,0.9936474,0.0006952153,0.0034743303],"study_design_scores_gemma":[0.000014272203,0.000018447687,0.000037533817,0.000031038355,0.000016546604,0.00009847914,0.000040867213,0.0112738395,0.00067746686,0.9763659,0.011409354,0.000016380913],"about_ca_topic_score_codex":0.0014583283,"about_ca_topic_score_gemma":0.0010420018,"teacher_disagreement_score":0.009452313,"about_ca_system_score_codex":0.0024305927,"about_ca_system_score_gemma":0.0026053677,"threshold_uncertainty_score":0.031621158},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023832656,0.00038801372,0.9550806,0.00051403855,0.00007516069,0.0003759517,0.00016192914,0.00088518084,0.018686434],"genre_scores_gemma":[0.3745209,0.000601756,0.6115898,0.00042502076,0.000067361914,0.0008647071,0.0005272215,0.00031638978,0.011086896],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99783057,0.00069496187,0.00019143612,0.0004589864,0.0005383633,0.00028568137],"domain_scores_gemma":[0.9978296,0.0017061246,0.00011966418,0.00012744639,0.00014658667,0.0000706317],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016327469,0.001289324,0.0009653719,0.00093020475,0.0007949133,0.0023015782,0.001239447,0.0010943484,0.00783824],"category_scores_gemma":[0.0061098156,0.00064358715,0.0020775709,0.0006941808,0.0026647549,0.0026270922,0.0019956706,0.0022584456,0.0010681455],"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.00014355677,0.00013582612,0.0004068371,0.0005254467,0.00006315369,0.00018312261,0.0006336886,0.10673156,0.005970328,0.8211102,0.0016939829,0.06240223],"study_design_scores_gemma":[0.00013156193,0.00011946496,0.000103234015,0.0001055831,0.000057242778,0.00007901206,0.00017437935,0.24038,0.005765288,0.7442479,0.00880336,0.000032915712],"about_ca_topic_score_codex":0.0023029286,"about_ca_topic_score_gemma":0.0028682537,"teacher_disagreement_score":0.00783824,"about_ca_system_score_codex":0.0024177525,"about_ca_system_score_gemma":0.0019538463,"threshold_uncertainty_score":0.026221573},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012091278,0.00011780652,0.9836218,0.00012530958,0.000050187617,0.000039842544,0.00007543875,0.0026854035,0.0011929754],"genre_scores_gemma":[0.6767738,0.00023336725,0.31774062,0.0001409818,0.0001107303,0.000279634,0.0003649458,0.000909153,0.003446689],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9913368,0.002433687,0.00042737022,0.0011327366,0.0039997376,0.0006697501],"domain_scores_gemma":[0.9755932,0.015602463,0.0012648521,0.0058287387,0.0013822553,0.000328503],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004755317,0.0011079299,0.0017625593,0.0012405608,0.0007124175,0.002575445,0.0028022353,0.0010273085,0.0037537087],"category_scores_gemma":[0.01983672,0.0010843668,0.001789155,0.0016853453,0.002777983,0.0044934778,0.003453486,0.0034970236,0.0008455769],"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.000752967,0.00018329278,0.0020112544,0.000434275,0.00018953336,0.00022659857,0.00024830218,0.36888802,0.021034798,0.45473912,0.0025371823,0.14875476],"study_design_scores_gemma":[0.00003334335,0.000056763805,0.00020967817,0.00001915224,0.000030233261,0.000041732485,0.000012836813,0.81150675,0.009817348,0.1768329,0.001418426,0.000020793326],"about_ca_topic_score_codex":0.001622618,"about_ca_topic_score_gemma":0.002368161,"teacher_disagreement_score":0.004755317,"about_ca_system_score_codex":0.0016353606,"about_ca_system_score_gemma":0.003155557,"threshold_uncertainty_score":0.025148809},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011239958,0.0024845735,0.95317185,0.0020833793,0.00019854496,0.00009994156,0.00036495482,0.00050449814,0.029852236],"genre_scores_gemma":[0.3631054,0.0039156494,0.611569,0.0013340076,0.00081290945,0.00035350598,0.00088477024,0.00034107643,0.01768378],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971834,0.0011512253,0.00019427094,0.0004960504,0.0006880538,0.00028707003],"domain_scores_gemma":[0.9909032,0.006929001,0.00042717476,0.0008212814,0.0006237433,0.00029562257],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004751651,0.00090812746,0.0012533207,0.0025461898,0.0020384456,0.0032578586,0.0026408187,0.0014985171,0.009350593],"category_scores_gemma":[0.016790323,0.0008121205,0.0019476097,0.0042554378,0.0051203393,0.012005371,0.005355198,0.0046745753,0.0014692673],"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.00010376764,0.000074934076,0.00040599133,0.00016301619,0.000032142954,0.00019283051,0.0002970126,0.011135787,0.00054376887,0.9451388,0.0036172313,0.03829472],"study_design_scores_gemma":[0.000018529143,0.000017310638,0.00012891863,0.00005400891,0.000025541094,0.000073917094,0.00007742036,0.03245026,0.00037367843,0.9612562,0.005509495,0.000014693027],"about_ca_topic_score_codex":0.0048534637,"about_ca_topic_score_gemma":0.008284888,"teacher_disagreement_score":0.009350593,"about_ca_system_score_codex":0.0026303327,"about_ca_system_score_gemma":0.0014190145,"threshold_uncertainty_score":0.031280875},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0069466997,0.000044375764,0.99194604,0.000025864958,0.000006418005,0.000025096826,0.000005801647,0.00023501075,0.0007646491],"genre_scores_gemma":[0.42728505,0.000117796226,0.57080656,0.000043036547,0.00001318589,0.00014189626,0.000041080566,0.00010593035,0.0014454349],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991592,0.00017144476,0.000041891355,0.00015799413,0.00039409113,0.00007530857],"domain_scores_gemma":[0.9993191,0.0002954715,0.000094718336,0.00013136087,0.00010494648,0.000054393822],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011659502,0.0007369993,0.00059137004,0.00035205495,0.0003313026,0.00068037794,0.0012239005,0.0005731095,0.0013160112],"category_scores_gemma":[0.0020837628,0.00057385175,0.00085184845,0.0002161851,0.0013207606,0.0011335112,0.0019646727,0.0015183504,0.00023432563],"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.00005571682,0.000050153816,0.00032136316,0.0000856673,0.000030552463,0.000115482944,0.00029841543,0.8964246,0.016172606,0.052704006,0.00018093322,0.03356052],"study_design_scores_gemma":[0.000011933821,0.000051087947,0.00005409509,0.00001002938,0.000006902104,0.00001590611,0.000014418788,0.9827648,0.002837221,0.0127725545,0.0014549184,0.000006129995],"about_ca_topic_score_codex":0.0033529613,"about_ca_topic_score_gemma":0.003382666,"teacher_disagreement_score":0.0033529613,"about_ca_system_score_codex":0.0005930035,"about_ca_system_score_gemma":0.0012125942,"threshold_uncertainty_score":0.0066668987},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05874596,0.00009891853,0.9361402,0.00021764848,0.0000843858,0.00006855546,0.000060051847,0.0024705674,0.0021137777],"genre_scores_gemma":[0.9085305,0.000057440346,0.08945494,0.00008690249,0.00003438527,0.000087526125,0.00008724045,0.00027638342,0.0013847772],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99421304,0.0017338528,0.00027477025,0.0008133305,0.0023024231,0.00066250877],"domain_scores_gemma":[0.9728741,0.02008534,0.0011784165,0.0039303014,0.0016072111,0.0003246642],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0056138253,0.0013262162,0.001369096,0.000943421,0.00077591796,0.0020806855,0.0018647034,0.0014470023,0.0056395177],"category_scores_gemma":[0.020689936,0.0007653721,0.0016707368,0.0004875326,0.0030224663,0.0033703858,0.0045580626,0.0025612558,0.00057090336],"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.0032776038,0.00021568811,0.0035646507,0.0008428046,0.0002879769,0.0013292804,0.00091822876,0.5560809,0.055295527,0.22785226,0.0018007699,0.14853433],"study_design_scores_gemma":[0.00008580175,0.00014960411,0.00024210235,0.000042886702,0.000044537144,0.00011361347,0.000043938748,0.86430204,0.023976315,0.11025555,0.0007138826,0.000029745845],"about_ca_topic_score_codex":0.00080338476,"about_ca_topic_score_gemma":0.0008948909,"teacher_disagreement_score":0.0056395177,"about_ca_system_score_codex":0.0011163737,"about_ca_system_score_gemma":0.0012488075,"threshold_uncertainty_score":0.029689074},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.048029065,0.0000485064,0.94939977,0.000045447334,0.000007219011,0.000025365474,0.000039974246,0.00017342043,0.0022311625],"genre_scores_gemma":[0.82013,0.00008602677,0.1774839,0.000035598103,0.000011131115,0.00010359545,0.00015478353,0.00010468613,0.0018902784],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99942905,0.0001426173,0.000029932839,0.00011501305,0.00019689428,0.00008648997],"domain_scores_gemma":[0.99899036,0.0004972707,0.00012584825,0.00021806512,0.0001126371,0.00005578637],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081020937,0.0004864165,0.00063620065,0.00065757654,0.000470574,0.0011887918,0.000867601,0.0005407321,0.0021443835],"category_scores_gemma":[0.003464095,0.00030305862,0.0007311842,0.0004421325,0.0014682709,0.0015425619,0.0017923623,0.0010681511,0.00029700468],"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.00013892546,0.00004657274,0.0012071902,0.00008142028,0.000027637308,0.00015208728,0.00023267292,0.36591524,0.0125902435,0.57798,0.00062633754,0.04100177],"study_design_scores_gemma":[0.000011792592,0.00004860167,0.00021757092,0.000009379252,0.0000061203964,0.000044540022,0.000030836174,0.8495196,0.0039130067,0.14522877,0.0009548603,0.000014840579],"about_ca_topic_score_codex":0.0010205723,"about_ca_topic_score_gemma":0.0008704943,"teacher_disagreement_score":0.0021443835,"about_ca_system_score_codex":0.00075099926,"about_ca_system_score_gemma":0.00053999305,"threshold_uncertainty_score":0},"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":"software","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031860918,0.0018333219,0.33375418,0.0017849976,0.0011210105,0.00054491503,0.09818553,0.5037875,0.027127655],"genre_scores_gemma":[0.22696294,0.0012494166,0.33452845,0.0018546267,0.0002284797,0.0009582314,0.3710487,0.026494773,0.03667445],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99911636,0.00016409013,0.000053098396,0.00029095812,0.0003057896,0.00006968851],"domain_scores_gemma":[0.99830735,0.00070786226,0.00008696187,0.0004934592,0.00035790598,0.00004643746],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009273545,0.0020492852,0.00081170385,0.0013633962,0.0005663119,0.0018619462,0.0028424205,0.001477938,0.02903091],"category_scores_gemma":[0.0055565475,0.00089844165,0.0015327658,0.0010182371,0.00048141446,0.0024298122,0.0014834526,0.0014782457,0.014012617],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010751886,0.0002415632,0.009881547,0.0012292677,0.00023480828,0.00033950765,0.00023971032,0.05040843,0.006657303,0.018028492,0.64989954,0.2617646],"study_design_scores_gemma":[0.0002561605,0.0002887772,0.0017735776,0.0001332212,0.00009205338,0.00041614182,0.00014887973,0.70117146,0.02110554,0.03381098,0.24071848,0.00008469025],"about_ca_topic_score_codex":0.008063799,"about_ca_topic_score_gemma":0.019835107,"teacher_disagreement_score":0.02903091,"about_ca_system_score_codex":0.0010024861,"about_ca_system_score_gemma":0.0017481012,"threshold_uncertainty_score":0.09711808},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013686115,0.010053407,0.56094027,0.0034782996,0.00522448,0.00006726982,0.0003418114,0.0013953414,0.4048129],"genre_scores_gemma":[0.31726795,0.013950426,0.29435775,0.00231877,0.0030773175,0.00022146132,0.00069877825,0.0031912501,0.36491624],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99928707,0.00015390152,0.000032438507,0.00015286356,0.0003007719,0.000073026466],"domain_scores_gemma":[0.99937207,0.00023163698,0.00003084943,0.00018797217,0.000117049305,0.000060557766],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011703455,0.0010804912,0.0008330743,0.0013819766,0.0013969683,0.0019619248,0.0012186709,0.0009976916,0.018874684],"category_scores_gemma":[0.0034723023,0.0006129018,0.0008492395,0.0010348344,0.0036220362,0.004937259,0.00346303,0.004650426,0.007095259],"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.00003244874,0.000008497785,0.00002583925,0.00006329853,0.0000054300986,0.000025603471,0.000088564244,0.00072254287,0.00061720615,0.9617915,0.0054916847,0.031127485],"study_design_scores_gemma":[0.000012851367,0.00003664276,0.000044694225,0.00009999262,0.000014494932,0.00015972041,0.00007547789,0.0037004102,0.0024687946,0.84765995,0.14570537,0.00002156355],"about_ca_topic_score_codex":0.00032515673,"about_ca_topic_score_gemma":0.00043237774,"teacher_disagreement_score":0.018874684,"about_ca_system_score_codex":0.0007247982,"about_ca_system_score_gemma":0.00046195643,"threshold_uncertainty_score":0.06314206},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019855265,0.0010900545,0.71083343,0.00246373,0.0012155243,0.0017674663,0.022939926,0.057136405,0.18269826],"genre_scores_gemma":[0.25378215,0.0011553647,0.48672885,0.0015684587,0.0004757061,0.0012620372,0.053875197,0.019657008,0.18149532],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980849,0.0002857204,0.00011803278,0.0005248812,0.0006401088,0.00034635072],"domain_scores_gemma":[0.99692035,0.00087847566,0.00009907973,0.0010644647,0.0009754684,0.000062208506],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010449478,0.0013739719,0.0010338268,0.0020189832,0.0011771405,0.0026130006,0.001306768,0.00088421575,0.13521644],"category_scores_gemma":[0.007014691,0.0008411438,0.0016525271,0.002120642,0.00081120286,0.0040940535,0.0022964638,0.0023616639,0.061668042],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010313981,0.00021711142,0.0008100016,0.0015867185,0.00009137546,0.00038807376,0.00037267164,0.006732675,0.026882324,0.15441903,0.23581676,0.57165176],"study_design_scores_gemma":[0.00020212261,0.00023108521,0.0010396589,0.00032901263,0.0001478907,0.000549356,0.00028293772,0.022245275,0.072819784,0.39211482,0.5099458,0.00009219721],"about_ca_topic_score_codex":0.0037752648,"about_ca_topic_score_gemma":0.0041767447,"teacher_disagreement_score":0.13521644,"about_ca_system_score_codex":0.0015895419,"about_ca_system_score_gemma":0.0023906128,"threshold_uncertainty_score":0.45234406},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.074607566,0.0006361574,0.816339,0.00079630787,0.0002386041,0.00037405294,0.0017853884,0.0022650931,0.10295796],"genre_scores_gemma":[0.66745394,0.0008705002,0.28070483,0.0005535263,0.00011210629,0.00065515266,0.002971099,0.000935308,0.045743547],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99838305,0.00042809884,0.00012592968,0.0003548509,0.0004634862,0.00024467695],"domain_scores_gemma":[0.9966737,0.0016727138,0.00026851046,0.00073336455,0.00048159296,0.000170109],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012017705,0.0004612621,0.0005487655,0.0015408465,0.0016252153,0.0026819243,0.001402336,0.0008922134,0.014963734],"category_scores_gemma":[0.005730054,0.000725071,0.0012404167,0.0016640145,0.0022023711,0.0057512117,0.0032557377,0.0022823948,0.0024395834],"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.00009209696,0.000039882143,0.0005841694,0.00011728265,0.000014735035,0.00018206282,0.00025665623,0.005297636,0.0016945321,0.96931803,0.0022589702,0.020143969],"study_design_scores_gemma":[0.000028944998,0.00002510575,0.00029742235,0.00011197494,0.00003437173,0.00019161012,0.00018994737,0.027692877,0.005092783,0.93383425,0.03247394,0.000026656993],"about_ca_topic_score_codex":0.0042880247,"about_ca_topic_score_gemma":0.0059788427,"teacher_disagreement_score":0.014963734,"about_ca_system_score_codex":0.0015606008,"about_ca_system_score_gemma":0.0015223889,"threshold_uncertainty_score":0.050058722},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034066204,0.00045169136,0.9551339,0.0003112472,0.000097330536,0.00007330881,0.00008086194,0.00022319182,0.009562169],"genre_scores_gemma":[0.78216475,0.0005952574,0.20822364,0.00028103264,0.00015949889,0.0005461004,0.0002844856,0.00019659866,0.007548661],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9952531,0.0015660513,0.00038451943,0.0009299297,0.0014985679,0.00036786258],"domain_scores_gemma":[0.9958099,0.0025429497,0.00046111998,0.00041891684,0.0005584812,0.00020857557],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003987368,0.0008485626,0.0007237983,0.0015665292,0.0010267954,0.0023567472,0.0011828988,0.0012254303,0.002961139],"category_scores_gemma":[0.011176113,0.00040790584,0.001314982,0.0009796004,0.0037082077,0.0043623904,0.0027040949,0.0026356543,0.0005138504],"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.00001898895,0.000016944037,0.000118365686,0.000021759064,0.000008791994,0.000042046424,0.00016305967,0.0058445814,0.00064135616,0.98968834,0.00009308349,0.0033427197],"study_design_scores_gemma":[0.000018423681,0.000030354868,0.000075851254,0.000021323089,0.000011529763,0.000053722,0.00003966338,0.0701626,0.0014841087,0.92541176,0.0026752288,0.000015402036],"about_ca_topic_score_codex":0.0010068518,"about_ca_topic_score_gemma":0.0005604228,"teacher_disagreement_score":0.003987368,"about_ca_system_score_codex":0.0023347184,"about_ca_system_score_gemma":0.0013601888,"threshold_uncertainty_score":0.021087468},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011350028,0.00056334905,0.9722181,0.0017779024,0.000061355444,0.000071821865,0.0001599514,0.00024328324,0.013554151],"genre_scores_gemma":[0.59819216,0.001577766,0.39048955,0.00063349074,0.00042407308,0.0003817096,0.0003841275,0.00031224964,0.0076048174],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9924821,0.0024812238,0.00059399573,0.0014889551,0.0024387885,0.0005147841],"domain_scores_gemma":[0.9743817,0.017230904,0.0011639725,0.0050835162,0.0014716546,0.000668171],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009711919,0.0012097296,0.0013548732,0.00261793,0.0020447264,0.0064449687,0.0066882116,0.00279223,0.004973465],"category_scores_gemma":[0.02703765,0.0024169325,0.004455931,0.0017998487,0.01076132,0.021112002,0.010416981,0.009784448,0.0006342364],"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.000014831725,0.000012798177,0.00006762279,0.00005504997,0.000015294261,0.00006459705,0.00023180815,0.0034496603,0.00066080067,0.9928341,0.0001344641,0.0024589507],"study_design_scores_gemma":[0.000012868284,0.000016362972,0.000049029946,0.000023253324,0.000024480898,0.000069297916,0.00005308433,0.015925659,0.00073924504,0.9809625,0.0021077995,0.00001628004],"about_ca_topic_score_codex":0.0012924598,"about_ca_topic_score_gemma":0.00141056,"teacher_disagreement_score":0.009711919,"about_ca_system_score_codex":0.0025559184,"about_ca_system_score_gemma":0.0013614849,"threshold_uncertainty_score":0.051362157},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01583129,0.00004712972,0.97856355,0.00013792586,0.000031053554,0.000089925714,0.00008264443,0.0020676907,0.003148857],"genre_scores_gemma":[0.31809652,0.00016779923,0.67604375,0.00027695298,0.00006003603,0.00017438046,0.0005578943,0.00075412437,0.0038685102],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99634856,0.0007056475,0.00021661328,0.0011155275,0.0013451825,0.00026846558],"domain_scores_gemma":[0.99372923,0.0032359369,0.0005359455,0.0015247746,0.0008421537,0.00013194283],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025870698,0.00064673903,0.000606223,0.001135595,0.0010046196,0.0013474848,0.0016153196,0.0007454903,0.003692318],"category_scores_gemma":[0.008653753,0.000609564,0.0017999876,0.00065467635,0.0027450065,0.0034677018,0.0020485986,0.0013270836,0.0010109161],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00047214454,0.00043104196,0.012611723,0.00081439526,0.00030375578,0.0018086933,0.0020983892,0.11357306,0.052725732,0.5041793,0.0058709625,0.3051108],"study_design_scores_gemma":[0.000049319646,0.00014705097,0.00089071755,0.00008135352,0.00016911494,0.00082498865,0.00020114654,0.4819886,0.07830569,0.41074255,0.026546637,0.000052826243],"about_ca_topic_score_codex":0.001320323,"about_ca_topic_score_gemma":0.0014680114,"teacher_disagreement_score":0.003692318,"about_ca_system_score_codex":0.0009045096,"about_ca_system_score_gemma":0.0014193138,"threshold_uncertainty_score":0.013681889},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0031891747,0.00014207265,0.9894238,0.0004441827,0.000066502376,0.00014543835,0.00017453433,0.0011708958,0.005243371],"genre_scores_gemma":[0.35548887,0.0009926831,0.6296609,0.0005505641,0.00033697337,0.00070465927,0.0010793445,0.0011293514,0.01005666],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9867475,0.006287207,0.00070874393,0.0015271852,0.003881042,0.00084829744],"domain_scores_gemma":[0.9256959,0.05415237,0.003762869,0.010261098,0.005375967,0.0007517378],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0102885775,0.0015961706,0.001326808,0.0054318667,0.0018649048,0.00550396,0.0037723728,0.0024304169,0.014150218],"category_scores_gemma":[0.058143876,0.001782803,0.0030931497,0.0031704681,0.0047526415,0.00878546,0.0054585235,0.007006257,0.0022022203],"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.00014723916,0.00014461704,0.0017077657,0.00037616558,0.0001138004,0.00023948695,0.00065310235,0.043351162,0.0023667212,0.87537193,0.004676548,0.0708515],"study_design_scores_gemma":[0.000025871614,0.000025195242,0.0002655996,0.00009298112,0.000070521644,0.00007782686,0.00012269542,0.22529231,0.0028604115,0.7661451,0.0049941493,0.000027376445],"about_ca_topic_score_codex":0.0034349654,"about_ca_topic_score_gemma":0.00374541,"teacher_disagreement_score":0.014150218,"about_ca_system_score_codex":0.002544535,"about_ca_system_score_gemma":0.004724663,"threshold_uncertainty_score":0.054411888},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0040227487,0.00009319541,0.99357986,0.000070955335,0.00001317831,0.00016290921,0.000031261625,0.001161285,0.0008645894],"genre_scores_gemma":[0.108892374,0.00011373381,0.8892879,0.00007286944,0.000013642376,0.00029973732,0.0001687747,0.0002993872,0.00085154304],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9890882,0.0050029242,0.0007769395,0.00087914907,0.003538468,0.00071439554],"domain_scores_gemma":[0.9846845,0.008881564,0.0009971128,0.0026137624,0.0024645969,0.00035857345],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.014841719,0.0014857373,0.00085991353,0.0018295253,0.0010730599,0.0023330606,0.0038048232,0.0020931163,0.0039350875],"category_scores_gemma":[0.01950228,0.0015771112,0.0024979785,0.0005382423,0.00342445,0.002266514,0.0037235902,0.0029268642,0.00078009465],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020730127,0.0002477331,0.0018135306,0.00073810556,0.00014070478,0.0007155841,0.0010415144,0.64421135,0.023491366,0.20396852,0.0017345581,0.12168971],"study_design_scores_gemma":[0.000093939416,0.00017907865,0.00016403885,0.00020661755,0.000049525403,0.00017444718,0.000056664845,0.92615527,0.014875813,0.043260578,0.014724619,0.00005937231],"about_ca_topic_score_codex":0.0059760427,"about_ca_topic_score_gemma":0.005235401,"teacher_disagreement_score":0.014841719,"about_ca_system_score_codex":0.0022459817,"about_ca_system_score_gemma":0.005013297,"threshold_uncertainty_score":0.07849145},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039679997,0.00028735693,0.9312226,0.00072109915,0.00016926353,0.00046566722,0.0018014881,0.0018017639,0.023850756],"genre_scores_gemma":[0.23750536,0.0003438972,0.74587303,0.0004522539,0.00006578928,0.00045285388,0.0036965208,0.0016265437,0.009983719],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968363,0.00076608243,0.00023971582,0.00042113243,0.0012397554,0.00049693394],"domain_scores_gemma":[0.9960075,0.001846599,0.0003871749,0.00085770723,0.0006998273,0.00020118825],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002549698,0.0014809277,0.00065497967,0.0014534628,0.00095514656,0.002282839,0.0012400533,0.00082002074,0.01548553],"category_scores_gemma":[0.009107339,0.00064836955,0.0016005322,0.0019062917,0.0014608317,0.004204477,0.0028451409,0.0028791092,0.0015305956],"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.0004958284,0.00035543545,0.0034876238,0.0011229316,0.00017452927,0.0012278139,0.0011068545,0.12639599,0.030916719,0.59079474,0.026487121,0.21743436],"study_design_scores_gemma":[0.00020673481,0.00016631026,0.0011535729,0.00026140857,0.00021300984,0.0009864967,0.00081436255,0.36286187,0.048583824,0.5106979,0.07395269,0.00010181585],"about_ca_topic_score_codex":0.0031068972,"about_ca_topic_score_gemma":0.0063298247,"teacher_disagreement_score":0.01548553,"about_ca_system_score_codex":0.0011457485,"about_ca_system_score_gemma":0.0022654934,"threshold_uncertainty_score":0.051804245},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02574935,0.0016346925,0.90398216,0.003303025,0.0002815948,0.0003325567,0.0008104498,0.0019003635,0.06200574],"genre_scores_gemma":[0.28468087,0.0024323692,0.69649726,0.0014191552,0.0005709781,0.00061432226,0.0018663055,0.00043968367,0.011479081],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9961086,0.0015992912,0.00024094527,0.0005540629,0.0011619423,0.0003352335],"domain_scores_gemma":[0.9940779,0.0041383957,0.00027791414,0.0008403773,0.0005510377,0.00011434227],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033346226,0.0007581995,0.000574824,0.0012525468,0.0011663118,0.0034888594,0.0020595284,0.0010869022,0.010671433],"category_scores_gemma":[0.011991216,0.0007997478,0.0017038642,0.0014087793,0.0026539,0.006172018,0.002752017,0.004483874,0.0020936541],"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.00004514501,0.000048299946,0.00038421009,0.00028507964,0.000038869064,0.00020525744,0.00030861227,0.013913192,0.002000792,0.9109688,0.00569872,0.06610295],"study_design_scores_gemma":[0.000050657425,0.00003361183,0.00017015585,0.0001167143,0.00003987033,0.00019943801,0.00016230035,0.09405383,0.005003935,0.87131685,0.028833484,0.000019167466],"about_ca_topic_score_codex":0.0018123551,"about_ca_topic_score_gemma":0.002580747,"teacher_disagreement_score":0.010671433,"about_ca_system_score_codex":0.0015828664,"about_ca_system_score_gemma":0.002438892,"threshold_uncertainty_score":0.035699487},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0072517963,0.000114692644,0.98791903,0.00041684267,0.00002439401,0.00007999434,0.000073651034,0.0012175244,0.0029021183],"genre_scores_gemma":[0.44415084,0.00043187538,0.54778874,0.0004613474,0.00012811436,0.00049002154,0.0005972768,0.00064888864,0.0053029787],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9893491,0.0045949323,0.001001723,0.0015099985,0.0028036083,0.0007405547],"domain_scores_gemma":[0.9777893,0.01589958,0.0010269481,0.0034314005,0.0014493538,0.00040350575],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011041133,0.0009861774,0.00092201197,0.0015369626,0.0022090035,0.0052405065,0.0036652826,0.0019357685,0.0053545097],"category_scores_gemma":[0.026243748,0.0013435705,0.003459014,0.0010961499,0.005411382,0.012895271,0.0057819514,0.0055896016,0.00094085955],"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.00010378393,0.00006963711,0.0005079335,0.0002519463,0.00006539263,0.00039595837,0.0011489303,0.03742541,0.005322004,0.9307651,0.0012510247,0.0226928],"study_design_scores_gemma":[0.000094646566,0.00005595358,0.000107429994,0.00007561961,0.00010107159,0.00015791578,0.00023737029,0.19799544,0.017517675,0.7716185,0.011994367,0.00004394356],"about_ca_topic_score_codex":0.0032366833,"about_ca_topic_score_gemma":0.0033055488,"teacher_disagreement_score":0.011041133,"about_ca_system_score_codex":0.004140229,"about_ca_system_score_gemma":0.0025187514,"threshold_uncertainty_score":0.05839181},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017328227,0.00013477069,0.9807509,0.00024657717,0.000022192791,0.000022805214,0.00003079219,0.00014830827,0.0013154884],"genre_scores_gemma":[0.7140114,0.0002720658,0.28359646,0.00016285302,0.000070554335,0.00015418157,0.00014087504,0.00006453778,0.0015271403],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9934035,0.002267847,0.00053426565,0.0010785507,0.0023928555,0.00032289783],"domain_scores_gemma":[0.9857334,0.008434758,0.0017803276,0.0020889486,0.0014845433,0.00047807163],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005730931,0.00074797345,0.0008304023,0.0014826067,0.000982233,0.0032361401,0.0019504246,0.0013986642,0.001941233],"category_scores_gemma":[0.025256352,0.00057184714,0.0020025165,0.0012846219,0.0045844275,0.007986022,0.0039516273,0.0029062112,0.00023027498],"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.00004937273,0.000022066915,0.0004359687,0.000075630844,0.00004888411,0.000120601464,0.0003269567,0.072268225,0.0017319951,0.91469204,0.00016323758,0.010065062],"study_design_scores_gemma":[0.000016079764,0.000033489177,0.00014147408,0.000015796824,0.000019704044,0.000063588275,0.000061756895,0.36636388,0.002064919,0.629576,0.0016247006,0.000018612393],"about_ca_topic_score_codex":0.002272162,"about_ca_topic_score_gemma":0.001612824,"teacher_disagreement_score":0.005730931,"about_ca_system_score_codex":0.0030197704,"about_ca_system_score_gemma":0.0011896997,"threshold_uncertainty_score":0.030308425},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.59076095,0.0006427073,0.38401404,0.00090115116,0.000110213405,0.00016043283,0.0011553136,0.0007277804,0.021527398],"genre_scores_gemma":[0.8692545,0.00027241264,0.12531179,0.0002148194,0.00008532483,0.00026599842,0.001433502,0.0002043158,0.0029573073],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.993835,0.0014893702,0.00053166196,0.0008676284,0.0025972403,0.00067915826],"domain_scores_gemma":[0.9856706,0.0089338515,0.00093439093,0.0025409844,0.0015222342,0.00039792014],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026123244,0.000814879,0.0014201448,0.0029081574,0.0011992228,0.0031610485,0.0023362336,0.001326748,0.006208755],"category_scores_gemma":[0.023329282,0.0006665072,0.000965893,0.00240428,0.0018706494,0.0076374994,0.0029728157,0.001837639,0.0007561168],"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.0007607557,0.00018790772,0.017312432,0.00057374156,0.00012798035,0.00046427577,0.00065670453,0.028641975,0.017538957,0.71645355,0.0038882045,0.21339346],"study_design_scores_gemma":[0.00004411019,0.00010088386,0.0028723837,0.000054302225,0.00006531174,0.00064331404,0.00017290059,0.18914811,0.015820112,0.78547245,0.0055504204,0.000055774122],"about_ca_topic_score_codex":0.00061076257,"about_ca_topic_score_gemma":0.00059880206,"teacher_disagreement_score":0.006208755,"about_ca_system_score_codex":0.0016265915,"about_ca_system_score_gemma":0.00082786055,"threshold_uncertainty_score":0.020770311},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6512881,0.0015181369,0.26670533,0.006540816,0.00037752907,0.00072905014,0.0054705264,0.003015672,0.06435482],"genre_scores_gemma":[0.87882215,0.0007334427,0.10004507,0.00094195217,0.00010866399,0.00036290445,0.0051369537,0.00030978373,0.013539104],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99908817,0.00010777999,0.000045348363,0.000295192,0.00022280816,0.0002406435],"domain_scores_gemma":[0.9972263,0.0020970672,0.00017744633,0.0002508387,0.00014491631,0.000103388],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042121977,0.0006656808,0.0009220028,0.00053848635,0.0012925502,0.0026440283,0.0008938015,0.0010921265,0.005087772],"category_scores_gemma":[0.0027948017,0.0007403903,0.0020574487,0.0010761049,0.0015136783,0.0022414385,0.0016878278,0.0016825332,0.00056216924],"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.0022352452,0.00065289374,0.01383766,0.0028760124,0.0006916421,0.0035978106,0.0020575135,0.3149492,0.07490348,0.32339782,0.04986952,0.2109312],"study_design_scores_gemma":[0.00044662028,0.00028683912,0.004553681,0.00017064915,0.000365767,0.0024483125,0.0010552378,0.36524764,0.043193035,0.5336048,0.048509903,0.00011756372],"about_ca_topic_score_codex":0.0047977236,"about_ca_topic_score_gemma":0.006258632,"teacher_disagreement_score":0.005087772,"about_ca_system_score_codex":0.0014803967,"about_ca_system_score_gemma":0.0015501671,"threshold_uncertainty_score":0.017020285},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7198878,0.016707705,0.048876937,0.030918557,0.0027426116,0.003048327,0.0063931914,0.00068461883,0.17074028],"genre_scores_gemma":[0.88893926,0.006723709,0.025869431,0.008740431,0.00050518697,0.0010384434,0.0026730862,0.00030554997,0.065204896],"study_design_codex":"case_report","study_design_gemma":"not_applicable","domain_scores_codex":[0.99795306,0.00077736547,0.0001701142,0.0002724358,0.00038618245,0.0004407958],"domain_scores_gemma":[0.997687,0.0009217723,0.00021923054,0.00020341981,0.00031253044,0.00065610046],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0016638578,0.0009674315,0.00077848387,0.001776187,0.004294608,0.0020151946,0.001929933,0.005070536,0.01779031],"category_scores_gemma":[0.008496708,0.00030728133,0.00092964794,0.0023723114,0.0018682203,0.0012068886,0.0027523234,0.00247569,0.004504455],"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.0018751665,0.002506452,0.05256598,0.0017860249,0.00019520777,0.6872682,0.015036195,0.0031404598,0.0029067977,0.03087266,0.08639342,0.11545351],"study_design_scores_gemma":[0.00018229098,0.0009741095,0.019786764,0.0013639292,0.000148846,0.6162678,0.025221713,0.0026949367,0.0043758163,0.01980062,0.3090308,0.00015233655],"about_ca_topic_score_codex":0.009148941,"about_ca_topic_score_gemma":0.012700643,"teacher_disagreement_score":0.9822097,"about_ca_system_score_codex":0.0022076892,"about_ca_system_score_gemma":0.0019080045,"threshold_uncertainty_score":0},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023554161,0.006394744,0.91541326,0.01906338,0.0012634236,0.00012930697,0.00035672713,0.00084264315,0.032982416],"genre_scores_gemma":[0.78656816,0.0055618323,0.19366774,0.0065794783,0.0023039405,0.00056077185,0.0004084062,0.0003832107,0.0039665275],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9813587,0.0072176103,0.0016234319,0.0035698714,0.00527923,0.0009510787],"domain_scores_gemma":[0.954196,0.034956224,0.0015857602,0.0042852825,0.0041843816,0.0007922988],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.018706838,0.0009958944,0.001410824,0.002821746,0.0032873112,0.008259114,0.0038242836,0.0042901323,0.004137515],"category_scores_gemma":[0.047748517,0.0014099294,0.0031838485,0.0022265974,0.025211943,0.021256234,0.007172898,0.015291801,0.0009906188],"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.000013125103,0.000010199599,0.00006993512,0.00008939099,0.000010697736,0.000055430177,0.00018880412,0.0006377936,0.00029726664,0.99474585,0.00044247363,0.0034391067],"study_design_scores_gemma":[0.000014408339,0.000016308859,0.000045243283,0.000060290648,0.000011097964,0.00007867801,0.00006176544,0.0038182288,0.0013237803,0.986421,0.008135299,0.000013878317],"about_ca_topic_score_codex":0.0013940306,"about_ca_topic_score_gemma":0.0005530785,"teacher_disagreement_score":0.018706838,"about_ca_system_score_codex":0.00608842,"about_ca_system_score_gemma":0.004018087,"threshold_uncertainty_score":0.098932445},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045737244,0.00034027465,0.9436417,0.0006104603,0.00006136096,0.00014952486,0.00016008649,0.0006538159,0.008645504],"genre_scores_gemma":[0.6538614,0.00049835164,0.34062198,0.00042017497,0.00019781843,0.00038163312,0.00029014243,0.00026045242,0.003468084],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.995516,0.0010116386,0.0004119115,0.0009971954,0.0015690216,0.0004943004],"domain_scores_gemma":[0.9845212,0.010197127,0.0010529326,0.0022998347,0.0010479153,0.00088086457],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0045470246,0.0006720383,0.00080044277,0.001189494,0.0020563526,0.0036829154,0.0013765574,0.0014858957,0.0039953566],"category_scores_gemma":[0.016285464,0.0008611907,0.0021332225,0.00075300864,0.0044715567,0.005422112,0.0029004992,0.00480894,0.0006473304],"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.000035963334,0.000030526837,0.000594425,0.00005291932,0.00001024781,0.00006906682,0.00036339904,0.006038178,0.0030733433,0.98037463,0.0003592513,0.008998095],"study_design_scores_gemma":[0.000031332296,0.000063066545,0.00032825305,0.000047368005,0.000028429193,0.00014692963,0.000100184196,0.10103231,0.0034307924,0.8871294,0.00763181,0.0000302073],"about_ca_topic_score_codex":0.0017265831,"about_ca_topic_score_gemma":0.0017100704,"teacher_disagreement_score":0.0045470246,"about_ca_system_score_codex":0.0025619601,"about_ca_system_score_gemma":0.0028653147,"threshold_uncertainty_score":0.024047256},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027798554,0.0024280616,0.68762386,0.002424535,0.0014066695,0.00034183322,0.0020609146,0.009543715,0.26637185],"genre_scores_gemma":[0.3995951,0.0034562368,0.4157355,0.0021369697,0.00071330514,0.00036692215,0.0074058315,0.004834902,0.16575529],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99822587,0.000265203,0.000079402555,0.00030984858,0.0008966998,0.00022309045],"domain_scores_gemma":[0.9985253,0.0005437478,0.000024556477,0.0005962813,0.00027708337,0.00003307162],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068285386,0.00081480877,0.0010228398,0.0017231953,0.0010935997,0.0028571875,0.0023922133,0.00079555786,0.03507716],"category_scores_gemma":[0.0032673609,0.00075806736,0.001249554,0.002948932,0.001342528,0.0042188778,0.0034109012,0.0036781034,0.011113541],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013673004,0.00014480903,0.0002197499,0.0004592643,0.000044244232,0.00019519069,0.00030558708,0.00583824,0.010417558,0.61360705,0.05788021,0.31075138],"study_design_scores_gemma":[0.000094022165,0.000046711193,0.00031477222,0.00011992223,0.00012191626,0.0003903758,0.00024865684,0.028242387,0.031953182,0.72869414,0.20972408,0.00004981246],"about_ca_topic_score_codex":0.0028932584,"about_ca_topic_score_gemma":0.004560311,"teacher_disagreement_score":0.03507716,"about_ca_system_score_codex":0.0014277119,"about_ca_system_score_gemma":0.0013146938,"threshold_uncertainty_score":0.1173448},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013103398,0.00007055044,0.9965153,0.0001052853,0.00003755359,0.000094207535,0.000074445794,0.0010290552,0.00076321565],"genre_scores_gemma":[0.16393542,0.00028363708,0.8312183,0.0002492911,0.00008251524,0.0005419272,0.000570614,0.00059388817,0.0025243077],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99425995,0.0017626575,0.00043651703,0.0008544323,0.0023435985,0.0003428366],"domain_scores_gemma":[0.9891472,0.00525022,0.00081375684,0.0030711712,0.0014502391,0.00026744025],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0053180763,0.0014458597,0.0010629462,0.0019647568,0.0011595296,0.0030997633,0.003611918,0.0014773977,0.0032038337],"category_scores_gemma":[0.01835437,0.0015258299,0.003462405,0.0013290055,0.0024592504,0.003291773,0.0038249614,0.003806707,0.00072522165],"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.00031047314,0.0004881374,0.0023592594,0.00054512016,0.0004839864,0.0008578115,0.000798704,0.48649392,0.023557136,0.34909198,0.006339611,0.12867391],"study_design_scores_gemma":[0.000040217245,0.00006046958,0.00014540747,0.000057510504,0.000084085674,0.00013702028,0.00003921603,0.8695813,0.007177172,0.115940146,0.0067043873,0.000033059758],"about_ca_topic_score_codex":0.008850299,"about_ca_topic_score_gemma":0.010188198,"teacher_disagreement_score":0.008850299,"about_ca_system_score_codex":0.0019359428,"about_ca_system_score_gemma":0.004709369,"threshold_uncertainty_score":0.028124988},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036955617,0.0010681506,0.88075775,0.0019101274,0.0011932537,0.00056160794,0.0016328746,0.033693686,0.042226985],"genre_scores_gemma":[0.33079907,0.0004897741,0.63599616,0.0012271825,0.00035109828,0.0006666895,0.0041451254,0.0036913173,0.02263364],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99391633,0.001955965,0.00031311292,0.001179274,0.0017654116,0.00086989504],"domain_scores_gemma":[0.97552866,0.01569346,0.0004920302,0.0065578697,0.0013963156,0.00033163207],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034022375,0.0020839612,0.0019942315,0.0017711958,0.0014756086,0.0030637893,0.0065189097,0.0018696426,0.06644935],"category_scores_gemma":[0.019151833,0.0018150209,0.0031096467,0.0029351264,0.0020772922,0.010471364,0.007785659,0.0061610127,0.013585659],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0024378507,0.0007130272,0.0018849714,0.0011974337,0.0003566032,0.00026995922,0.0003818114,0.1349563,0.013934511,0.13114974,0.07506464,0.6376531],"study_design_scores_gemma":[0.00047796968,0.00019912963,0.00044389456,0.00010478904,0.00018089663,0.00014341633,0.00018301904,0.77240306,0.010869689,0.19426677,0.02068789,0.000039397317],"about_ca_topic_score_codex":0.004718844,"about_ca_topic_score_gemma":0.012258947,"teacher_disagreement_score":0.06644935,"about_ca_system_score_codex":0.0024792205,"about_ca_system_score_gemma":0.004009324,"threshold_uncertainty_score":0.22229522},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032205877,0.0002260108,0.9799714,0.00020289622,0.00016131712,0.00014031203,0.00039251536,0.005823198,0.009861847],"genre_scores_gemma":[0.031867545,0.00016964907,0.95308393,0.00014456474,0.00008503509,0.00025400228,0.0020707173,0.0011198157,0.011204756],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99864215,0.0001998405,0.0001531237,0.00040208423,0.00047306038,0.00012973361],"domain_scores_gemma":[0.9979394,0.000847201,0.00007977987,0.0004908128,0.00056751777,0.000075139564],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001054254,0.0014931223,0.0012709444,0.002627542,0.0014812216,0.004208242,0.002653519,0.0014883314,0.02506808],"category_scores_gemma":[0.0053707818,0.00086635776,0.0020420349,0.0024859551,0.001107377,0.0053131403,0.0031578164,0.0028438643,0.013659289],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017150457,0.00013515151,0.0004026395,0.00025571487,0.00003771744,0.00005777787,0.00017728755,0.0054202494,0.0060594077,0.2043453,0.03458102,0.7483562],"study_design_scores_gemma":[0.00012302183,0.00009696217,0.00062548433,0.00015406222,0.000071573806,0.00042375698,0.00022480593,0.22677028,0.015320068,0.67211163,0.084003694,0.00007472611],"about_ca_topic_score_codex":0.0022726841,"about_ca_topic_score_gemma":0.0030899213,"teacher_disagreement_score":0.02506808,"about_ca_system_score_codex":0.0020112807,"about_ca_system_score_gemma":0.0017634052,"threshold_uncertainty_score":0.08386105},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05262824,0.00018503793,0.940183,0.00011422568,0.000037038477,0.00014651782,0.0001138989,0.00238732,0.0042047556],"genre_scores_gemma":[0.5441967,0.00028823767,0.4519587,0.000108707005,0.000023062785,0.0003096565,0.00033278496,0.00032463128,0.0024574664],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9953187,0.0018810665,0.00055255013,0.00062191515,0.0013525285,0.00027317108],"domain_scores_gemma":[0.9918927,0.0059435084,0.00043631534,0.000959827,0.00069071597,0.00007687379],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035301298,0.0006160479,0.0005742846,0.0006240889,0.0005618176,0.0019480527,0.0014762116,0.0007153425,0.0011928866],"category_scores_gemma":[0.013061857,0.0006009967,0.0011002435,0.0005005639,0.0021114633,0.0019501054,0.0011262703,0.000937065,0.0003258559],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042210807,0.00017313898,0.0024601973,0.0005268351,0.00018293297,0.0010486604,0.0013562556,0.27837685,0.06599916,0.5342992,0.0012402624,0.113914475],"study_design_scores_gemma":[0.00021689608,0.00015113813,0.00037351457,0.00007777766,0.000113927934,0.00024402824,0.00012220342,0.7435284,0.078788765,0.16649775,0.009827846,0.00005775685],"about_ca_topic_score_codex":0.003887729,"about_ca_topic_score_gemma":0.003780478,"teacher_disagreement_score":0.003887729,"about_ca_system_score_codex":0.0010714649,"about_ca_system_score_gemma":0.0018268365,"threshold_uncertainty_score":0.018669307},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07641529,0.00017171545,0.914308,0.00046326738,0.00013293512,0.00018938992,0.00048858207,0.003964774,0.0038659554],"genre_scores_gemma":[0.81689346,0.00019594794,0.17873187,0.00024906272,0.00010248444,0.00025518582,0.0006792422,0.0005712597,0.0023216163],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9925586,0.0017366142,0.0005896185,0.0019114394,0.002356398,0.00084731757],"domain_scores_gemma":[0.96518797,0.024555229,0.002304298,0.0051111705,0.0022465668,0.00059475005],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003993012,0.0011477388,0.0010111497,0.0016609107,0.0013255689,0.0027081037,0.002042797,0.001231092,0.0048334384],"category_scores_gemma":[0.029362375,0.0008043449,0.0019506039,0.0008968278,0.0041986816,0.006596052,0.0028432775,0.0034952827,0.0005498053],"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.000723679,0.00022745483,0.004094131,0.00046801742,0.0002258021,0.0011072095,0.00070037704,0.16727948,0.030529108,0.7060134,0.0026783545,0.08595299],"study_design_scores_gemma":[0.00006975687,0.00008093898,0.00025315068,0.000050672403,0.00006513934,0.00014942758,0.000053581494,0.37990087,0.043257434,0.5736485,0.0023973961,0.00007306059],"about_ca_topic_score_codex":0.0032591189,"about_ca_topic_score_gemma":0.0028328097,"teacher_disagreement_score":0.0048334384,"about_ca_system_score_codex":0.0015652224,"about_ca_system_score_gemma":0.00296642,"threshold_uncertainty_score":0.02111733},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009582791,0.00033901617,0.987777,0.00023573212,0.000032677966,0.00003980177,0.00004674706,0.00035239232,0.0015938618],"genre_scores_gemma":[0.49212086,0.0006659888,0.5041554,0.00027994943,0.00008747769,0.00029876095,0.00031706213,0.00038706223,0.001687433],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99603015,0.0016794187,0.0002075186,0.0006740533,0.0010959601,0.00031285227],"domain_scores_gemma":[0.98234624,0.01323704,0.0012823069,0.0018092378,0.0008562742,0.00046888264],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0051999963,0.0018379182,0.0015689938,0.0014796779,0.00055221305,0.001934436,0.0016302593,0.0015200032,0.0038877658],"category_scores_gemma":[0.031296156,0.0009494432,0.0012851481,0.001266182,0.0022344443,0.004013136,0.0033411202,0.0047730426,0.0006343618],"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.00011485764,0.00009628268,0.0008286265,0.00022399466,0.000043286527,0.00004811153,0.00011279723,0.8040564,0.0026776737,0.104808174,0.0013206613,0.085669175],"study_design_scores_gemma":[0.0000134404,0.000029424726,0.000053361637,0.000028940427,0.0000069772905,0.000010052637,0.000007336725,0.92994726,0.00094518415,0.06816719,0.00078469457,0.000006089115],"about_ca_topic_score_codex":0.0023445385,"about_ca_topic_score_gemma":0.0030135808,"teacher_disagreement_score":0.0051999963,"about_ca_system_score_codex":0.0021824723,"about_ca_system_score_gemma":0.0025779586,"threshold_uncertainty_score":0.02750057},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030661991,0.000071695365,0.97382957,0.0003903778,0.00012426624,0.00021185442,0.00026605107,0.013566055,0.008473826],"genre_scores_gemma":[0.08573346,0.00023274483,0.89932907,0.0009267248,0.00017491184,0.00052984984,0.0017115716,0.0033511678,0.008010484],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.990424,0.0031809672,0.00092402386,0.0010480346,0.0036895643,0.00073334714],"domain_scores_gemma":[0.9808952,0.008156562,0.0008032848,0.006035376,0.0037018908,0.00040760002],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008793531,0.0014181911,0.000733927,0.0018600064,0.0011611129,0.0042525167,0.0047182483,0.001432375,0.016709512],"category_scores_gemma":[0.021034157,0.0013392965,0.0027513208,0.001338493,0.0021723176,0.006633998,0.007991699,0.0042547164,0.0057393466],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00068368885,0.00078019354,0.004030763,0.001475888,0.00029983738,0.0014166106,0.0013129587,0.08842758,0.023085775,0.37888455,0.048632447,0.45096973],"study_design_scores_gemma":[0.00030789775,0.00020607738,0.00032113696,0.00021878199,0.00013046949,0.000704457,0.0001900994,0.6172084,0.04824864,0.15386313,0.1784956,0.000105351544],"about_ca_topic_score_codex":0.00329506,"about_ca_topic_score_gemma":0.003925539,"teacher_disagreement_score":0.016709512,"about_ca_system_score_codex":0.0012468464,"about_ca_system_score_gemma":0.0037645532,"threshold_uncertainty_score":0.055898845},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036497273,0.00007368623,0.9560787,0.00018745853,0.000038091956,0.00024142429,0.00024164612,0.0029566977,0.0036849005],"genre_scores_gemma":[0.4087932,0.00014572332,0.5846574,0.0001365072,0.000028400893,0.00048834895,0.00090760645,0.0016853978,0.0031574355],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99677306,0.00083359133,0.00017845973,0.00070360274,0.0012041001,0.00030715007],"domain_scores_gemma":[0.99125457,0.005596044,0.000296007,0.0018215352,0.00092244206,0.00010937083],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023523541,0.00071989757,0.0007345942,0.0012280003,0.00064128224,0.0011301688,0.0016180143,0.00066815864,0.004421952],"category_scores_gemma":[0.011385896,0.00062778697,0.0015144214,0.00049210986,0.0015410585,0.0017567789,0.0022425489,0.0013260236,0.00093893067],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00073105155,0.00035260466,0.0033749046,0.000867755,0.00014370804,0.0014769379,0.001199295,0.16951445,0.15369478,0.31921226,0.008646597,0.34078556],"study_design_scores_gemma":[0.00016659182,0.0002067458,0.0007853276,0.000094900344,0.00012544036,0.0005368934,0.00023030839,0.62431926,0.16846313,0.18493076,0.020071412,0.00006922588],"about_ca_topic_score_codex":0.0006707947,"about_ca_topic_score_gemma":0.0011790578,"teacher_disagreement_score":0.004421952,"about_ca_system_score_codex":0.0008231873,"about_ca_system_score_gemma":0.0018691478,"threshold_uncertainty_score":0.014792919},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024243476,0.00006551169,0.9726275,0.00026587324,0.000017141192,0.000060389844,0.00006496735,0.000724993,0.0019301726],"genre_scores_gemma":[0.8898281,0.00007817472,0.107926644,0.00018033155,0.000025823358,0.00022405456,0.00011902933,0.00014650788,0.0014713953],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973236,0.0008256593,0.00014657438,0.0004272304,0.00093848276,0.00033845977],"domain_scores_gemma":[0.9912738,0.006380365,0.0009523049,0.00056379783,0.0006172083,0.00021249524],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00262432,0.0008374111,0.0009228218,0.0005328138,0.0006217734,0.0016321914,0.0014717354,0.00093883276,0.0022886645],"category_scores_gemma":[0.011104196,0.0005859846,0.0007389396,0.0006446965,0.0021112193,0.0017143796,0.0019448255,0.0014585576,0.00030454417],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010041275,0.00003897896,0.0003072885,0.000046813624,0.00002350005,0.00013521488,0.00008945122,0.96346813,0.0019120107,0.024110861,0.00035368305,0.009413624],"study_design_scores_gemma":[0.000016117783,0.000014796408,0.00002804549,0.0000050951644,0.0000046250025,0.000008717534,0.0000062559684,0.9855985,0.0006771561,0.013459486,0.00017807946,0.0000031396805],"about_ca_topic_score_codex":0.0053456663,"about_ca_topic_score_gemma":0.004842194,"teacher_disagreement_score":0.0053456663,"about_ca_system_score_codex":0.0017046479,"about_ca_system_score_gemma":0.0018107151,"threshold_uncertainty_score":0.013878882},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026164227,0.00018609318,0.99397486,0.00013972739,0.00002878783,0.000055917473,0.00004308282,0.00015477167,0.0028003168],"genre_scores_gemma":[0.25724387,0.00075477327,0.738222,0.00030163157,0.00024036058,0.00039899163,0.00024714004,0.00023275604,0.0023584764],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9932099,0.0021586411,0.0007272069,0.0010164824,0.0023246552,0.0005631007],"domain_scores_gemma":[0.97969294,0.01504844,0.0012024585,0.0021652586,0.0016434962,0.00024752386],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009593922,0.0011892534,0.0008100924,0.003575738,0.0011694072,0.0035138752,0.0021121558,0.0008686011,0.0038524382],"category_scores_gemma":[0.020393202,0.0007579593,0.0028849232,0.0023563784,0.006524854,0.0052477624,0.0028234732,0.0038362886,0.00065913075],"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.000023091165,0.000042454223,0.00049372663,0.00017335576,0.00002503789,0.00019963176,0.00031352826,0.019365385,0.0018595309,0.95288014,0.0005002027,0.024123969],"study_design_scores_gemma":[0.000027984934,0.00006690776,0.0004558793,0.00014049832,0.000040355222,0.00023457302,0.000069484486,0.11622104,0.005516873,0.867567,0.009617717,0.000041597697],"about_ca_topic_score_codex":0.002123727,"about_ca_topic_score_gemma":0.0019692923,"teacher_disagreement_score":0.009593922,"about_ca_system_score_codex":0.0026402976,"about_ca_system_score_gemma":0.0018462024,"threshold_uncertainty_score":0.050738096},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030216638,0.00299658,0.9643375,0.004068834,0.00015997518,0.00006827632,0.00008321626,0.00021944375,0.025044426],"genre_scores_gemma":[0.20943391,0.0060836347,0.76980746,0.0018324651,0.0010729859,0.00078481,0.00031093034,0.0003066419,0.010367256],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9945287,0.0023986865,0.00034636498,0.00090608356,0.0014783341,0.00034177775],"domain_scores_gemma":[0.99293315,0.0041769105,0.00055961433,0.0011957798,0.0007643734,0.00037009348],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005768453,0.0016940733,0.0016353211,0.0033659902,0.0015411027,0.008917711,0.0037378785,0.003251961,0.004414028],"category_scores_gemma":[0.0073303003,0.0015272406,0.0026489848,0.0022353618,0.012458281,0.0149525,0.0049407133,0.00982749,0.001074792],"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.0000122169995,0.000014830127,0.000044147335,0.00005656199,0.000009029529,0.000023745079,0.00016992344,0.006540883,0.00024594116,0.9880471,0.0003269222,0.004508582],"study_design_scores_gemma":[0.000016840082,0.000021823174,0.00008108146,0.00005817399,0.000014490403,0.000026000223,0.000116146155,0.039285015,0.00033985003,0.94762844,0.012394696,0.000017472146],"about_ca_topic_score_codex":0.004792717,"about_ca_topic_score_gemma":0.003666099,"teacher_disagreement_score":0.008917711,"about_ca_system_score_codex":0.0048911856,"about_ca_system_score_gemma":0.0034099,"threshold_uncertainty_score":0.03548819},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05651105,0.000094276555,0.9379679,0.00024756222,0.00006403751,0.00013538782,0.00016824895,0.0032889862,0.0015224523],"genre_scores_gemma":[0.43207076,0.00012161331,0.56465024,0.00022831286,0.000042974712,0.00028566638,0.0006451511,0.0010080987,0.0009471801],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9908826,0.0023665081,0.0006524462,0.0016270948,0.0036539924,0.00081734866],"domain_scores_gemma":[0.9578617,0.02671987,0.0037929767,0.008118721,0.0031342276,0.00037254693],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0047252555,0.0013889333,0.0013647608,0.003314432,0.0009380937,0.001981916,0.0024787441,0.0013709944,0.0016993727],"category_scores_gemma":[0.03743007,0.0011036105,0.0027499644,0.0013467625,0.0023205832,0.004333102,0.0028033666,0.002104194,0.00043340155],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007388502,0.0008121306,0.023498157,0.0013262605,0.0005816253,0.0032113374,0.002262753,0.33178234,0.09276789,0.28513098,0.0058676573,0.25202003],"study_design_scores_gemma":[0.0000634531,0.00017903022,0.0007353866,0.00014160227,0.00015187998,0.00071945385,0.00012224354,0.81514126,0.08729754,0.091890134,0.0034816905,0.00007628561],"about_ca_topic_score_codex":0.0027592778,"about_ca_topic_score_gemma":0.0049947593,"teacher_disagreement_score":0.0047252555,"about_ca_system_score_codex":0.001120101,"about_ca_system_score_gemma":0.0027524778,"threshold_uncertainty_score":0.024989903},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03100753,0.00008251195,0.9650343,0.0002272317,0.000019985304,0.00010891598,0.00011339151,0.0010541931,0.0023518505],"genre_scores_gemma":[0.5321528,0.00009328265,0.4656724,0.00013192186,0.00001462241,0.0002258641,0.00023722227,0.00016206717,0.0013098884],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99786854,0.000839878,0.00018412093,0.0002978119,0.0005674867,0.0002420921],"domain_scores_gemma":[0.9899041,0.0072234403,0.0007353904,0.0011495277,0.0007127417,0.0002747597],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003178272,0.00083694723,0.0005144937,0.000473615,0.00062652846,0.001504824,0.0013784237,0.0010433462,0.0022493482],"category_scores_gemma":[0.010714855,0.00048103053,0.00096337346,0.0005124318,0.0023495024,0.0021478902,0.002304633,0.0018450667,0.000332733],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003777496,0.00019610915,0.0022223045,0.0005719386,0.000076646575,0.00051562587,0.0007342878,0.70353585,0.012067323,0.21280657,0.0012849672,0.06561063],"study_design_scores_gemma":[0.00006202767,0.00010199392,0.0001913508,0.000042524734,0.000022069959,0.000072131246,0.00007904717,0.87615496,0.012585313,0.107860886,0.0028089276,0.000018735533],"about_ca_topic_score_codex":0.003696922,"about_ca_topic_score_gemma":0.0062046517,"teacher_disagreement_score":0.003696922,"about_ca_system_score_codex":0.0013366834,"about_ca_system_score_gemma":0.0034468786,"threshold_uncertainty_score":0.01680851},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00092395674,0.00011455997,0.996861,0.0003354216,0.00003354926,0.000039432078,0.00011370879,0.00061587134,0.00096251647],"genre_scores_gemma":[0.13480255,0.0005784435,0.8584221,0.0009340654,0.00013186812,0.000854929,0.0006257404,0.0008868663,0.002763517],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99544036,0.002414245,0.0004885991,0.00053384405,0.00086182315,0.0002611509],"domain_scores_gemma":[0.9892531,0.007684153,0.0006675111,0.0014945802,0.0007055899,0.00019509783],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0050836727,0.001395117,0.0007623931,0.0008307347,0.00068582234,0.0033752024,0.0020418765,0.001979582,0.0071504656],"category_scores_gemma":[0.020061446,0.001006435,0.0019861923,0.0009767839,0.004660803,0.005352544,0.0022102376,0.006037684,0.0021860786],"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.00010392573,0.00006737574,0.00046809373,0.00023672648,0.00002459195,0.0001611037,0.00049248064,0.0811724,0.0021645066,0.870478,0.0035846718,0.04104614],"study_design_scores_gemma":[0.0000570925,0.000043684966,0.00006422536,0.00013896843,0.00002090474,0.00008083292,0.00006585196,0.34288564,0.0026620522,0.63823426,0.0157141,0.000032505486],"about_ca_topic_score_codex":0.0036164357,"about_ca_topic_score_gemma":0.0045413924,"teacher_disagreement_score":0.0071504656,"about_ca_system_score_codex":0.0018352126,"about_ca_system_score_gemma":0.0030863143,"threshold_uncertainty_score":0.02688533},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0037369449,0.000108254,0.9942154,0.00013820922,0.00001661589,0.00003977655,0.000042639964,0.00017562578,0.0015265482],"genre_scores_gemma":[0.26811308,0.0010285872,0.7271978,0.00023657233,0.00015729581,0.00048407938,0.00034275436,0.00023226115,0.0022075078],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9955734,0.0018109428,0.00031243367,0.0004099657,0.0015164132,0.000376762],"domain_scores_gemma":[0.984861,0.010990224,0.0009271909,0.0013407614,0.0017094138,0.00017141193],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0077188364,0.0012497511,0.0006470892,0.0021337902,0.00073553884,0.002990741,0.0023621786,0.0010606651,0.0027073708],"category_scores_gemma":[0.017550694,0.0006916852,0.0033316368,0.001271083,0.003831428,0.0032744624,0.0022086452,0.0026588447,0.00065254717],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029188344,0.00009729263,0.0007350963,0.00033037437,0.000055681518,0.00042815637,0.00047253788,0.31946847,0.004610797,0.6493096,0.000953201,0.02350965],"study_design_scores_gemma":[0.000022929677,0.00003412155,0.00017078112,0.000103403065,0.000042085092,0.00009297392,0.00006350267,0.6241963,0.0044934712,0.36531857,0.0054371934,0.000024665631],"about_ca_topic_score_codex":0.0033742017,"about_ca_topic_score_gemma":0.0018545832,"teacher_disagreement_score":0.0077188364,"about_ca_system_score_codex":0.0023815164,"about_ca_system_score_gemma":0.002781101,"threshold_uncertainty_score":0.040821552},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.60030055,0.00078348943,0.37766495,0.003601691,0.000069340706,0.00032115576,0.0015364109,0.0010118706,0.014710589],"genre_scores_gemma":[0.9548159,0.00044971882,0.03955318,0.00023453693,0.00009372556,0.00020786945,0.0009880947,0.00013529498,0.00352174],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970409,0.0006878046,0.00025200399,0.0008268498,0.0006511829,0.0005411792],"domain_scores_gemma":[0.98212975,0.015226376,0.0010828016,0.00081314665,0.000425581,0.00032235848],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018905147,0.00081692025,0.0008273492,0.0009426739,0.0011331328,0.004109215,0.0014999649,0.0012437043,0.0047623273],"category_scores_gemma":[0.011335676,0.00063915516,0.0023382406,0.0010068973,0.0027797536,0.0070535988,0.0025968628,0.0030533965,0.00026431773],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007794223,0.00026005073,0.004774522,0.0007130546,0.000171712,0.0005374868,0.0010119618,0.5730455,0.0132676605,0.3686392,0.0020574837,0.034741964],"study_design_scores_gemma":[0.00007960775,0.00007777611,0.0010311755,0.000041439936,0.00008027553,0.00014854898,0.00016698943,0.55971605,0.006301358,0.4306581,0.0016537758,0.00004491109],"about_ca_topic_score_codex":0.005341442,"about_ca_topic_score_gemma":0.0047826134,"teacher_disagreement_score":0.005341442,"about_ca_system_score_codex":0.0032745402,"about_ca_system_score_gemma":0.0023190195,"threshold_uncertainty_score":0.02375859},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008826203,0.00015103511,0.9834992,0.00009399249,0.00005720626,0.00007185503,0.00011783342,0.0016889251,0.0054937634],"genre_scores_gemma":[0.47363976,0.00030884647,0.5171225,0.0001802583,0.00006977781,0.0005659616,0.0007265761,0.00064524356,0.006741114],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99824214,0.00056301814,0.00010202844,0.00029424558,0.0005707102,0.00022785705],"domain_scores_gemma":[0.9946402,0.0040997025,0.00017656639,0.00076546264,0.00025407597,0.00006407979],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014194342,0.0010979119,0.0011912227,0.0008509682,0.0006568622,0.0015989358,0.0018607271,0.0010245309,0.008579177],"category_scores_gemma":[0.007180563,0.00063829956,0.0017218171,0.0006801679,0.0014130952,0.001999083,0.0019739133,0.0034842687,0.0015752569],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006161094,0.00020583713,0.00057110336,0.0006512286,0.000103635444,0.00032390913,0.00036154286,0.52626795,0.01975361,0.28220177,0.0040085576,0.16493478],"study_design_scores_gemma":[0.00003110377,0.000044726126,0.00006297526,0.000058957357,0.000023616712,0.000038224924,0.000028864775,0.9045636,0.006045608,0.08621671,0.002873862,0.00001181164],"about_ca_topic_score_codex":0.0028881966,"about_ca_topic_score_gemma":0.0044514234,"teacher_disagreement_score":0.008579177,"about_ca_system_score_codex":0.0020677152,"about_ca_system_score_gemma":0.001417736,"threshold_uncertainty_score":0.028700173},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000635169,0.0000352076,0.99797565,0.000054358734,0.000014448702,0.000046628615,0.00003857826,0.00060442137,0.0005956564],"genre_scores_gemma":[0.07791776,0.00028611897,0.9188966,0.00016553927,0.00007023018,0.00033712797,0.00026815687,0.00030905553,0.0017494757],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966738,0.00091631117,0.0003874258,0.00044802306,0.0012928229,0.0002815407],"domain_scores_gemma":[0.9938053,0.003860303,0.000423674,0.0012059564,0.0006015837,0.0001032588],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004854208,0.0010011051,0.00065893604,0.0018862733,0.0010800409,0.0020973554,0.0026439126,0.0008316277,0.00466086],"category_scores_gemma":[0.008806346,0.00083804014,0.002723314,0.00088006194,0.0038129287,0.0026718825,0.0025549873,0.002305384,0.0011140232],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000072142924,0.00017834682,0.00090533646,0.0008038438,0.000116723124,0.0007509114,0.0006016743,0.10742832,0.018027488,0.7378618,0.0033276784,0.12992564],"study_design_scores_gemma":[0.00013973723,0.00026770352,0.0004831741,0.00033842208,0.00016772514,0.0008566179,0.0001389626,0.4100261,0.037138153,0.4903102,0.060015555,0.00011760604],"about_ca_topic_score_codex":0.0023745515,"about_ca_topic_score_gemma":0.0020014008,"teacher_disagreement_score":0.004854208,"about_ca_system_score_codex":0.0013493096,"about_ca_system_score_gemma":0.0031066444,"threshold_uncertainty_score":0.02567178},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001488937,0.000030002151,0.99295664,0.000064341606,0.00002593683,0.00004696674,0.000043738753,0.0044604917,0.00088286406],"genre_scores_gemma":[0.06858129,0.00014900528,0.9278609,0.00022005745,0.000025968835,0.0002582041,0.00037118854,0.0010151785,0.001518138],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997191,0.00093437894,0.00026326277,0.00036573588,0.0010337173,0.00021182121],"domain_scores_gemma":[0.9949721,0.0031505413,0.00022842694,0.0011675538,0.00038530972,0.00009599243],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039137118,0.0008773684,0.0007239135,0.001470576,0.0004516416,0.0016515534,0.0020200873,0.0013552041,0.005527642],"category_scores_gemma":[0.009266258,0.00074006076,0.0012768875,0.0006258696,0.0013435769,0.0023493918,0.0027609565,0.0022128082,0.0017249755],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042742418,0.00029866633,0.003513985,0.0008394262,0.00016251949,0.0011849232,0.0012764103,0.15699337,0.02528784,0.37891227,0.008036181,0.42306694],"study_design_scores_gemma":[0.00014345883,0.00018701584,0.00039440746,0.00021928811,0.00007508884,0.000506249,0.00014388852,0.6622311,0.037653156,0.1793684,0.118988544,0.000089397385],"about_ca_topic_score_codex":0.0014280357,"about_ca_topic_score_gemma":0.0016205574,"teacher_disagreement_score":0.005527642,"about_ca_system_score_codex":0.0006594641,"about_ca_system_score_gemma":0.0013312813,"threshold_uncertainty_score":0.020697951},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46955004,0.0005900243,0.51013273,0.0005726349,0.000104836356,0.00021120971,0.00063810166,0.0012427758,0.016957596],"genre_scores_gemma":[0.9081094,0.00033923617,0.08248161,0.00014690627,0.00007682982,0.00015408131,0.0006358792,0.00007783427,0.007978153],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99914575,0.00015898017,0.00008459074,0.0002828965,0.00016465397,0.00016324493],"domain_scores_gemma":[0.99744713,0.0015780918,0.0004015715,0.00023173007,0.00019189033,0.00014961633],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007502389,0.00058223674,0.0004324808,0.0006131276,0.0007290356,0.0016593506,0.00114419,0.0005276788,0.0040482967],"category_scores_gemma":[0.0026894673,0.00032109595,0.0012287374,0.0007162515,0.0016140314,0.0036260928,0.0016229035,0.0017165159,0.00042022375],"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.00042573322,0.00025225108,0.0024123376,0.00040950175,0.000056759338,0.0009489356,0.000990067,0.17475224,0.022274552,0.75688624,0.0010084608,0.039582938],"study_design_scores_gemma":[0.00007761544,0.00026763836,0.0009166924,0.00006630373,0.00007546444,0.00031429608,0.00027477194,0.43285367,0.021791711,0.53418803,0.009107109,0.000066722445],"about_ca_topic_score_codex":0.0028700163,"about_ca_topic_score_gemma":0.003097078,"teacher_disagreement_score":0.0040482967,"about_ca_system_score_codex":0.0013450973,"about_ca_system_score_gemma":0.000864047,"threshold_uncertainty_score":0.013542891},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012085938,0.000042859258,0.98608047,0.000038579205,0.0000069880725,0.000028080458,0.00010195614,0.00057682436,0.0010383971],"genre_scores_gemma":[0.57578635,0.00015414967,0.42036355,0.00007815353,0.000015482452,0.00030429536,0.0008354208,0.00028742207,0.0021750752],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991449,0.00020897493,0.00004550244,0.00014680132,0.0003550831,0.0000987671],"domain_scores_gemma":[0.99874663,0.00070239435,0.000116541225,0.00023754126,0.00015049572,0.000046363133],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077549776,0.0009517885,0.00077205134,0.00085298874,0.0004037896,0.00070768985,0.00085452024,0.0004992335,0.0026145459],"category_scores_gemma":[0.0030942396,0.0006616848,0.0015192681,0.00053004955,0.0010909894,0.000976864,0.0017475403,0.0014389936,0.00043897817],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000056279936,0.000022675287,0.00041919673,0.00005594708,0.000020969994,0.000068724126,0.00004953371,0.9547338,0.0033187072,0.023086749,0.0003648768,0.017802572],"study_design_scores_gemma":[0.000005925721,0.00000925239,0.00003790594,0.00000427788,0.0000045587376,0.000008436328,0.000004157505,0.9844617,0.0006402034,0.014569851,0.00025094431,0.0000027795763],"about_ca_topic_score_codex":0.0061579915,"about_ca_topic_score_gemma":0.0072838212,"teacher_disagreement_score":0.0061579915,"about_ca_system_score_codex":0.0011849524,"about_ca_system_score_gemma":0.0017743761,"threshold_uncertainty_score":0.012244284},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.057739813,0.0007221466,0.92285085,0.0026772008,0.0001661296,0.00010854101,0.000113429145,0.00051298214,0.015108936],"genre_scores_gemma":[0.5403009,0.0006072518,0.44562808,0.00074862933,0.00004823492,0.00016710011,0.00023946464,0.0005022902,0.011757943],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999616,0.00017754837,0.000010777745,0.00007194822,0.000057415262,0.0000663291],"domain_scores_gemma":[0.9986706,0.0009941135,0.00006288428,0.00009801457,0.00010744866,0.00006690391],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010172394,0.00068441656,0.0006528178,0.0004084428,0.0006894486,0.0007414243,0.0010573062,0.0017882455,0.0046951133],"category_scores_gemma":[0.0055564553,0.00040039708,0.0006580612,0.00045741905,0.0015529157,0.0012014987,0.0018816503,0.001058501,0.00047165272],"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.00014897017,0.000054454013,0.0009201199,0.00020778642,0.00004779579,0.00023189028,0.00041298836,0.7358921,0.0026253357,0.13355295,0.009262599,0.116642945],"study_design_scores_gemma":[0.00006684247,0.000062600106,0.00014254003,0.000053978245,0.000028110493,0.00008126497,0.00020124862,0.84417,0.0015354771,0.14659621,0.007048438,0.0000133234],"about_ca_topic_score_codex":0.0059983563,"about_ca_topic_score_gemma":0.005840243,"teacher_disagreement_score":0.0059983563,"about_ca_system_score_codex":0.00055226544,"about_ca_system_score_gemma":0.0011803551,"threshold_uncertainty_score":0.015706718},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016883159,0.00006881065,0.9721719,0.00017886944,0.0000732677,0.00010183901,0.00042713614,0.006613829,0.0034810856],"genre_scores_gemma":[0.55094767,0.00019531557,0.4404333,0.00041588637,0.00011532249,0.00037102966,0.001624289,0.0013022857,0.004594831],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9928087,0.0024164785,0.0007552637,0.0009875125,0.0025682368,0.0004637707],"domain_scores_gemma":[0.9824553,0.009969092,0.0011871416,0.0033164693,0.002811704,0.0002604177],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004750887,0.0011247022,0.00068137044,0.001261202,0.0008276511,0.0029618922,0.0024770116,0.0011320518,0.005031676],"category_scores_gemma":[0.014469854,0.00080446416,0.0016855067,0.0008659418,0.0015642404,0.004489252,0.0021458513,0.0016541311,0.0011685692],"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.0010927634,0.0005372682,0.007451128,0.0013513459,0.00035459446,0.0016423488,0.0008594954,0.2863876,0.087060615,0.4542614,0.011715308,0.14728618],"study_design_scores_gemma":[0.00024714207,0.00026158456,0.00033329724,0.00006791282,0.00009979921,0.0004613054,0.00010486233,0.78063947,0.08305349,0.11237518,0.022277372,0.000078619414],"about_ca_topic_score_codex":0.0041276203,"about_ca_topic_score_gemma":0.0044830483,"teacher_disagreement_score":0.005031676,"about_ca_system_score_codex":0.0016821008,"about_ca_system_score_gemma":0.0031247179,"threshold_uncertainty_score":0.025125444},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010976397,0.0055734185,0.92767316,0.0011070439,0.00030567189,0.0000970981,0.00014342151,0.0006524539,0.06335007],"genre_scores_gemma":[0.103432566,0.012629087,0.77917576,0.0011679116,0.00066626054,0.0009204011,0.0006397498,0.0009521973,0.10041604],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990227,0.00028750658,0.00007001371,0.0001794903,0.00038247282,0.000057675854],"domain_scores_gemma":[0.9989549,0.00067028793,0.000057975565,0.000184681,0.000104151404,0.000027926466],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015837431,0.0011089985,0.0005797758,0.0012675734,0.0008153792,0.003145819,0.0023775718,0.0015285566,0.016230844],"category_scores_gemma":[0.0022447854,0.00082880387,0.0015204446,0.00087524,0.0042114845,0.005013261,0.0019194247,0.0033380666,0.0046502673],"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.000005563025,0.000011496149,0.000030186296,0.0001752468,0.000008865796,0.000048931306,0.00017249612,0.0026299746,0.00078583765,0.96884567,0.0036887082,0.0235969],"study_design_scores_gemma":[0.00001353693,0.000013090271,0.000040652892,0.0001751362,0.000010382768,0.00019624317,0.00005792125,0.014297583,0.0017846235,0.85170823,0.13168661,0.00001590538],"about_ca_topic_score_codex":0.00053754327,"about_ca_topic_score_gemma":0.0006750031,"teacher_disagreement_score":0.016230844,"about_ca_system_score_codex":0.0017153904,"about_ca_system_score_gemma":0.0011117985,"threshold_uncertainty_score":0.054297626},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030001136,0.00028469728,0.99204046,0.000574669,0.00007491356,0.00003372866,0.000081544815,0.0002394526,0.00367035],"genre_scores_gemma":[0.4804346,0.0010335059,0.49607205,0.0008937031,0.00059846573,0.00055844674,0.0009039907,0.0019237055,0.017581593],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98994386,0.0048568277,0.00047981914,0.0015039481,0.0024833186,0.00073223916],"domain_scores_gemma":[0.91216344,0.0776071,0.0016556885,0.0041303965,0.0032428019,0.0012005738],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.018764297,0.0034039614,0.003412046,0.0022839971,0.0014034517,0.0047831736,0.0037244537,0.0047420864,0.01464082],"category_scores_gemma":[0.09936618,0.0029196355,0.0022769233,0.0017157757,0.0055438466,0.008897858,0.010128332,0.0095514385,0.0016581819],"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.0002996216,0.000078925805,0.0006047183,0.0003333152,0.00010872168,0.00009543523,0.00023111842,0.45741317,0.0011800991,0.49262473,0.0038535406,0.043176547],"study_design_scores_gemma":[0.00002399338,0.00003275318,0.00008338634,0.00007082389,0.000016540338,0.000027975313,0.000017886023,0.7320379,0.00089847855,0.26576915,0.0010053653,0.000015710368],"about_ca_topic_score_codex":0.0029893976,"about_ca_topic_score_gemma":0.0028730116,"teacher_disagreement_score":0.018764297,"about_ca_system_score_codex":0.0036885329,"about_ca_system_score_gemma":0.0036945606,"threshold_uncertainty_score":0.09923631},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01285116,0.00037535984,0.96831435,0.00045078807,0.00013978341,0.00021147465,0.00021451338,0.005558313,0.011884377],"genre_scores_gemma":[0.29490647,0.00077156565,0.68613976,0.00042567396,0.00019358637,0.00034353306,0.0013058241,0.0033694012,0.012544157],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9906673,0.0023660539,0.0005727227,0.0015592361,0.0038013346,0.0010333379],"domain_scores_gemma":[0.9680447,0.017314166,0.0010250465,0.009729434,0.0034731652,0.00041336587],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0052141966,0.001254815,0.0015175324,0.0021935126,0.0014872638,0.004126762,0.0032226343,0.0025151705,0.01409923],"category_scores_gemma":[0.030326564,0.0017900195,0.0025231913,0.001837562,0.0039668344,0.009453246,0.0052957875,0.0042935046,0.0054683047],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008383057,0.00027170728,0.0017410646,0.0011775723,0.00013343534,0.0003021533,0.00060812716,0.0614045,0.022864806,0.5130546,0.01615485,0.38144884],"study_design_scores_gemma":[0.00019405394,0.00012452574,0.0005226181,0.00039906253,0.000099262405,0.00044890042,0.00014347104,0.19019814,0.053168792,0.7258428,0.028772982,0.000085398184],"about_ca_topic_score_codex":0.0016231153,"about_ca_topic_score_gemma":0.0016677245,"teacher_disagreement_score":0.01409923,"about_ca_system_score_codex":0.001971769,"about_ca_system_score_gemma":0.0045521576,"threshold_uncertainty_score":0.047166646},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042473227,0.00010488845,0.9426149,0.00023912729,0.00007782837,0.00023804173,0.00048485704,0.0043983376,0.009368747],"genre_scores_gemma":[0.48412168,0.00017024147,0.5041687,0.00020480105,0.000046596324,0.00025060415,0.0013273759,0.0014793572,0.008230641],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9937785,0.0013374924,0.00038432612,0.00053214666,0.003362252,0.00060522323],"domain_scores_gemma":[0.99516284,0.0015311748,0.0003835825,0.0015353458,0.0013293736,0.0000577246],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003854113,0.0006028417,0.00048200705,0.0017190065,0.00058957055,0.0017409688,0.0016186428,0.0007713366,0.0067327586],"category_scores_gemma":[0.007840492,0.00052173896,0.0019067898,0.00077380356,0.0014413705,0.0023437901,0.0015938181,0.0012047815,0.0014484236],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00078253634,0.00020730839,0.007880713,0.0006248171,0.00017617138,0.0008297232,0.00077940157,0.13457422,0.068148986,0.5959833,0.008219715,0.18179311],"study_design_scores_gemma":[0.00012380564,0.00047105108,0.0030283667,0.00022585192,0.00020472535,0.00051256263,0.00035998912,0.6703139,0.09874662,0.1771666,0.048741035,0.00010553685],"about_ca_topic_score_codex":0.0050895587,"about_ca_topic_score_gemma":0.005087762,"teacher_disagreement_score":0.0067327586,"about_ca_system_score_codex":0.0012821204,"about_ca_system_score_gemma":0.0025584884,"threshold_uncertainty_score":0.022523344},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00077112386,0.001077535,0.9912766,0.0005624236,0.00011614488,0.000042526815,0.00015846732,0.00012132291,0.0058737434],"genre_scores_gemma":[0.26498234,0.0058362572,0.71091706,0.0010692921,0.0011005764,0.0010850185,0.0009654718,0.00023001726,0.013814079],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980464,0.0005923998,0.0001747771,0.0002937133,0.0007526015,0.00014005735],"domain_scores_gemma":[0.99803466,0.0010918031,0.00033946618,0.00017939368,0.00025921655,0.00009546735],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002501605,0.0013977954,0.00080249406,0.0015893189,0.0011994336,0.0025791924,0.0024174373,0.0019689137,0.004999271],"category_scores_gemma":[0.004590071,0.00070002966,0.0023475115,0.0015910463,0.0036444613,0.0050358027,0.0022737482,0.0038773352,0.0012941541],"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.000005268257,0.0000098392,0.00008100984,0.00007596973,0.000016314689,0.00008692952,0.0000908552,0.026186273,0.0004948027,0.9669681,0.0010084982,0.004976162],"study_design_scores_gemma":[0.000015256806,0.00002257833,0.00006975958,0.00005192964,0.000020668458,0.00018688013,0.000045194727,0.13076268,0.0004233064,0.8342262,0.03415452,0.000021167822],"about_ca_topic_score_codex":0.003446158,"about_ca_topic_score_gemma":0.0022721025,"teacher_disagreement_score":0.004999271,"about_ca_system_score_codex":0.0017001736,"about_ca_system_score_gemma":0.0020299493,"threshold_uncertainty_score":0.016724229},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0208272,0.00006930093,0.9769384,0.00006098284,0.000013022128,0.00008139482,0.000039909817,0.00048007176,0.0014896579],"genre_scores_gemma":[0.5086245,0.00012313531,0.48908296,0.00006247411,0.000013278336,0.00028691645,0.0001750623,0.0001279499,0.00150382],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981521,0.0005155932,0.00017441828,0.00044392946,0.0005472951,0.00016660514],"domain_scores_gemma":[0.99643207,0.0023915963,0.0003311461,0.00052787253,0.00025427603,0.00006295118],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020920727,0.0007224649,0.00069329084,0.0004371881,0.0004136048,0.0010640281,0.0009377528,0.00057149783,0.0023978974],"category_scores_gemma":[0.005149864,0.000502045,0.00095897086,0.0003922014,0.0011579941,0.0011992748,0.0009947811,0.0012088594,0.00025974648],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026219946,0.00011271301,0.00093292195,0.0004016521,0.000054692628,0.00039095053,0.00033340263,0.71687,0.031631563,0.12590839,0.00065149536,0.12244998],"study_design_scores_gemma":[0.00005379106,0.00014399573,0.000114282564,0.000028730647,0.00002523479,0.000066728746,0.000035173,0.9394885,0.0171856,0.041420095,0.001420943,0.00001693137],"about_ca_topic_score_codex":0.0018364403,"about_ca_topic_score_gemma":0.003207425,"teacher_disagreement_score":0.0023978974,"about_ca_system_score_codex":0.00085094874,"about_ca_system_score_gemma":0.0020540955,"threshold_uncertainty_score":0.011064112},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.081179425,0.00013026851,0.9134532,0.00021171887,0.000024889248,0.00016925592,0.000065921806,0.0021470776,0.0026182914],"genre_scores_gemma":[0.46600312,0.00009745455,0.53140694,0.00016072766,0.000020852824,0.00019781174,0.0002797457,0.0004164591,0.0014169883],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973712,0.0008460232,0.0001300141,0.00033511466,0.0009296312,0.00038788808],"domain_scores_gemma":[0.9903453,0.0069448417,0.0005199549,0.0013593729,0.0007008525,0.00012970081],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022576873,0.00086527044,0.00077499315,0.001559362,0.00083790877,0.0013010883,0.0018726883,0.00071077264,0.0019531855],"category_scores_gemma":[0.014278766,0.00085144426,0.0014175632,0.00092142355,0.0025448848,0.0028633985,0.0035112847,0.0018019275,0.0003328333],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007965225,0.00027017968,0.012009704,0.00065058965,0.000103431325,0.0004525014,0.0007709754,0.26707155,0.04254595,0.3014974,0.0031559956,0.37067524],"study_design_scores_gemma":[0.00006147226,0.00013081342,0.00053943327,0.000085644446,0.000050725328,0.000108618406,0.00012899529,0.78429896,0.06267534,0.148871,0.0030138867,0.00003514043],"about_ca_topic_score_codex":0.0029070764,"about_ca_topic_score_gemma":0.0061746426,"teacher_disagreement_score":0.0029070764,"about_ca_system_score_codex":0.0015221171,"about_ca_system_score_gemma":0.0028971047,"threshold_uncertainty_score":0.011939943},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5516888,0.00032328794,0.33337238,0.0026866912,0.0003520428,0.00023244899,0.0012118113,0.0017557956,0.1083767],"genre_scores_gemma":[0.94992316,0.0001791036,0.028292563,0.00033446666,0.00010760773,0.00012683014,0.0011480326,0.00024656142,0.019641638],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971636,0.00025431957,0.00017712174,0.00065759773,0.00094951974,0.00079776224],"domain_scores_gemma":[0.99538124,0.0021942924,0.0004557871,0.00072370464,0.0007892046,0.00045579494],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015370073,0.00063536473,0.0010891758,0.0011345635,0.0029968726,0.0039411536,0.0015442667,0.0013823208,0.009842014],"category_scores_gemma":[0.0074378327,0.00064716506,0.0015473171,0.001052563,0.003735019,0.005205388,0.004449119,0.0038001088,0.0018724663],"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.00020396049,0.000049012782,0.0009643885,0.000080695754,0.000023547067,0.00033716994,0.0004061966,0.00254024,0.0036605247,0.9829562,0.0023113706,0.0064667733],"study_design_scores_gemma":[0.00005722902,0.00006315987,0.00047764793,0.000037922153,0.000030610234,0.00031464195,0.00025567578,0.009600629,0.010135562,0.97030276,0.008675659,0.00004847519],"about_ca_topic_score_codex":0.0029710466,"about_ca_topic_score_gemma":0.0017302015,"teacher_disagreement_score":0.009842014,"about_ca_system_score_codex":0.0018425427,"about_ca_system_score_gemma":0.0026581478,"threshold_uncertainty_score":0.03292477},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.061983913,0.00004348975,0.9348076,0.000079412224,0.000020027359,0.00006487188,0.000009402018,0.0002819207,0.0027094523],"genre_scores_gemma":[0.8964422,0.000052504267,0.10195079,0.0000418662,0.000010365022,0.00008632837,0.000015704796,0.000023592966,0.0013766],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992889,0.00022781706,0.000045232853,0.00014151851,0.00022381415,0.00007264096],"domain_scores_gemma":[0.99861157,0.00061083,0.00025718822,0.00025756846,0.00017606822,0.00008679537],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011001853,0.00055608514,0.00028983847,0.00026899707,0.0003466736,0.0007253146,0.00046907732,0.0003321524,0.0010793231],"category_scores_gemma":[0.0032087653,0.00019390858,0.00036812155,0.00010221599,0.0010741455,0.0006053203,0.0009509786,0.0005477864,0.00017389747],"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.00044872728,0.0003152616,0.009049965,0.0004305305,0.00012025393,0.0007045971,0.0021924935,0.55511796,0.18994185,0.05880175,0.001025042,0.18185157],"study_design_scores_gemma":[0.0000590414,0.00063132576,0.004836826,0.000054125623,0.00004221149,0.00022045177,0.0003200627,0.9346097,0.025874415,0.028168354,0.0051167514,0.000066739594],"about_ca_topic_score_codex":0.0006571847,"about_ca_topic_score_gemma":0.00077259453,"teacher_disagreement_score":0.0011001853,"about_ca_system_score_codex":0.00030060977,"about_ca_system_score_gemma":0.00039156032,"threshold_uncertainty_score":0.005818367},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04003308,0.00011515675,0.9559213,0.00005910623,0.000013464504,0.00009616505,0.00005271682,0.001823769,0.0018852736],"genre_scores_gemma":[0.4799027,0.00013558756,0.5178355,0.00005462186,0.000011266055,0.00015943489,0.00021056556,0.00038228952,0.0013079431],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99845994,0.0005815797,0.00007261809,0.00021548207,0.00053493696,0.0001355138],"domain_scores_gemma":[0.99798054,0.001190119,0.00022541819,0.00042311402,0.00013765326,0.000043145366],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014385236,0.00077388104,0.0005438775,0.0006826054,0.0004495219,0.001022527,0.00094980514,0.0004364203,0.0016242347],"category_scores_gemma":[0.004650682,0.00049488054,0.0009803707,0.00056186045,0.0010531553,0.0014933684,0.0012793897,0.0012634167,0.00028307905],"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.00024699044,0.00018153375,0.0022850814,0.00023627336,0.000045558456,0.00015048486,0.00024475725,0.82460487,0.0318936,0.043522444,0.00047545086,0.09611303],"study_design_scores_gemma":[0.0000099569115,0.000040787374,0.0001600113,0.000010873433,0.000012530735,0.000018023276,0.000018428917,0.97802895,0.012540546,0.008068016,0.0010844717,0.0000074717054],"about_ca_topic_score_codex":0.003449763,"about_ca_topic_score_gemma":0.007239615,"teacher_disagreement_score":0.003449763,"about_ca_system_score_codex":0.0012661054,"about_ca_system_score_gemma":0.0014594496,"threshold_uncertainty_score":0.009186268},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.117040165,0.17051272,0.28473824,0.031008694,0.016440084,0.0027440807,0.041384015,0.03763797,0.2984941],"genre_scores_gemma":[0.30201313,0.049676154,0.37368616,0.008381559,0.004644119,0.0026619637,0.18199135,0.029704878,0.047240783],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.96671313,0.012312644,0.0019199229,0.0025262672,0.014161505,0.002366471],"domain_scores_gemma":[0.9734476,0.010097175,0.0007597798,0.0034044427,0.010805093,0.0014859851],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.027008701,0.0031658467,0.0021900088,0.006257552,0.0015774574,0.008258489,0.0036606847,0.0018244713,0.019200515],"category_scores_gemma":[0.058066588,0.0012934974,0.0021070102,0.0068020886,0.0014969377,0.008768754,0.0046828757,0.0060341656,0.0073813805],"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.002298959,0.0011407713,0.003521606,0.0034726737,0.00036164426,0.000212982,0.0003529053,0.026077291,0.0054678647,0.0637282,0.40562654,0.48773864],"study_design_scores_gemma":[0.00072510494,0.0014264282,0.0060714497,0.003932602,0.00044107507,0.0005376498,0.00050953805,0.10031489,0.024621813,0.05963809,0.8014976,0.0002838607],"about_ca_topic_score_codex":0.0065272967,"about_ca_topic_score_gemma":0.007308567,"teacher_disagreement_score":0.027008701,"about_ca_system_score_codex":0.0044810507,"about_ca_system_score_gemma":0.006188413,"threshold_uncertainty_score":0.14283735},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05357709,0.0007180762,0.92894393,0.00043729055,0.00014224263,0.000095237796,0.00010576695,0.00027114738,0.015709247],"genre_scores_gemma":[0.8370792,0.00070447894,0.1522889,0.00029436225,0.00017355187,0.00051476475,0.0002855824,0.00017576922,0.00848338],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9961144,0.001237516,0.00031559862,0.00076382334,0.0012192867,0.00034931183],"domain_scores_gemma":[0.9962121,0.002186192,0.00045845725,0.00035210187,0.00056093093,0.00023032482],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003305269,0.0008696325,0.0007802329,0.0015732656,0.0010804763,0.0023243022,0.0010843999,0.0013031593,0.003343946],"category_scores_gemma":[0.010214178,0.0003695884,0.0012073169,0.001033817,0.003370227,0.004300648,0.0024704894,0.0025395502,0.0005863282],"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.000018732911,0.000017495098,0.00010044073,0.000020446232,0.000007632203,0.000042424366,0.0001430725,0.0052323793,0.0005916452,0.9907453,0.00010155921,0.002978887],"study_design_scores_gemma":[0.000018132965,0.000033433153,0.000075347234,0.00001837529,0.000009944237,0.00006077164,0.000036312533,0.06473133,0.0010721034,0.9314282,0.0025010826,0.000015041016],"about_ca_topic_score_codex":0.0009702224,"about_ca_topic_score_gemma":0.0005409595,"teacher_disagreement_score":0.003343946,"about_ca_system_score_codex":0.0023176947,"about_ca_system_score_gemma":0.0012507322,"threshold_uncertainty_score":0.017480135},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.050775915,0.0002993888,0.9355412,0.0003337609,0.0001260251,0.00025034725,0.0005248207,0.005323895,0.006824662],"genre_scores_gemma":[0.65238404,0.00023517649,0.34229174,0.00032724327,0.00006336293,0.00026726958,0.0008662632,0.0009160354,0.0026488826],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99060494,0.0032624742,0.0006468841,0.0012763885,0.003264628,0.00094478694],"domain_scores_gemma":[0.9786754,0.012716018,0.001012824,0.0051161586,0.0022311686,0.00024849773],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005739542,0.0011903346,0.0018389077,0.0025427311,0.0017385242,0.0033141011,0.0037357023,0.001578976,0.003547658],"category_scores_gemma":[0.019882487,0.0013208991,0.005376899,0.0013755504,0.0041380357,0.004743626,0.0031777404,0.002562974,0.0005466135],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009330791,0.00027625595,0.0031049794,0.0007485341,0.00032012834,0.0005884385,0.0006917081,0.40421283,0.013488346,0.49757606,0.004264094,0.07379551],"study_design_scores_gemma":[0.000096863114,0.00011156567,0.00020622689,0.000088305795,0.00017319982,0.0001331365,0.00007608044,0.8028268,0.018480117,0.17442685,0.0033350268,0.00004580515],"about_ca_topic_score_codex":0.018200476,"about_ca_topic_score_gemma":0.020342562,"teacher_disagreement_score":0.018200476,"about_ca_system_score_codex":0.0027765092,"about_ca_system_score_gemma":0.0059711277,"threshold_uncertainty_score":0.03618908},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03167775,0.0002156877,0.9633512,0.00036582068,0.000025318339,0.000059215836,0.00007872981,0.0015243655,0.0027018648],"genre_scores_gemma":[0.61890954,0.00019237508,0.3774474,0.00027641922,0.000022430126,0.00017089093,0.00022172306,0.0002980948,0.0024610467],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994442,0.00018147402,0.000032749307,0.00012007725,0.00015802172,0.000063455744],"domain_scores_gemma":[0.99780184,0.0016579148,0.0001633115,0.00017173546,0.00015836833,0.00004685888],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012212901,0.0007102676,0.0004275226,0.00044003123,0.00028321455,0.0007210101,0.00092446303,0.0009644589,0.0025959625],"category_scores_gemma":[0.0046823914,0.0004227069,0.00065646385,0.00028883244,0.0013025667,0.001100404,0.001012194,0.0016520984,0.0003169922],"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.00010753513,0.00006187207,0.00057459733,0.00016327476,0.000027915707,0.000062344145,0.000080200014,0.8841072,0.007819294,0.029309463,0.00090435386,0.076782025],"study_design_scores_gemma":[0.0000065860236,0.000012849742,0.00002255839,0.000006302974,0.0000027885646,0.000005816393,0.0000040730433,0.9877337,0.0015047054,0.0104372725,0.00026171398,0.0000015837447],"about_ca_topic_score_codex":0.0038376988,"about_ca_topic_score_gemma":0.008225701,"teacher_disagreement_score":0.0038376988,"about_ca_system_score_codex":0.0013794643,"about_ca_system_score_gemma":0.0016651906,"threshold_uncertainty_score":0.010008752},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07459827,0.00016786394,0.9103778,0.000122773,0.00005399841,0.0002623847,0.0000742714,0.0010063732,0.013336273],"genre_scores_gemma":[0.493738,0.00017185493,0.49766073,0.00006826871,0.000013329162,0.00034123746,0.00023573254,0.00030116984,0.007469688],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974738,0.0007241265,0.0001404323,0.00034374575,0.0010175583,0.00030026707],"domain_scores_gemma":[0.99670994,0.0016430725,0.00029941482,0.0004892586,0.0007449575,0.00011330957],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002676774,0.0008288817,0.00068144547,0.0011579522,0.0005864632,0.0017407957,0.0016636684,0.0009551097,0.0054977597],"category_scores_gemma":[0.008154512,0.00065615925,0.00081950525,0.0006967016,0.0008048337,0.0018791928,0.0025820376,0.0011397413,0.0005216114],"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.00043098698,0.00022635199,0.0038240436,0.00030029233,0.00009216287,0.0008160566,0.0009222842,0.67614615,0.034855805,0.11646827,0.0012566807,0.16466099],"study_design_scores_gemma":[0.000042094896,0.00014671098,0.0007234868,0.00006648928,0.000049045717,0.00016144119,0.00010034508,0.93663853,0.02117548,0.026994383,0.013860544,0.000041413827],"about_ca_topic_score_codex":0.0036554968,"about_ca_topic_score_gemma":0.0040465496,"teacher_disagreement_score":0.0054977597,"about_ca_system_score_codex":0.001342604,"about_ca_system_score_gemma":0.002014067,"threshold_uncertainty_score":0.018391848},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005822988,0.00028589802,0.98548996,0.0006599959,0.0002785804,0.00011778761,0.00007137104,0.00085302,0.0064203073],"genre_scores_gemma":[0.22314219,0.00050647935,0.7647692,0.0011839638,0.0011810835,0.0005386647,0.00033129472,0.001060838,0.007286226],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9828666,0.004531016,0.001866255,0.0033529378,0.006272466,0.0011108456],"domain_scores_gemma":[0.9691584,0.014422744,0.0015127414,0.009381055,0.004211458,0.0013134556],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0106960535,0.0015009857,0.0014614599,0.0035640022,0.0030969882,0.006991923,0.0042437403,0.0025382447,0.006139413],"category_scores_gemma":[0.02850893,0.0023851877,0.0043960726,0.0021593547,0.009946397,0.021487474,0.010775242,0.010191203,0.0016819055],"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.00011459949,0.0000920882,0.00032042532,0.00023207272,0.000062864725,0.00019923116,0.0007768372,0.0026808346,0.006461575,0.96234107,0.0011609801,0.025557311],"study_design_scores_gemma":[0.00008173156,0.00012784886,0.00015371329,0.00011375745,0.00017962768,0.00048796626,0.00014463266,0.028401801,0.013168213,0.93287885,0.024178648,0.00008314716],"about_ca_topic_score_codex":0.0006090292,"about_ca_topic_score_gemma":0.0007892554,"teacher_disagreement_score":0.0106960535,"about_ca_system_score_codex":0.0014243666,"about_ca_system_score_gemma":0.0025851312,"threshold_uncertainty_score":0.056566834},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09550147,0.000091123526,0.9011768,0.00013537607,0.00001229608,0.00003722164,0.000057069286,0.00028443194,0.0027042315],"genre_scores_gemma":[0.9567487,0.000076963464,0.041941036,0.000025456848,0.000015163794,0.000052307932,0.000055222587,0.00003588488,0.001049248],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998978,0.0004414937,0.000045177443,0.00009947681,0.00033610236,0.000099792946],"domain_scores_gemma":[0.99686795,0.0022959313,0.00031430705,0.00020135862,0.00027566013,0.000044774042],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001595347,0.0003752727,0.00030232072,0.0009033766,0.00031680637,0.0006595121,0.00062401575,0.00036920386,0.0013927766],"category_scores_gemma":[0.0049970015,0.00020520676,0.0006520437,0.0003637688,0.0017032227,0.0011031743,0.00071010273,0.0006815893,0.00010718784],"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.000057421938,0.000048396338,0.0015245572,0.000066808534,0.00002678834,0.00026162787,0.00025893343,0.66634333,0.005504701,0.31414673,0.00030240198,0.011458417],"study_design_scores_gemma":[0.000007496921,0.000014372368,0.00016637113,0.0000068529107,0.0000064771143,0.000019509062,0.000019235453,0.943435,0.0016050364,0.05430808,0.00040673852,0.000004845572],"about_ca_topic_score_codex":0.0039882604,"about_ca_topic_score_gemma":0.0019240049,"teacher_disagreement_score":0.0039882604,"about_ca_system_score_codex":0.001277921,"about_ca_system_score_gemma":0.000710211,"threshold_uncertainty_score":0.009272039},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0054854085,0.001762158,0.98227996,0.0011033661,0.00015790443,0.000021463915,0.000069430236,0.0011816164,0.007938644],"genre_scores_gemma":[0.41566238,0.006867862,0.5525218,0.0012233758,0.00067371165,0.00021817528,0.00036481823,0.001536677,0.02093115],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971361,0.0007708845,0.00012887565,0.0004451972,0.0013255063,0.00019348096],"domain_scores_gemma":[0.9945109,0.003517212,0.0002894927,0.00095994753,0.00064211444,0.00008034123],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016541902,0.0011193409,0.0011117767,0.0027897432,0.001101054,0.002399673,0.0024127364,0.0016003203,0.007493528],"category_scores_gemma":[0.013618083,0.00055966934,0.0013154428,0.0044655427,0.004988337,0.0077390345,0.002947743,0.0044309963,0.0019349894],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006127587,0.000017518716,0.00036590622,0.00022307497,0.000025658845,0.00011575504,0.0002070867,0.034797344,0.0028700775,0.8549517,0.002829893,0.10353469],"study_design_scores_gemma":[0.0000161553,0.000027184871,0.00011861912,0.00007542809,0.000025695665,0.0001587776,0.000054895154,0.13408539,0.0051134573,0.8449514,0.015343634,0.000029395984],"about_ca_topic_score_codex":0.0032725672,"about_ca_topic_score_gemma":0.001924602,"teacher_disagreement_score":0.007493528,"about_ca_system_score_codex":0.0020685026,"about_ca_system_score_gemma":0.002496083,"threshold_uncertainty_score":0.025068343},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00070346874,0.000049932638,0.99806505,0.000041258376,0.000023178574,0.000032491385,0.000025013282,0.00033741823,0.0007223035],"genre_scores_gemma":[0.045696244,0.00019450836,0.9511322,0.000118995406,0.000047543967,0.00018186159,0.00020356383,0.0001806626,0.0022445922],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997888,0.00030615117,0.00014404915,0.00052368146,0.001010466,0.00012762206],"domain_scores_gemma":[0.9983152,0.00065049477,0.00012799929,0.0005121617,0.00032942183,0.00006472383],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020938623,0.0010022264,0.00086307194,0.0023415266,0.0010850913,0.0019033254,0.0022421917,0.0011035528,0.0043597403],"category_scores_gemma":[0.0046527423,0.00073451374,0.002400512,0.0010492491,0.0024293142,0.003801748,0.0029731903,0.00340461,0.0014228473],"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.00009951485,0.00017774192,0.0010332362,0.00037142867,0.00017340228,0.00027424286,0.00053562503,0.06252253,0.03186741,0.7098198,0.002923811,0.19020118],"study_design_scores_gemma":[0.000060511793,0.00012013841,0.0003141322,0.00012660667,0.00014168271,0.0005175762,0.00008605267,0.46700895,0.023556476,0.45140615,0.056586627,0.00007512014],"about_ca_topic_score_codex":0.0026153019,"about_ca_topic_score_gemma":0.0025221067,"teacher_disagreement_score":0.0043597403,"about_ca_system_score_codex":0.0013656319,"about_ca_system_score_gemma":0.002406731,"threshold_uncertainty_score":0.014584839},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004911907,0.0024717494,0.15904564,0.011917498,0.01225669,0.0020428791,0.037735123,0.03599867,0.73361987],"genre_scores_gemma":[0.0862027,0.002344719,0.034312923,0.0018713992,0.0030045777,0.0010660724,0.039044544,0.009922925,0.8222301],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99786735,0.00061325764,0.00009156419,0.0005307545,0.00063840265,0.00025858177],"domain_scores_gemma":[0.99194664,0.0030251562,0.00015337771,0.003082287,0.0010688575,0.0007236602],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00377307,0.0020042802,0.002357225,0.0013234843,0.0021159733,0.005485496,0.0024890017,0.0032299045,0.7672276],"category_scores_gemma":[0.012472403,0.0007245792,0.0027846422,0.0017356169,0.0007008621,0.004245319,0.0035359836,0.0029510888,0.53370136],"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.0006093764,0.0002254024,0.00039416214,0.00033895916,0.00006199944,0.00008200036,0.00007922049,0.0013164575,0.00345942,0.014374749,0.8770399,0.10201824],"study_design_scores_gemma":[0.0004146022,0.00032134147,0.0012076766,0.00025089475,0.000117166506,0.00023145691,0.000090610614,0.015855283,0.010393082,0.043713246,0.92731714,0.00008750504],"about_ca_topic_score_codex":0.0016670631,"about_ca_topic_score_gemma":0.0028084393,"teacher_disagreement_score":0.7672276,"about_ca_system_score_codex":0.0014753332,"about_ca_system_score_gemma":0.0021872793,"threshold_uncertainty_score":0.33202153},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022113044,0.0010299261,0.9827336,0.0002559525,0.00014769497,0.000071426606,0.00010191822,0.0011109225,0.012337224],"genre_scores_gemma":[0.21378423,0.0049922676,0.7663606,0.00027088623,0.00025516714,0.00035455823,0.000520468,0.00052561617,0.012936287],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980591,0.0006869978,0.0001588056,0.00021906565,0.00074709504,0.00012893997],"domain_scores_gemma":[0.99515283,0.0039126403,0.00014726096,0.0004991207,0.00025829923,0.000029895178],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023634634,0.001044671,0.00070534943,0.0010287566,0.0006329553,0.0028131732,0.002191274,0.00096415763,0.00745277],"category_scores_gemma":[0.0066300933,0.00070801907,0.001690425,0.0007229663,0.0032826744,0.0038597977,0.0014131503,0.0020107497,0.0019488874],"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.000055033997,0.0000545052,0.00017242935,0.0009426933,0.000057456968,0.00023257559,0.0002878322,0.0545307,0.0062415153,0.8201201,0.004951452,0.11235362],"study_design_scores_gemma":[0.00005494857,0.000056828587,0.00013400744,0.00030348304,0.00005314139,0.00024206234,0.000050025228,0.167556,0.017824192,0.7664413,0.04725161,0.000032449138],"about_ca_topic_score_codex":0.001430814,"about_ca_topic_score_gemma":0.00080711313,"teacher_disagreement_score":0.00745277,"about_ca_system_score_codex":0.0011756445,"about_ca_system_score_gemma":0.0018132352,"threshold_uncertainty_score":0.024931967},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027523956,0.0028492347,0.4889471,0.0007479949,0.000557964,0.00011068357,0.0005167417,0.0061168103,0.49740118],"genre_scores_gemma":[0.07113815,0.004889132,0.1684358,0.0004101805,0.00026683536,0.00021733859,0.0025299427,0.002096934,0.7500157],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99947935,0.00006162394,0.000025903646,0.00011634412,0.00027692123,0.000039928662],"domain_scores_gemma":[0.99954116,0.00012049857,0.000012470293,0.00020878784,0.000106337684,0.000010804703],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046283557,0.0010424997,0.0005793099,0.00091280375,0.0006581399,0.0022413053,0.0009867272,0.00082218694,0.09982022],"category_scores_gemma":[0.0013166318,0.0007677821,0.0006514051,0.0010346535,0.0008159575,0.0029660633,0.0012807333,0.001389403,0.04754633],"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.000050427956,0.00004662467,0.00018192166,0.00031039762,0.000019235427,0.00010693553,0.00016846549,0.0047674663,0.006046123,0.23801653,0.10304663,0.6472393],"study_design_scores_gemma":[0.000026680264,0.000040525796,0.0002604496,0.00024990193,0.000035332938,0.00046867994,0.000055588527,0.017640585,0.018026117,0.22488762,0.7382863,0.00002218023],"about_ca_topic_score_codex":0.0011947039,"about_ca_topic_score_gemma":0.0016628838,"teacher_disagreement_score":0.09982022,"about_ca_system_score_codex":0.00076734944,"about_ca_system_score_gemma":0.0010111661,"threshold_uncertainty_score":0.33393192},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014150345,0.0009412749,0.7569495,0.0009824374,0.0003556736,0.00056073634,0.004613776,0.21267277,0.008773572],"genre_scores_gemma":[0.14227372,0.00032542174,0.8238674,0.0010345804,0.0002732381,0.0011692676,0.011926711,0.014396933,0.0047327075],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99406034,0.002213641,0.0005831995,0.0008737345,0.0018899465,0.0003791242],"domain_scores_gemma":[0.9874464,0.008841435,0.000769965,0.0014782271,0.0012088687,0.0002550241],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0054383567,0.0028667825,0.0016535808,0.0031014082,0.00083157106,0.0030174588,0.0038679852,0.002031393,0.02517412],"category_scores_gemma":[0.026334854,0.0011923937,0.0034317512,0.0021472047,0.0011910303,0.003951764,0.002812146,0.0036375937,0.009324036],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015750832,0.00048717455,0.007393826,0.0021853326,0.0005002321,0.0003272459,0.00019837265,0.15687434,0.00649809,0.04086069,0.22033028,0.5627693],"study_design_scores_gemma":[0.00032371984,0.00019572384,0.00029931482,0.000089751724,0.000046852918,0.00008874831,0.000035103265,0.9512439,0.0069619766,0.025196884,0.015483038,0.00003502742],"about_ca_topic_score_codex":0.0016717376,"about_ca_topic_score_gemma":0.004881066,"teacher_disagreement_score":0.02517412,"about_ca_system_score_codex":0.0016595474,"about_ca_system_score_gemma":0.00400985,"threshold_uncertainty_score":0.08421582},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027258273,0.0017368913,0.9458138,0.004115598,0.0005273036,0.00019962908,0.0007397817,0.0059001446,0.03824101],"genre_scores_gemma":[0.082080245,0.0027921903,0.89153314,0.003440401,0.00071021105,0.0005572065,0.002395694,0.0016372737,0.014853569],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99710816,0.00094919355,0.00022320753,0.00042791013,0.0010734837,0.00021803154],"domain_scores_gemma":[0.99430484,0.00371984,0.000235451,0.0009900292,0.0005926541,0.00015728231],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025793274,0.0012099924,0.00069566624,0.0017471901,0.00091562903,0.003384518,0.002385021,0.0018474067,0.026550643],"category_scores_gemma":[0.012217083,0.00088774494,0.001838239,0.0027492754,0.0018754033,0.0049142074,0.0041346457,0.006440659,0.008293069],"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.00012930747,0.00013253953,0.0005493862,0.0007389183,0.000077059645,0.00014027081,0.00016726945,0.033516306,0.0031920678,0.6491129,0.058380578,0.25386336],"study_design_scores_gemma":[0.00014436596,0.000032641816,0.000117083044,0.00016408258,0.000030576743,0.0001921588,0.00006920376,0.16346584,0.004363128,0.72840524,0.10298486,0.000030798994],"about_ca_topic_score_codex":0.0015633999,"about_ca_topic_score_gemma":0.002897701,"teacher_disagreement_score":0.026550643,"about_ca_system_score_codex":0.0024168384,"about_ca_system_score_gemma":0.0029164015,"threshold_uncertainty_score":0.088820755},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0038655247,0.000039795006,0.9938128,0.00005376526,0.000022177916,0.000031586053,0.00002382613,0.0013414667,0.0008090534],"genre_scores_gemma":[0.21092376,0.00011456663,0.7866688,0.00011575935,0.00003352492,0.00013802382,0.0001178342,0.0003089222,0.0015787579],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959155,0.0010793412,0.0002478463,0.00045919858,0.001992663,0.00030542654],"domain_scores_gemma":[0.99366814,0.0039221626,0.0002635939,0.0016315731,0.0004347483,0.000079809965],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038364579,0.00061580667,0.00079353555,0.001391635,0.0005748221,0.0015248089,0.0021567855,0.00070653623,0.002679205],"category_scores_gemma":[0.005306056,0.0006326691,0.0011689083,0.0005559389,0.0019657407,0.0025710845,0.0026097316,0.0013104216,0.00056995056],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036590037,0.0002780889,0.0029203536,0.00058333535,0.00031061188,0.00077902724,0.00037602667,0.32647553,0.038770575,0.37620196,0.0025042163,0.25043434],"study_design_scores_gemma":[0.00011829406,0.00009354708,0.00024498644,0.000049639613,0.000068879934,0.00017382979,0.00003242083,0.8713563,0.036180962,0.08387816,0.007769339,0.00003362871],"about_ca_topic_score_codex":0.002245328,"about_ca_topic_score_gemma":0.00243567,"teacher_disagreement_score":0.0038364579,"about_ca_system_score_codex":0.001136307,"about_ca_system_score_gemma":0.0018080315,"threshold_uncertainty_score":0.020289361},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07246007,0.011602395,0.34882358,0.12758574,0.012886277,0.0008865976,0.011613053,0.0058886604,0.40825367],"genre_scores_gemma":[0.61982876,0.009622726,0.102251895,0.018472418,0.0041509937,0.00069265213,0.009159482,0.00175917,0.23406187],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99751544,0.000599836,0.0001787419,0.0005276448,0.00072980573,0.00044864326],"domain_scores_gemma":[0.99386966,0.0023932904,0.0004858688,0.0015256323,0.0010165814,0.0007090057],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031934574,0.0007438106,0.00071722106,0.0011952091,0.0036898507,0.008138766,0.0019325707,0.0031011763,0.039327532],"category_scores_gemma":[0.013547817,0.0007041969,0.00094367,0.0016293126,0.0017188248,0.013718739,0.0032430626,0.0028433572,0.009306798],"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.00076805445,0.00018862766,0.007553639,0.0003553789,0.00007071029,0.0017973694,0.0015193304,0.0063340575,0.0013830962,0.68280476,0.12074738,0.17647764],"study_design_scores_gemma":[0.00006825039,0.000106640226,0.0013609134,0.00023821658,0.00007923854,0.0009754625,0.002081819,0.021654423,0.0030522505,0.53861535,0.43168503,0.000082404],"about_ca_topic_score_codex":0.0038383629,"about_ca_topic_score_gemma":0.002828188,"teacher_disagreement_score":0.039327532,"about_ca_system_score_codex":0.0020199788,"about_ca_system_score_gemma":0.0018243784,"threshold_uncertainty_score":0.13156372},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046538055,0.00027972794,0.8958379,0.00072181766,0.00012098742,0.0002444759,0.0012349369,0.0023953717,0.0526267],"genre_scores_gemma":[0.8882357,0.00036004736,0.076376535,0.00024458798,0.000039533454,0.0004150616,0.0008687313,0.0002217113,0.03323817],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997125,0.000060328293,0.000018198996,0.00007309351,0.00009333133,0.00004246711],"domain_scores_gemma":[0.9997886,0.00008366683,0.000028539873,0.000029160225,0.00004972247,0.000020387115],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034233814,0.00066368247,0.00039369473,0.00048710528,0.0005077036,0.0019587183,0.0011646198,0.0014705439,0.011998523],"category_scores_gemma":[0.0005104554,0.00033775927,0.00074760255,0.0002707653,0.0008606574,0.001135178,0.00087429315,0.00087912614,0.0014951612],"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.00040192925,0.0001271417,0.0008582516,0.00019418233,0.000049895454,0.0010314829,0.0004232693,0.5106331,0.021014377,0.45029113,0.0024009105,0.012574235],"study_design_scores_gemma":[0.00011097626,0.00009841334,0.00029877506,0.00003536884,0.00003337391,0.00010570773,0.000083767685,0.89867824,0.0039588907,0.08471708,0.011852488,0.000026920314],"about_ca_topic_score_codex":0.013217423,"about_ca_topic_score_gemma":0.00639458,"teacher_disagreement_score":0.013217423,"about_ca_system_score_codex":0.0009935796,"about_ca_system_score_gemma":0.0009167735,"threshold_uncertainty_score":0.04013908},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020917773,0.00017203798,0.9532444,0.000168147,0.000108159686,0.0001436068,0.0002979657,0.0031004709,0.021847446],"genre_scores_gemma":[0.8463104,0.00041309066,0.12287072,0.000115185576,0.000050635015,0.00028959336,0.00037023134,0.00023254486,0.029347593],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99975663,0.000050844912,0.000016914128,0.00005774614,0.0000908677,0.000027086631],"domain_scores_gemma":[0.9998348,0.000066583656,0.000026140562,0.00002449415,0.00003508528,0.000012932102],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027798087,0.0006374673,0.000457993,0.00040800383,0.0005579069,0.0013691364,0.0011888529,0.0010245416,0.010763278],"category_scores_gemma":[0.00045588656,0.00033516478,0.0005784632,0.00027148935,0.0004504549,0.0009227796,0.0005252265,0.0006322987,0.0015147366],"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.00023407591,0.00010925081,0.000752448,0.00020000695,0.000043792465,0.0003999029,0.00017826723,0.8745178,0.016788121,0.07822618,0.0020110605,0.026539149],"study_design_scores_gemma":[0.00002315731,0.000054975877,0.00013397216,0.000011775082,0.00001475012,0.00004735214,0.000009932555,0.9848032,0.0035893093,0.0059537673,0.005348601,0.000009229183],"about_ca_topic_score_codex":0.0066954824,"about_ca_topic_score_gemma":0.0034829625,"teacher_disagreement_score":0.010763278,"about_ca_system_score_codex":0.00047004168,"about_ca_system_score_gemma":0.0005913086,"threshold_uncertainty_score":0.03600681},"labels":[],"label_agreement":null},{"id":"W3029555746","doi":"10.1007/s10703-023-00412-3","title":"Global guidance for local generalization in model checking","year":2023,"lang":"en","type":"article","venue":"Formal Methods in System Design","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"European Research Council; Israel Science Foundation; United States-Israel Binational Science Foundation; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada; European Commission","keywords":"Generalization; Computer science; Model checking; Mathematics; Theoretical computer science; Mathematical analysis","score_opus":0.1346089457146592,"score_gpt":0.41691030172723903,"score_spread":0.28230135601257983,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3029555746","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.079519674,0.00027306864,0.90179473,0.00038246906,0.00003273255,0.00014660481,0.00014004721,0.014513173,0.0031975114],"genre_scores_gemma":[0.68130755,0.00012023364,0.31558275,0.00031258265,0.000031780604,0.00013621322,0.00027741937,0.0014191063,0.0008124093],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.97967714,0.011029773,0.0013444024,0.0025651618,0.0041312748,0.0012521592],"domain_scores_gemma":[0.9416278,0.030286096,0.0036616225,0.02123925,0.0026688967,0.0005163824],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.013244908,0.0014936371,0.0014848787,0.0014613409,0.0007647703,0.0024143036,0.0032876737,0.0012911895,0.002800048],"category_scores_gemma":[0.037588757,0.0010167229,0.0024133322,0.001376054,0.00417519,0.006035004,0.005926193,0.004205026,0.000852606],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0022446008,0.00064863946,0.025176052,0.001485053,0.00046300393,0.00053339405,0.0018516757,0.3686361,0.060741954,0.18442324,0.0071277265,0.3466685],"study_design_scores_gemma":[0.00015817433,0.00038499993,0.0009760445,0.00017858612,0.00016367648,0.00017667611,0.00015450682,0.8527278,0.060782444,0.078479014,0.0057412386,0.00007675708],"about_ca_topic_score_codex":0.002578151,"about_ca_topic_score_gemma":0.003774095,"teacher_disagreement_score":0.013244908,"about_ca_system_score_codex":0.0014668196,"about_ca_system_score_gemma":0.003329862,"threshold_uncertainty_score":0.0700466},"labels":[],"label_agreement":null},{"id":"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015390809,0.000045026474,0.97453386,0.000112876805,0.000036498895,0.00007398901,0.00013343309,0.009058379,0.0006151151],"genre_scores_gemma":[0.48080543,0.00009221605,0.51563185,0.0002315334,0.00005387329,0.00026091826,0.0005464848,0.0010923833,0.0012853403],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99048936,0.0033418857,0.00060373143,0.0011699472,0.0038041405,0.00059092406],"domain_scores_gemma":[0.9677017,0.021720845,0.0024558615,0.0051552206,0.002612815,0.0003535712],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007731813,0.00087713765,0.001416133,0.0017962295,0.0007446911,0.0023776926,0.0028358905,0.0009595882,0.0028747416],"category_scores_gemma":[0.028969888,0.0009222579,0.0015982494,0.0009923778,0.0016375412,0.0027153057,0.0022489298,0.002464546,0.00058802107],"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.00061819714,0.0004573839,0.01061754,0.00038393372,0.0003538993,0.00043932642,0.0002625916,0.675902,0.032549426,0.11870804,0.005170386,0.15453729],"study_design_scores_gemma":[0.000033426288,0.000037613634,0.00017420042,0.000011903551,0.000025337562,0.000040498653,0.000007834343,0.97498375,0.009779123,0.013957281,0.0009363998,0.0000127316835],"about_ca_topic_score_codex":0.003915339,"about_ca_topic_score_gemma":0.0057616914,"teacher_disagreement_score":0.007731813,"about_ca_system_score_codex":0.0011530811,"about_ca_system_score_gemma":0.005282444,"threshold_uncertainty_score":0.040890217},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008372023,0.00003216896,0.98945564,0.000039203256,0.000020782245,0.00011419645,0.000009604203,0.00067450776,0.0012818739],"genre_scores_gemma":[0.37152043,0.000101889585,0.6251339,0.00006571444,0.000018869854,0.00048565475,0.000058026537,0.00023516253,0.002380318],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997431,0.001211128,0.00016218952,0.00021626105,0.0008392512,0.00014020788],"domain_scores_gemma":[0.9978441,0.0011564317,0.0002386671,0.00023605893,0.00044137734,0.00008334992],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004315081,0.00069639395,0.00040736917,0.0010221126,0.0007186733,0.001320808,0.0008652667,0.0007980243,0.002983517],"category_scores_gemma":[0.004235688,0.0005224394,0.0009796246,0.00037855378,0.0017916025,0.0011532838,0.0012121612,0.00096732413,0.00052247924],"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.00040388043,0.0002349416,0.0015198656,0.0003855091,0.000082732025,0.0008407471,0.0013389143,0.35101578,0.057956185,0.504061,0.00078282657,0.0813776],"study_design_scores_gemma":[0.00011022263,0.00021677035,0.00017244212,0.00009706578,0.00006846386,0.00013169648,0.0000765262,0.8792109,0.03382165,0.071239255,0.014818519,0.000036516078],"about_ca_topic_score_codex":0.0017927616,"about_ca_topic_score_gemma":0.0023055025,"teacher_disagreement_score":0.004315081,"about_ca_system_score_codex":0.0010242844,"about_ca_system_score_gemma":0.0017232267,"threshold_uncertainty_score":0.022820592},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0072412514,0.0015152693,0.92777485,0.0037239026,0.00024380375,0.000098994664,0.00019270762,0.0005807884,0.058628496],"genre_scores_gemma":[0.46494168,0.0031881237,0.4832825,0.0028339324,0.0015476523,0.00083665847,0.0011972396,0.0013093982,0.040862896],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9942238,0.0027597141,0.00035890407,0.0006477281,0.0015228371,0.00048708735],"domain_scores_gemma":[0.9833144,0.012555809,0.000587453,0.0023289812,0.0008613238,0.0003519945],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005026837,0.0014257092,0.0015184698,0.0024880215,0.002088316,0.008158429,0.0060768714,0.003410658,0.012317372],"category_scores_gemma":[0.019320885,0.001787849,0.003135733,0.0029303632,0.009017539,0.01780675,0.00534958,0.011993397,0.0021089623],"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.000018139046,0.000012595142,0.000058938444,0.000056935827,0.000008541885,0.000027288763,0.0001293455,0.0070648678,0.00021109082,0.9861885,0.0014467421,0.0047770976],"study_design_scores_gemma":[0.00000767664,0.000007681685,0.000048383623,0.000024420215,0.000008795361,0.000025283927,0.000036650064,0.027880799,0.00028753103,0.96810883,0.003555422,0.000008375106],"about_ca_topic_score_codex":0.0023932504,"about_ca_topic_score_gemma":0.002532006,"teacher_disagreement_score":0.012317372,"about_ca_system_score_codex":0.0040176897,"about_ca_system_score_gemma":0.0019295675,"threshold_uncertainty_score":0.041205645},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0076324116,0.011165794,0.9456557,0.0016634571,0.00031190077,0.00006814712,0.00088092807,0.001217244,0.03140459],"genre_scores_gemma":[0.41432017,0.01747759,0.53756267,0.0024633482,0.0011723381,0.00034940286,0.0017022392,0.0004879786,0.024464367],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981242,0.00046084743,0.00018852939,0.00039738748,0.00059236155,0.0002367771],"domain_scores_gemma":[0.99838114,0.0009407623,0.0001439776,0.00019767303,0.0002662524,0.000070219954],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022614906,0.00089380617,0.00055927795,0.001715173,0.00067317963,0.0029651073,0.0014846404,0.0010316239,0.0047314805],"category_scores_gemma":[0.004503582,0.00051507,0.0014073973,0.0023975496,0.0023819674,0.006842899,0.0011757571,0.002616597,0.0013909162],"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.00003447997,0.000019799952,0.00025781695,0.0003019819,0.000015554418,0.00014458015,0.00017316408,0.0048106825,0.0012535403,0.9413962,0.0027740756,0.0488182],"study_design_scores_gemma":[0.000017963683,0.00005497227,0.00025233114,0.00020048204,0.000048905666,0.00049071707,0.000095909105,0.031165585,0.0039348016,0.8799169,0.0837751,0.000046264642],"about_ca_topic_score_codex":0.0042050425,"about_ca_topic_score_gemma":0.002880632,"teacher_disagreement_score":0.0047314805,"about_ca_system_score_codex":0.0026980657,"about_ca_system_score_gemma":0.0014624957,"threshold_uncertainty_score":0.019575894},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012481075,0.000045876594,0.9856133,0.000036167297,0.000006902321,0.000026364767,0.000099209174,0.0005996672,0.0010915986],"genre_scores_gemma":[0.5892007,0.00016744934,0.40679583,0.00007606744,0.000015078247,0.00029540856,0.00086489005,0.00029465,0.002289889],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992385,0.00017949755,0.000039708233,0.00012980787,0.00032400215,0.00008852195],"domain_scores_gemma":[0.9989008,0.00059721497,0.00010676172,0.00021680561,0.00013455785,0.000043852167],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000705217,0.00097484083,0.00078397646,0.0008218486,0.00039557822,0.0006710878,0.0008330723,0.0004889493,0.002662762],"category_scores_gemma":[0.0027985398,0.00066159084,0.0014037284,0.00053335796,0.0010089432,0.00094218133,0.0016442782,0.0013799203,0.00045160585],"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.000051804844,0.000020550238,0.0003530091,0.00005060633,0.000018792125,0.000060026337,0.00004343906,0.95968956,0.0031026786,0.01952605,0.0003518593,0.016731614],"study_design_scores_gemma":[0.000005386091,0.000008616854,0.000034580444,0.000003777512,0.0000041185995,0.000007790963,0.0000038029766,0.9867942,0.00057607895,0.012322409,0.0002367952,0.0000025148847],"about_ca_topic_score_codex":0.0062359204,"about_ca_topic_score_gemma":0.007305876,"teacher_disagreement_score":0.0062359204,"about_ca_system_score_codex":0.0011214007,"about_ca_system_score_gemma":0.0017007096,"threshold_uncertainty_score":0.012399256},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033437595,0.00031526672,0.9505476,0.00033300227,0.000032573953,0.00010789742,0.00012632519,0.010668702,0.004431067],"genre_scores_gemma":[0.45401406,0.0002520919,0.54084176,0.00044680753,0.00004863466,0.00019171192,0.0004340748,0.0021656742,0.0016051804],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9875916,0.0054534595,0.00093613786,0.0019371954,0.0030881797,0.0009934212],"domain_scores_gemma":[0.97092044,0.0143234655,0.001523886,0.011598262,0.0013212708,0.00031263597],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00889616,0.0015506315,0.0013817028,0.0011725929,0.0007708924,0.0027379275,0.0032226082,0.0013571099,0.0036768876],"category_scores_gemma":[0.025232706,0.0010154567,0.0025696296,0.0014568536,0.0039412696,0.006266772,0.006108475,0.004924412,0.0014000576],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012980344,0.0003808726,0.011197941,0.0014047686,0.00027062983,0.00038444545,0.0016624578,0.19303237,0.04974285,0.3020402,0.008732885,0.42985266],"study_design_scores_gemma":[0.00017167896,0.0003772779,0.0009133727,0.00027011236,0.00020972431,0.00030552314,0.00022335471,0.70874006,0.07790776,0.19572304,0.015054535,0.000103588645],"about_ca_topic_score_codex":0.0019264633,"about_ca_topic_score_gemma":0.0031938127,"teacher_disagreement_score":0.00889616,"about_ca_system_score_codex":0.0014781422,"about_ca_system_score_gemma":0.0033996352,"threshold_uncertainty_score":0.047047913},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26464158,0.01842906,0.1686051,0.008169329,0.0022046934,0.0011117574,0.0022685383,0.008093616,0.5264764],"genre_scores_gemma":[0.28604499,0.013170127,0.07054312,0.0011103501,0.00032752517,0.00047761376,0.0038792395,0.0024244564,0.6220226],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9954727,0.0014510565,0.00016927197,0.00042794595,0.002003516,0.0004755769],"domain_scores_gemma":[0.99312735,0.0018072061,0.00011407486,0.0005749733,0.0024490855,0.0019271808],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0066389902,0.0010881983,0.000540035,0.001857326,0.0014985387,0.00252972,0.0012890139,0.0017358036,0.033931732],"category_scores_gemma":[0.0066255094,0.0005322671,0.00079943804,0.0018905865,0.00081986375,0.0026429787,0.0026880442,0.001650047,0.011850976],"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.00035021213,0.0053191492,0.0035922069,0.00034997275,0.000023174325,0.0004881603,0.010358385,0.0012140458,0.010128859,0.0066943523,0.084745124,0.8767362],"study_design_scores_gemma":[0.00020580454,0.0024166845,0.010044884,0.00042648573,0.000077541226,0.0018697268,0.007634103,0.0029601126,0.02598232,0.0045401445,0.94376194,0.00008022139],"about_ca_topic_score_codex":0.004807265,"about_ca_topic_score_gemma":0.006187733,"teacher_disagreement_score":0.033931732,"about_ca_system_score_codex":0.0015538987,"about_ca_system_score_gemma":0.0036285145,"threshold_uncertainty_score":0.11351293},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009857312,0.00010820219,0.98422885,0.0003546795,0.000028029388,0.00011069178,0.00010610825,0.0033369965,0.0018691856],"genre_scores_gemma":[0.3675081,0.00027068786,0.6284107,0.00037898292,0.00008354985,0.00028812428,0.0004634343,0.00075961254,0.0018368141],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9886064,0.0050909063,0.0005253241,0.0012214556,0.003742691,0.00081316574],"domain_scores_gemma":[0.9701744,0.023203775,0.001306569,0.0035581249,0.0014653518,0.0002918039],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007735384,0.0013665459,0.0012839326,0.0019310492,0.0010132596,0.0033493154,0.003400448,0.0016391386,0.005052315],"category_scores_gemma":[0.032646287,0.0011332629,0.003443817,0.0017359878,0.004437176,0.006990162,0.00590127,0.0029704901,0.0005469551],"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.001024397,0.00039357803,0.003347979,0.00063741487,0.00032893516,0.0010525784,0.0009437665,0.45760798,0.013065845,0.3613208,0.005722849,0.15455382],"study_design_scores_gemma":[0.0001296856,0.00007631905,0.000096937736,0.000041493473,0.000071228555,0.00015240225,0.00006445478,0.8318256,0.009982695,0.15403455,0.0034877856,0.00003672852],"about_ca_topic_score_codex":0.0072727515,"about_ca_topic_score_gemma":0.0063779927,"teacher_disagreement_score":0.007735384,"about_ca_system_score_codex":0.0021768296,"about_ca_system_score_gemma":0.0034288138,"threshold_uncertainty_score":0.04090911},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029741772,0.00032840806,0.9665509,0.0002840249,0.000028187305,0.00007384134,0.000075551354,0.00061629445,0.002300987],"genre_scores_gemma":[0.58892995,0.00032626934,0.40473598,0.00022425437,0.00009487354,0.0002668685,0.00039022954,0.00046746066,0.0045641256],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99372745,0.0024129872,0.00042756798,0.00082465616,0.0020832457,0.00052408286],"domain_scores_gemma":[0.9808574,0.014590289,0.0014343081,0.0014648952,0.0012398724,0.00041321552],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034706115,0.0012988268,0.0013394144,0.0017731576,0.00042065664,0.0016656226,0.0020014246,0.0008222089,0.0032613394],"category_scores_gemma":[0.016127862,0.0009079618,0.0016611764,0.0012740066,0.0018864305,0.0019551998,0.0015946203,0.0017699449,0.00041466995],"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.0014141361,0.00040347603,0.0029049802,0.0008324488,0.00034814162,0.00065907754,0.00044386619,0.48352832,0.04002648,0.19780928,0.0028361175,0.2687937],"study_design_scores_gemma":[0.00010907907,0.00023364752,0.00057172205,0.000058430767,0.00015260676,0.00026999722,0.000055122542,0.7860711,0.021865908,0.18843818,0.0021425914,0.000031599106],"about_ca_topic_score_codex":0.0016055254,"about_ca_topic_score_gemma":0.0017234513,"teacher_disagreement_score":0.0034706115,"about_ca_system_score_codex":0.001215583,"about_ca_system_score_gemma":0.0018784443,"threshold_uncertainty_score":0.018354595},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0074487366,0.00019524232,0.9846742,0.000277737,0.000059446877,0.0001285486,0.000101059486,0.0010222545,0.0060928483],"genre_scores_gemma":[0.63764036,0.0004616631,0.35377315,0.00020054053,0.00006695655,0.00030178402,0.00042587236,0.0002712206,0.0068583684],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959539,0.001822514,0.00023456386,0.00037028242,0.0012488728,0.00036976617],"domain_scores_gemma":[0.9933466,0.0050522774,0.00028088863,0.0007230682,0.0005016482,0.000095609576],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033910563,0.0006503295,0.0005733775,0.0005419124,0.00067456777,0.0021677022,0.0018292399,0.0013135587,0.0063475533],"category_scores_gemma":[0.010087229,0.0006007703,0.0013974727,0.00026743946,0.0027627805,0.002165018,0.0022611753,0.0013850123,0.0010277599],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000370699,0.0001895237,0.0009513241,0.00091832754,0.000100625424,0.0011044925,0.0011504531,0.24327825,0.019987594,0.62570333,0.004710182,0.10153518],"study_design_scores_gemma":[0.00011208574,0.00011679386,0.00038970326,0.00025692553,0.000053118372,0.00037998392,0.00018501311,0.6076883,0.020972533,0.3531951,0.016604783,0.000045690136],"about_ca_topic_score_codex":0.002897628,"about_ca_topic_score_gemma":0.0021742906,"teacher_disagreement_score":0.0063475533,"about_ca_system_score_codex":0.0012273922,"about_ca_system_score_gemma":0.0022712487,"threshold_uncertainty_score":0.02123475},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039288618,0.00019739679,0.95669395,0.00027613874,0.000018999246,0.000111659334,0.00010181213,0.001983417,0.0013280446],"genre_scores_gemma":[0.5127152,0.0003854469,0.48474547,0.00017914744,0.00002814247,0.00017634411,0.0004235812,0.0004126748,0.0009340028],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99034625,0.004627974,0.0006208845,0.00096534996,0.0030353977,0.0004041097],"domain_scores_gemma":[0.9625752,0.027551416,0.0024406102,0.005180972,0.0019652997,0.00028649808],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008041658,0.0012129684,0.0008053316,0.0018298719,0.00068324903,0.002368036,0.0023810316,0.0012011445,0.002484982],"category_scores_gemma":[0.025707878,0.0007431938,0.0017225058,0.0011680205,0.0032056295,0.0052591157,0.0027858315,0.0021084975,0.00028681962],"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.0005668483,0.00043716838,0.009674403,0.0015212479,0.00031232054,0.0007928873,0.001446067,0.4890765,0.043991197,0.16271111,0.0015133625,0.28795686],"study_design_scores_gemma":[0.00011239011,0.00029789296,0.0008509934,0.00016411064,0.00009856959,0.00037994876,0.0002697045,0.8912116,0.043652777,0.05751958,0.0053899097,0.00005247212],"about_ca_topic_score_codex":0.00475953,"about_ca_topic_score_gemma":0.0050683594,"teacher_disagreement_score":0.008041658,"about_ca_system_score_codex":0.0014705992,"about_ca_system_score_gemma":0.0038062532,"threshold_uncertainty_score":0.042528868},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027694494,0.00012154447,0.96270365,0.00014150028,0.00007677355,0.00020337911,0.0007037723,0.0062264404,0.0021284872],"genre_scores_gemma":[0.70794153,0.0002841645,0.2839608,0.0002994304,0.00010157518,0.00058912276,0.002543626,0.0015329402,0.0027468107],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98812485,0.0027473115,0.0013831842,0.0020947994,0.004477587,0.0011723124],"domain_scores_gemma":[0.9543744,0.027194899,0.0029466276,0.008087967,0.0067724786,0.0006235831],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0069181365,0.0015644662,0.0012046489,0.0020151169,0.00082335743,0.003013174,0.002913019,0.0014890472,0.005559212],"category_scores_gemma":[0.042319577,0.00091961364,0.003140499,0.0012188926,0.0031643405,0.0053541693,0.0028038998,0.002553525,0.0012861186],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0021452783,0.00066689926,0.015021303,0.0021976961,0.0007377999,0.0024285864,0.001476003,0.42299497,0.08506639,0.29256988,0.0062659485,0.16842927],"study_design_scores_gemma":[0.00023306215,0.0003894956,0.0007043178,0.00017756323,0.00023615868,0.0004631004,0.0001575372,0.740852,0.09692778,0.15221651,0.007547513,0.00009501247],"about_ca_topic_score_codex":0.00486617,"about_ca_topic_score_gemma":0.0037077528,"teacher_disagreement_score":0.0069181365,"about_ca_system_score_codex":0.0015509259,"about_ca_system_score_gemma":0.0034984779,"threshold_uncertainty_score":0.036587},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016823201,0.0076465453,0.87568986,0.008135646,0.006138239,0.00031890912,0.0009946347,0.012235972,0.08715789],"genre_scores_gemma":[0.045543205,0.01222809,0.8308364,0.0066641574,0.007267148,0.0010677258,0.006955701,0.011272089,0.07816546],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9873604,0.0059673097,0.0011884894,0.0016290365,0.0032440946,0.00061067025],"domain_scores_gemma":[0.9778867,0.013415578,0.00032187128,0.004010862,0.0036129823,0.0007521034],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.018997258,0.0024802126,0.0021282993,0.0047139083,0.0020720598,0.0102916565,0.0048632985,0.0026878281,0.075215586],"category_scores_gemma":[0.032506216,0.0019994606,0.0037313339,0.0032175255,0.0038239553,0.009340016,0.0071641253,0.007443326,0.030568205],"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.0003289369,0.00031102163,0.0005299379,0.0010755808,0.00011964246,0.0005473764,0.000725634,0.006570183,0.0018581013,0.35991016,0.2784602,0.34956327],"study_design_scores_gemma":[0.00013822132,0.0000829716,0.0002516373,0.0007670666,0.00006335009,0.0005647207,0.0001374547,0.031688903,0.0030253534,0.23095079,0.7322548,0.000074690855],"about_ca_topic_score_codex":0.0031364814,"about_ca_topic_score_gemma":0.0024561593,"teacher_disagreement_score":0.075215586,"about_ca_system_score_codex":0.0040926053,"about_ca_system_score_gemma":0.004500992,"threshold_uncertainty_score":0.2516212},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014377578,0.0001143663,0.9785443,0.000099027246,0.00004908042,0.00014174165,0.00029268587,0.0017298253,0.0046514743],"genre_scores_gemma":[0.3546663,0.00034499416,0.6384646,0.000086091786,0.000027992914,0.0008416716,0.0013843959,0.00040659064,0.0037773878],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99848676,0.00045831274,0.00012736696,0.0002670326,0.00053605135,0.00012438768],"domain_scores_gemma":[0.99767023,0.0014906835,0.00014518145,0.00038171324,0.00027763765,0.000034602475],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011142784,0.0007812053,0.00063556095,0.00085581915,0.0003915243,0.0010571289,0.00095255923,0.0009833275,0.0045678522],"category_scores_gemma":[0.004808472,0.00052951986,0.0015262063,0.0005319184,0.00072601513,0.0010900197,0.0009196745,0.0009646198,0.00097129657],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001737114,0.00012514445,0.0009601177,0.0006477788,0.000071580616,0.00043605184,0.0003870304,0.73217,0.048984658,0.1442131,0.001683598,0.070147276],"study_design_scores_gemma":[0.000044926655,0.00007987547,0.00013067616,0.00005188998,0.00003260237,0.00006194086,0.000043460772,0.92760456,0.025710186,0.037637487,0.008587697,0.0000146533785],"about_ca_topic_score_codex":0.0014383813,"about_ca_topic_score_gemma":0.0017650982,"teacher_disagreement_score":0.0045678522,"about_ca_system_score_codex":0.00082711113,"about_ca_system_score_gemma":0.0016425428,"threshold_uncertainty_score":0.015281022},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1333617,0.0011074607,0.8030435,0.0010023363,0.0002220236,0.00020776548,0.0009068023,0.0006756298,0.05947284],"genre_scores_gemma":[0.85315144,0.0012957916,0.12036265,0.00035362778,0.00034400102,0.00033385406,0.0010147992,0.0001797706,0.0229642],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979394,0.00038029393,0.00021137457,0.0004330644,0.0007805998,0.00025520456],"domain_scores_gemma":[0.99633765,0.0010648129,0.0004412232,0.00049753865,0.0013649401,0.0002938184],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014848391,0.00048241817,0.00035945553,0.002095183,0.0009961749,0.0031013063,0.0008046696,0.0007229325,0.008475552],"category_scores_gemma":[0.004981849,0.00035990903,0.0009177077,0.0019246442,0.0035404626,0.0064270217,0.002903452,0.0021047606,0.0011405298],"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.000020786694,0.000012586144,0.00023083008,0.00003525965,0.0000055260093,0.000085061016,0.00025939633,0.000681231,0.0006695967,0.9912525,0.00025867228,0.0064884936],"study_design_scores_gemma":[0.000020525156,0.00006417951,0.00031593547,0.000030171239,0.000018569248,0.00023115105,0.00021486879,0.00807505,0.0019075046,0.9751032,0.013996628,0.000022186785],"about_ca_topic_score_codex":0.0013695459,"about_ca_topic_score_gemma":0.0007876581,"teacher_disagreement_score":0.008475552,"about_ca_system_score_codex":0.0008922538,"about_ca_system_score_gemma":0.00118016,"threshold_uncertainty_score":0.028353512},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10532238,0.0011745448,0.8811575,0.0012626578,0.00020556118,0.00021419466,0.00015147608,0.00026879355,0.010242897],"genre_scores_gemma":[0.7353059,0.0010339577,0.25885284,0.0004442601,0.00042810175,0.00046208804,0.0005934197,0.00013851402,0.0027408954],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99468684,0.001649773,0.0007098645,0.0011343472,0.0013034267,0.0005157759],"domain_scores_gemma":[0.98464334,0.008201283,0.0019224731,0.0021469442,0.0018809753,0.001204979],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0064015365,0.0010215265,0.0011290971,0.003666578,0.001361389,0.0049557136,0.0019387614,0.0030126914,0.0023145415],"category_scores_gemma":[0.018503532,0.0007890144,0.0024147653,0.0022372846,0.008214264,0.010654039,0.004397617,0.0058347667,0.00040064793],"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.00004945682,0.000073742885,0.00093908113,0.000056254445,0.000016641887,0.0000905107,0.0007659266,0.0036239484,0.0007901312,0.9813703,0.00022785354,0.01199612],"study_design_scores_gemma":[0.00002784192,0.000073065756,0.0005264614,0.000052804255,0.000017964012,0.000101023914,0.00022406041,0.042220056,0.00055844017,0.95343727,0.002733947,0.00002697538],"about_ca_topic_score_codex":0.0016837191,"about_ca_topic_score_gemma":0.00062419684,"teacher_disagreement_score":0.0064015365,"about_ca_system_score_codex":0.002074164,"about_ca_system_score_gemma":0.0018089957,"threshold_uncertainty_score":0.03385496},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006779938,0.00008404288,0.99020314,0.000095774616,0.000025290528,0.00006523256,0.0000816273,0.0015531937,0.0011116934],"genre_scores_gemma":[0.42905608,0.00029930714,0.56703407,0.00020492755,0.000051721876,0.00046057987,0.0006915745,0.0006363996,0.0015653817],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.988735,0.0041825483,0.00074284605,0.0011332621,0.0043430277,0.0008633753],"domain_scores_gemma":[0.980358,0.013121709,0.0011054963,0.0035061354,0.0017478501,0.00016078503],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0053072716,0.0011069345,0.0011838215,0.0016234461,0.0009197013,0.002505865,0.0028782662,0.0015540805,0.0038996283],"category_scores_gemma":[0.024503838,0.0009950541,0.003363945,0.0008722379,0.0029895324,0.004822132,0.0034530691,0.0027072218,0.00079785055],"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.00030162852,0.00014597956,0.00201204,0.00064649363,0.00017444819,0.00063843036,0.0006797754,0.51344967,0.025824824,0.39270377,0.0013853511,0.062037617],"study_design_scores_gemma":[0.000044613826,0.000057388632,0.000118281016,0.00007643798,0.000041405074,0.00006946999,0.000042441538,0.8812109,0.0145176705,0.100565284,0.0032322018,0.00002390011],"about_ca_topic_score_codex":0.0054980675,"about_ca_topic_score_gemma":0.005016847,"teacher_disagreement_score":0.0054980675,"about_ca_system_score_codex":0.0022579932,"about_ca_system_score_gemma":0.0038896129,"threshold_uncertainty_score":0.028067887},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030069673,0.00010115188,0.9948592,0.00012237126,0.000013823549,0.000040194478,0.00005077377,0.00038675158,0.0014187703],"genre_scores_gemma":[0.3148726,0.00072210183,0.67895883,0.00029107215,0.00011339772,0.0006889523,0.0005945938,0.00060317933,0.0031553246],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99567455,0.0009892653,0.0003654889,0.0007413403,0.0019033612,0.00032600018],"domain_scores_gemma":[0.9914436,0.0043379506,0.0007247245,0.0025892393,0.00077242963,0.00013196263],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00408906,0.0012553565,0.00092564186,0.00089024456,0.0007172976,0.0023125932,0.0017762072,0.0012925245,0.0034821283],"category_scores_gemma":[0.012162891,0.0009724804,0.002945566,0.00061333977,0.0039364127,0.0048083127,0.0034824926,0.004457592,0.000979221],"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.00010041724,0.00007880908,0.00046502965,0.00043314934,0.00010495373,0.00024225621,0.00072118954,0.19434544,0.011378776,0.74349433,0.001473604,0.047162116],"study_design_scores_gemma":[0.000055753644,0.0001171488,0.00014864249,0.000118291435,0.000074897616,0.00012508086,0.00009825877,0.31986898,0.020271895,0.6479903,0.011083665,0.000047104317],"about_ca_topic_score_codex":0.0012786972,"about_ca_topic_score_gemma":0.0009977852,"teacher_disagreement_score":0.00408906,"about_ca_system_score_codex":0.0011530746,"about_ca_system_score_gemma":0.0021145912,"threshold_uncertainty_score":0.02162528},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028938293,0.0006440376,0.98919666,0.0010554971,0.000118260075,0.00014548971,0.00014251983,0.00035576464,0.005447925],"genre_scores_gemma":[0.18320526,0.0019107356,0.8060395,0.0007891607,0.00022641663,0.0007965899,0.00093877426,0.00035154852,0.005741987],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9947472,0.0022682252,0.0005600751,0.0006122541,0.0014185145,0.00039373484],"domain_scores_gemma":[0.9925096,0.004020978,0.0006758064,0.001569705,0.00095443515,0.0002693853],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0058192783,0.0011534737,0.0008020018,0.00096930034,0.0011364644,0.00445448,0.0031973347,0.0027112372,0.0040515587],"category_scores_gemma":[0.013230153,0.00086675904,0.002261497,0.00081677776,0.0056732884,0.008771991,0.003961986,0.003983944,0.0017352608],"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.000030510171,0.000094862095,0.0005795053,0.0005074884,0.00005240936,0.00036056552,0.0011843393,0.05332772,0.0020191318,0.917418,0.00191898,0.022506539],"study_design_scores_gemma":[0.00006159173,0.000080470316,0.00016715184,0.0003813852,0.00007317437,0.00032946354,0.00035226764,0.10390792,0.0039523565,0.8203008,0.07033479,0.000058611837],"about_ca_topic_score_codex":0.006329881,"about_ca_topic_score_gemma":0.005412614,"teacher_disagreement_score":0.006329881,"about_ca_system_score_codex":0.0016174089,"about_ca_system_score_gemma":0.0037249385,"threshold_uncertainty_score":0.030775666},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005314116,0.00011026504,0.9973596,0.00019077436,0.000026834501,0.0001663754,0.00007685373,0.00018951733,0.0013484842],"genre_scores_gemma":[0.045894444,0.00061883416,0.94825315,0.00026783347,0.00008381873,0.0014769447,0.00042041508,0.00016718873,0.0028174222],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960626,0.0016246227,0.00035215713,0.0004186584,0.0013003788,0.00024166248],"domain_scores_gemma":[0.9944676,0.0038655787,0.00033447923,0.0006024992,0.00059037097,0.00013944753],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005144209,0.001822045,0.00095256924,0.0021227582,0.001184263,0.0034947295,0.0038442656,0.0019163276,0.0051480955],"category_scores_gemma":[0.009352209,0.001339651,0.004553532,0.0011144127,0.0037399514,0.0025981846,0.0029092266,0.0042455182,0.001244186],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000051006344,0.00017998653,0.0004611387,0.00056882726,0.00012774378,0.0006534789,0.0008717918,0.22311679,0.005131942,0.7397963,0.0022648675,0.026776062],"study_design_scores_gemma":[0.000080408536,0.0001262402,0.00020218058,0.00040938993,0.00011486968,0.0003224754,0.00022622656,0.53209287,0.004507728,0.41320312,0.04863955,0.00007490883],"about_ca_topic_score_codex":0.0059347223,"about_ca_topic_score_gemma":0.0069307345,"teacher_disagreement_score":0.0059347223,"about_ca_system_score_codex":0.0029496932,"about_ca_system_score_gemma":0.0045847474,"threshold_uncertainty_score":0.027205527},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12773117,0.00015653913,0.8574465,0.00012905903,0.00008855256,0.00007704652,0.00022868591,0.0060498132,0.008092669],"genre_scores_gemma":[0.79008967,0.00010547299,0.20718193,0.000059050213,0.000012035476,0.00011766979,0.00016749532,0.00013128053,0.0021354165],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99964726,0.0000882911,0.000026575253,0.0000559163,0.00012825223,0.000053749678],"domain_scores_gemma":[0.9996082,0.00019871732,0.000037696092,0.00009123799,0.000052295578,0.00001187335],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036742925,0.00043602628,0.0002130307,0.00029795902,0.00022401383,0.0004151436,0.0005059986,0.00025965908,0.0031673184],"category_scores_gemma":[0.0008263726,0.0002180372,0.0004112508,0.00014757889,0.00050104386,0.0004953329,0.00037920105,0.00038415802,0.00039086927],"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.0004810302,0.0000942938,0.0032516907,0.00038795374,0.000079150814,0.00073577865,0.0002408501,0.7040264,0.111392155,0.054926507,0.0031080013,0.1212762],"study_design_scores_gemma":[0.00008060847,0.00016459644,0.0006902542,0.00003652667,0.000023797662,0.00013359728,0.000032106767,0.9116281,0.06565984,0.011169975,0.01036354,0.0000169199],"about_ca_topic_score_codex":0.0024484477,"about_ca_topic_score_gemma":0.0028852138,"teacher_disagreement_score":0.0031673184,"about_ca_system_score_codex":0.000546151,"about_ca_system_score_gemma":0.0005960424,"threshold_uncertainty_score":0.0105957985},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0054052854,0.00010434735,0.988598,0.00012303931,0.000028117214,0.000092995484,0.0004360301,0.0018212913,0.0033908272],"genre_scores_gemma":[0.2179247,0.00049156643,0.7728543,0.00042720424,0.00004608528,0.00045371748,0.002145274,0.001124218,0.0045329733],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980421,0.00042609707,0.00015836583,0.0004617067,0.0006731247,0.00023854332],"domain_scores_gemma":[0.9966344,0.0020301964,0.00022730528,0.0005919706,0.00046777038,0.000048401536],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013109714,0.0010404072,0.00056588947,0.0012098725,0.00064097974,0.0016933525,0.0014518021,0.00088062725,0.011296304],"category_scores_gemma":[0.0060059405,0.0005497002,0.0019898375,0.0010434024,0.0021027634,0.0035044625,0.0024495532,0.0019955083,0.0023122896],"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.00023606802,0.00013021259,0.0016025031,0.0016592148,0.00015818296,0.0005456401,0.00052931346,0.13011089,0.049788326,0.60842186,0.007051889,0.19976588],"study_design_scores_gemma":[0.00004462164,0.00010306472,0.00030572063,0.00016012482,0.00009673635,0.00020126431,0.00008117928,0.43136123,0.050570484,0.4942064,0.02281354,0.000055678414],"about_ca_topic_score_codex":0.003008625,"about_ca_topic_score_gemma":0.0049091917,"teacher_disagreement_score":0.011296304,"about_ca_system_score_codex":0.0011573221,"about_ca_system_score_gemma":0.0023222144,"threshold_uncertainty_score":0.03778988},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.076277636,0.005289829,0.8980472,0.0009879672,0.00012140429,0.00034549308,0.00077104935,0.00066214835,0.01749725],"genre_scores_gemma":[0.7079834,0.005030595,0.28179845,0.00035568498,0.00038514874,0.00048667303,0.0010223661,0.00012310961,0.002814635],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972326,0.0004336027,0.0005278721,0.00048255787,0.0011393364,0.00018409782],"domain_scores_gemma":[0.99033993,0.005809209,0.0011920354,0.0012738166,0.0011674913,0.00021749038],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024133413,0.00089843397,0.0010993283,0.006107818,0.0010830066,0.00542498,0.0016041655,0.0016831133,0.002168834],"category_scores_gemma":[0.008511424,0.0005286754,0.0018172855,0.003421585,0.0042396784,0.008791841,0.0015801988,0.0019229329,0.00042600805],"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.000110242996,0.00016839957,0.0049267295,0.0008111729,0.00008900758,0.0006389256,0.0007726603,0.016536292,0.0077831135,0.9018081,0.0009031842,0.06545221],"study_design_scores_gemma":[0.000033498283,0.00022587171,0.0032014195,0.0003309616,0.00013765175,0.0015358579,0.0004512383,0.11375368,0.007849084,0.85775,0.014651876,0.00007893127],"about_ca_topic_score_codex":0.00086183636,"about_ca_topic_score_gemma":0.00048792173,"teacher_disagreement_score":0.006107818,"about_ca_system_score_codex":0.0012245079,"about_ca_system_score_gemma":0.0013717448,"threshold_uncertainty_score":0.012763143},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008238441,0.0028132596,0.97384495,0.0027358932,0.00013692597,0.00035932555,0.0010626921,0.0038736872,0.0069348],"genre_scores_gemma":[0.1481266,0.0027706372,0.83976454,0.0006601505,0.00025346284,0.0006270891,0.0025720487,0.0005135541,0.004711925],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99677414,0.001475989,0.0002768059,0.0005743669,0.0006669072,0.00023165147],"domain_scores_gemma":[0.9787936,0.018632563,0.0005719625,0.0008747384,0.0009404539,0.0001866873],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0044496385,0.0017737547,0.0015739998,0.0027004299,0.0014578841,0.0038021922,0.0035990535,0.0021039036,0.0126166055],"category_scores_gemma":[0.022403182,0.001253169,0.002499783,0.0043367124,0.0018902196,0.0056328475,0.0035003487,0.0035848306,0.0020636516],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003393219,0.00040367286,0.0026089305,0.0015957922,0.00032330377,0.0002909111,0.00049020955,0.2596391,0.0009604618,0.17163132,0.028910538,0.5328064],"study_design_scores_gemma":[0.00012706738,0.00003369488,0.0002324367,0.0001453554,0.00005682805,0.0001458215,0.0001614982,0.61177516,0.0005740398,0.37862614,0.008098352,0.00002362761],"about_ca_topic_score_codex":0.008445651,"about_ca_topic_score_gemma":0.010929614,"teacher_disagreement_score":0.0126166055,"about_ca_system_score_codex":0.0028957068,"about_ca_system_score_gemma":0.0033661837,"threshold_uncertainty_score":0.042206764},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0404013,0.0001487737,0.9540361,0.00011260046,0.000041322583,0.00006985002,0.00006591237,0.002913591,0.0022104215],"genre_scores_gemma":[0.920299,0.00009669432,0.07804871,0.00003696616,0.000013571883,0.00009360421,0.00007992889,0.00025311296,0.0010782676],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984459,0.0004732889,0.00006542505,0.0002892255,0.0005631669,0.00016284722],"domain_scores_gemma":[0.9967205,0.001760066,0.00034057707,0.000711425,0.00038969697,0.00007771665],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014765784,0.00087027374,0.0010343159,0.00085480243,0.00054164696,0.0011784357,0.001489987,0.0008354564,0.0024107676],"category_scores_gemma":[0.0063379,0.00077392044,0.001088682,0.0004889854,0.0009333432,0.0013758452,0.001474706,0.0011773591,0.00047562888],"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.00019717519,0.000068449146,0.0010848484,0.00013721401,0.000059368103,0.00021491628,0.00010826185,0.9295007,0.016916601,0.023855664,0.0007057833,0.02715109],"study_design_scores_gemma":[0.000008166462,0.00001844315,0.00010682545,0.0000053687163,0.000011330855,0.000024568631,0.0000027491865,0.99463046,0.0021867305,0.0027972432,0.00020240979,0.0000057397447],"about_ca_topic_score_codex":0.0036883398,"about_ca_topic_score_gemma":0.0035806226,"teacher_disagreement_score":0.0036883398,"about_ca_system_score_codex":0.0008349506,"about_ca_system_score_gemma":0.0017947911,"threshold_uncertainty_score":0.008064806},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0429688,0.00008731551,0.95287466,0.000113384354,0.000054164273,0.00014802981,0.0001692018,0.0011008098,0.0024836317],"genre_scores_gemma":[0.7392891,0.00013395707,0.2576618,0.00013783814,0.00002533879,0.00032972835,0.00048756466,0.00013090788,0.0018036274],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99588495,0.0008124691,0.00038779643,0.00091754785,0.0015993393,0.00039776604],"domain_scores_gemma":[0.99576557,0.0022619616,0.00040120276,0.00078283396,0.00069577206,0.00009262666],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013881068,0.00034488543,0.00045112116,0.00052840385,0.00061086036,0.0013191553,0.0011540536,0.0004996162,0.0020562636],"category_scores_gemma":[0.0060330504,0.00030711817,0.0015583446,0.00049693254,0.0018629859,0.0021708617,0.0016659454,0.0011934413,0.0002717527],"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.00079368264,0.0002824798,0.004507852,0.00064096047,0.00016462544,0.0018873283,0.0020548205,0.19153419,0.11823868,0.58567727,0.0019199633,0.092298105],"study_design_scores_gemma":[0.00013595053,0.00024791757,0.0005756475,0.00008021969,0.00008903423,0.0005340999,0.00024711524,0.7512308,0.07316102,0.16459711,0.0090371175,0.000063997715],"about_ca_topic_score_codex":0.003452073,"about_ca_topic_score_gemma":0.0022308624,"teacher_disagreement_score":0.003452073,"about_ca_system_score_codex":0.0011173716,"about_ca_system_score_gemma":0.0020636488,"threshold_uncertainty_score":0.008107185},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011101041,0.00018731454,0.9955225,0.0003593441,0.00003841691,0.0000990968,0.000017957353,0.00017593199,0.0024893647],"genre_scores_gemma":[0.08243985,0.000529619,0.9141224,0.000177628,0.00009935903,0.00054569845,0.00007478814,0.0001435655,0.0018671181],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98936266,0.0057554124,0.0008095394,0.0005922776,0.0030386418,0.00044151468],"domain_scores_gemma":[0.9676508,0.023814626,0.0015962071,0.0032344365,0.0032929878,0.000410921],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.014716494,0.0011682838,0.00057127135,0.0023371074,0.0016563209,0.00366319,0.0034195972,0.0014741163,0.0036478736],"category_scores_gemma":[0.026358688,0.0012644972,0.0019862084,0.0010445148,0.0093361195,0.0039452175,0.0041349987,0.004403103,0.0005726713],"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.000017636909,0.00006432262,0.00023322643,0.00030595378,0.000025560848,0.00020532068,0.0007929187,0.03836822,0.0017692578,0.9384557,0.0008140309,0.018947821],"study_design_scores_gemma":[0.00008552317,0.00009415798,0.000121509234,0.00040577896,0.000041288873,0.00019703589,0.00023826411,0.16547316,0.004238154,0.7890834,0.039972965,0.00004868992],"about_ca_topic_score_codex":0.004249346,"about_ca_topic_score_gemma":0.0034269781,"teacher_disagreement_score":0.014716494,"about_ca_system_score_codex":0.0033896868,"about_ca_system_score_gemma":0.0056070047,"threshold_uncertainty_score":0.07782918},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004295004,0.0010219489,0.96697015,0.0008319299,0.000072736395,0.000101475875,0.00007549091,0.00022368478,0.026407685],"genre_scores_gemma":[0.24881704,0.002618686,0.7216692,0.0007308764,0.00048142322,0.0006748712,0.00019133755,0.0007772745,0.0240392],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98901105,0.0058943727,0.0004332612,0.0014735411,0.0025907513,0.00059696374],"domain_scores_gemma":[0.9696926,0.022628268,0.0007513535,0.0049621314,0.0016182839,0.00034734132],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0153249875,0.0016217389,0.0012930606,0.002352136,0.0013439308,0.003703586,0.002574573,0.002176319,0.01337739],"category_scores_gemma":[0.03610833,0.0011628213,0.0019462829,0.0029648496,0.007217998,0.013010254,0.0055409526,0.0056276685,0.0026673211],"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.00003531129,0.0000200372,0.00012275805,0.00005781948,0.000016817718,0.000020909638,0.00015604011,0.005493663,0.00026123805,0.9719794,0.0008752273,0.020960834],"study_design_scores_gemma":[0.000031292413,0.000018637538,0.000052330015,0.00004420511,0.000012523706,0.000039644103,0.000019365598,0.016026445,0.0004503635,0.9744683,0.008822434,0.000014577881],"about_ca_topic_score_codex":0.0014945555,"about_ca_topic_score_gemma":0.0010892946,"teacher_disagreement_score":0.0153249875,"about_ca_system_score_codex":0.003303405,"about_ca_system_score_gemma":0.0021505859,"threshold_uncertainty_score":0.0810473},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12306675,0.0011130363,0.8475457,0.0009777687,0.00020845828,0.0002672709,0.00068803737,0.0016044675,0.024528531],"genre_scores_gemma":[0.83324844,0.0004965217,0.15792696,0.00027820302,0.000097504606,0.00031546576,0.00058111193,0.00012620525,0.00692951],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99797887,0.0003926036,0.00013235601,0.00073273695,0.00047866078,0.00028479533],"domain_scores_gemma":[0.99044997,0.006714375,0.00082517683,0.0008857205,0.00068042596,0.00044427902],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001216676,0.0009239536,0.0008562,0.0007883992,0.0009845528,0.0025304083,0.0026737766,0.0016465341,0.005112284],"category_scores_gemma":[0.0074383677,0.00040882104,0.0010704349,0.0011018268,0.0032312125,0.003375151,0.0016834876,0.0024032772,0.000593384],"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.00039544195,0.00019627277,0.0025933892,0.00053203193,0.00007226796,0.0010574958,0.0006016541,0.18869936,0.012673,0.756767,0.0025776366,0.03383448],"study_design_scores_gemma":[0.00009603148,0.00015431477,0.00040543158,0.000074291645,0.0000676255,0.00040875797,0.00015898353,0.5957718,0.008750703,0.38615236,0.007897545,0.00006219707],"about_ca_topic_score_codex":0.0032328565,"about_ca_topic_score_gemma":0.0021243272,"teacher_disagreement_score":0.005112284,"about_ca_system_score_codex":0.0019025982,"about_ca_system_score_gemma":0.0014881436,"threshold_uncertainty_score":0.017102301},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03341671,0.0001602561,0.95921177,0.00010456903,0.000040442566,0.000076757926,0.00008224407,0.0002994341,0.0066078384],"genre_scores_gemma":[0.9263978,0.00018931231,0.0693988,0.000071534996,0.000030336483,0.000120743476,0.00017861005,0.0001099256,0.0035028763],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99870896,0.00026764325,0.00006696291,0.00021301581,0.00060874067,0.00013477355],"domain_scores_gemma":[0.99791783,0.0008758972,0.00040731175,0.0004252687,0.00026369822,0.000110001914],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00093205454,0.00069875695,0.00034146052,0.00048857986,0.0004606617,0.000825116,0.00091898435,0.0007810162,0.002557902],"category_scores_gemma":[0.0053973435,0.0002952061,0.0008545894,0.00015875742,0.0016652937,0.0014568828,0.0015161652,0.0012042078,0.0004681884],"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.00012082264,0.0000989317,0.0045162938,0.00024475792,0.000056780496,0.0003851967,0.0005997908,0.5581583,0.018228136,0.3717203,0.0013383614,0.044532273],"study_design_scores_gemma":[0.000012436725,0.00020468149,0.0009700689,0.00006749004,0.000021353355,0.00021333741,0.00019123223,0.83727765,0.0063840267,0.14791305,0.0067164283,0.000028258775],"about_ca_topic_score_codex":0.0023826973,"about_ca_topic_score_gemma":0.0018548843,"teacher_disagreement_score":0.002557902,"about_ca_system_score_codex":0.00080480415,"about_ca_system_score_gemma":0.0012754155,"threshold_uncertainty_score":0.008557022},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033656813,0.026565146,0.7597819,0.05076938,0.0013136775,0.00029580022,0.0008613566,0.005704075,0.12105189],"genre_scores_gemma":[0.5087149,0.022315163,0.42923895,0.0098274965,0.0029069828,0.00083973695,0.0016136416,0.0059029968,0.018640207],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.968864,0.01581817,0.00097438553,0.0035672877,0.008991363,0.0017847687],"domain_scores_gemma":[0.8040275,0.1626386,0.0022975502,0.023882678,0.0054668356,0.0016868075],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.026149984,0.0029376908,0.0022365213,0.0027035847,0.0030878137,0.01073141,0.0071641956,0.0039596516,0.022630887],"category_scores_gemma":[0.11345612,0.0028076328,0.0038172093,0.0043113073,0.012804862,0.047949832,0.010900508,0.023997754,0.008085637],"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.0005416614,0.00012242825,0.0011002383,0.0006250999,0.00009845026,0.00012598443,0.0005484264,0.020168595,0.000986346,0.8647141,0.014309355,0.09665937],"study_design_scores_gemma":[0.0001115558,0.000055083787,0.00014664096,0.0003600854,0.000057624016,0.00008259433,0.00009616683,0.055905458,0.0010879798,0.9195797,0.022482263,0.0000350496],"about_ca_topic_score_codex":0.006881376,"about_ca_topic_score_gemma":0.004506189,"teacher_disagreement_score":0.026149984,"about_ca_system_score_codex":0.007036607,"about_ca_system_score_gemma":0.0058950013,"threshold_uncertainty_score":0.13829601},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00336167,0.000026357628,0.98930675,0.0001543411,0.000022376535,0.00012333284,0.00015152703,0.00475727,0.0020963904],"genre_scores_gemma":[0.0782486,0.00015676288,0.91485834,0.00015238632,0.000018788389,0.00032105707,0.00104611,0.0017008913,0.003496962],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99754554,0.0010857128,0.0002082512,0.00026742427,0.0007387368,0.00015440297],"domain_scores_gemma":[0.99530137,0.002590796,0.0003711999,0.0010284415,0.00051497726,0.00019319844],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029841808,0.0008853678,0.0004264123,0.0010002466,0.00047582257,0.0025620817,0.001826988,0.00094690017,0.005224131],"category_scores_gemma":[0.011349428,0.00077959336,0.0010296573,0.0006470057,0.0015342189,0.004376623,0.0030796546,0.0022913697,0.0017301717],"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.0004961683,0.0002596979,0.0011814762,0.0006709067,0.0000703513,0.001392123,0.0037524663,0.0748334,0.031208787,0.55668604,0.013846936,0.31560156],"study_design_scores_gemma":[0.00018599734,0.00028378778,0.00045128915,0.00031022448,0.00004521557,0.0011636342,0.00093537604,0.4821967,0.08652694,0.22980857,0.19793817,0.00015417759],"about_ca_topic_score_codex":0.0013546087,"about_ca_topic_score_gemma":0.0020341384,"teacher_disagreement_score":0.005224131,"about_ca_system_score_codex":0.00079849554,"about_ca_system_score_gemma":0.0016436082,"threshold_uncertainty_score":0.0174765},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.058037803,0.00052944507,0.92794985,0.0003430346,0.000084076106,0.0003079447,0.000117729025,0.006387304,0.0062428745],"genre_scores_gemma":[0.5164581,0.00025477697,0.48000473,0.00032251334,0.000057194007,0.00034564218,0.00029824363,0.0011310647,0.0011277904],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98803246,0.006604302,0.00081337173,0.0017693305,0.002093163,0.0006874274],"domain_scores_gemma":[0.9600322,0.029169008,0.0016524582,0.0071450565,0.0017451216,0.00025606007],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007622231,0.0017063819,0.0014289023,0.0014866904,0.0008175627,0.0022763968,0.0024767336,0.0014972705,0.004187629],"category_scores_gemma":[0.04257986,0.0012387808,0.0012175008,0.0010174216,0.0019052207,0.0033165892,0.0026929192,0.0030199285,0.001764008],"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.0009192271,0.00063971634,0.003921024,0.00064389466,0.00016641227,0.00022639924,0.00042605193,0.45597667,0.052158322,0.052343205,0.004155703,0.42842335],"study_design_scores_gemma":[0.00017850917,0.0001365198,0.00039417774,0.000070083894,0.00006113053,0.00010907396,0.00005220465,0.92189646,0.024684398,0.0476083,0.0047531407,0.000055956913],"about_ca_topic_score_codex":0.0011964228,"about_ca_topic_score_gemma":0.0021285373,"teacher_disagreement_score":0.007622231,"about_ca_system_score_codex":0.001537844,"about_ca_system_score_gemma":0.0027324308,"threshold_uncertainty_score":0.04031068},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033558514,0.0003477777,0.956836,0.00041627794,0.000033955963,0.0001354995,0.00034152792,0.0038595083,0.0044709644],"genre_scores_gemma":[0.5855849,0.00034127734,0.4094659,0.00018102556,0.000034099572,0.00030727775,0.0012422903,0.00033754442,0.0025057588],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99710923,0.0010206385,0.00020351617,0.00043951298,0.0010079457,0.00021917945],"domain_scores_gemma":[0.9906288,0.007886581,0.00035163361,0.00055942073,0.0004580382,0.00011544514],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018154944,0.0008424741,0.00065443304,0.001353809,0.0008340922,0.0017131813,0.0016316825,0.0011913134,0.004969771],"category_scores_gemma":[0.008681672,0.00057838357,0.0013539637,0.00097458175,0.0026785964,0.0022509303,0.002375679,0.0020027861,0.0006582214],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033745947,0.000121362544,0.0012092751,0.0007109049,0.00007784599,0.00049919984,0.00039622915,0.62373036,0.013906903,0.28169054,0.0020331622,0.07528676],"study_design_scores_gemma":[0.00004926257,0.00003552757,0.00015719557,0.00004969205,0.00002263412,0.000064952284,0.00004180709,0.7645059,0.006707087,0.22477278,0.0035751555,0.000018020832],"about_ca_topic_score_codex":0.0057683494,"about_ca_topic_score_gemma":0.0071982816,"teacher_disagreement_score":0.0057683494,"about_ca_system_score_codex":0.002121723,"about_ca_system_score_gemma":0.0017734128,"threshold_uncertainty_score":0.016625583},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0148126725,0.000057574256,0.9819994,0.00005701692,0.000015344798,0.000053112683,0.000023259796,0.00051434827,0.0024672418],"genre_scores_gemma":[0.3857612,0.00014604336,0.6106374,0.00008883043,0.000023601151,0.00014223749,0.00013565965,0.00010516089,0.0029597806],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990662,0.00015780279,0.00007077794,0.00013895125,0.00050470943,0.0000616249],"domain_scores_gemma":[0.99910444,0.00038260245,0.00010050925,0.00024563237,0.00015068382,0.000016098818],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008630933,0.00049378927,0.00043570055,0.00077676546,0.00036636685,0.0006071155,0.00076912326,0.00050117663,0.004387762],"category_scores_gemma":[0.0033177352,0.00033494818,0.0007172433,0.00066183746,0.0008643286,0.0013751194,0.0008797747,0.00081173755,0.0005451244],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030910596,0.00009328487,0.0009677477,0.00024652292,0.000049513983,0.00038623746,0.00027267673,0.30225316,0.048353136,0.13982503,0.0017906058,0.505453],"study_design_scores_gemma":[0.00008863621,0.00026216725,0.00023973329,0.000040988933,0.000040515883,0.00047455245,0.00007477611,0.83799934,0.038086187,0.10840812,0.014261333,0.000023702676],"about_ca_topic_score_codex":0.0011307595,"about_ca_topic_score_gemma":0.0014752665,"teacher_disagreement_score":0.004387762,"about_ca_system_score_codex":0.0005540377,"about_ca_system_score_gemma":0.00072803133,"threshold_uncertainty_score":0.014678538},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008615735,0.0000669155,0.98989546,0.00003636443,0.000014135706,0.000026709144,0.000018200562,0.0005981734,0.00072820403],"genre_scores_gemma":[0.39237353,0.0002634369,0.6061084,0.000065302724,0.000033068223,0.00019347394,0.00014821465,0.00013334592,0.0006811924],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962734,0.0014365029,0.0003210493,0.0003232793,0.0014641106,0.00018161704],"domain_scores_gemma":[0.99415284,0.0042839893,0.00028685777,0.00089059916,0.00033136303,0.00005444754],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028027482,0.00074636424,0.00079816725,0.0012621394,0.00029677,0.0010989541,0.0014336694,0.00075356895,0.0016361636],"category_scores_gemma":[0.009499603,0.0004493497,0.0010852055,0.000848383,0.0014320756,0.0021662288,0.0015359933,0.0012697998,0.00030507336],"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.0002955489,0.00011164169,0.0012446034,0.000287022,0.00011493955,0.0002437416,0.0002921087,0.6359212,0.040985774,0.18658638,0.0005213142,0.13339582],"study_design_scores_gemma":[0.000036182675,0.00007457683,0.00007145119,0.000028261855,0.000022399223,0.00004077076,0.000011619311,0.95251703,0.012150029,0.033561885,0.001472381,0.000013400492],"about_ca_topic_score_codex":0.0009656639,"about_ca_topic_score_gemma":0.000958038,"teacher_disagreement_score":0.0028027482,"about_ca_system_score_codex":0.00081000203,"about_ca_system_score_gemma":0.0011084445,"threshold_uncertainty_score":0.014822483},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24161997,0.00007698107,0.75092125,0.00030660743,0.000035740683,0.00017623212,0.00022416138,0.0017240897,0.0049149604],"genre_scores_gemma":[0.9189329,0.00006337429,0.079501376,0.000062302264,0.0000065101926,0.000096508345,0.00009878031,0.000035681776,0.0012026333],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991973,0.00019176034,0.000021051523,0.0001035558,0.00040670682,0.00007962633],"domain_scores_gemma":[0.99908924,0.0005220193,0.00009309639,0.0001388183,0.00012767775,0.000029074872],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005434979,0.0004015863,0.00034616073,0.0002259795,0.0005504319,0.00076691626,0.00082042447,0.0009327946,0.0022779212],"category_scores_gemma":[0.0027617589,0.00024416274,0.00050831493,0.00017858249,0.0011799155,0.0008504344,0.0007330138,0.0008834443,0.00022654602],"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.0001479247,0.000073726194,0.0023384974,0.00016438281,0.00005164357,0.00048596217,0.0002488233,0.84425676,0.04753834,0.07019118,0.0013667368,0.03313599],"study_design_scores_gemma":[0.00003137034,0.00010350175,0.000246248,0.000013633615,0.000010701841,0.00008268113,0.000022994673,0.9587752,0.02851115,0.010769481,0.0014229502,0.000010190326],"about_ca_topic_score_codex":0.0029751288,"about_ca_topic_score_gemma":0.0025985653,"teacher_disagreement_score":0.0029751288,"about_ca_system_score_codex":0.0006445687,"about_ca_system_score_gemma":0.0022250048,"threshold_uncertainty_score":0.007620394},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009223959,0.00004307614,0.983459,0.000057621684,0.000051685052,0.000075842676,0.00041203518,0.0135874925,0.001390863],"genre_scores_gemma":[0.037915386,0.00015087312,0.9505229,0.00014278236,0.000038506027,0.0003739598,0.0018081559,0.004475675,0.0045718257],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975999,0.00083563774,0.00027251864,0.00043518443,0.0007040051,0.00015274055],"domain_scores_gemma":[0.99442685,0.00347089,0.00024142097,0.0013054942,0.00039829564,0.00015695141],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027914988,0.0014478568,0.0010659173,0.0021856637,0.0010006302,0.0026200213,0.0025625767,0.0011004935,0.029077427],"category_scores_gemma":[0.01073885,0.0017213844,0.0024901999,0.0012975334,0.0011446635,0.0050510066,0.0040780143,0.0028464266,0.0062739085],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003747743,0.00031887778,0.0025115092,0.0016498762,0.00019607837,0.0006253558,0.0006944625,0.046426002,0.014493428,0.23044235,0.04133737,0.66093],"study_design_scores_gemma":[0.00015580464,0.000113369955,0.00043228187,0.00036875758,0.00014670675,0.0006276365,0.00014328334,0.41694558,0.031936426,0.32763454,0.22137253,0.0001230171],"about_ca_topic_score_codex":0.0016172966,"about_ca_topic_score_gemma":0.0034775927,"teacher_disagreement_score":0.029077427,"about_ca_system_score_codex":0.0009913652,"about_ca_system_score_gemma":0.0018520401,"threshold_uncertainty_score":0.09727371},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021496445,0.000103446495,0.95643103,0.000056485253,0.000037574577,0.00009063098,0.00039136177,0.020062914,0.0013300463],"genre_scores_gemma":[0.644125,0.00023246596,0.3470378,0.00022507437,0.000056114313,0.0004835684,0.0013340628,0.003047246,0.0034586904],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968658,0.0007172629,0.00022501615,0.0005422175,0.0013707159,0.0002788903],"domain_scores_gemma":[0.9935767,0.0035504363,0.00067632116,0.0014282587,0.00067464745,0.00009369827],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012460592,0.0013754298,0.00068599393,0.001129118,0.00040877488,0.0015031506,0.0015112984,0.0005495902,0.0071918266],"category_scores_gemma":[0.0073908237,0.0005568694,0.0007100181,0.00075464475,0.0009924184,0.0038688579,0.0011339335,0.00110058,0.0016509978],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0028208469,0.00036871282,0.007244565,0.0009845651,0.00020334276,0.0012246949,0.0006938241,0.13474037,0.28261933,0.06358474,0.010352757,0.4951622],"study_design_scores_gemma":[0.00006073141,0.00028891192,0.00067304017,0.00006186383,0.000043122473,0.00020251643,0.00004048,0.73112303,0.2315001,0.029634519,0.006316525,0.000055105374],"about_ca_topic_score_codex":0.0015487435,"about_ca_topic_score_gemma":0.0020104656,"teacher_disagreement_score":0.0071918266,"about_ca_system_score_codex":0.0008223836,"about_ca_system_score_gemma":0.0010668803,"threshold_uncertainty_score":0.024059117},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007496993,0.0003974862,0.9851009,0.00045350863,0.000054516426,0.00005225896,0.000049927185,0.00014354088,0.0062508616],"genre_scores_gemma":[0.5714774,0.0011761395,0.41668427,0.0005115174,0.00023832501,0.00054082857,0.0002182394,0.00026244682,0.008890849],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99671185,0.0011779449,0.0002620469,0.00050771993,0.001076622,0.00026384162],"domain_scores_gemma":[0.99325234,0.0044694003,0.00051285874,0.00067258964,0.00085319765,0.00023962512],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006023841,0.0009897664,0.0008308268,0.0024271195,0.0014113715,0.0033372673,0.0020982646,0.0017193911,0.0040214583],"category_scores_gemma":[0.012795787,0.00068531564,0.0022417146,0.0014780071,0.0056461664,0.0067381826,0.003474963,0.0048285625,0.00064258015],"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.000003231528,0.000005234289,0.00003807106,0.000020059702,0.0000059137956,0.000023850354,0.00009391116,0.0031884091,0.00022530265,0.99410915,0.0000987263,0.0021882353],"study_design_scores_gemma":[0.0000063575603,0.000010077591,0.000021372034,0.000019710691,0.000007088679,0.000022393919,0.000022752625,0.024798298,0.0005253806,0.97247225,0.0020848343,0.000009528005],"about_ca_topic_score_codex":0.0015269383,"about_ca_topic_score_gemma":0.00095615676,"teacher_disagreement_score":0.006023841,"about_ca_system_score_codex":0.003628242,"about_ca_system_score_gemma":0.0013267405,"threshold_uncertainty_score":0.03185749},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2728984,0.0002060497,0.7186985,0.0006945108,0.000042118143,0.00015921285,0.0005061695,0.00081465725,0.0059804097],"genre_scores_gemma":[0.88845354,0.00019703138,0.10539991,0.00014785593,0.00002696326,0.00026553095,0.00079578906,0.00009481125,0.004618544],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987356,0.00026609458,0.00013095493,0.00036579845,0.00027579334,0.00022576026],"domain_scores_gemma":[0.99522746,0.0037718338,0.00037343576,0.00025999357,0.00021990518,0.00014728268],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012192085,0.0006544464,0.0005454245,0.00048475622,0.00079623965,0.00211136,0.0012061077,0.0010799571,0.0037619094],"category_scores_gemma":[0.0048489515,0.00037218092,0.0011020136,0.0006438614,0.0022709689,0.00466979,0.0031288734,0.0019220472,0.000376793],"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.0007668614,0.00029898103,0.0017377244,0.00083581056,0.0000938037,0.0007486536,0.001104903,0.35810822,0.03112025,0.5555678,0.001122648,0.048494406],"study_design_scores_gemma":[0.00010341553,0.00016303577,0.00044150054,0.00006089698,0.00004307573,0.00018410194,0.00027825803,0.5007903,0.021563325,0.47429156,0.002019929,0.0000605546],"about_ca_topic_score_codex":0.0019154614,"about_ca_topic_score_gemma":0.0015975739,"teacher_disagreement_score":0.0037619094,"about_ca_system_score_codex":0.0012457597,"about_ca_system_score_gemma":0.0014813558,"threshold_uncertainty_score":0.012584865},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16818799,0.0040463246,0.77648884,0.027252391,0.001284106,0.00013718073,0.00017435758,0.0031204466,0.0193083],"genre_scores_gemma":[0.9557661,0.0016059644,0.035872787,0.0013353936,0.000502583,0.000082825936,0.000041124502,0.00031441034,0.004478884],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979405,0.0006838862,0.00009647698,0.000288708,0.00063472247,0.0003558101],"domain_scores_gemma":[0.9721931,0.015337211,0.0033759165,0.004476572,0.0033225825,0.0012946104],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038091652,0.000665846,0.00064536254,0.0006991586,0.0011963118,0.002940283,0.0013823616,0.001680824,0.003437372],"category_scores_gemma":[0.03782776,0.0004317799,0.00039160103,0.00053319125,0.0029245093,0.013567727,0.0019349626,0.0028479144,0.0006673145],"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.0011869306,0.00031383205,0.026879044,0.0013296283,0.0004151514,0.0016658352,0.0035651755,0.07681611,0.026663207,0.47643602,0.022609366,0.36211962],"study_design_scores_gemma":[0.00010485448,0.0002812739,0.002847107,0.00041977566,0.0004375949,0.00059662014,0.0017127931,0.18488279,0.0250652,0.7418179,0.041677434,0.00015661775],"about_ca_topic_score_codex":0.0018821573,"about_ca_topic_score_gemma":0.0013921176,"teacher_disagreement_score":0.0038091652,"about_ca_system_score_codex":0.0006059293,"about_ca_system_score_gemma":0.0014719911,"threshold_uncertainty_score":0.020145059},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023103552,0.00006169926,0.9712058,0.000059661703,0.000015966672,0.00008259873,0.000071327035,0.0018867475,0.003512777],"genre_scores_gemma":[0.27928212,0.00009744079,0.7175174,0.00007861567,0.000011559573,0.00030486032,0.00023950041,0.00038371555,0.002084849],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99900013,0.00030473922,0.000051891286,0.00021114288,0.00032512692,0.000106962],"domain_scores_gemma":[0.9988626,0.00064642663,0.000089319976,0.00023432908,0.00014543622,0.000021900034],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009246344,0.000626961,0.0005467927,0.00041810918,0.00040607128,0.0008145711,0.0012749248,0.00061100913,0.0037778157],"category_scores_gemma":[0.0023080069,0.000393152,0.0005289143,0.00041505357,0.00096927764,0.0008778948,0.00070924073,0.0007372891,0.0005406169],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003597159,0.00025185655,0.0010219985,0.0007435424,0.00009679212,0.00035542436,0.0004470077,0.3709776,0.10985873,0.21080595,0.0036835433,0.30139786],"study_design_scores_gemma":[0.00014036248,0.00022436125,0.00024713963,0.00005168968,0.00005779537,0.00012445368,0.00007408782,0.8125046,0.11569105,0.058988687,0.011869679,0.000026112497],"about_ca_topic_score_codex":0.00091412413,"about_ca_topic_score_gemma":0.0017486014,"teacher_disagreement_score":0.0037778157,"about_ca_system_score_codex":0.0005649811,"about_ca_system_score_gemma":0.0011540393,"threshold_uncertainty_score":0.012638032},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044072364,0.00015028291,0.95212954,0.00017729586,0.00002708656,0.0000931204,0.00005046421,0.00021867159,0.0030810668],"genre_scores_gemma":[0.8715272,0.00017082004,0.12628111,0.000061182545,0.00001552808,0.00026156375,0.00007509178,0.00007096697,0.0015364402],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989459,0.0002519198,0.00008238979,0.00025948044,0.00030910692,0.00015116419],"domain_scores_gemma":[0.9969748,0.0019726737,0.00052538776,0.0001722621,0.00025672902,0.00009812765],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014679612,0.0013383579,0.00075518136,0.00069153326,0.0003911764,0.0009393977,0.00074139674,0.0009564967,0.0013337174],"category_scores_gemma":[0.0044890027,0.00055803324,0.0011803635,0.0003246122,0.0012900279,0.0008965006,0.0013735663,0.0011107498,0.00016522591],"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.00002778915,0.000020561414,0.00019339226,0.000057197347,0.000021307089,0.000045368717,0.000053594726,0.9722651,0.0033392443,0.01783272,0.000075576,0.0060681575],"study_design_scores_gemma":[0.000010853297,0.000044222852,0.00004829255,0.0000088251745,0.000008637569,0.000008391802,0.000011790347,0.99001956,0.0013449645,0.008241441,0.00024824176,0.000004791863],"about_ca_topic_score_codex":0.0019170147,"about_ca_topic_score_gemma":0.0017008804,"teacher_disagreement_score":0.0019170147,"about_ca_system_score_codex":0.0013322141,"about_ca_system_score_gemma":0.0016884055,"threshold_uncertainty_score":0.009665906},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.047196027,0.00017267498,0.9318353,0.00040781155,0.0003367648,0.00019191462,0.00049902446,0.009946444,0.009414033],"genre_scores_gemma":[0.635884,0.0002457357,0.341965,0.00027262294,0.00011296519,0.00018170063,0.0015958411,0.0032835954,0.016458558],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9934736,0.001354511,0.00040965754,0.0009789254,0.003261697,0.00052154233],"domain_scores_gemma":[0.98483074,0.006339562,0.00071547134,0.005228406,0.0027138817,0.0001719604],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029359064,0.0008488853,0.00070691033,0.0008045013,0.0009875788,0.0018606111,0.0013691396,0.0013191868,0.013197573],"category_scores_gemma":[0.02076873,0.0008327188,0.0015160395,0.0005965059,0.0015904617,0.0029708545,0.0021454042,0.0014540601,0.0033317269],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016967767,0.0003425327,0.007414528,0.00146476,0.0002650836,0.002245717,0.0010458877,0.09138908,0.11923144,0.35156208,0.019145785,0.40419635],"study_design_scores_gemma":[0.00027522794,0.00040362703,0.0016177502,0.00026305823,0.00018237418,0.0009915262,0.00022572863,0.4246922,0.29160747,0.23500234,0.04465081,0.000087925946],"about_ca_topic_score_codex":0.0022773687,"about_ca_topic_score_gemma":0.0021417763,"teacher_disagreement_score":0.013197573,"about_ca_system_score_codex":0.0012250725,"about_ca_system_score_gemma":0.003314544,"threshold_uncertainty_score":0.044150293},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08716977,0.00028703705,0.9068879,0.00030760502,0.00003967283,0.00011081472,0.00009458511,0.0018795264,0.0032230506],"genre_scores_gemma":[0.8449983,0.000070069174,0.15351959,0.0001480034,0.000013976264,0.000115052964,0.00018472021,0.00016877163,0.00078146195],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99857974,0.0005161653,0.00006812396,0.00017814613,0.00047256163,0.00018532573],"domain_scores_gemma":[0.99467754,0.0038151722,0.00040586607,0.00036721042,0.0005811867,0.00015310572],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020083713,0.0010111338,0.0013357074,0.0010129262,0.0006409688,0.001036459,0.0011277002,0.0010270738,0.0030413494],"category_scores_gemma":[0.0068151504,0.0004056223,0.0011707759,0.00053671,0.0014075896,0.0010221398,0.001338386,0.0011508057,0.00029415087],"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.00012599319,0.00004816894,0.0014398374,0.000098580764,0.00004085192,0.00011398462,0.000058128328,0.9626319,0.003810695,0.011216701,0.0004853541,0.01992994],"study_design_scores_gemma":[0.000007806573,0.000020552072,0.000055577082,0.0000050194503,0.000005310102,0.000009917029,0.0000061861,0.99643624,0.0007118424,0.002617421,0.000121231504,0.000002832665],"about_ca_topic_score_codex":0.0051563513,"about_ca_topic_score_gemma":0.0039575514,"teacher_disagreement_score":0.0051563513,"about_ca_system_score_codex":0.0011121485,"about_ca_system_score_gemma":0.0019727892,"threshold_uncertainty_score":0.0106214285},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.052306805,0.00040352065,0.9343275,0.00015872568,0.000052981297,0.00006558854,0.00007036857,0.003155202,0.009459248],"genre_scores_gemma":[0.5937921,0.0003101084,0.39990896,0.00014281026,0.000023523291,0.00017280175,0.00024156067,0.0008173755,0.0045908326],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988973,0.00037266768,0.00007284805,0.0001688336,0.00035012813,0.00013817975],"domain_scores_gemma":[0.9978771,0.0013610359,0.00010292701,0.00045341867,0.00016403297,0.000041454772],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012634763,0.0007894397,0.0007262231,0.0008075983,0.0005270796,0.0013024248,0.0010836977,0.00074146985,0.0035304555],"category_scores_gemma":[0.0031076963,0.00035271692,0.000611979,0.00049341115,0.0016820959,0.0014246934,0.0015009686,0.0011754496,0.00062219345],"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.00037059793,0.0001921897,0.0011687697,0.00058284006,0.0000679173,0.00058259716,0.0006847571,0.1831318,0.112891145,0.43387148,0.004235533,0.26222035],"study_design_scores_gemma":[0.00003918587,0.00014503981,0.00019850263,0.00010671895,0.000062919586,0.0003035852,0.00007613365,0.6793428,0.16449068,0.13354677,0.02164676,0.000040855342],"about_ca_topic_score_codex":0.0010020545,"about_ca_topic_score_gemma":0.0013085876,"teacher_disagreement_score":0.0035304555,"about_ca_system_score_codex":0.00084438646,"about_ca_system_score_gemma":0.00083372864,"threshold_uncertainty_score":0.011810482},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035160195,0.0006760315,0.9482447,0.0007142454,0.00014563541,0.00021404734,0.0005475871,0.0024014048,0.0118960785],"genre_scores_gemma":[0.34576064,0.00046885392,0.6441836,0.0004707855,0.00010033041,0.0003761639,0.0016796639,0.0007159744,0.0062440154],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979138,0.0007062827,0.0001564783,0.00032651811,0.00067676447,0.00022023836],"domain_scores_gemma":[0.99530643,0.0031757534,0.00029099,0.00072309835,0.0004092455,0.00009448423],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018160569,0.0008566603,0.00055005326,0.0007603695,0.0006101528,0.001980648,0.0015424048,0.00079513,0.009061145],"category_scores_gemma":[0.008872655,0.00056384463,0.0014206716,0.0011145837,0.0021017932,0.003390418,0.0026614075,0.0019512335,0.0014405663],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00046222235,0.00021955842,0.002210418,0.0014491328,0.0001029889,0.00049167854,0.0005504407,0.37157747,0.009684405,0.3777019,0.013476289,0.22207353],"study_design_scores_gemma":[0.00006696763,0.00010759306,0.00030127462,0.00018662811,0.0000430418,0.0001988218,0.00009159537,0.5484171,0.012300863,0.42280594,0.0154506555,0.00002943572],"about_ca_topic_score_codex":0.0015912593,"about_ca_topic_score_gemma":0.002746778,"teacher_disagreement_score":0.009061145,"about_ca_system_score_codex":0.0008996217,"about_ca_system_score_gemma":0.0015246086,"threshold_uncertainty_score":0.030312598},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29035428,0.00021455619,0.7004678,0.0007982221,0.000044727138,0.00016387836,0.0005183368,0.0008004701,0.0066376845],"genre_scores_gemma":[0.8864022,0.0001906522,0.107335545,0.00014350793,0.000026633683,0.00025900622,0.0007665689,0.00009172104,0.004784134],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99868363,0.0003015343,0.00013546881,0.000382058,0.00026677034,0.00023050263],"domain_scores_gemma":[0.9947524,0.0042419247,0.00038713054,0.0002664635,0.00020549468,0.00014653277],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013445606,0.00061781594,0.0005393233,0.00048887567,0.0008130396,0.0022244419,0.0011636623,0.0011145045,0.0037843804],"category_scores_gemma":[0.005041722,0.00039011732,0.0011622249,0.00062846707,0.002480255,0.0045635914,0.003195583,0.0019561034,0.00035396835],"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.0007654482,0.00028378292,0.0018053883,0.00076411926,0.000095544056,0.0006928295,0.001143159,0.34641984,0.026776448,0.5731445,0.0011125618,0.046996392],"study_design_scores_gemma":[0.00010884429,0.00014763924,0.0004652057,0.00006168498,0.00004315149,0.00017156269,0.0002934374,0.4872953,0.019826831,0.48943892,0.0020864557,0.00006105798],"about_ca_topic_score_codex":0.001966042,"about_ca_topic_score_gemma":0.0016778846,"teacher_disagreement_score":0.0037843804,"about_ca_system_score_codex":0.0012657443,"about_ca_system_score_gemma":0.0015054116,"threshold_uncertainty_score":0.012660027},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010210451,0.002041833,0.9661108,0.0019467457,0.00017118605,0.00003428795,0.000103678205,0.00030572762,0.019075258],"genre_scores_gemma":[0.63660383,0.0045789834,0.3392126,0.0014625877,0.00085840176,0.00042131086,0.00054604356,0.0005280427,0.01578823],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967751,0.0009554161,0.0001995137,0.000727583,0.0011084724,0.00023383199],"domain_scores_gemma":[0.9906543,0.00635823,0.0003375966,0.0020082453,0.00048208368,0.00015953733],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040594204,0.000921888,0.0016352152,0.00076537614,0.0008663487,0.003775064,0.0020947184,0.002092902,0.004278499],"category_scores_gemma":[0.0087248515,0.001064342,0.0018325242,0.0007290627,0.008405682,0.012271698,0.0049738144,0.0076543447,0.00078773615],"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.00006129183,0.00002340328,0.00008420365,0.00020402497,0.000026723103,0.000035828143,0.00023880726,0.013011306,0.0008589898,0.9613894,0.0014916325,0.022574393],"study_design_scores_gemma":[0.000017819571,0.000025200397,0.000044213735,0.00004360783,0.00001033397,0.000024159064,0.000031180272,0.025166338,0.0007495315,0.9693626,0.004515264,0.000009835198],"about_ca_topic_score_codex":0.0009273421,"about_ca_topic_score_gemma":0.0004056397,"teacher_disagreement_score":0.004278499,"about_ca_system_score_codex":0.0009653258,"about_ca_system_score_gemma":0.0015871353,"threshold_uncertainty_score":0.02146852},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018528686,0.00010510883,0.97671366,0.00004890537,0.00006609668,0.00007690154,0.0003585421,0.015537516,0.005240395],"genre_scores_gemma":[0.10667246,0.0003828105,0.87671983,0.00021235614,0.00006714687,0.000538092,0.0017429086,0.005149017,0.008515383],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99928963,0.00011943652,0.000070271926,0.00012924949,0.0003290827,0.000062287574],"domain_scores_gemma":[0.9993594,0.00032564768,0.00006408922,0.00011175355,0.000118897064,0.000020169166],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011006298,0.00094012293,0.000606089,0.00084899244,0.00030642093,0.0010064504,0.0012187591,0.0005844619,0.015906503],"category_scores_gemma":[0.0023822745,0.0006951838,0.001178521,0.00032915865,0.00062092516,0.0009333614,0.0010751447,0.0012776308,0.0033416268],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000447978,0.00013830476,0.0010067277,0.001392101,0.00013305219,0.00074906094,0.000411602,0.22403404,0.072349474,0.2074691,0.030452544,0.46141604],"study_design_scores_gemma":[0.00017233075,0.00018483314,0.00023245768,0.00020120414,0.00006508866,0.0004942456,0.000036907168,0.7573684,0.053971447,0.048902556,0.13829136,0.00007915048],"about_ca_topic_score_codex":0.0013690275,"about_ca_topic_score_gemma":0.0017220179,"teacher_disagreement_score":0.015906503,"about_ca_system_score_codex":0.0005170504,"about_ca_system_score_gemma":0.0011584371,"threshold_uncertainty_score":0.053212583},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.053767435,0.00009847563,0.93706065,0.0001973281,0.0000395553,0.0001334159,0.0004681738,0.0062453276,0.0019896438],"genre_scores_gemma":[0.701399,0.00028472426,0.2909425,0.00020611858,0.000037440917,0.00041848226,0.0016552629,0.0011260773,0.003930445],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9951965,0.0014346244,0.00036909865,0.0008309283,0.0016197055,0.00054905296],"domain_scores_gemma":[0.992388,0.0050237007,0.0005178384,0.0012532085,0.0006913865,0.00012591403],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0044208374,0.0010899252,0.0009909822,0.0010083263,0.00064070977,0.0020973475,0.002272721,0.0012143331,0.0035013717],"category_scores_gemma":[0.013737785,0.0011198545,0.0028094677,0.00073092396,0.0028446214,0.0034443913,0.0028996319,0.0016720338,0.000397721],"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.00045421976,0.00015502717,0.0039806035,0.00054624333,0.00017372619,0.00058875943,0.00036991105,0.775248,0.026348034,0.15923299,0.0023448477,0.030557703],"study_design_scores_gemma":[0.00010281334,0.00007250896,0.0002652556,0.000039518574,0.000049254697,0.00007158455,0.000028052042,0.9191659,0.024380993,0.05321285,0.0025857443,0.000025477957],"about_ca_topic_score_codex":0.00822243,"about_ca_topic_score_gemma":0.00709578,"teacher_disagreement_score":0.00822243,"about_ca_system_score_codex":0.0017905494,"about_ca_system_score_gemma":0.0031648339,"threshold_uncertainty_score":0.023379862},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00060987665,0.000047300942,0.99677354,0.00008798986,0.000021701166,0.00012906318,0.00006600407,0.0014679619,0.00079661567],"genre_scores_gemma":[0.076092675,0.00029835277,0.9182954,0.00021740742,0.000074351345,0.00091462565,0.0006161466,0.0010707692,0.0024203628],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9913093,0.0030126872,0.0010265884,0.001283009,0.0027816764,0.0005866978],"domain_scores_gemma":[0.9864742,0.008087751,0.0008517626,0.0022633122,0.0019948895,0.0003280069],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00973302,0.0021637846,0.0010937774,0.0021347427,0.0013369203,0.0034541225,0.0038270024,0.0020244324,0.007747244],"category_scores_gemma":[0.023822648,0.00211623,0.0045205066,0.0008702057,0.0043571456,0.0039641527,0.0052490253,0.004395388,0.0021481398],"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.00011940734,0.00020454984,0.0012766961,0.0009850027,0.00018264576,0.0011404294,0.001030415,0.20919967,0.009398795,0.69480264,0.0047689388,0.07689077],"study_design_scores_gemma":[0.00013929796,0.00019859435,0.0003165532,0.00046082932,0.00013768296,0.00052008056,0.00021085642,0.5871388,0.011233121,0.34989884,0.04963358,0.00011180348],"about_ca_topic_score_codex":0.008730623,"about_ca_topic_score_gemma":0.006215832,"teacher_disagreement_score":0.00973302,"about_ca_system_score_codex":0.0027252925,"about_ca_system_score_gemma":0.0055076675,"threshold_uncertainty_score":0.051473737},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91823786,0.0018313963,0.029422667,0.002605641,0.00051276246,0.00030092697,0.0055566076,0.0108951535,0.030636983],"genre_scores_gemma":[0.90981704,0.00049704383,0.06271326,0.0010151357,0.00012000905,0.00038496216,0.012464622,0.0017992784,0.011188666],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9964283,0.0010118122,0.00038076553,0.0006364259,0.0010912601,0.00045138225],"domain_scores_gemma":[0.9663811,0.023803424,0.0009165698,0.0057578883,0.0023593297,0.00078176777],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024837127,0.0011068475,0.00071985944,0.000907257,0.0008714882,0.0013590495,0.0034599018,0.0018564324,0.017540649],"category_scores_gemma":[0.021892067,0.0005241213,0.0005881691,0.0017794399,0.0015559901,0.0045143417,0.0018588426,0.0033853562,0.0023289288],"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.016578678,0.010306451,0.015956417,0.005186347,0.00074174773,0.0019869842,0.001648903,0.17846787,0.125624,0.05122492,0.13152172,0.4607559],"study_design_scores_gemma":[0.0038961214,0.005815904,0.0068697347,0.00035094115,0.0002784533,0.0010693499,0.0013971474,0.67296356,0.21900673,0.037593316,0.05059339,0.00016533195],"about_ca_topic_score_codex":0.0026296873,"about_ca_topic_score_gemma":0.003960349,"teacher_disagreement_score":0.017540649,"about_ca_system_score_codex":0.001309335,"about_ca_system_score_gemma":0.0015667583,"threshold_uncertainty_score":0.058679342},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010884474,0.00018865136,0.9832123,0.00013890315,0.00006959389,0.00011255974,0.00023389989,0.0018311566,0.0033284184],"genre_scores_gemma":[0.1466615,0.0004327495,0.84565395,0.00014601473,0.000048627386,0.00028870458,0.0005697892,0.00042684685,0.0057718265],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985209,0.00044149207,0.00024310923,0.00021290462,0.00047566256,0.00010604351],"domain_scores_gemma":[0.9987204,0.0005154246,0.00012871729,0.00036469774,0.00022124973,0.0000496008],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019115482,0.0007765412,0.00052791677,0.0007720463,0.00061858457,0.0018530497,0.0017922044,0.0009187371,0.0021819335],"category_scores_gemma":[0.0025158022,0.0007689082,0.002065193,0.0006498016,0.0015568169,0.0028968058,0.0018936358,0.0014291015,0.00072157587],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026409177,0.00008406521,0.0019215668,0.00053857197,0.00009041789,0.0008158003,0.0018622075,0.17990653,0.02359037,0.716466,0.0025951979,0.071865246],"study_design_scores_gemma":[0.0001313031,0.00019665489,0.0003784422,0.00013147213,0.00014910422,0.00049133325,0.0002850298,0.611453,0.03301198,0.21796554,0.13571884,0.00008737174],"about_ca_topic_score_codex":0.0057070134,"about_ca_topic_score_gemma":0.0071284147,"teacher_disagreement_score":0.0057070134,"about_ca_system_score_codex":0.00090712047,"about_ca_system_score_gemma":0.0017915546,"threshold_uncertainty_score":0.011347592},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17623185,0.0006141749,0.3146149,0.0027786226,0.0013755114,0.00025357763,0.00037168412,0.0019870007,0.5017727],"genre_scores_gemma":[0.9324597,0.00024196284,0.016081898,0.0015404354,0.00016613664,0.00013274362,0.00014756502,0.00023807237,0.04899139],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992004,0.00016401836,0.000027030956,0.00017973309,0.00027089703,0.00015795408],"domain_scores_gemma":[0.998168,0.00068795064,0.00014291986,0.00051560317,0.00027489057,0.00021062966],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007064561,0.0004825203,0.0003268755,0.00036048333,0.0008162631,0.0010532873,0.0005221805,0.00068333856,0.0421172],"category_scores_gemma":[0.0043062214,0.00020035857,0.00032797677,0.0001500317,0.0015736925,0.001611523,0.0016664736,0.0021847207,0.0026228414],"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.0003227316,0.0002570235,0.0013068991,0.00013877205,0.00003096736,0.00027457636,0.00046070767,0.0019268997,0.0362331,0.89462054,0.005345516,0.05908221],"study_design_scores_gemma":[0.00005855299,0.00035108515,0.003267146,0.00009439106,0.000045560075,0.0005947688,0.0002002723,0.009529901,0.030217903,0.90111214,0.054490346,0.000037889255],"about_ca_topic_score_codex":0.0003874776,"about_ca_topic_score_gemma":0.0005640712,"teacher_disagreement_score":0.0421172,"about_ca_system_score_codex":0.0004904839,"about_ca_system_score_gemma":0.0005251677,"threshold_uncertainty_score":0.14089608},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045203846,0.0008557259,0.9071649,0.0013452076,0.00015624016,0.00042039398,0.0016969522,0.019450579,0.023706246],"genre_scores_gemma":[0.39987433,0.00029562722,0.576506,0.0006807936,0.000095173295,0.00041269013,0.0037688592,0.0015785593,0.016787872],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969879,0.00047512958,0.00016520321,0.00077027676,0.0010599218,0.0005416254],"domain_scores_gemma":[0.9965623,0.0013354846,0.00023257457,0.001253074,0.00048380892,0.00013273885],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011860551,0.0010569672,0.0012053485,0.0011443824,0.0011679794,0.002307595,0.004123585,0.001044386,0.021646364],"category_scores_gemma":[0.0061104125,0.0006726252,0.001369081,0.002112381,0.0011621785,0.0061525516,0.003641512,0.00197384,0.0038732283],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009613786,0.00038771375,0.003171202,0.00062306575,0.00013317005,0.00024156863,0.00027681643,0.048667185,0.028828815,0.09685315,0.031323195,0.7885328],"study_design_scores_gemma":[0.00019043453,0.00019916489,0.0010797892,0.000052471223,0.00009339879,0.00037718515,0.00016822368,0.8004572,0.03807157,0.12734723,0.03190084,0.00006247249],"about_ca_topic_score_codex":0.008093236,"about_ca_topic_score_gemma":0.01891205,"teacher_disagreement_score":0.021646364,"about_ca_system_score_codex":0.0035676635,"about_ca_system_score_gemma":0.0025888497,"threshold_uncertainty_score":0.07241428},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008581851,0.011950997,0.49503314,0.003251969,0.0039379653,0.00022468298,0.0010706607,0.0035146582,0.47243404],"genre_scores_gemma":[0.21856852,0.018843185,0.1818609,0.0022681209,0.0022484558,0.0004966678,0.0018675086,0.0018617277,0.57198495],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985795,0.00019691407,0.00006229979,0.00022545348,0.0007966548,0.00013921507],"domain_scores_gemma":[0.99741566,0.00087342237,0.00014571444,0.0008194753,0.0006860561,0.00005953114],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006806941,0.0013215238,0.00082010555,0.002385788,0.0012552064,0.0030224647,0.0010801851,0.0017985607,0.030176248],"category_scores_gemma":[0.004938154,0.00047876392,0.00044582871,0.002682558,0.0016970752,0.0030724548,0.0017037839,0.002430811,0.012774357],"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.00003707731,0.000022828579,0.00011770656,0.00026320363,0.000017014565,0.00009752765,0.00018542545,0.003712779,0.002808369,0.6970892,0.047178183,0.24847071],"study_design_scores_gemma":[0.000018171146,0.00006105247,0.00019654265,0.00046462513,0.000030345742,0.00068208383,0.000073446405,0.00987728,0.01941415,0.4859653,0.48316488,0.000052143518],"about_ca_topic_score_codex":0.0006623912,"about_ca_topic_score_gemma":0.00067086087,"teacher_disagreement_score":0.030176248,"about_ca_system_score_codex":0.0010916048,"about_ca_system_score_gemma":0.0014970938,"threshold_uncertainty_score":0.100949645},"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":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021680961,0.00089054386,0.9134785,0.00027585786,0.0003054211,0.00010197217,0.0010461706,0.03680765,0.044925794],"genre_scores_gemma":[0.037340768,0.0019773243,0.78180695,0.0005614613,0.00017251965,0.00037821574,0.007478202,0.030735727,0.13954885],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99932134,0.00007220046,0.000028190587,0.00008710791,0.00044352878,0.00004758925],"domain_scores_gemma":[0.99945,0.00026184224,0.00002442325,0.000106644125,0.00013718825,0.000019913496],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005465374,0.0013056807,0.00049264607,0.0014294996,0.0004185754,0.0011547018,0.0016739091,0.0008971837,0.04216009],"category_scores_gemma":[0.0018749438,0.00085451006,0.0007878514,0.0010162813,0.0005087136,0.0019415563,0.0013806361,0.001528379,0.020926712],"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.0000975585,0.00006913699,0.00020852433,0.0006964476,0.000033427492,0.00020921013,0.0001866585,0.006000626,0.020732783,0.050827254,0.16410968,0.7568287],"study_design_scores_gemma":[0.00011057245,0.00006900147,0.00044550718,0.00037459837,0.00005558999,0.0011870904,0.00005168316,0.052626166,0.06816558,0.08540157,0.7914311,0.000081515784],"about_ca_topic_score_codex":0.0006915841,"about_ca_topic_score_gemma":0.0012137931,"teacher_disagreement_score":0.04216009,"about_ca_system_score_codex":0.00036143998,"about_ca_system_score_gemma":0.00057347777,"threshold_uncertainty_score":0.14103955},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0068632206,0.0008343964,0.98429084,0.00060092297,0.00025199883,0.00034550286,0.00006179367,0.0030070746,0.003744182],"genre_scores_gemma":[0.05274505,0.0015216011,0.93975294,0.00030401853,0.0001433165,0.0003080984,0.00030376294,0.0006091622,0.0043119946],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9822344,0.004484433,0.0015492502,0.0013139598,0.009793889,0.00062404963],"domain_scores_gemma":[0.96265316,0.014031533,0.0019380982,0.01436046,0.0067584696,0.00025816922],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010049991,0.0023764567,0.00085367425,0.002385611,0.0010739517,0.0016214325,0.0030206046,0.0017478957,0.0060517685],"category_scores_gemma":[0.04292257,0.0010611018,0.0024135332,0.0014732623,0.0019867008,0.0050980016,0.0034262077,0.00456357,0.0026117805],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003939697,0.0006507562,0.0020756985,0.0017898323,0.00019211072,0.0005724495,0.0010532237,0.04011066,0.08890255,0.08184943,0.0076183225,0.774791],"study_design_scores_gemma":[0.0004705101,0.0017190941,0.0024168296,0.0009812241,0.0010996296,0.0046233437,0.0007595596,0.31849992,0.21591827,0.20996925,0.2432949,0.0002473931],"about_ca_topic_score_codex":0.0012870082,"about_ca_topic_score_gemma":0.0014379033,"teacher_disagreement_score":0.010049991,"about_ca_system_score_codex":0.0009601283,"about_ca_system_score_gemma":0.0030454623,"threshold_uncertainty_score":0.053150058},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023627799,0.0004895989,0.96018904,0.00062259857,0.00009195686,0.00018325062,0.00032091784,0.002326085,0.012148713],"genre_scores_gemma":[0.27604532,0.00037092058,0.7167009,0.0005757175,0.00009439624,0.0003207787,0.0009771193,0.0005719052,0.004342875],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983997,0.00059586717,0.00008340396,0.00025923076,0.0004955422,0.00016618558],"domain_scores_gemma":[0.9967705,0.0023356336,0.00018924488,0.00035590108,0.00028437673,0.00006438076],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015260043,0.0009988515,0.0007740721,0.0009238485,0.00050863746,0.0013852313,0.0016376668,0.0010693423,0.006400469],"category_scores_gemma":[0.0075879632,0.00079829927,0.0012819256,0.0012419997,0.0012243137,0.0025637983,0.002350011,0.0022000629,0.00084920926],"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.00031243433,0.00022776908,0.0008036304,0.0007704227,0.00015450123,0.00038888722,0.0002830611,0.5943039,0.010762391,0.1529502,0.015420101,0.22362271],"study_design_scores_gemma":[0.00010674381,0.000048619848,0.000104026265,0.000056060027,0.000032833646,0.00010394445,0.000052888907,0.8813563,0.00674223,0.105800144,0.005579362,0.000016889033],"about_ca_topic_score_codex":0.0020172813,"about_ca_topic_score_gemma":0.0046214564,"teacher_disagreement_score":0.006400469,"about_ca_system_score_codex":0.00094189955,"about_ca_system_score_gemma":0.0019749214,"threshold_uncertainty_score":0.021411717},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00082037714,0.00012639783,0.9953492,0.000081669685,0.00004159073,0.0000675707,0.00004033788,0.0016701261,0.0018027182],"genre_scores_gemma":[0.08731825,0.0005213226,0.90317297,0.0002695031,0.00015568057,0.00034473115,0.00024729277,0.0009567057,0.007013551],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99649507,0.00063331675,0.00023941425,0.00050335727,0.0017883114,0.000340674],"domain_scores_gemma":[0.99605393,0.0012132492,0.00020910392,0.0018895939,0.00047605112,0.00015804356],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023378914,0.0018497022,0.001268936,0.0027599419,0.001625839,0.0037973172,0.0045292056,0.0014972171,0.014255617],"category_scores_gemma":[0.0073518334,0.0015256339,0.0025048412,0.0015923793,0.0028413746,0.00741869,0.005219217,0.004229338,0.0059927073],"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.00021737536,0.00016381552,0.00038145395,0.00044788796,0.00008722867,0.00028681714,0.0001854007,0.03206375,0.01334082,0.7206411,0.0057967287,0.22638762],"study_design_scores_gemma":[0.00007681585,0.00010315588,0.000110575165,0.00011396666,0.0001337971,0.00018518454,0.000040552095,0.20336106,0.010235635,0.7439599,0.04162043,0.00005895823],"about_ca_topic_score_codex":0.0024664938,"about_ca_topic_score_gemma":0.0043530576,"teacher_disagreement_score":0.014255617,"about_ca_system_score_codex":0.0011442847,"about_ca_system_score_gemma":0.002237722,"threshold_uncertainty_score":0.047689795},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11371127,0.000053066306,0.85956573,0.0006851881,0.000028615934,0.0001935879,0.00018160215,0.00093990174,0.024641016],"genre_scores_gemma":[0.8137313,0.00009562637,0.17658989,0.00014903922,0.000018917064,0.00039485493,0.00032599727,0.00018832508,0.008506058],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9951213,0.001919796,0.00032772092,0.00057110103,0.0013151224,0.0007449286],"domain_scores_gemma":[0.9923057,0.0042382907,0.0006607221,0.0019462123,0.0006072188,0.00024184913],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036755092,0.00056623254,0.0006512505,0.00089520996,0.0008927147,0.0031506137,0.0019781147,0.0018307213,0.007249927],"category_scores_gemma":[0.008765525,0.0005725283,0.0018865257,0.00079540315,0.0035956607,0.0052555045,0.002516537,0.0024223537,0.00083919277],"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.00011711833,0.00007634493,0.00046787658,0.000055279907,0.000033799373,0.00019973789,0.00041583818,0.028217554,0.003934697,0.9587717,0.00025411954,0.0074558486],"study_design_scores_gemma":[0.00018547206,0.00013379488,0.00029169585,0.000035083725,0.0000630715,0.000091510505,0.00020046107,0.14963773,0.008252394,0.8365736,0.0044977437,0.00003735954],"about_ca_topic_score_codex":0.0039007508,"about_ca_topic_score_gemma":0.0023653598,"teacher_disagreement_score":0.007249927,"about_ca_system_score_codex":0.0015803048,"about_ca_system_score_gemma":0.002002628,"threshold_uncertainty_score":0.024253428},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009137759,0.00024146505,0.97977966,0.00006552971,0.00008313963,0.000060122657,0.00007600216,0.0047301888,0.005826085],"genre_scores_gemma":[0.52981013,0.000368551,0.45543262,0.00016329106,0.00012389767,0.00026443906,0.0006470684,0.0020802917,0.011109744],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.995641,0.0011729161,0.00020376511,0.0007103554,0.0018882495,0.00038373182],"domain_scores_gemma":[0.99409074,0.0023316713,0.00020184669,0.0026312107,0.0006180533,0.00012648795],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022162315,0.0010598117,0.001569162,0.000973375,0.00071445445,0.0015968416,0.002035147,0.0007456014,0.0070235385],"category_scores_gemma":[0.0063561667,0.00085637416,0.0013264852,0.0009853814,0.0017572666,0.0023580415,0.002762396,0.0023388125,0.002636338],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013033184,0.0002021287,0.001326052,0.0005511999,0.0001267796,0.0001866449,0.00032998936,0.12388494,0.06341429,0.25695524,0.008802254,0.54291713],"study_design_scores_gemma":[0.0000880332,0.00014043177,0.0004663445,0.000054963144,0.0000675424,0.00016502023,0.00003478961,0.7559849,0.06378026,0.16783392,0.011337566,0.000046233494],"about_ca_topic_score_codex":0.0008716604,"about_ca_topic_score_gemma":0.0013556948,"teacher_disagreement_score":0.0070235385,"about_ca_system_score_codex":0.0012255779,"about_ca_system_score_gemma":0.0011719251,"threshold_uncertainty_score":0.023496091},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034829777,0.00067032385,0.92149556,0.00076362456,0.00028582758,0.00053157384,0.00051405316,0.0016088855,0.039300304],"genre_scores_gemma":[0.40792724,0.0012013685,0.55498093,0.00041090228,0.000389097,0.0010334951,0.0018911441,0.0008208549,0.03134503],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9917441,0.0019439163,0.0011041077,0.0022918873,0.002087683,0.00082828425],"domain_scores_gemma":[0.9875837,0.004999141,0.0010684655,0.0033240097,0.0023809683,0.0006437078],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005381507,0.001454702,0.0009356002,0.0029812483,0.0045319386,0.0077987127,0.0023868072,0.0019026009,0.016687637],"category_scores_gemma":[0.018325476,0.0014909174,0.003606364,0.0019525449,0.006107632,0.013013212,0.0072406125,0.0025619417,0.003565393],"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.00013105746,0.000056508397,0.0014103071,0.00019797769,0.000067550995,0.00065609027,0.0010733078,0.0052678576,0.0031003377,0.96527505,0.0012234559,0.021540467],"study_design_scores_gemma":[0.00006110502,0.00005850043,0.00036510537,0.00009952891,0.00011893332,0.00042335803,0.00030652355,0.0247813,0.0054688593,0.93427825,0.033986673,0.000051928895],"about_ca_topic_score_codex":0.005657695,"about_ca_topic_score_gemma":0.005465212,"teacher_disagreement_score":0.016687637,"about_ca_system_score_codex":0.0023135538,"about_ca_system_score_gemma":0.0034923507,"threshold_uncertainty_score":0.05582571},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14992309,0.00017421086,0.8319055,0.00014252494,0.00005309383,0.00006828698,0.000259442,0.0041073184,0.013366514],"genre_scores_gemma":[0.80275035,0.00010271631,0.19364879,0.000043410564,0.000007764596,0.00011654999,0.00023880664,0.00011123855,0.002980415],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998826,0.000018737419,0.000007141841,0.00001763578,0.00005006213,0.000023821513],"domain_scores_gemma":[0.9998727,0.00006074362,0.000011024152,0.00002091777,0.000028178529,0.000006549608],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017240363,0.00045778698,0.00022743508,0.0003252516,0.00024172918,0.00032823515,0.00039730113,0.00022479436,0.0036757365],"category_scores_gemma":[0.00038198647,0.0001645296,0.00035435663,0.00017244277,0.00026504704,0.00033155858,0.00028779614,0.000315353,0.00036695861],"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.0002259075,0.000047445315,0.0018458134,0.0001878407,0.000042348383,0.00031508607,0.00011782966,0.8607427,0.038619276,0.023326332,0.002072182,0.07245729],"study_design_scores_gemma":[0.000020223897,0.00004647703,0.00032105503,0.000007622973,0.000008644223,0.00003076609,0.00001558864,0.9851179,0.009020318,0.0035763204,0.001827754,0.0000074107666],"about_ca_topic_score_codex":0.004664817,"about_ca_topic_score_gemma":0.0051825955,"teacher_disagreement_score":0.004664817,"about_ca_system_score_codex":0.0005088836,"about_ca_system_score_gemma":0.0005778585,"threshold_uncertainty_score":0.012296557},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.064587265,0.0021074556,0.9131174,0.0015624217,0.00026290037,0.00018241222,0.0011856208,0.0005906547,0.016403884],"genre_scores_gemma":[0.7493841,0.0023455843,0.22320351,0.0005890315,0.0006654581,0.00094344415,0.0033617553,0.0007687974,0.018738344],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9917543,0.003227957,0.0007883123,0.0014294687,0.0021074023,0.0006925795],"domain_scores_gemma":[0.9563954,0.027855866,0.005071226,0.0025679118,0.004803852,0.0033057148],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0075641396,0.0018590549,0.0020527402,0.007119039,0.0022327325,0.0059192986,0.0020313428,0.0030388734,0.008251169],"category_scores_gemma":[0.047604818,0.0010735457,0.0016575127,0.004560556,0.003826613,0.015455503,0.00413591,0.0031323794,0.0009443396],"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.000044622768,0.000017262413,0.0005874812,0.000088998924,0.000024549465,0.000043362703,0.00017355554,0.009822333,0.0003850366,0.9800945,0.0008923869,0.007825967],"study_design_scores_gemma":[0.000007531869,0.000021150236,0.00023654419,0.000035447116,0.000011810775,0.00002825616,0.000027571536,0.036970902,0.00019841248,0.96045905,0.0019859043,0.000017365335],"about_ca_topic_score_codex":0.002949027,"about_ca_topic_score_gemma":0.0023059926,"teacher_disagreement_score":0.008251169,"about_ca_system_score_codex":0.006725008,"about_ca_system_score_gemma":0.0020938753,"threshold_uncertainty_score":0.048793614},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023078527,0.025041044,0.6383494,0.0029975309,0.007939727,0.00022457149,0.00069601415,0.006131544,0.31631234],"genre_scores_gemma":[0.05576103,0.019164992,0.32817322,0.001999344,0.0045556813,0.0004983491,0.0032412224,0.0056084595,0.58099765],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99865746,0.00015625673,0.0000675398,0.00017407908,0.0008766508,0.00006795239],"domain_scores_gemma":[0.99893373,0.00032032764,0.000046238056,0.00029529276,0.00031230802,0.00009211721],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012244316,0.0012836533,0.0011305376,0.0013708078,0.0010576728,0.0028596746,0.0014792792,0.0008803369,0.026123641],"category_scores_gemma":[0.0027656145,0.0010399652,0.000747397,0.002455532,0.0011659524,0.0037127538,0.0015687033,0.002866717,0.017127201],"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.000059102535,0.000048883656,0.00010289064,0.0004160568,0.000025885543,0.0001200192,0.00018688272,0.003888572,0.0038591903,0.3116993,0.3087312,0.37086198],"study_design_scores_gemma":[0.000019199791,0.000034886525,0.00019683978,0.00014286801,0.000016318616,0.000421527,0.000034352473,0.0077397483,0.002916276,0.17889349,0.80955505,0.000029470166],"about_ca_topic_score_codex":0.0014817365,"about_ca_topic_score_gemma":0.0026461505,"teacher_disagreement_score":0.026123641,"about_ca_system_score_codex":0.001239375,"about_ca_system_score_gemma":0.0017093958,"threshold_uncertainty_score":0.08739227},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0569926,0.00025422152,0.9341004,0.00084029103,0.00007006102,0.00022754911,0.00042713256,0.0026367214,0.0044510276],"genre_scores_gemma":[0.27891853,0.00024497617,0.7153522,0.0004988638,0.00007891184,0.00015822916,0.0012681236,0.00050403277,0.0029761626],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99792695,0.00048527974,0.00016463043,0.00057378766,0.00052039983,0.00032896473],"domain_scores_gemma":[0.9938996,0.004574563,0.00043139682,0.00056292774,0.0004421973,0.00008929373],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022204006,0.00091664423,0.0006267638,0.0009597327,0.00076091243,0.0016704027,0.0017662974,0.0010238191,0.0043750633],"category_scores_gemma":[0.007598279,0.00064346084,0.002358764,0.000937973,0.0018700449,0.0038084507,0.0023196826,0.0022756269,0.0006052522],"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.00044381912,0.0003662959,0.0048058545,0.0014799036,0.00024585237,0.00087779475,0.0009797133,0.23483746,0.026159458,0.44096947,0.00813388,0.28070056],"study_design_scores_gemma":[0.00015238301,0.00013318655,0.000439905,0.00010884841,0.00012744348,0.0002905323,0.00027387645,0.59507096,0.036106423,0.3582685,0.008976737,0.000051164927],"about_ca_topic_score_codex":0.006001977,"about_ca_topic_score_gemma":0.009994038,"teacher_disagreement_score":0.006001977,"about_ca_system_score_codex":0.0016150592,"about_ca_system_score_gemma":0.0029441463,"threshold_uncertainty_score":0.01463604},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01133931,0.002277256,0.79611886,0.0014469537,0.00040970303,0.0001076597,0.0003468431,0.0012603175,0.18669306],"genre_scores_gemma":[0.6438779,0.004256956,0.273023,0.00060523045,0.0005508752,0.0004077451,0.00093885313,0.00093583565,0.075403616],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99868613,0.00041892153,0.00009678857,0.00026493668,0.0003805306,0.00015277248],"domain_scores_gemma":[0.99904484,0.0003694147,0.000051664232,0.0002843444,0.00020503307,0.000044630982],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015984586,0.0006837265,0.0005406049,0.0014203854,0.0012608357,0.003283543,0.0012081014,0.001105039,0.008518191],"category_scores_gemma":[0.002951225,0.00070771354,0.0010546991,0.0018149656,0.005340755,0.007153168,0.0017596822,0.0026020082,0.0018406871],"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.000006786721,0.0000021273243,0.000015149612,0.000015768137,0.000001786475,0.000012513274,0.00010761496,0.00046067097,0.0002208585,0.99269366,0.00070869067,0.005754344],"study_design_scores_gemma":[0.000009392424,0.000008004697,0.000044474084,0.000023064973,0.0000071905165,0.000029980294,0.00005019821,0.002563897,0.000752212,0.9709811,0.025522457,0.0000080239115],"about_ca_topic_score_codex":0.0029644705,"about_ca_topic_score_gemma":0.0016135398,"teacher_disagreement_score":0.008518191,"about_ca_system_score_codex":0.0017847344,"about_ca_system_score_gemma":0.0011875508,"threshold_uncertainty_score":0.028496206},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01031248,0.0017679359,0.92843634,0.000995586,0.0004015274,0.00013130711,0.00017296377,0.0038855644,0.05389633],"genre_scores_gemma":[0.53250396,0.0037584961,0.34357888,0.0006596067,0.00046529892,0.0005050883,0.0014478642,0.0027421932,0.11433862],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99791425,0.00053523184,0.00010263894,0.00029720642,0.000987417,0.000163241],"domain_scores_gemma":[0.99796164,0.0009499213,0.00007992505,0.00077131967,0.00019147496,0.000045797886],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014935732,0.0011092103,0.0008810821,0.0010232705,0.0009823607,0.0026814458,0.0023085657,0.0014596295,0.013213443],"category_scores_gemma":[0.005164646,0.0012448202,0.0010359456,0.0015567725,0.0018559006,0.0051520267,0.0025768285,0.0044058547,0.004222058],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001276723,0.00007847583,0.00017114561,0.00029965234,0.000039654973,0.000112012385,0.000314087,0.017111992,0.00790436,0.80790377,0.011211086,0.15472601],"study_design_scores_gemma":[0.000042562366,0.0000591398,0.00010359066,0.00012224787,0.00003678477,0.00015749646,0.000060838018,0.06201922,0.017733585,0.87188685,0.047740463,0.000037267928],"about_ca_topic_score_codex":0.00068072305,"about_ca_topic_score_gemma":0.0008331295,"teacher_disagreement_score":0.013213443,"about_ca_system_score_codex":0.001293049,"about_ca_system_score_gemma":0.000976023,"threshold_uncertainty_score":0.0442034},"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":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0053699547,0.0039683557,0.25025925,0.003440749,0.00409826,0.0011156339,0.450382,0.009689236,0.27167648],"genre_scores_gemma":[0.10247307,0.0039976477,0.3192954,0.0023411314,0.0013341112,0.0021038307,0.327344,0.0032848823,0.23782589],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986279,0.00031169745,0.00017294771,0.00014454126,0.00066703366,0.000075913726],"domain_scores_gemma":[0.988787,0.004971074,0.00050271465,0.0008203873,0.004833122,0.000085612686],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0009317842,0.0013435001,0.0010136985,0.0031237435,0.000501309,0.0013939921,0.0020100188,0.0017180232,0.41264307],"category_scores_gemma":[0.021794576,0.00051718915,0.00068592886,0.003086565,0.00016714277,0.001699515,0.00062351755,0.0007696937,0.10693181],"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.00036702695,0.00007411179,0.0007788364,0.0013137137,0.00003088921,0.00019442203,0.000028224735,0.018167976,0.00085812324,0.028055904,0.8128311,0.13729967],"study_design_scores_gemma":[0.00022647672,0.00013796626,0.0018445094,0.0008116928,0.0000534851,0.0005419001,0.000084121646,0.046674278,0.0036467304,0.057580084,0.8883078,0.00009101211],"about_ca_topic_score_codex":0.011080632,"about_ca_topic_score_gemma":0.010585965,"teacher_disagreement_score":0.5873569,"about_ca_system_score_codex":0.0016369623,"about_ca_system_score_gemma":0.0017451289,"threshold_uncertainty_score":0.83779335},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09014214,0.0008388463,0.85336035,0.0009677148,0.00020783485,0.00010029326,0.000088221466,0.003157606,0.05113703],"genre_scores_gemma":[0.800504,0.00048026294,0.18452732,0.00079935155,0.000125237,0.00009394383,0.00017128221,0.00056977343,0.012728863],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99651295,0.0009098571,0.00015794791,0.0007986351,0.001249549,0.00037104753],"domain_scores_gemma":[0.9960104,0.0015628183,0.00014977202,0.0014987239,0.00063728815,0.00014102114],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039369795,0.0005953846,0.0007444357,0.0010222557,0.0007898585,0.0017439672,0.0016762464,0.00094487466,0.0036198364],"category_scores_gemma":[0.00526645,0.0006010824,0.0012135659,0.0007747437,0.0047180667,0.004358981,0.004184868,0.0040011425,0.0005566934],"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.00021255478,0.000059327154,0.0010016557,0.000110738394,0.00002051692,0.00022996373,0.0003795142,0.016468989,0.00854195,0.903881,0.0017512706,0.067342445],"study_design_scores_gemma":[0.000039644427,0.00026024767,0.0005454945,0.00008236929,0.00003587093,0.00040967276,0.00014695778,0.10999529,0.021076927,0.8365239,0.030832037,0.000051610266],"about_ca_topic_score_codex":0.0012049726,"about_ca_topic_score_gemma":0.0013297652,"teacher_disagreement_score":0.0039369795,"about_ca_system_score_codex":0.0011241988,"about_ca_system_score_gemma":0.0010731596,"threshold_uncertainty_score":0.020820975},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009272219,0.000045562723,0.9877224,0.00015556309,0.00003212048,0.00013755653,0.000044563367,0.0011644844,0.0014255723],"genre_scores_gemma":[0.42364213,0.000285925,0.5727471,0.00018792406,0.000036219426,0.0004900586,0.00027390552,0.00042455937,0.0019121376],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9945668,0.0020842778,0.00048141435,0.00041097612,0.0021409367,0.00031556902],"domain_scores_gemma":[0.9918326,0.0043546255,0.0006353666,0.0017686114,0.0012921342,0.000116616815],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00448788,0.0007571364,0.00062632107,0.00079407176,0.0004945346,0.002036046,0.0012623185,0.0008403103,0.0025629252],"category_scores_gemma":[0.01640384,0.0005991628,0.001779085,0.00030837453,0.0024364532,0.0015495148,0.0025480157,0.0020617594,0.0006579985],"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.00016453798,0.00020400662,0.0028646113,0.00046375202,0.000100834935,0.0009585551,0.0016756005,0.5997199,0.024296233,0.28616446,0.0012401224,0.08214749],"study_design_scores_gemma":[0.000054547534,0.00015206682,0.00036851922,0.0001861075,0.000049304927,0.00013477501,0.00017873665,0.8644345,0.028078573,0.09735305,0.008971238,0.000038492282],"about_ca_topic_score_codex":0.0031503248,"about_ca_topic_score_gemma":0.0018276863,"teacher_disagreement_score":0.00448788,"about_ca_system_score_codex":0.0013837789,"about_ca_system_score_gemma":0.002926217,"threshold_uncertainty_score":0.02373451},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013143638,0.000102375,0.9824525,0.00020602718,0.000029079481,0.00009697265,0.00013140748,0.00022849978,0.0036094591],"genre_scores_gemma":[0.86735046,0.0003423887,0.12756756,0.00020077784,0.00006435907,0.0010564392,0.0004773317,0.00019708568,0.0027436141],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9961118,0.0008102061,0.00042501834,0.00063844287,0.0015799482,0.00043464405],"domain_scores_gemma":[0.9845095,0.0094709685,0.0018171206,0.00072646874,0.0031191057,0.00035672466],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005432737,0.0014688344,0.0009301827,0.0016149299,0.00063616876,0.0018120136,0.0012547385,0.0014764933,0.0035839106],"category_scores_gemma":[0.018452339,0.00070042873,0.0021543046,0.0005985866,0.001990346,0.002273133,0.0023883542,0.0024353699,0.00067093375],"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.00015121223,0.00011835146,0.0011996991,0.00047557338,0.000094325,0.00055430265,0.0006062401,0.42143497,0.024706475,0.5316571,0.0013547372,0.017647091],"study_design_scores_gemma":[0.000071808936,0.00018343913,0.0004157368,0.00010388267,0.000043063323,0.00013624485,0.00013253487,0.85032755,0.013741944,0.13197652,0.0028074551,0.000059848662],"about_ca_topic_score_codex":0.0014442757,"about_ca_topic_score_gemma":0.0012307134,"teacher_disagreement_score":0.005432737,"about_ca_system_score_codex":0.0012175889,"about_ca_system_score_gemma":0.0030352988,"threshold_uncertainty_score":0.028731406},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026249992,0.0002433398,0.9691722,0.0002811475,0.000042757532,0.00009893471,0.00012378236,0.00077749783,0.0030103698],"genre_scores_gemma":[0.57189345,0.00031415495,0.42394716,0.00023701992,0.000042750195,0.00033852115,0.00047282776,0.0004187496,0.0023353973],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965995,0.0015274546,0.00015906153,0.0005395298,0.00081089785,0.0003635181],"domain_scores_gemma":[0.9842605,0.0118967295,0.001148114,0.0010918644,0.0010706806,0.000532151],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0044017257,0.0016664673,0.0015671543,0.001464172,0.00076956715,0.0022769016,0.0016666378,0.0013424328,0.005550067],"category_scores_gemma":[0.028452583,0.0010891285,0.0014517654,0.0009599783,0.0016255968,0.0031441017,0.002465932,0.0037580137,0.0007665554],"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.00009073579,0.00007660565,0.0009150318,0.00009546483,0.000023607308,0.000037228874,0.00009100773,0.929338,0.0008102424,0.024408856,0.00074615696,0.043367155],"study_design_scores_gemma":[0.000015130403,0.000025327061,0.000049845814,0.000019329855,0.0000055874325,0.0000056909557,0.000010239774,0.9793117,0.0004608382,0.019579634,0.0005117361,0.0000049155765],"about_ca_topic_score_codex":0.0056883204,"about_ca_topic_score_gemma":0.009092007,"teacher_disagreement_score":0.0056883204,"about_ca_system_score_codex":0.0028551517,"about_ca_system_score_gemma":0.0036631327,"threshold_uncertainty_score":0.023278832},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0038732046,0.00013666901,0.99310666,0.000060631814,0.00002432749,0.00004392646,0.00010359224,0.0013197818,0.0013312249],"genre_scores_gemma":[0.44085497,0.00061320694,0.54957354,0.0001687285,0.00011301794,0.0004619219,0.0009104525,0.0009505867,0.0063535376],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9947596,0.0013963813,0.0003718937,0.00065436534,0.0024639405,0.0003537899],"domain_scores_gemma":[0.99162745,0.0045447177,0.00054900046,0.0025225568,0.0006362598,0.000120126366],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003917824,0.0014465579,0.0014935277,0.00082957733,0.00056808215,0.002368134,0.002510791,0.0012360746,0.004108183],"category_scores_gemma":[0.01053764,0.0013129021,0.0027400427,0.0006213182,0.0024311845,0.0036178022,0.003243214,0.0045563276,0.0011836332],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038395083,0.000096846525,0.00025579103,0.0005965437,0.00019399151,0.00023305391,0.0003802163,0.44847095,0.026096912,0.43767068,0.0021830811,0.08343792],"study_design_scores_gemma":[0.00005848668,0.00009537736,0.000102882026,0.000076875614,0.000060421098,0.00006108716,0.000029090366,0.6658224,0.02228425,0.3041137,0.007261538,0.000033913337],"about_ca_topic_score_codex":0.0012561872,"about_ca_topic_score_gemma":0.0016422895,"teacher_disagreement_score":0.004108183,"about_ca_system_score_codex":0.0015004298,"about_ca_system_score_gemma":0.0023066688,"threshold_uncertainty_score":0.020719707},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007987701,0.0001349223,0.98194593,0.00019015356,0.00006682763,0.00024244613,0.00087710464,0.0035352998,0.005019528],"genre_scores_gemma":[0.19752264,0.00051078753,0.78980225,0.00031873494,0.0001276303,0.00075503765,0.003447308,0.0013633808,0.0061522494],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.994474,0.000694861,0.00045056417,0.0011813622,0.0026213941,0.0005777342],"domain_scores_gemma":[0.9894488,0.0056226286,0.0010431525,0.002129681,0.0016140771,0.00014175684],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028039692,0.0012719018,0.00078408926,0.0032494487,0.0013215389,0.002337967,0.0027330716,0.0013481227,0.008930077],"category_scores_gemma":[0.014975386,0.0009156644,0.0030142227,0.0016551095,0.0025543664,0.006534007,0.0031482186,0.002803004,0.0022903036],"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.0003313589,0.00018056376,0.005438176,0.00091190636,0.00014075858,0.0010083161,0.00091859105,0.054965485,0.017726505,0.690479,0.011564238,0.21633506],"study_design_scores_gemma":[0.00008491321,0.0001970687,0.0017735617,0.00024874805,0.0002703215,0.0007713187,0.00023943186,0.23673372,0.059956722,0.6312364,0.0683504,0.0001374455],"about_ca_topic_score_codex":0.0025946999,"about_ca_topic_score_gemma":0.0024822163,"teacher_disagreement_score":0.008930077,"about_ca_system_score_codex":0.0015417014,"about_ca_system_score_gemma":0.0025710894,"threshold_uncertainty_score":0.029874146},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08590234,0.000057421716,0.90165776,0.00014073683,0.000034625547,0.00019084923,0.00026452154,0.008711477,0.0030402709],"genre_scores_gemma":[0.71805185,0.000067605804,0.27766928,0.000084793115,0.000011223878,0.00026459302,0.0006794277,0.0007453228,0.0024258539],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99938774,0.00017984225,0.000031487485,0.00011675024,0.0002262615,0.000057910485],"domain_scores_gemma":[0.9974692,0.0016934759,0.0002034299,0.00039163372,0.00021168804,0.000030669213],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050996884,0.00040856664,0.00028481512,0.0003669614,0.00023692944,0.0004924794,0.0005159112,0.0003607066,0.0036418422],"category_scores_gemma":[0.0037815971,0.00024073856,0.00038593865,0.00026422978,0.0005242989,0.0008004706,0.0006322619,0.0005457795,0.00049647846],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00078818615,0.00020889826,0.0060652923,0.0005639909,0.0000568831,0.0013594948,0.00054999423,0.16548377,0.3119968,0.10078416,0.0051242346,0.40701833],"study_design_scores_gemma":[0.000112152964,0.00022983494,0.001270533,0.000030678988,0.000042072006,0.00033894466,0.000072953575,0.6678694,0.2849454,0.034551565,0.010509163,0.000027358008],"about_ca_topic_score_codex":0.0005748281,"about_ca_topic_score_gemma":0.0010155994,"teacher_disagreement_score":0.0036418422,"about_ca_system_score_codex":0.00034778056,"about_ca_system_score_gemma":0.0005488304,"threshold_uncertainty_score":0.012183189},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25909257,0.0014349709,0.7088359,0.003710308,0.000335064,0.0005888707,0.00040790509,0.002847183,0.02274727],"genre_scores_gemma":[0.75659955,0.0006057452,0.23403302,0.0009930333,0.00008752925,0.0003180979,0.0004976465,0.0006513347,0.0062141926],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9938212,0.0023396327,0.00039155644,0.0008440287,0.0017608551,0.00084271247],"domain_scores_gemma":[0.9752529,0.01961304,0.0012997171,0.0020887032,0.0013731283,0.0003724885],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0053986823,0.0010526231,0.0016277202,0.001588055,0.002645822,0.0035877165,0.002605261,0.0021738312,0.0060975156],"category_scores_gemma":[0.031538572,0.0013144873,0.0016255813,0.0013500918,0.003465982,0.008266523,0.0032741495,0.0032140727,0.00068254484],"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.0022949313,0.00072038436,0.0094679175,0.0009218215,0.00025690076,0.0026430737,0.0019041458,0.24264812,0.016254237,0.3320342,0.013901613,0.37695265],"study_design_scores_gemma":[0.00026997871,0.00031189882,0.0007560355,0.000196187,0.00021136047,0.0008356216,0.00073508796,0.5548601,0.027290365,0.40187627,0.01253408,0.00012303112],"about_ca_topic_score_codex":0.0036733358,"about_ca_topic_score_gemma":0.007072774,"teacher_disagreement_score":0.0060975156,"about_ca_system_score_codex":0.0020529267,"about_ca_system_score_gemma":0.002992391,"threshold_uncertainty_score":0.02855128},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.103151485,0.00015172469,0.87477523,0.0007059572,0.00013713536,0.00035867142,0.00014920668,0.004747424,0.015823152],"genre_scores_gemma":[0.77367646,0.00030027123,0.2171172,0.00024659545,0.00008064595,0.0006810066,0.00034081584,0.00072949287,0.006827435],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9934277,0.002158262,0.0004116382,0.00046216097,0.0029620545,0.00057819294],"domain_scores_gemma":[0.9815481,0.011083377,0.0010974578,0.004426183,0.0016076488,0.0002374149],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030459636,0.0009936326,0.0007373836,0.0011322518,0.0007407653,0.0011669714,0.0016536643,0.00092617614,0.0033184197],"category_scores_gemma":[0.01623099,0.000488622,0.0014008464,0.00071705563,0.0025028118,0.0018571307,0.0029505333,0.002581761,0.0007991883],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000611738,0.0004441231,0.0009784411,0.00061252527,0.00011077378,0.0017529046,0.0012771626,0.2509223,0.055313375,0.5452724,0.005173283,0.13753088],"study_design_scores_gemma":[0.00016868876,0.00021878927,0.00042009001,0.00006960623,0.00011197385,0.0005524702,0.0002607739,0.33190644,0.1258149,0.5207656,0.019658655,0.000052083353],"about_ca_topic_score_codex":0.000738227,"about_ca_topic_score_gemma":0.00057592103,"teacher_disagreement_score":0.0033184197,"about_ca_system_score_codex":0.00067240925,"about_ca_system_score_gemma":0.0012023315,"threshold_uncertainty_score":0.016108751},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0071913227,0.00010008897,0.9888764,0.000043857686,0.000025307805,0.00009988539,0.00016023239,0.0016218828,0.0018809541],"genre_scores_gemma":[0.1479761,0.00016764383,0.8470536,0.000060131446,0.0000148861345,0.0001828479,0.0008783925,0.00031649615,0.0033499184],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99853575,0.0001920895,0.00013842156,0.000278266,0.0007043531,0.00015110703],"domain_scores_gemma":[0.99862206,0.0005235519,0.00010263761,0.00038305228,0.00033850086,0.000030230936],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00095794135,0.0009882881,0.000929605,0.0016069004,0.00070073747,0.0011275327,0.0009937055,0.0005494941,0.0049358467],"category_scores_gemma":[0.0032381741,0.00063957745,0.0014866812,0.0013606178,0.00079831143,0.002085473,0.0018127295,0.00091411266,0.0012553995],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032092762,0.00013109794,0.0017000264,0.00055253867,0.00011807184,0.00026030786,0.00024026983,0.14267485,0.03660455,0.075069025,0.00461867,0.73770964],"study_design_scores_gemma":[0.00010709216,0.00013030089,0.0005766854,0.0000691253,0.00013747365,0.00030065933,0.0000809837,0.759787,0.107877485,0.099681444,0.03118951,0.00006218836],"about_ca_topic_score_codex":0.0020972406,"about_ca_topic_score_gemma":0.0025753886,"teacher_disagreement_score":0.0049358467,"about_ca_system_score_codex":0.00087101996,"about_ca_system_score_gemma":0.0016723769,"threshold_uncertainty_score":0.016512096},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008347572,0.00014192115,0.9845323,0.00016012661,0.000017972838,0.00006661029,0.00003595131,0.00600002,0.00069749594],"genre_scores_gemma":[0.15526174,0.00014740597,0.8424531,0.00014235925,0.000031836422,0.00012108737,0.0001231057,0.0010382147,0.00068109535],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9933961,0.0032468704,0.00045407758,0.0006779138,0.0018621318,0.00036290367],"domain_scores_gemma":[0.95295495,0.034842685,0.002373307,0.007363832,0.0021245824,0.00034058443],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0059020338,0.001050593,0.00095356395,0.0021436778,0.0010164663,0.002076973,0.0026026554,0.0013550828,0.0050006662],"category_scores_gemma":[0.040507365,0.0012077746,0.0015462922,0.001222217,0.002746304,0.0048281495,0.004018692,0.0029519561,0.0011603433],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00085722207,0.0003252587,0.0050643655,0.0013981981,0.0002670127,0.0011765959,0.0019070082,0.12852466,0.09834143,0.22665332,0.0063429573,0.52914196],"study_design_scores_gemma":[0.00023936796,0.00017240913,0.0004910121,0.00015912487,0.000126312,0.0008393792,0.000119385586,0.7598026,0.12782644,0.09936861,0.010748378,0.00010697523],"about_ca_topic_score_codex":0.0013854112,"about_ca_topic_score_gemma":0.0022124809,"teacher_disagreement_score":0.0059020338,"about_ca_system_score_codex":0.0010206228,"about_ca_system_score_gemma":0.0019646306,"threshold_uncertainty_score":0.031213343},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06231468,0.00006836695,0.93595153,0.00005478267,0.000016420026,0.000040673378,0.00008953825,0.00073710055,0.0007267699],"genre_scores_gemma":[0.6583925,0.00019264921,0.3398675,0.000057758894,0.00003661124,0.00010046621,0.00019735833,0.00016402511,0.0009912029],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.995899,0.00073734624,0.0003667694,0.00063729833,0.0020226198,0.00033690757],"domain_scores_gemma":[0.9919409,0.0049128844,0.0011733322,0.0013131314,0.0005914436,0.000068234534],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002088001,0.00091193576,0.00077008945,0.00078762916,0.0004915986,0.0020145865,0.0015993341,0.0008215044,0.0014553192],"category_scores_gemma":[0.009731301,0.0006706838,0.0012235444,0.0009901017,0.0030882307,0.0037894154,0.0014594606,0.0017690236,0.0002994847],"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.0006527189,0.0000714468,0.002145042,0.00034501328,0.00008981559,0.0006108375,0.00037271882,0.65984803,0.07323227,0.17432815,0.00058058667,0.08772335],"study_design_scores_gemma":[0.000091193026,0.00024682234,0.00023585283,0.00004183088,0.00007094504,0.0002512511,0.00005961116,0.7606446,0.11897892,0.11606369,0.0032758026,0.000039437713],"about_ca_topic_score_codex":0.0020748274,"about_ca_topic_score_gemma":0.002491815,"teacher_disagreement_score":0.002088001,"about_ca_system_score_codex":0.00090260105,"about_ca_system_score_gemma":0.0014699725,"threshold_uncertainty_score":0.011042535},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1460882,0.00022394783,0.8407181,0.00055443536,0.0001608656,0.00024322384,0.0003654232,0.0026442748,0.009001481],"genre_scores_gemma":[0.82431096,0.00024852916,0.16994767,0.00009279879,0.000026691792,0.00016524442,0.0001680124,0.00010519955,0.004934816],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99936754,0.00012793517,0.00004389346,0.000086014974,0.0003099111,0.000064822394],"domain_scores_gemma":[0.99906844,0.00056481763,0.000088696834,0.00012373396,0.00013243078,0.000021878908],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009477084,0.00038923262,0.00026838225,0.00032292504,0.000607987,0.00082290615,0.0007034011,0.00057419756,0.0021575494],"category_scores_gemma":[0.0029858707,0.00034051653,0.0006252478,0.00015561245,0.0016180283,0.0011993976,0.00061211135,0.0007799687,0.0003026795],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033543422,0.00018019478,0.0017979688,0.000651088,0.00006170435,0.0012897712,0.000697862,0.34013376,0.16623318,0.4251059,0.0024455874,0.061067555],"study_design_scores_gemma":[0.00019543669,0.0004463086,0.0006572448,0.0001258474,0.00005749917,0.0005750131,0.000099460005,0.69015276,0.19324717,0.08876228,0.025606463,0.00007445226],"about_ca_topic_score_codex":0.0023526216,"about_ca_topic_score_gemma":0.002242071,"teacher_disagreement_score":0.0023526216,"about_ca_system_score_codex":0.00090185093,"about_ca_system_score_gemma":0.0019716187,"threshold_uncertainty_score":0.0072177052},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12863734,0.00014932816,0.8630584,0.00017883714,0.000024639934,0.00009640725,0.00005311815,0.0050694114,0.002732637],"genre_scores_gemma":[0.5974344,0.00013128153,0.39975828,0.000047138954,0.000023081124,0.000122475,0.0001831688,0.0006540759,0.0016460787],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99096984,0.0030214784,0.000427031,0.00053956837,0.004490924,0.0005511951],"domain_scores_gemma":[0.96577245,0.024204366,0.0017467283,0.004522773,0.0034853786,0.00026826366],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005249854,0.0010845512,0.0010687496,0.001437949,0.00088861235,0.0022224963,0.0025456692,0.0012683076,0.002261796],"category_scores_gemma":[0.044073183,0.00063025486,0.00091209303,0.00097026903,0.0018487014,0.0039847842,0.002279839,0.0020109247,0.00051917374],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010987064,0.0003888043,0.016562307,0.00069681724,0.00012227295,0.00044291108,0.0014128485,0.373511,0.08770999,0.13476528,0.0017981182,0.381491],"study_design_scores_gemma":[0.00005204649,0.00010748081,0.0009113839,0.000033423003,0.0000417621,0.00008144807,0.0000525072,0.9188633,0.047382466,0.030285181,0.0021533587,0.000035690373],"about_ca_topic_score_codex":0.0026441126,"about_ca_topic_score_gemma":0.0029788723,"teacher_disagreement_score":0.005249854,"about_ca_system_score_codex":0.0014106808,"about_ca_system_score_gemma":0.0024921042,"threshold_uncertainty_score":0.02776426},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002472895,0.00026755163,0.98673475,0.00032466813,0.00007301735,0.00016505417,0.00026225238,0.0017676892,0.007932024],"genre_scores_gemma":[0.2205894,0.0010402263,0.7565702,0.00034998628,0.0001038358,0.00073162373,0.001355779,0.0009292912,0.018329652],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9958936,0.0016354143,0.0003413657,0.0005733073,0.0012560382,0.00030026436],"domain_scores_gemma":[0.9961046,0.0017755051,0.00029279204,0.00084028323,0.00086758984,0.0001192406],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00412407,0.00094312895,0.0006093854,0.0017188706,0.0007966457,0.002235299,0.0017157202,0.0010154108,0.0088988],"category_scores_gemma":[0.009313537,0.0007568052,0.0019309996,0.0008105877,0.0013375118,0.0028819358,0.002418576,0.0016966696,0.002332154],"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.00010500923,0.00010851195,0.0010556943,0.00076402514,0.00013776086,0.00058905996,0.0006509929,0.06484775,0.0108661605,0.78615004,0.006855172,0.12786974],"study_design_scores_gemma":[0.00010493719,0.00013803998,0.0004123786,0.00049308,0.0001333511,0.00054242497,0.00030536295,0.36795738,0.03096523,0.39672878,0.2021478,0.00007123031],"about_ca_topic_score_codex":0.003100002,"about_ca_topic_score_gemma":0.004238519,"teacher_disagreement_score":0.0088988,"about_ca_system_score_codex":0.0015479766,"about_ca_system_score_gemma":0.0034875632,"threshold_uncertainty_score":0.02976942},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0058942833,0.00077192177,0.9875772,0.000109674125,0.000035515088,0.00006876223,0.00011321244,0.0013680599,0.0040613753],"genre_scores_gemma":[0.22051567,0.0025017557,0.76583594,0.000085344276,0.000057733057,0.00024854476,0.00070299604,0.00065535685,0.009396689],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986993,0.00039183372,0.00014936647,0.0001358745,0.0005468275,0.00007673623],"domain_scores_gemma":[0.9984975,0.0008029546,0.00021017941,0.0002755625,0.00018630011,0.000027515167],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013516266,0.0009608032,0.0006019019,0.0011568834,0.0003381109,0.0023863667,0.0013722524,0.0009532883,0.0029849724],"category_scores_gemma":[0.0027689845,0.00093393645,0.0014315459,0.0006471395,0.0009926698,0.0023676327,0.0008116234,0.0010110071,0.000986346],"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.0001298319,0.00009964112,0.0012033699,0.0012166686,0.00012462851,0.0006329236,0.0013901505,0.37032768,0.056596346,0.41036484,0.0024946963,0.15541928],"study_design_scores_gemma":[0.000044960532,0.000096757445,0.00078841584,0.00035340124,0.00012440371,0.00057540426,0.00014418413,0.72756624,0.050868362,0.12874621,0.09062867,0.00006302748],"about_ca_topic_score_codex":0.0034262484,"about_ca_topic_score_gemma":0.0023836563,"teacher_disagreement_score":0.0034262484,"about_ca_system_score_codex":0.0009887575,"about_ca_system_score_gemma":0.0010166784,"threshold_uncertainty_score":0.009985745},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006230466,0.00019011727,0.9691027,0.0007406811,0.00014075704,0.0000888139,0.00007009896,0.000923618,0.022512667],"genre_scores_gemma":[0.45712024,0.00053201086,0.5068493,0.00067930826,0.00030277212,0.00036701295,0.00019548746,0.0004420461,0.033511862],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99647576,0.0011901521,0.00017391177,0.000793739,0.00095572975,0.00041066515],"domain_scores_gemma":[0.9949727,0.0024914984,0.00035374388,0.0012095207,0.00071421504,0.00025825892],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004738145,0.0006952851,0.0004463428,0.0008336981,0.001775247,0.0034866752,0.00225585,0.0011091639,0.007078278],"category_scores_gemma":[0.010682287,0.00048812624,0.0010990028,0.0006622422,0.0053194896,0.0045345556,0.0026742457,0.0019640985,0.0009936151],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001643497,0.000012622754,0.00012490379,0.000028818453,0.0000071480827,0.00004758229,0.00017576218,0.008050848,0.00065502356,0.97891176,0.00074504374,0.011224096],"study_design_scores_gemma":[0.000021952636,0.000026740354,0.00005734002,0.0000277668,0.000023179904,0.00007283812,0.00006194946,0.057446152,0.0024769637,0.91629636,0.023473999,0.000014654238],"about_ca_topic_score_codex":0.003144605,"about_ca_topic_score_gemma":0.0036937322,"teacher_disagreement_score":0.007078278,"about_ca_system_score_codex":0.0022693705,"about_ca_system_score_gemma":0.0029327353,"threshold_uncertainty_score":0.025058031},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014300451,0.00039377427,0.9563253,0.0004817538,0.000097206525,0.0001156946,0.00015042035,0.001122193,0.027013326],"genre_scores_gemma":[0.57601756,0.00059930934,0.40499893,0.0006202517,0.00026318972,0.00053179025,0.00038453806,0.00036060537,0.016223738],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984303,0.00048645982,0.0001304101,0.0003121179,0.00048059825,0.00016000032],"domain_scores_gemma":[0.99774665,0.0014538759,0.00018630085,0.00022930655,0.0002920135,0.00009188112],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017775816,0.00041814422,0.00027943728,0.0009710722,0.0006609808,0.0027898494,0.0008002105,0.00063300296,0.005252101],"category_scores_gemma":[0.0035776515,0.00036537123,0.0006051132,0.00070724357,0.0037433498,0.0025224367,0.0012806321,0.0011799532,0.0006687594],"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.000020145739,0.000012022803,0.0001451729,0.00003227266,0.0000038736443,0.000067897075,0.00015797235,0.0029804837,0.00087022374,0.9810038,0.00063055725,0.01407546],"study_design_scores_gemma":[0.00004565443,0.00005947809,0.00022195779,0.00005311373,0.00002103057,0.00011010238,0.00013684704,0.08208474,0.0055177505,0.8739772,0.037738483,0.000033563036],"about_ca_topic_score_codex":0.002585942,"about_ca_topic_score_gemma":0.0023183369,"teacher_disagreement_score":0.005252101,"about_ca_system_score_codex":0.0017211566,"about_ca_system_score_gemma":0.0012216752,"threshold_uncertainty_score":0.017570019},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011243658,0.011899978,0.15547788,0.0024875752,0.00088884373,0.00006401206,0.00044037602,0.00059603277,0.82702094],"genre_scores_gemma":[0.08633711,0.019041838,0.081531234,0.0021026589,0.0014288995,0.00025464979,0.0012351838,0.0006465219,0.80742186],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99963117,0.00007447218,0.000021916172,0.000087757624,0.00015592473,0.000028762586],"domain_scores_gemma":[0.99972886,0.00014441689,0.000013913806,0.000044180466,0.000055444216,0.000013161559],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005050116,0.0009359434,0.00047545647,0.0011453589,0.00083552685,0.0025743982,0.0007992823,0.0007525893,0.03835784],"category_scores_gemma":[0.0010265411,0.00042834153,0.00055083365,0.0013113562,0.0020402633,0.0036127747,0.0006914292,0.0020926949,0.012196712],"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.0000091850325,0.000009256436,0.000018143628,0.00009075812,0.000003880529,0.000023445053,0.00011959273,0.00034982798,0.00034589565,0.9300163,0.024835512,0.044178344],"study_design_scores_gemma":[0.000008842062,0.000008617589,0.00005036358,0.000105322775,0.000008482448,0.00010393989,0.00003634516,0.0011024036,0.0006451412,0.5761683,0.42175525,0.0000070681676],"about_ca_topic_score_codex":0.0014805391,"about_ca_topic_score_gemma":0.0016566466,"teacher_disagreement_score":0.03835784,"about_ca_system_score_codex":0.0017670206,"about_ca_system_score_gemma":0.0009859308,"threshold_uncertainty_score":0.12831968},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003555783,0.00002184777,0.9930854,0.000063934116,0.000015556005,0.000031625183,0.000043440403,0.0019966983,0.0011856963],"genre_scores_gemma":[0.17924681,0.00018238758,0.8162295,0.00010799638,0.000030294352,0.00017109563,0.00028951702,0.0007958184,0.002946586],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99608225,0.000982659,0.00024931887,0.00033155776,0.0020711478,0.000283093],"domain_scores_gemma":[0.99281776,0.0033941036,0.0004826916,0.0021583384,0.0010815497,0.000065629865],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003299636,0.00098619,0.00045704792,0.0016912346,0.00066347665,0.0022452285,0.0019308561,0.00069072837,0.004345752],"category_scores_gemma":[0.0101398835,0.0009787882,0.0011701895,0.0007894149,0.0020984954,0.0038138563,0.0018821564,0.0016426546,0.0012211297],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021123102,0.00017266136,0.0016373149,0.0004724386,0.00009098224,0.0005550662,0.0007287202,0.12686084,0.035356365,0.503388,0.0047141365,0.32581228],"study_design_scores_gemma":[0.00008845563,0.000111512556,0.00030174447,0.00013982979,0.00009525856,0.0003252309,0.00013185974,0.5988275,0.10290818,0.2665154,0.030496923,0.000058017205],"about_ca_topic_score_codex":0.0016632155,"about_ca_topic_score_gemma":0.0023630701,"teacher_disagreement_score":0.004345752,"about_ca_system_score_codex":0.0011117624,"about_ca_system_score_gemma":0.002871448,"threshold_uncertainty_score":0.017450392},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004707862,0.00012504267,0.99754745,0.00030159883,0.000034148205,0.00009745943,0.00005412905,0.00037795358,0.0009914106],"genre_scores_gemma":[0.024217226,0.0002640527,0.9736265,0.00021527181,0.00009249317,0.00031000498,0.0002654781,0.00011567845,0.0008933977],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.97654164,0.010382261,0.002840773,0.0032259203,0.0057173735,0.0012919422],"domain_scores_gemma":[0.97548,0.015431536,0.0020094097,0.0038755496,0.0024125369,0.0007909537],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.029860009,0.0026076895,0.0024299198,0.006302593,0.0041699177,0.012633177,0.010169418,0.0048371144,0.006741275],"category_scores_gemma":[0.043715663,0.0032978568,0.009335136,0.0050627026,0.009405332,0.018201854,0.011472231,0.00950287,0.0015526859],"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.00008364151,0.00005383914,0.00033619217,0.00032445416,0.00014138171,0.000816006,0.0014036383,0.026816849,0.00144589,0.93167853,0.0020897232,0.034809854],"study_design_scores_gemma":[0.00009506428,0.000048270373,0.00008778226,0.00027029042,0.00013801201,0.0003451026,0.0002806858,0.12629463,0.0019435346,0.8472071,0.02319736,0.000092143055],"about_ca_topic_score_codex":0.012815965,"about_ca_topic_score_gemma":0.010584916,"teacher_disagreement_score":0.029860009,"about_ca_system_score_codex":0.004615038,"about_ca_system_score_gemma":0.0044817273,"threshold_uncertainty_score":0.15791667},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001087479,0.000068672896,0.9968245,0.000063220345,0.00001996651,0.000059420952,0.00009147435,0.0007730727,0.0010121479],"genre_scores_gemma":[0.062793955,0.0005309216,0.9332014,0.0001253932,0.00004446455,0.00027190393,0.0005109287,0.0005041178,0.0020169145],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9962696,0.0009923724,0.0003414552,0.00059121964,0.0016162022,0.0001892409],"domain_scores_gemma":[0.9954894,0.0029075027,0.00026665936,0.0005860845,0.0006896148,0.000060709513],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023918618,0.0016540934,0.0013533739,0.0029513217,0.0010441919,0.00349066,0.0018515094,0.000996959,0.0075794286],"category_scores_gemma":[0.008570044,0.0010311503,0.0027390602,0.0018956376,0.001924559,0.0049149347,0.0022001737,0.0026277644,0.0014801212],"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.00028048208,0.00008447291,0.0009887969,0.0007762925,0.00016081451,0.00024617318,0.0004685534,0.21006759,0.008411855,0.5610231,0.005126877,0.21236503],"study_design_scores_gemma":[0.0000912595,0.000080743564,0.00014550373,0.00016178454,0.00010149188,0.00019181934,0.000121833014,0.50439066,0.021726085,0.42500958,0.047914416,0.0000647536],"about_ca_topic_score_codex":0.0038353738,"about_ca_topic_score_gemma":0.0034683298,"teacher_disagreement_score":0.0075794286,"about_ca_system_score_codex":0.0016555523,"about_ca_system_score_gemma":0.00190304,"threshold_uncertainty_score":0.025355697},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032338903,0.00010269552,0.9942417,0.000087518376,0.0000161151,0.00006311731,0.000026852957,0.0005164347,0.0017116517],"genre_scores_gemma":[0.050620347,0.00014102217,0.9469616,0.0000970976,0.000020468231,0.0001633552,0.0001086204,0.00009854957,0.0017890827],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99941826,0.00013899332,0.00005116659,0.00011690968,0.000212905,0.00006182832],"domain_scores_gemma":[0.9995072,0.00023643115,0.000046157376,0.00007197133,0.000121593075,0.000016715261],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005311273,0.0007505289,0.00052774744,0.00091589906,0.0006267306,0.0008828881,0.0010052205,0.0006007296,0.004569359],"category_scores_gemma":[0.0013263507,0.00042065702,0.00061569805,0.0009232088,0.0007922963,0.0010216555,0.0006418864,0.00096645637,0.0006667379],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024848175,0.00020568196,0.0004701516,0.00039187633,0.00007633508,0.00019644437,0.00020993038,0.19387043,0.0644136,0.09247833,0.0054959636,0.6419428],"study_design_scores_gemma":[0.00013605096,0.0002181172,0.00012027646,0.000033158365,0.0000546394,0.00021105634,0.000047626756,0.89581585,0.049200784,0.039516263,0.014615681,0.00003053684],"about_ca_topic_score_codex":0.0021558972,"about_ca_topic_score_gemma":0.0037922086,"teacher_disagreement_score":0.004569359,"about_ca_system_score_codex":0.000838837,"about_ca_system_score_gemma":0.001211738,"threshold_uncertainty_score":0.015286028},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00064946635,0.006549401,0.0079248855,0.05729064,0.08835086,0.0001744843,0.019618863,0.0073318062,0.81210953],"genre_scores_gemma":[0.0045391796,0.0020416374,0.0015073679,0.011982006,0.007088019,0.00005726444,0.011279968,0.0019519706,0.9595525],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99726737,0.00025553326,0.00016318465,0.00049038546,0.0015672563,0.00025622945],"domain_scores_gemma":[0.99145085,0.0011871571,0.0002942304,0.0013171685,0.004602046,0.0011485853],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0018615643,0.00079442904,0.00092771597,0.0023018683,0.0018295045,0.006950065,0.0016072799,0.0022393174,0.65452945],"category_scores_gemma":[0.010813618,0.0005955838,0.0008852467,0.0020239402,0.0007649696,0.0049332827,0.0016604166,0.0035678009,0.48520407],"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.000020428937,0.000009022696,0.000051493556,0.000056917343,0.0000030044105,0.000016897076,0.0000064336045,0.000047793194,0.00018700979,0.0049203513,0.97018594,0.024494613],"study_design_scores_gemma":[0.000005132687,0.000005986361,0.00009811032,0.000042683096,0.0000017417881,0.000028301563,0.000008536495,0.00007433147,0.00017752631,0.0018141345,0.99773943,0.000004117015],"about_ca_topic_score_codex":0.004582848,"about_ca_topic_score_gemma":0.008224114,"teacher_disagreement_score":0.65452945,"about_ca_system_score_codex":0.0026992604,"about_ca_system_score_gemma":0.0037136534,"threshold_uncertainty_score":0.4927718},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10641238,0.00008968186,0.88227516,0.00044824876,0.000033821747,0.00013527152,0.00026057241,0.0007293173,0.009615515],"genre_scores_gemma":[0.7333889,0.00016353687,0.26005474,0.0003741497,0.00007180784,0.00035498184,0.00057338853,0.00025595046,0.004762613],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980558,0.00037296498,0.0001492869,0.00031941617,0.00087141205,0.00023116186],"domain_scores_gemma":[0.99540234,0.003015155,0.00037861298,0.0003680148,0.00072866125,0.000107166095],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016408437,0.0004835111,0.00036486142,0.0014172812,0.00052617205,0.002011232,0.0010930351,0.00083912,0.0042132563],"category_scores_gemma":[0.008108766,0.00027938694,0.001154813,0.00092133135,0.0018704071,0.005072374,0.001705976,0.001873595,0.00036339654],"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.000079507554,0.000096454576,0.0013749194,0.00013134308,0.000023339782,0.00024357399,0.0007204303,0.013512528,0.0066805254,0.9377059,0.0009292879,0.03850219],"study_design_scores_gemma":[0.00003430615,0.000078052195,0.00041003095,0.000033120716,0.000048331935,0.000189617,0.00021805207,0.14882277,0.013257993,0.8326422,0.0042388174,0.00002681077],"about_ca_topic_score_codex":0.0010407447,"about_ca_topic_score_gemma":0.0012429008,"teacher_disagreement_score":0.0042132563,"about_ca_system_score_codex":0.0015693158,"about_ca_system_score_gemma":0.0009315636,"threshold_uncertainty_score":0.01409471},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028528941,0.000023625948,0.98653877,0.00018793608,0.000046265566,0.00016699653,0.000711954,0.0062725195,0.0031989482],"genre_scores_gemma":[0.11778128,0.00024829348,0.8732596,0.00031865932,0.00002020159,0.0005072791,0.002538939,0.0013149439,0.0040107993],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983309,0.00037129768,0.00019973669,0.00023744011,0.00070033415,0.00016035738],"domain_scores_gemma":[0.9975776,0.0010034106,0.00017465652,0.0005890943,0.00059585593,0.000059297025],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016039807,0.0007784824,0.00040396338,0.0007636575,0.00040214448,0.0017658527,0.001450943,0.00058233,0.0036816488],"category_scores_gemma":[0.0054152994,0.0006867651,0.00092835084,0.00070914545,0.0008897709,0.0013697931,0.0016163705,0.0021474261,0.0012281254],"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.0003877973,0.00022420452,0.0015968031,0.001134521,0.000103606195,0.0015856638,0.0009650765,0.31902793,0.03222955,0.39906895,0.022766018,0.22090992],"study_design_scores_gemma":[0.00011483976,0.000106610765,0.00028511125,0.00013170198,0.00005913598,0.000498784,0.00018441165,0.73054475,0.071317874,0.086549155,0.110148616,0.000059005895],"about_ca_topic_score_codex":0.011740959,"about_ca_topic_score_gemma":0.010946498,"teacher_disagreement_score":0.011740959,"about_ca_system_score_codex":0.0014325952,"about_ca_system_score_gemma":0.0039320253,"threshold_uncertainty_score":0.023345232},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006966105,0.0010382253,0.54786474,0.0024031065,0.0018169433,0.0005103746,0.006464227,0.07960407,0.35333222],"genre_scores_gemma":[0.21785252,0.0020387205,0.34426853,0.003381412,0.0010919798,0.0011077035,0.022702346,0.022240296,0.38531652],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9976962,0.00034286172,0.00016810842,0.0004465678,0.0010889999,0.000257327],"domain_scores_gemma":[0.9972626,0.0006102565,0.00014965898,0.00095986907,0.00085575576,0.00016186858],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0017432692,0.0009117828,0.0006026875,0.0017505551,0.00081265694,0.0025501736,0.0017356458,0.0012110509,0.14768071],"category_scores_gemma":[0.006594518,0.00049427664,0.000995458,0.00070539047,0.00092009094,0.0024754957,0.0028176634,0.0014397989,0.07009939],"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.00044222592,0.000098892786,0.0008522981,0.0008623308,0.000042684296,0.00067768863,0.00034627158,0.01101875,0.011448992,0.30477288,0.22676608,0.44267094],"study_design_scores_gemma":[0.00005937679,0.00009949556,0.00023456242,0.00017909457,0.000019152088,0.00053210824,0.00007341886,0.019746479,0.011399909,0.044266623,0.9233448,0.00004498357],"about_ca_topic_score_codex":0.0013542507,"about_ca_topic_score_gemma":0.0014766242,"teacher_disagreement_score":0.8523193,"about_ca_system_score_codex":0.0009145497,"about_ca_system_score_gemma":0.001352412,"threshold_uncertainty_score":0},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.069738016,0.00012354832,0.9250079,0.0004618524,0.000020924192,0.00027292178,0.00033418703,0.0015089035,0.002531672],"genre_scores_gemma":[0.5955737,0.0001426893,0.3999506,0.00024650127,0.00007186455,0.0006179281,0.0011523436,0.0005613131,0.0016830909],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98567814,0.003980532,0.0010176556,0.0026850011,0.005210416,0.001428286],"domain_scores_gemma":[0.947209,0.03982827,0.003315804,0.0042537497,0.004803914,0.0005892582],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008956115,0.00105722,0.0010370718,0.0025028107,0.0014886063,0.002777966,0.0029420096,0.0011759985,0.0026841238],"category_scores_gemma":[0.04247518,0.0011023853,0.002837366,0.0015963339,0.004597339,0.0035778282,0.0029441717,0.003103862,0.00035012167],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00086849445,0.00036891885,0.02092052,0.00072993257,0.00046869591,0.0009260306,0.0019300907,0.4179458,0.0123364255,0.45121428,0.0021986063,0.090092115],"study_design_scores_gemma":[0.00011646042,0.00017224968,0.0012811484,0.0000980797,0.0001905994,0.00014155745,0.000238847,0.66062033,0.019395579,0.3136557,0.0040404866,0.000048976686],"about_ca_topic_score_codex":0.004596481,"about_ca_topic_score_gemma":0.0023056704,"teacher_disagreement_score":0.008956115,"about_ca_system_score_codex":0.0024236343,"about_ca_system_score_gemma":0.0041984385,"threshold_uncertainty_score":0.04736507},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005740322,0.000060035043,0.99270153,0.00007175057,0.000011480168,0.00005547475,0.000044601195,0.000674959,0.00063986675],"genre_scores_gemma":[0.30103254,0.00021236941,0.69617826,0.00014313981,0.000032625696,0.00026408964,0.00020143257,0.00025111818,0.0016844547],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99598,0.0017897409,0.0002488415,0.0006424433,0.0009850956,0.00035382403],"domain_scores_gemma":[0.99579704,0.002777551,0.00041973699,0.0004665028,0.0004719293,0.00006720328],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038703303,0.0007819202,0.00059724855,0.0010477314,0.0007463988,0.0016944903,0.0014874707,0.0009539842,0.0032135854],"category_scores_gemma":[0.008480422,0.0006226927,0.0012638422,0.00078389165,0.0019388831,0.0032772727,0.0012943101,0.0011369907,0.0007046843],"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.00055588776,0.0001582809,0.0015093025,0.0005628718,0.00009403357,0.0007230975,0.0008167507,0.4439613,0.037770465,0.39328927,0.0018847568,0.118673965],"study_design_scores_gemma":[0.00012447091,0.00020852429,0.00014977348,0.000113338654,0.00007206744,0.00018820878,0.000068390196,0.8377354,0.03218978,0.1194952,0.009608127,0.00004672706],"about_ca_topic_score_codex":0.004862292,"about_ca_topic_score_gemma":0.0051794304,"teacher_disagreement_score":0.004862292,"about_ca_system_score_codex":0.0015165197,"about_ca_system_score_gemma":0.0032574232,"threshold_uncertainty_score":0.020468473},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13425982,0.00031702244,0.82604057,0.00027301675,0.00012817814,0.000094966745,0.00018872943,0.001139301,0.03755836],"genre_scores_gemma":[0.9533864,0.00021179533,0.040055543,0.000048362097,0.000025569658,0.00007037167,0.00014309553,0.00010133859,0.005957423],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99958056,0.00016335817,0.000022348877,0.00006990544,0.00010699119,0.00005678223],"domain_scores_gemma":[0.9991486,0.00057668105,0.00005465314,0.00010811224,0.000065084314,0.000046867026],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056860165,0.00041946492,0.0006882259,0.0003306542,0.00052489573,0.0012276202,0.001146563,0.0007499033,0.005437212],"category_scores_gemma":[0.001908702,0.00029671116,0.000832856,0.00043344902,0.0013526651,0.0016567215,0.0008155665,0.00086039095,0.00047448277],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018391972,0.00005767632,0.00035724053,0.00007146603,0.000027525084,0.0001168356,0.00013313556,0.40054056,0.0067998995,0.5836472,0.00052339723,0.007541144],"study_design_scores_gemma":[0.000040476247,0.000048203576,0.00007047693,0.000010959642,0.000011575511,0.000037678645,0.000023979965,0.74753577,0.0048705065,0.24545841,0.0018808966,0.000011057109],"about_ca_topic_score_codex":0.0020502654,"about_ca_topic_score_gemma":0.0018194425,"teacher_disagreement_score":0.005437212,"about_ca_system_score_codex":0.0009046234,"about_ca_system_score_gemma":0.0008631488,"threshold_uncertainty_score":0.018189311},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15956287,0.0010256987,0.7799941,0.00050761295,0.00031854463,0.00022572368,0.0005069076,0.022637246,0.035221264],"genre_scores_gemma":[0.5960974,0.00026873016,0.3964625,0.00025574077,0.00005702665,0.00010084909,0.00075171195,0.00024579966,0.005760254],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9996146,0.000072595096,0.000028061988,0.00006564816,0.00015465698,0.00006449025],"domain_scores_gemma":[0.999566,0.00016500703,0.00004322191,0.00008201044,0.00012165162,0.000021980803],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022918919,0.0006368245,0.00028340524,0.0005363955,0.00021195384,0.00060265017,0.0011273667,0.00028524478,0.0113645],"category_scores_gemma":[0.0008185324,0.00030994255,0.00032066827,0.00060826086,0.00017320525,0.0006380882,0.00031278486,0.0005837899,0.0014399278],"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.0011006825,0.00038572808,0.0036666784,0.0007686117,0.0001640857,0.00068995246,0.00013087691,0.12748726,0.17858264,0.024568994,0.021094875,0.64135975],"study_design_scores_gemma":[0.00023428725,0.0007204196,0.0019960965,0.000041745807,0.00009272583,0.00042734013,0.000028915869,0.8496045,0.11971015,0.0027694586,0.024333484,0.00004091035],"about_ca_topic_score_codex":0.0029031618,"about_ca_topic_score_gemma":0.005737643,"teacher_disagreement_score":0.0113645,"about_ca_system_score_codex":0.00057710195,"about_ca_system_score_gemma":0.0007061579,"threshold_uncertainty_score":0.03801799},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0076344744,0.0009612732,0.5796352,0.0026934878,0.0006308249,0.00008061893,0.0007101645,0.0013234345,0.4063306],"genre_scores_gemma":[0.4252546,0.004083057,0.21922223,0.0012307655,0.0008543657,0.00049989216,0.0033577373,0.0016283538,0.34386906],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992384,0.00012309045,0.00005415089,0.00018052226,0.00032881016,0.00007508454],"domain_scores_gemma":[0.9992312,0.00025406457,0.00003090577,0.00027024947,0.00018269765,0.00003083458],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006557804,0.0007181721,0.0004984487,0.0009052925,0.0009544338,0.0034066718,0.000840667,0.0007859819,0.025348622],"category_scores_gemma":[0.0026660007,0.000443386,0.0008354743,0.0016058643,0.0017322601,0.005021217,0.0020800063,0.0032456734,0.0069326283],"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.0000067887054,0.000008969035,0.000025997799,0.000030719195,0.0000026023336,0.000015939902,0.00007701505,0.0011646962,0.0003601357,0.9565686,0.007368931,0.034369517],"study_design_scores_gemma":[0.000005050282,0.0000066866974,0.00003270329,0.000028299857,0.0000061299693,0.000060424518,0.000027886066,0.0066485167,0.0014206821,0.8953182,0.09643852,0.0000068721633],"about_ca_topic_score_codex":0.0012775109,"about_ca_topic_score_gemma":0.00088349485,"teacher_disagreement_score":0.025348622,"about_ca_system_score_codex":0.0016338308,"about_ca_system_score_gemma":0.0010396086,"threshold_uncertainty_score":0.08479965},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043742612,0.00012729486,0.9496632,0.00037627088,0.00012358827,0.00022082243,0.00012780282,0.0030318527,0.0025864753],"genre_scores_gemma":[0.7129687,0.00029273526,0.28222427,0.00022720346,0.00006399987,0.00040569657,0.00037924488,0.00050374493,0.0029343725],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9874183,0.0031564382,0.0009125931,0.0010476486,0.006632051,0.0008328787],"domain_scores_gemma":[0.9816913,0.006615318,0.0014926244,0.00653529,0.0034282086,0.00023726687],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0070698983,0.0008007342,0.0007508075,0.0008513052,0.0012627814,0.003565244,0.0024741783,0.0016075791,0.0017153904],"category_scores_gemma":[0.02524215,0.001079101,0.0014839357,0.00048654564,0.0044894754,0.0045349477,0.0025174087,0.0035221311,0.00049765065],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005101841,0.0002772334,0.0063525997,0.0008139151,0.00026710177,0.0018966073,0.0016481876,0.24962643,0.09543789,0.54271626,0.003373142,0.097080514],"study_design_scores_gemma":[0.0001471758,0.00030624235,0.00066164124,0.0001619652,0.0001530049,0.000551536,0.00021452158,0.75056237,0.12197742,0.11039942,0.0147670135,0.00009771567],"about_ca_topic_score_codex":0.005114993,"about_ca_topic_score_gemma":0.002974095,"teacher_disagreement_score":0.0070698983,"about_ca_system_score_codex":0.0015935556,"about_ca_system_score_gemma":0.005985236,"threshold_uncertainty_score":0.037389636},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03809428,0.00008647182,0.95806193,0.000086017804,0.000015281126,0.0000879379,0.00022124227,0.002489791,0.00085713016],"genre_scores_gemma":[0.5283644,0.00015758225,0.4692912,0.00008808091,0.000012037506,0.00022904918,0.00048074455,0.00022449347,0.0011523684],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979381,0.00063643174,0.00019826388,0.00045472712,0.00057359814,0.00019877467],"domain_scores_gemma":[0.99377656,0.0045367246,0.0004824602,0.0007003245,0.00042943362,0.00007438159],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002131003,0.00074563525,0.0007868902,0.001481611,0.0006091325,0.0011955019,0.0012863538,0.00062923273,0.0021128112],"category_scores_gemma":[0.007603678,0.000590758,0.00132586,0.00059937616,0.0014389011,0.0022457703,0.0014260977,0.00096257834,0.00021389163],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005152035,0.00012302754,0.0048802057,0.00040955446,0.00016624558,0.0005697803,0.00027618874,0.74505866,0.022704037,0.1119722,0.0010653434,0.112259634],"study_design_scores_gemma":[0.000083600884,0.000072486386,0.00020387769,0.00003503752,0.000048057325,0.000082893195,0.000026388372,0.91618896,0.02833433,0.052429542,0.0024731057,0.000021639291],"about_ca_topic_score_codex":0.00556545,"about_ca_topic_score_gemma":0.0065670577,"teacher_disagreement_score":0.00556545,"about_ca_system_score_codex":0.0012539111,"about_ca_system_score_gemma":0.0021908507,"threshold_uncertainty_score":0.011269927},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014622853,0.00014321913,0.9948697,0.00005591612,0.000022087568,0.00006102686,0.00006296599,0.0017478772,0.0015748014],"genre_scores_gemma":[0.089569956,0.00047850728,0.9047562,0.00012454699,0.000046810677,0.00049349386,0.00048112604,0.00071803515,0.003331295],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968009,0.0008984324,0.00018159054,0.00041822324,0.001517672,0.00018322801],"domain_scores_gemma":[0.9942502,0.0035246047,0.00020766046,0.001260735,0.0006870067,0.00006983784],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001991591,0.0017304702,0.0012107643,0.0012063473,0.0007582328,0.0019891795,0.0019465671,0.0011415678,0.02004621],"category_scores_gemma":[0.007759479,0.0011711651,0.0022331348,0.0012759775,0.0014634848,0.0036898542,0.003141741,0.0033735859,0.003911322],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039607528,0.000158669,0.00079584727,0.00092100893,0.00018381019,0.00022736614,0.0003251463,0.2518689,0.026155012,0.27097583,0.007133718,0.44085854],"study_design_scores_gemma":[0.00013201844,0.00008511728,0.00016141041,0.00006841192,0.000049754453,0.00011384076,0.00003956691,0.76068485,0.009003932,0.2181822,0.011443934,0.00003499675],"about_ca_topic_score_codex":0.0031595265,"about_ca_topic_score_gemma":0.0046744975,"teacher_disagreement_score":0.02004621,"about_ca_system_score_codex":0.0013359542,"about_ca_system_score_gemma":0.001894411,"threshold_uncertainty_score":0.067061245},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.063287124,0.00034321754,0.92965734,0.00032904433,0.00006170603,0.00008629879,0.000105409476,0.0012510018,0.0048788777],"genre_scores_gemma":[0.8882541,0.0002575904,0.10912426,0.000066846274,0.00006165936,0.000113244976,0.000166068,0.00020025646,0.0017558949],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9944864,0.0018959306,0.00034915959,0.0006438554,0.0022169387,0.00040778614],"domain_scores_gemma":[0.97902805,0.016245404,0.0011518669,0.0024840776,0.00089625636,0.00019436194],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005061886,0.0008698666,0.0011269415,0.0009971205,0.00080595264,0.0033401628,0.002648365,0.0017555208,0.0024049731],"category_scores_gemma":[0.022497213,0.0010994169,0.002199954,0.000841663,0.0031099454,0.006109364,0.0026579,0.0031527728,0.0003122024],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005124729,0.00014668207,0.0020349284,0.00036114268,0.00019848808,0.00038637136,0.00042156354,0.556356,0.0111919185,0.38025874,0.00086580054,0.047265857],"study_design_scores_gemma":[0.000039021208,0.000039762384,0.00019696922,0.000024413377,0.000040756247,0.00007234976,0.000024680807,0.79471827,0.007619543,0.19639651,0.0008112768,0.000016397214],"about_ca_topic_score_codex":0.0020233826,"about_ca_topic_score_gemma":0.0025112282,"teacher_disagreement_score":0.005061886,"about_ca_system_score_codex":0.0015776332,"about_ca_system_score_gemma":0.0015122591,"threshold_uncertainty_score":0.026770115},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029138865,0.0016236234,0.9478704,0.0017219982,0.000121224024,0.00017409511,0.00018558574,0.002026593,0.017137682],"genre_scores_gemma":[0.17436391,0.0013095589,0.8175706,0.0006721506,0.000096264004,0.0003437829,0.0006535323,0.0006567694,0.0043333885],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966208,0.0012969291,0.0001820109,0.00043613766,0.0011676063,0.0002964517],"domain_scores_gemma":[0.9953377,0.002188921,0.00018694715,0.0016287753,0.0005416753,0.000115858915],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020550594,0.00069991825,0.0014313877,0.00096536026,0.0010798671,0.0021694687,0.002679971,0.0011367064,0.0060501164],"category_scores_gemma":[0.0075889113,0.00075680885,0.0011828509,0.0022738823,0.001633771,0.0052781985,0.003306476,0.0025679597,0.0015296326],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025772868,0.00018375457,0.0013833884,0.0005081684,0.000113202084,0.00018488184,0.00043164787,0.15185282,0.009126751,0.35685778,0.017638655,0.46146125],"study_design_scores_gemma":[0.00007895636,0.0000743297,0.00026995115,0.00008341585,0.000036008336,0.00011143203,0.00016576081,0.69143105,0.006474548,0.2671984,0.034057412,0.000018757786],"about_ca_topic_score_codex":0.0057836478,"about_ca_topic_score_gemma":0.008262059,"teacher_disagreement_score":0.0060501164,"about_ca_system_score_codex":0.0013186057,"about_ca_system_score_gemma":0.0018721332,"threshold_uncertainty_score":0.020239651},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023661386,0.000053433538,0.9718531,0.00030378412,0.00004574485,0.00009153758,0.000091178445,0.0014124991,0.002487357],"genre_scores_gemma":[0.6041754,0.00017642356,0.39145052,0.0003586784,0.00006212233,0.00027874002,0.0005150088,0.00043451777,0.0025485584],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9952586,0.0012717312,0.00021431647,0.00044501777,0.002078915,0.00073144765],"domain_scores_gemma":[0.9858085,0.008937329,0.0005576889,0.0028626565,0.0016167795,0.00021698987],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003437823,0.0006369098,0.0008578353,0.0011121957,0.0010628556,0.0022260086,0.002536157,0.0009055402,0.0020023496],"category_scores_gemma":[0.014631225,0.000514202,0.002826372,0.00065333873,0.0028634707,0.0033833347,0.0036771914,0.004152277,0.00038389408],"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.0002618419,0.00036328542,0.0023699352,0.00035158297,0.0001929855,0.00080824,0.00088505493,0.43978864,0.02094951,0.4467612,0.0024379105,0.08482974],"study_design_scores_gemma":[0.000048952625,0.00004400007,0.0001639774,0.00003126348,0.0000668941,0.00008146863,0.00010163582,0.7265804,0.025324984,0.24557598,0.0019588792,0.000021588932],"about_ca_topic_score_codex":0.0077900286,"about_ca_topic_score_gemma":0.008105928,"teacher_disagreement_score":0.0077900286,"about_ca_system_score_codex":0.0022056252,"about_ca_system_score_gemma":0.0040229997,"threshold_uncertainty_score":0.018181145},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0075861258,0.00022645915,0.7090016,0.0006636872,0.0008505616,0.0004017989,0.0013916442,0.019279199,0.26059896],"genre_scores_gemma":[0.24817556,0.00051609665,0.41548952,0.0006036792,0.00017052946,0.0009561954,0.004644904,0.004597258,0.3248463],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990761,0.00015158483,0.00006108493,0.00025742967,0.00033699078,0.00011677385],"domain_scores_gemma":[0.99905187,0.00014781707,0.000018700403,0.00046571143,0.00027191092,0.000044032222],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005156108,0.0007221248,0.00059261953,0.000776566,0.0012109119,0.0025410303,0.0016691231,0.0009887293,0.09360363],"category_scores_gemma":[0.002076619,0.0006490354,0.001066825,0.00061677926,0.00078483345,0.0025112103,0.002194667,0.0018425304,0.037749816],"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.0001929045,0.00017936746,0.0003731475,0.00025758683,0.000034681092,0.00015135242,0.00026437835,0.005269244,0.01467954,0.68493885,0.04935745,0.24430147],"study_design_scores_gemma":[0.000104924184,0.000100794394,0.00032356795,0.00012677655,0.00009914497,0.0003761219,0.0001863388,0.06494681,0.049618382,0.37223366,0.5118296,0.00005382097],"about_ca_topic_score_codex":0.0015649772,"about_ca_topic_score_gemma":0.0021931527,"teacher_disagreement_score":0.09360363,"about_ca_system_score_codex":0.0007881536,"about_ca_system_score_gemma":0.0014820003,"threshold_uncertainty_score":0.3131354},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16515394,0.0005095436,0.8177905,0.00035892293,0.0000683704,0.00012174622,0.00023514353,0.0006676383,0.015094156],"genre_scores_gemma":[0.8374041,0.00050347554,0.1549161,0.000111988,0.000063935484,0.00010614446,0.0003692647,0.00024666716,0.0062783887],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989064,0.0003351635,0.00007013345,0.000118063705,0.00039840574,0.00017181574],"domain_scores_gemma":[0.9960551,0.002387258,0.000330264,0.0007159787,0.00046018782,0.000051125444],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012111028,0.00042589798,0.0004659307,0.00096896966,0.00051128835,0.0010560045,0.0007070327,0.0003574646,0.003714052],"category_scores_gemma":[0.004442985,0.00026335355,0.00052870053,0.0011117968,0.0011966736,0.0025705476,0.00044673143,0.00075199537,0.00042613596],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024907503,0.00007092422,0.001407811,0.0001741103,0.000019197621,0.00052670937,0.00037196066,0.15203366,0.01790658,0.7412622,0.001456189,0.08452149],"study_design_scores_gemma":[0.00004831032,0.00013573277,0.00075346755,0.000058249254,0.000039331713,0.0002791786,0.00016089056,0.5143844,0.03235752,0.4388888,0.012851359,0.000042884574],"about_ca_topic_score_codex":0.0014501481,"about_ca_topic_score_gemma":0.0019996215,"teacher_disagreement_score":0.003714052,"about_ca_system_score_codex":0.001162849,"about_ca_system_score_gemma":0.00090641587,"threshold_uncertainty_score":0.012424767},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022910836,0.0042707664,0.09235409,0.0012395618,0.0011115213,0.000094261515,0.0012447843,0.0021169789,0.89527696],"genre_scores_gemma":[0.15453038,0.011818274,0.12853973,0.0030124574,0.0028509246,0.00058797875,0.0068961955,0.0026093305,0.6891548],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999435,0.00009875706,0.00003040416,0.00013409254,0.0002529683,0.00004879392],"domain_scores_gemma":[0.99974316,0.00004850318,0.000014592407,0.000060759034,0.00010912133,0.000023862389],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004281948,0.0009812284,0.0010824606,0.0018216236,0.0018766125,0.003981449,0.001387191,0.0007621312,0.0743559],"category_scores_gemma":[0.00087592454,0.00048211985,0.00075354025,0.0024490685,0.0021100664,0.004570778,0.0015761821,0.0031570226,0.03834815],"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.0000126808145,0.000016931544,0.000045130593,0.00013635734,0.000007024843,0.000029720943,0.00010077313,0.00020610502,0.00047940784,0.9025755,0.047463182,0.048927348],"study_design_scores_gemma":[0.0000074390064,0.000010555248,0.00009623196,0.000050939558,0.000007299702,0.00014424969,0.00003431387,0.0007133451,0.00079175504,0.6954,0.30273256,0.000011305989],"about_ca_topic_score_codex":0.0014926567,"about_ca_topic_score_gemma":0.0012979228,"teacher_disagreement_score":0.0743559,"about_ca_system_score_codex":0.0012329826,"about_ca_system_score_gemma":0.0012660361,"threshold_uncertainty_score":0.24874526},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.059321966,0.005367118,0.5400822,0.0016802646,0.00056553475,0.0001896722,0.0007404257,0.0007725839,0.3912803],"genre_scores_gemma":[0.69634986,0.0075142323,0.14257765,0.00059937686,0.00067990494,0.00032391932,0.001045766,0.00032529197,0.15058395],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99936944,0.000110288696,0.000046786634,0.000112326634,0.0002946953,0.00006641406],"domain_scores_gemma":[0.9991161,0.00030482808,0.000071156355,0.0001521279,0.0002849984,0.00007078633],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061138195,0.00039473193,0.00023340763,0.0011998106,0.0006644359,0.0027714714,0.0005455438,0.0004665073,0.010002634],"category_scores_gemma":[0.0018195638,0.0002809809,0.0004675497,0.0016324897,0.0024914155,0.0052329376,0.0016637121,0.002006203,0.0017496529],"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.000009266296,0.00000673825,0.00006198436,0.000037546328,0.0000015945299,0.000037129572,0.00020294488,0.0002988863,0.00042630814,0.9854497,0.0008637253,0.012604278],"study_design_scores_gemma":[0.00000852165,0.00003595764,0.00021367508,0.000042386804,0.00000783766,0.00025597375,0.00017478998,0.003131753,0.0012718831,0.9191762,0.07566824,0.000012809286],"about_ca_topic_score_codex":0.0009263681,"about_ca_topic_score_gemma":0.0006362606,"teacher_disagreement_score":0.010002634,"about_ca_system_score_codex":0.00089744537,"about_ca_system_score_gemma":0.0008749282,"threshold_uncertainty_score":0.033462167},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005123239,0.000044725297,0.99673283,0.000031638978,0.000029842835,0.00009722098,0.000041124593,0.0012066431,0.001303663],"genre_scores_gemma":[0.013164196,0.00007430476,0.98312485,0.000043208194,0.000021902028,0.00026908048,0.00018049795,0.0003898648,0.0027321447],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975811,0.00041423453,0.0002163064,0.00068091,0.00090079074,0.0002066139],"domain_scores_gemma":[0.9982784,0.0006849902,0.000120140496,0.000406002,0.00043005793,0.000080321995],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016589029,0.0016780611,0.0010636126,0.0019123082,0.0015959464,0.002320208,0.0017519598,0.0008059235,0.012329077],"category_scores_gemma":[0.0045272755,0.0011229283,0.0021264409,0.0013367224,0.0017416792,0.003223163,0.0031088237,0.0024888264,0.004395503],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002373596,0.00016462631,0.00049809227,0.00056616403,0.00010369513,0.00039381077,0.0005940428,0.016675252,0.04341758,0.34258834,0.014793313,0.5799677],"study_design_scores_gemma":[0.00025428907,0.00019060033,0.0002583019,0.00029612184,0.00017798194,0.0016260941,0.00020360196,0.28372455,0.078281,0.43912295,0.19570851,0.00015596312],"about_ca_topic_score_codex":0.0024990304,"about_ca_topic_score_gemma":0.0028481567,"teacher_disagreement_score":0.012329077,"about_ca_system_score_codex":0.0013646089,"about_ca_system_score_gemma":0.0025036072,"threshold_uncertainty_score":0.041244864},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011655497,0.00020580356,0.9795273,0.00022626414,0.00003557454,0.00007320754,0.0001500419,0.00026497318,0.00786139],"genre_scores_gemma":[0.6303756,0.00046424978,0.35517085,0.00030775552,0.000050933235,0.0005769794,0.00040872238,0.00030388153,0.012340953],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99933714,0.0001797913,0.000024290071,0.00011335078,0.00022242036,0.00012297588],"domain_scores_gemma":[0.9989291,0.00068721443,0.00012798898,0.00005611301,0.00014518315,0.000054353517],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011170954,0.0014106574,0.0011074519,0.0005762527,0.000436199,0.0015264336,0.0011910276,0.0010983183,0.007640539],"category_scores_gemma":[0.0024976293,0.00066572486,0.000935212,0.0006901822,0.0009720257,0.0016151068,0.0010363637,0.0018547305,0.00081090606],"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.00002890993,0.000014236991,0.00013003398,0.00004431176,0.0000106413045,0.000056332778,0.000017075983,0.96945244,0.00090205926,0.024222016,0.00056662445,0.004555305],"study_design_scores_gemma":[0.0000057665775,0.000009932625,0.000015878042,0.0000057598504,0.000004391167,0.000008034216,0.0000058913597,0.99204105,0.00038049417,0.0070376294,0.00048268327,0.000002529921],"about_ca_topic_score_codex":0.0023392017,"about_ca_topic_score_gemma":0.0030775005,"teacher_disagreement_score":0.007640539,"about_ca_system_score_codex":0.001397619,"about_ca_system_score_gemma":0.0018587869,"threshold_uncertainty_score":0.02556014},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004624398,0.00013117737,0.9715551,0.00022836126,0.00011868939,0.00014030929,0.0004569101,0.020768315,0.001976696],"genre_scores_gemma":[0.1256808,0.0003460225,0.86319816,0.00074218307,0.000082744045,0.0004196919,0.0022658533,0.0031625386,0.004101939],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9962728,0.0009432839,0.0003532177,0.0004425069,0.0016730195,0.0003152129],"domain_scores_gemma":[0.9936737,0.0031529919,0.0003952547,0.0016346145,0.00094014226,0.00020328978],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003099305,0.0012016068,0.0011926112,0.0015660342,0.00088127406,0.0024835498,0.003995146,0.0016463883,0.0071600894],"category_scores_gemma":[0.009413043,0.0012432229,0.0020383417,0.0010798522,0.0023170027,0.0055756913,0.0034761226,0.005129006,0.0018889426],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010949068,0.0006505024,0.005013171,0.0016025107,0.00058171834,0.0011911392,0.000605824,0.31681973,0.05029256,0.28425512,0.053041384,0.28485146],"study_design_scores_gemma":[0.00018575563,0.0000886535,0.0002487995,0.000098091,0.00012430696,0.00025148538,0.000030630817,0.885756,0.04215201,0.046876047,0.024119975,0.00006819915],"about_ca_topic_score_codex":0.0053805574,"about_ca_topic_score_gemma":0.007941934,"teacher_disagreement_score":0.0071600894,"about_ca_system_score_codex":0.0013923728,"about_ca_system_score_gemma":0.0029378152,"threshold_uncertainty_score":0.023952901},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015860434,0.000031082433,0.994034,0.0000776051,0.000039876926,0.000058597285,0.00011277873,0.0022686545,0.0017913575],"genre_scores_gemma":[0.12887833,0.00028125348,0.8610992,0.00028325128,0.000067479334,0.00062063907,0.0013155587,0.003261173,0.0041931076],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9939334,0.002035174,0.0008060385,0.0008491052,0.0019284985,0.00044781496],"domain_scores_gemma":[0.9939919,0.0018655699,0.0004500459,0.0025995895,0.00093343185,0.00015944103],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0045463294,0.0013044936,0.0008721286,0.0012042474,0.0007066288,0.0036245482,0.0031186605,0.0017043565,0.0052857096],"category_scores_gemma":[0.012337238,0.0010972472,0.0025785302,0.0010612361,0.0024267063,0.0052878913,0.003969988,0.0025686095,0.0024528531],"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.00013997337,0.00007085271,0.0005160958,0.0004226435,0.00006668519,0.0005170855,0.0010509102,0.038615774,0.014782973,0.863953,0.005265381,0.07459857],"study_design_scores_gemma":[0.00007172536,0.00012453667,0.00011161395,0.00015702966,0.00007142093,0.0004880288,0.00021314686,0.24654362,0.055781394,0.5904922,0.10586698,0.00007839657],"about_ca_topic_score_codex":0.002337997,"about_ca_topic_score_gemma":0.0018051215,"teacher_disagreement_score":0.0052857096,"about_ca_system_score_codex":0.0016263996,"about_ca_system_score_gemma":0.0024690726,"threshold_uncertainty_score":0.02404356},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022051508,0.00004505688,0.9758125,0.00008631031,0.000012079697,0.000107521715,0.000053614298,0.0014533211,0.0003780962],"genre_scores_gemma":[0.46146923,0.00012974816,0.53645974,0.00011196966,0.000034652363,0.0003478754,0.00026676845,0.0004386742,0.00074127124],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9923269,0.00199082,0.00072150456,0.0017396737,0.0025300193,0.00069113635],"domain_scores_gemma":[0.97643083,0.016170595,0.0021580304,0.0037151189,0.0012077477,0.00031767777],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007715617,0.0015046749,0.0011647913,0.0011400719,0.0011510141,0.002825747,0.0030855527,0.0012671376,0.001858571],"category_scores_gemma":[0.025987297,0.0016817959,0.003690736,0.00083329825,0.005085489,0.007969614,0.0036594986,0.002275483,0.00026914253],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006442835,0.000284895,0.0061069815,0.0008010014,0.000372682,0.0012850662,0.0016228254,0.61045957,0.050457064,0.2209927,0.00085670274,0.106116235],"study_design_scores_gemma":[0.0001517074,0.000119525444,0.00039166954,0.000060678707,0.00012315858,0.00016341571,0.00008194465,0.8727641,0.035056915,0.08862845,0.0024094523,0.000048977796],"about_ca_topic_score_codex":0.005173127,"about_ca_topic_score_gemma":0.0039309836,"teacher_disagreement_score":0.007715617,"about_ca_system_score_codex":0.0024054435,"about_ca_system_score_gemma":0.0036817838,"threshold_uncertainty_score":0.040804565},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.058037803,0.00052944507,0.92794985,0.0003430346,0.000084076106,0.0003079447,0.000117729025,0.006387304,0.0062428745],"genre_scores_gemma":[0.5164581,0.00025477697,0.48000473,0.00032251334,0.000057194007,0.00034564218,0.00029824363,0.0011310647,0.0011277904],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98803246,0.006604302,0.00081337173,0.0017693305,0.002093163,0.0006874274],"domain_scores_gemma":[0.9600322,0.029169008,0.0016524582,0.0071450565,0.0017451216,0.00025606007],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007622231,0.0017063819,0.0014289023,0.0014866904,0.0008175627,0.0022763968,0.0024767336,0.0014972705,0.004187629],"category_scores_gemma":[0.04257986,0.0012387808,0.0012175008,0.0010174216,0.0019052207,0.0033165892,0.0026929192,0.0030199285,0.001764008],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009192271,0.00063971634,0.003921024,0.00064389466,0.00016641227,0.00022639924,0.00042605193,0.45597667,0.052158322,0.052343205,0.004155703,0.42842335],"study_design_scores_gemma":[0.00017850917,0.0001365198,0.00039417774,0.000070083894,0.00006113053,0.00010907396,0.00005220465,0.92189646,0.024684398,0.0476083,0.0047531407,0.000055956913],"about_ca_topic_score_codex":0.0011964228,"about_ca_topic_score_gemma":0.0021285373,"teacher_disagreement_score":0.007622231,"about_ca_system_score_codex":0.001537844,"about_ca_system_score_gemma":0.0027324308,"threshold_uncertainty_score":0.04031068},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014573224,0.00002763263,0.97845846,0.00006342798,0.000015989748,0.00011254899,0.00012494138,0.004919303,0.001704556],"genre_scores_gemma":[0.27234203,0.000096790034,0.7226751,0.000116649215,0.000019765313,0.00042271992,0.00049615133,0.0010073641,0.002823383],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99845207,0.00041437085,0.00012909595,0.0001747868,0.00072667777,0.00010301589],"domain_scores_gemma":[0.99726045,0.001423661,0.0002691858,0.00055008824,0.0004529894,0.000043684733],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012287087,0.00046046803,0.00028424303,0.00046006354,0.0002315272,0.0011611235,0.0010337811,0.0007089941,0.003091073],"category_scores_gemma":[0.005253718,0.0005209258,0.00040938184,0.00027328488,0.0006819691,0.0011131761,0.0006143566,0.001174589,0.0010298113],"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.00047234763,0.00025113169,0.0047412375,0.00077408174,0.00005717873,0.001240373,0.00093427754,0.1176018,0.39231274,0.19691484,0.009248368,0.27545163],"study_design_scores_gemma":[0.00015759114,0.00022572576,0.0006660851,0.000059709244,0.00003931559,0.00051173894,0.000063046646,0.65514404,0.2937659,0.025145255,0.024190642,0.000030934414],"about_ca_topic_score_codex":0.0004283021,"about_ca_topic_score_gemma":0.0004940623,"teacher_disagreement_score":0.003091073,"about_ca_system_score_codex":0.00044472766,"about_ca_system_score_gemma":0.0008662703,"threshold_uncertainty_score":0.010340631},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06366223,0.00021528875,0.92936486,0.00023756477,0.000089896894,0.00009431074,0.000093014496,0.0032723295,0.0029704536],"genre_scores_gemma":[0.77533865,0.00018110492,0.22217171,0.00009909563,0.00003623487,0.00016644182,0.00018176711,0.0003232847,0.0015017542],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99723274,0.0009995361,0.00024283958,0.00036887403,0.0007875401,0.0003684249],"domain_scores_gemma":[0.9922943,0.004547475,0.000413126,0.0022570298,0.00034555778,0.00014262051],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032993145,0.00082648086,0.0017318957,0.0008733103,0.0011728174,0.0027052502,0.002206448,0.001117887,0.0024686016],"category_scores_gemma":[0.008456147,0.0011900755,0.002468502,0.0008796364,0.003485398,0.0064511336,0.0034983647,0.003639926,0.00026862163],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000529463,0.00013757836,0.0020125965,0.00033623373,0.00023318655,0.0002674726,0.0005495666,0.5506855,0.010820438,0.3851218,0.0014068651,0.04789919],"study_design_scores_gemma":[0.000058053727,0.000036373778,0.00013024647,0.000022460841,0.000055691304,0.000026599877,0.00003694567,0.75299627,0.0066879964,0.23880798,0.0011183566,0.000023011035],"about_ca_topic_score_codex":0.0045601334,"about_ca_topic_score_gemma":0.00842378,"teacher_disagreement_score":0.0045601334,"about_ca_system_score_codex":0.0014860387,"about_ca_system_score_gemma":0.0019172253,"threshold_uncertainty_score":0.017448604},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014958419,0.00048144074,0.9774993,0.00030371037,0.000038193102,0.00013612997,0.00024910757,0.00023815187,0.006095507],"genre_scores_gemma":[0.4666863,0.0023498756,0.5157048,0.00054973416,0.00026385073,0.0013728361,0.0021991108,0.0003611153,0.01051232],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9951349,0.0014737746,0.00054979837,0.0007287907,0.0017630187,0.00034962496],"domain_scores_gemma":[0.9911034,0.005438204,0.0007201314,0.0010047596,0.0014912123,0.0002423161],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0043502995,0.0013463148,0.0007694055,0.0017167086,0.00090000796,0.0031785998,0.0015527952,0.0022637306,0.003350774],"category_scores_gemma":[0.010448585,0.0010020684,0.0015423615,0.0024987557,0.0038196016,0.0071860887,0.0031671245,0.0024981522,0.0009434592],"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.00008379751,0.000030627878,0.00047724915,0.0001255992,0.000021251599,0.00043950928,0.0006850336,0.042346865,0.0032052472,0.9349199,0.00072382885,0.016940968],"study_design_scores_gemma":[0.000047360132,0.00023697053,0.00030048587,0.00022773657,0.00003671558,0.00042315698,0.0003328422,0.22214736,0.0068443837,0.7441905,0.02513824,0.00007416843],"about_ca_topic_score_codex":0.0036468739,"about_ca_topic_score_gemma":0.002791836,"teacher_disagreement_score":0.0043502995,"about_ca_system_score_codex":0.0016718857,"about_ca_system_score_gemma":0.0018181449,"threshold_uncertainty_score":0.023006856},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12528528,0.00016045615,0.865441,0.00019565977,0.000028095063,0.00009744342,0.000058151953,0.0059350356,0.002798828],"genre_scores_gemma":[0.59172195,0.00013488394,0.40527713,0.00005171628,0.000026123194,0.000117743264,0.00019588924,0.0007645085,0.0017100336],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9894114,0.0034638948,0.0004965305,0.00062182976,0.005380244,0.0006260169],"domain_scores_gemma":[0.9617321,0.027292192,0.001887542,0.004996318,0.0037965786,0.0002952708],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005561287,0.0011481046,0.0010713465,0.001589365,0.00089962,0.0024433134,0.0027663538,0.0013419776,0.0023374087],"category_scores_gemma":[0.047966607,0.00072114967,0.0010123348,0.001065904,0.0019119076,0.004198285,0.002504584,0.0022050582,0.0005593029],"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.0011114121,0.00039971786,0.017779721,0.00071865885,0.0001326823,0.00043986074,0.0014640283,0.3839683,0.08553318,0.12052395,0.001957753,0.38597074],"study_design_scores_gemma":[0.000048094364,0.00010390076,0.0009001467,0.000034276367,0.00004209348,0.00007447949,0.000051016727,0.92827123,0.040701877,0.02769243,0.0020453823,0.000035067696],"about_ca_topic_score_codex":0.0029386296,"about_ca_topic_score_gemma":0.0033366738,"teacher_disagreement_score":0.005561287,"about_ca_system_score_codex":0.0014699334,"about_ca_system_score_gemma":0.0026899893,"threshold_uncertainty_score":0.029411256},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010349872,0.000065216234,0.9969759,0.00006347821,0.000019264393,0.000057697664,0.00008661768,0.00073157134,0.0009652709],"genre_scores_gemma":[0.059261043,0.00051609013,0.9368914,0.00012419204,0.000043338907,0.0002601421,0.0004677938,0.00048241494,0.0019537378],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9961972,0.0010281046,0.00035054935,0.0005907304,0.0016461984,0.00018720211],"domain_scores_gemma":[0.99521327,0.00311305,0.00027752662,0.0006134743,0.0007202029,0.00006248624],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002462938,0.001652321,0.0013369042,0.002895769,0.0010693673,0.003539867,0.001856096,0.0010149315,0.0073441025],"category_scores_gemma":[0.008726798,0.0010275553,0.0027119352,0.0019359343,0.0019243475,0.005103686,0.0021798313,0.002717852,0.0014518609],"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.00027123583,0.00008498637,0.0009779452,0.0007617385,0.0001564281,0.00023469867,0.0004713228,0.21145998,0.008412833,0.55786806,0.0049811434,0.2143196],"study_design_scores_gemma":[0.00008882507,0.000080261234,0.00014037912,0.00015943717,0.00010150287,0.00018158356,0.00011872933,0.51290345,0.021317348,0.41692132,0.047922567,0.00006466213],"about_ca_topic_score_codex":0.0040162248,"about_ca_topic_score_gemma":0.003673844,"teacher_disagreement_score":0.0073441025,"about_ca_system_score_codex":0.0016749941,"about_ca_system_score_gemma":0.0019566845,"threshold_uncertainty_score":0.024568439},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017489755,0.00007899163,0.99600285,0.00008953212,0.00002349328,0.000053031763,0.00002815902,0.0008769907,0.0010980385],"genre_scores_gemma":[0.1417455,0.0003250239,0.8554675,0.00020956164,0.000049327224,0.0002631047,0.00014241868,0.00013953411,0.001658067],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99618703,0.0011043212,0.00026662904,0.0005246353,0.0016631846,0.00025426492],"domain_scores_gemma":[0.99427503,0.0039278683,0.0003711454,0.00082264194,0.0005318634,0.00007146142],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020203555,0.00092032057,0.0005656748,0.0019089717,0.00063794473,0.0013896868,0.0016406915,0.0011051801,0.004326824],"category_scores_gemma":[0.0076750065,0.0006108787,0.0015233823,0.0008566472,0.0023589144,0.0028820017,0.0015925028,0.001944818,0.0009797441],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021550008,0.00021586333,0.0011470622,0.0006889409,0.00014145042,0.00065707014,0.00042095926,0.08658398,0.037566572,0.5055543,0.0040938593,0.36271435],"study_design_scores_gemma":[0.00024594463,0.0002859207,0.00032857366,0.00022603427,0.00012945115,0.0011459547,0.00006785968,0.5632412,0.061868858,0.33999315,0.03238742,0.00007976493],"about_ca_topic_score_codex":0.0011177213,"about_ca_topic_score_gemma":0.00117083,"teacher_disagreement_score":0.004326824,"about_ca_system_score_codex":0.0010798014,"about_ca_system_score_gemma":0.0016883349,"threshold_uncertainty_score":0.01447463},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.086191684,0.00073975365,0.8835255,0.000293252,0.00015054591,0.00011207057,0.00011025892,0.002218878,0.026658028],"genre_scores_gemma":[0.71439046,0.00025203486,0.28151512,0.00014821412,0.00003115477,0.000076732555,0.00021857965,0.00008305808,0.0032846257],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995536,0.00010271347,0.00002462158,0.00010489145,0.00012852305,0.0000854647],"domain_scores_gemma":[0.9997092,0.000097319724,0.000026990869,0.00009301584,0.00005227563,0.000021160235],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002786745,0.0005069784,0.0003828656,0.0004793171,0.00057457364,0.0009449755,0.001159408,0.00036291048,0.0049993093],"category_scores_gemma":[0.0007816923,0.00022406786,0.00046890965,0.00078603363,0.00042348533,0.0010078566,0.0007035784,0.0005382936,0.0006369308],"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.0006166425,0.00022876955,0.0025152953,0.00025677859,0.00015717815,0.0007688972,0.0001339708,0.4288348,0.054343425,0.10054853,0.0076412563,0.40395442],"study_design_scores_gemma":[0.00008147653,0.00020256922,0.00042954079,0.00002650858,0.00004941764,0.00017258653,0.00005454916,0.9397375,0.027771274,0.022090903,0.009361561,0.000022116748],"about_ca_topic_score_codex":0.0024922679,"about_ca_topic_score_gemma":0.004660829,"teacher_disagreement_score":0.0049993093,"about_ca_system_score_codex":0.00066878746,"about_ca_system_score_gemma":0.00063697144,"threshold_uncertainty_score":0.016724348},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013961201,0.000060100974,0.9800299,0.0003351716,0.000056288784,0.00007850465,0.00006783639,0.004371301,0.001039625],"genre_scores_gemma":[0.31464154,0.00021547102,0.6802527,0.0005662782,0.00008322825,0.00033897444,0.00034122312,0.0014947756,0.0020658495],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9910738,0.0029736634,0.00057565235,0.0014596381,0.0029716534,0.0009456669],"domain_scores_gemma":[0.9844707,0.009498812,0.0012545214,0.0030726618,0.0013603065,0.0003430102],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0060026622,0.0018899776,0.0013672762,0.0022578633,0.0010097591,0.0030649782,0.0035677229,0.0019671472,0.0033409598],"category_scores_gemma":[0.027597107,0.0015520066,0.0044351188,0.0011806812,0.006059153,0.0060983044,0.005425289,0.006036411,0.0008191827],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00055280933,0.00041379384,0.0048441137,0.00058134994,0.00028033828,0.0012195935,0.0010392345,0.42078397,0.022969276,0.4538433,0.006226123,0.08724606],"study_design_scores_gemma":[0.000138833,0.00011858289,0.00024751876,0.000097597316,0.00007737744,0.00019568474,0.000050357947,0.7539724,0.021457626,0.21784317,0.0057248003,0.0000760117],"about_ca_topic_score_codex":0.010704856,"about_ca_topic_score_gemma":0.008783537,"teacher_disagreement_score":0.010704856,"about_ca_system_score_codex":0.0024071557,"about_ca_system_score_gemma":0.003329489,"threshold_uncertainty_score":0.031745493},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007256277,0.0024453949,0.93696046,0.005107038,0.0015529037,0.00031072233,0.0007763238,0.0033821054,0.042208817],"genre_scores_gemma":[0.26636335,0.005025794,0.67083776,0.005587292,0.002457153,0.0014413333,0.0029377819,0.0047915545,0.040558048],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.97091115,0.009012184,0.0028346616,0.0048584733,0.010662445,0.0017211055],"domain_scores_gemma":[0.8929574,0.07078043,0.0051581385,0.018657744,0.011329813,0.0011164073],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0138040995,0.0022819226,0.0018884932,0.0028549833,0.004135079,0.010363236,0.0030819203,0.0038933484,0.023026032],"category_scores_gemma":[0.10349458,0.0020285512,0.0039300667,0.0027646008,0.0076762517,0.029413342,0.009088172,0.008156873,0.008481462],"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.000073563024,0.000045721124,0.0004194684,0.0004601282,0.00006602321,0.00022997143,0.0006746529,0.0012519406,0.0012492328,0.9498816,0.010693491,0.034954086],"study_design_scores_gemma":[0.00004441628,0.000031406955,0.00013033932,0.00034237048,0.000091363065,0.00031862367,0.000101546226,0.0056215217,0.004575363,0.90661776,0.082072526,0.000052636995],"about_ca_topic_score_codex":0.0009110546,"about_ca_topic_score_gemma":0.0011501077,"teacher_disagreement_score":0.023026032,"about_ca_system_score_codex":0.002530466,"about_ca_system_score_gemma":0.004215606,"threshold_uncertainty_score":0.077029705},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0067884256,0.000582869,0.98637354,0.000961843,0.000065886714,0.00012352476,0.00013232621,0.0005955952,0.0043759597],"genre_scores_gemma":[0.3550766,0.0019821904,0.6384056,0.0006046574,0.00019833383,0.00040052825,0.0007070958,0.0001575777,0.0024673594],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9954021,0.0019265028,0.00038483692,0.0005510477,0.0014668016,0.0002687257],"domain_scores_gemma":[0.99183005,0.0062390147,0.0005213242,0.000606801,0.00071229605,0.00009059594],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035324066,0.001092637,0.0007361984,0.003002521,0.00082036626,0.0022733577,0.0016368796,0.0015041062,0.0041082613],"category_scores_gemma":[0.018630588,0.0007089481,0.0015875258,0.0019101996,0.0025261021,0.003788838,0.0018999542,0.0018058985,0.00062022515],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025906737,0.0001346996,0.0024792787,0.0011299369,0.00020418498,0.00096111844,0.00060927717,0.2037045,0.010745283,0.5225185,0.0058757346,0.25137848],"study_design_scores_gemma":[0.00009185263,0.00006014726,0.00017809289,0.00017664496,0.000082164304,0.00025881242,0.00009322705,0.45969748,0.006853663,0.52593535,0.006538953,0.000033669392],"about_ca_topic_score_codex":0.0028709727,"about_ca_topic_score_gemma":0.003462374,"teacher_disagreement_score":0.0041082613,"about_ca_system_score_codex":0.0019148762,"about_ca_system_score_gemma":0.0019243283,"threshold_uncertainty_score":0.018681407},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018238159,0.000043084,0.97762614,0.00007743709,0.00002368704,0.00006737547,0.000032838056,0.002124117,0.0017672055],"genre_scores_gemma":[0.50975966,0.00011551657,0.48646685,0.00016667145,0.000022225106,0.00019957608,0.00016212427,0.0007607625,0.002346553],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99612844,0.0011928355,0.00017809837,0.0004170393,0.0017077888,0.00037570013],"domain_scores_gemma":[0.9908166,0.006100844,0.00042857142,0.001841144,0.0007168558,0.000096113756],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002674065,0.0008788451,0.0005958856,0.0011924459,0.00063050265,0.0014039992,0.0015490795,0.0010057818,0.0036126424],"category_scores_gemma":[0.012345702,0.00070817425,0.001098717,0.00053376076,0.0020133655,0.003009366,0.002490982,0.00208816,0.00068321713],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010326729,0.00031223957,0.00356522,0.0004959161,0.00008650399,0.0010303376,0.0011164653,0.11940258,0.104170606,0.42737767,0.0023923214,0.3390175],"study_design_scores_gemma":[0.00014696945,0.00035762435,0.0005513786,0.00012251368,0.00009333888,0.00039783114,0.00011004596,0.50820124,0.24347644,0.2339083,0.012552007,0.00008228985],"about_ca_topic_score_codex":0.0009804766,"about_ca_topic_score_gemma":0.0014224926,"teacher_disagreement_score":0.0036126424,"about_ca_system_score_codex":0.0012023115,"about_ca_system_score_gemma":0.0011968121,"threshold_uncertainty_score":0.014141917},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.097537436,0.0021763854,0.8577322,0.00042987842,0.00022960185,0.00018520457,0.0003887154,0.010314516,0.031006044],"genre_scores_gemma":[0.81297934,0.0012585395,0.16077578,0.00024258716,0.00016851506,0.00013690983,0.00056180364,0.0007667687,0.023109661],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983285,0.00031945255,0.000100806574,0.00043021672,0.00069015374,0.00013084862],"domain_scores_gemma":[0.9958191,0.0020499504,0.0005721597,0.0009898032,0.000483586,0.00008528257],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014549446,0.0005653196,0.00044323094,0.00082555995,0.00026755422,0.0020711184,0.0015037855,0.00056526193,0.0040620314],"category_scores_gemma":[0.005961741,0.00033008726,0.00036284508,0.0005837362,0.0007831865,0.002824467,0.0006673784,0.0006801021,0.0010697911],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012485045,0.00024631424,0.0037220623,0.0007006889,0.00006947043,0.000725136,0.0010336089,0.01964854,0.20240517,0.13526338,0.008591574,0.6263455],"study_design_scores_gemma":[0.000120883415,0.000489064,0.0027549528,0.00027840675,0.0001694563,0.0015872447,0.0001606663,0.2832227,0.5342503,0.10590278,0.07098521,0.00007825763],"about_ca_topic_score_codex":0.00040964555,"about_ca_topic_score_gemma":0.00042632103,"teacher_disagreement_score":0.0040620314,"about_ca_system_score_codex":0.00066790363,"about_ca_system_score_gemma":0.000577292,"threshold_uncertainty_score":0.013588846},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012591726,0.019171884,0.025105003,0.060298774,0.27950662,0.00034099634,0.006352048,0.0012837761,0.6066817],"genre_scores_gemma":[0.01159997,0.008757231,0.0064366795,0.008818117,0.05218668,0.00027731125,0.0051544607,0.0010159987,0.9057536],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989833,0.0001844024,0.000055995453,0.00018203065,0.0005184953,0.000075689706],"domain_scores_gemma":[0.99511564,0.0010465116,0.00017955092,0.0005304931,0.0025064652,0.0006212785],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0016351397,0.0009636066,0.0006429998,0.0031781434,0.00245263,0.0038099973,0.0012712732,0.0011873653,0.26904082],"category_scores_gemma":[0.012528404,0.00028762198,0.0005972181,0.001929718,0.0009658318,0.0032834713,0.0020095014,0.0038237786,0.15943159],"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.000022711454,0.00002068783,0.0000823342,0.0001226088,0.0000029820023,0.0000328386,0.000093429444,0.00013746618,0.00013576764,0.03732649,0.91661704,0.0454056],"study_design_scores_gemma":[0.0000037419488,0.000008733578,0.00013221957,0.0001115621,0.0000020719865,0.00003456283,0.00005514277,0.00006391831,0.00010421862,0.015861722,0.9836172,0.0000049335163],"about_ca_topic_score_codex":0.0028535258,"about_ca_topic_score_gemma":0.0033882617,"teacher_disagreement_score":0.7309592,"about_ca_system_score_codex":0.0027516598,"about_ca_system_score_gemma":0.0024599626,"threshold_uncertainty_score":0},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008557646,0.00019352106,0.9940175,0.0002979995,0.00008507739,0.00009232184,0.00007342822,0.0006420276,0.0037423864],"genre_scores_gemma":[0.060612775,0.00069004187,0.93237174,0.00038826035,0.00025180154,0.0009431048,0.0004474865,0.00050107815,0.0037937434],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99006164,0.0036988521,0.001653185,0.0011122334,0.0028897172,0.00058440736],"domain_scores_gemma":[0.99446434,0.0023897544,0.0005507937,0.0014249111,0.00086870167,0.00030144327],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010376433,0.0020942679,0.0012404763,0.0027587793,0.0022321003,0.007559115,0.0035469972,0.0022255532,0.004369987],"category_scores_gemma":[0.0103411395,0.0012994591,0.0033152527,0.0023215958,0.005818048,0.010786389,0.0055101863,0.004820444,0.0016559741],"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.0000062089443,0.000010262213,0.00003555309,0.000048943344,0.0000092123155,0.000059139275,0.00036622473,0.0024707948,0.0004116774,0.99072355,0.0005187031,0.0053397072],"study_design_scores_gemma":[0.000024148321,0.0000299072,0.000029706058,0.00009266324,0.000030662974,0.00012363533,0.00011822572,0.019081123,0.0018426047,0.9147233,0.06387865,0.0000253686],"about_ca_topic_score_codex":0.002644617,"about_ca_topic_score_gemma":0.0022104545,"teacher_disagreement_score":0.010376433,"about_ca_system_score_codex":0.0028876418,"about_ca_system_score_gemma":0.0031560608,"threshold_uncertainty_score":0.054876506},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026174258,0.0004124401,0.9702786,0.0001504879,0.000029444423,0.0000731645,0.00010697417,0.000978661,0.0017959347],"genre_scores_gemma":[0.25167993,0.0007980179,0.74450845,0.00015930826,0.000026668058,0.0002614506,0.00031206812,0.00033266176,0.0019214841],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9938525,0.002741208,0.00052354584,0.00054660364,0.002147322,0.0001888657],"domain_scores_gemma":[0.9842929,0.010523647,0.0015100046,0.0022655309,0.0012748723,0.00013297009],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041614557,0.0009985432,0.00068160455,0.0024374712,0.0006055889,0.0021574518,0.0012748252,0.0008139423,0.0031185194],"category_scores_gemma":[0.014485447,0.0006608895,0.0013535989,0.0018805732,0.0026153093,0.0047879866,0.002088015,0.0014838983,0.00044987793],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009229416,0.00009974748,0.0036712706,0.0006753415,0.00014691113,0.00024850623,0.0005978768,0.26664,0.020898532,0.46051025,0.0020099396,0.2435786],"study_design_scores_gemma":[0.00028058156,0.00036885354,0.0007652767,0.00031432483,0.00019673191,0.00030298167,0.00020635307,0.5435672,0.077719405,0.34956384,0.02661935,0.00009516609],"about_ca_topic_score_codex":0.0038408467,"about_ca_topic_score_gemma":0.0033845922,"teacher_disagreement_score":0.0041614557,"about_ca_system_score_codex":0.0013009364,"about_ca_system_score_gemma":0.00133396,"threshold_uncertainty_score":0.02200818},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0065200524,0.00015130032,0.9912513,0.00016644545,0.000020013693,0.00014396742,0.00001321687,0.00037148758,0.0013621998],"genre_scores_gemma":[0.113990135,0.0003368181,0.88294935,0.0001343898,0.00003331619,0.0004944347,0.00008505114,0.00032694617,0.0016495473],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99353045,0.003534505,0.00038918856,0.0005291218,0.0016853047,0.00033150252],"domain_scores_gemma":[0.98523927,0.0091856625,0.0010162037,0.0033615641,0.0008967038,0.00030055246],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00829988,0.0012670133,0.00048751198,0.0011553162,0.0010010784,0.002031542,0.0020452237,0.00137844,0.0018809019],"category_scores_gemma":[0.021016568,0.0012143262,0.001303335,0.0005473081,0.004474854,0.004772458,0.003975008,0.0031645182,0.00048094982],"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.0002595204,0.00018609069,0.0016299908,0.00077193603,0.000116492025,0.0008118231,0.0076759825,0.12088175,0.030306907,0.6234585,0.0018355462,0.21206543],"study_design_scores_gemma":[0.00023912467,0.00070343737,0.00057624676,0.00061590504,0.000237048,0.0010685137,0.0006981185,0.21390365,0.053331118,0.6032836,0.12516566,0.0001775787],"about_ca_topic_score_codex":0.001668783,"about_ca_topic_score_gemma":0.0014435889,"teacher_disagreement_score":0.00829988,"about_ca_system_score_codex":0.0012807656,"about_ca_system_score_gemma":0.001891881,"threshold_uncertainty_score":0.04389447},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04414307,0.00006737479,0.947157,0.00017738676,0.000017422914,0.000091612674,0.00015940306,0.0070235245,0.0011631007],"genre_scores_gemma":[0.70763975,0.00007104892,0.28943238,0.00010313559,0.000017271901,0.0003476772,0.00036828403,0.00044985785,0.001570549],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99427235,0.0023267746,0.00030265935,0.0011528552,0.0014418733,0.0005034091],"domain_scores_gemma":[0.98570734,0.009539703,0.0009938348,0.0029071693,0.0006454775,0.00020642193],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004110144,0.0012032344,0.0013680109,0.0011939303,0.0010048164,0.002073938,0.0030718893,0.0011574368,0.0030382106],"category_scores_gemma":[0.01446165,0.00085752556,0.0019421902,0.0010767765,0.0026665651,0.0057231905,0.0045860424,0.001919272,0.00044967796],"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.00076939346,0.00025419274,0.005314853,0.00031195,0.00015793576,0.0003468758,0.0005115506,0.8060957,0.016133055,0.06827081,0.0016659793,0.10016764],"study_design_scores_gemma":[0.00005915072,0.000046990135,0.000132622,0.000011523448,0.000023446126,0.000029948014,0.000036109286,0.9609238,0.0077903364,0.030294988,0.00063646655,0.00001462311],"about_ca_topic_score_codex":0.0065926383,"about_ca_topic_score_gemma":0.01041502,"teacher_disagreement_score":0.0065926383,"about_ca_system_score_codex":0.0017008503,"about_ca_system_score_gemma":0.003593512,"threshold_uncertainty_score":0.0217368},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.058138162,0.0003233918,0.9317817,0.0005409568,0.000044738415,0.00022777643,0.00009322632,0.0017701603,0.007079979],"genre_scores_gemma":[0.36749235,0.00021467138,0.62791187,0.00034113927,0.00004089287,0.00024213268,0.00034206023,0.00025937957,0.0031554936],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99614304,0.0016169079,0.00020135347,0.00059267716,0.0011597583,0.00028630602],"domain_scores_gemma":[0.99084353,0.005640102,0.0004775997,0.0017249652,0.0011022607,0.00021158138],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029601,0.00093548384,0.0013605639,0.0011413879,0.0007882065,0.0015761639,0.0027325763,0.0014531652,0.0035218133],"category_scores_gemma":[0.013453605,0.0006637356,0.000736136,0.0014782689,0.0014789052,0.0028338982,0.0030392811,0.002631639,0.0009914968],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043072356,0.00055831997,0.005715359,0.00032180766,0.000109748595,0.0003912585,0.0003776714,0.27490354,0.01029374,0.082976244,0.004252265,0.61966944],"study_design_scores_gemma":[0.000033509594,0.00015955295,0.00039910286,0.000030671694,0.000031620944,0.000170081,0.000064284286,0.9225723,0.013341869,0.058837987,0.0043397737,0.00001928229],"about_ca_topic_score_codex":0.0018969128,"about_ca_topic_score_gemma":0.004055464,"teacher_disagreement_score":0.0035218133,"about_ca_system_score_codex":0.000987999,"about_ca_system_score_gemma":0.0016739873,"threshold_uncertainty_score":0.015654683},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06664697,0.0003160377,0.92252904,0.00023079095,0.00013298586,0.000109479064,0.00022176014,0.0061970935,0.0036160012],"genre_scores_gemma":[0.736893,0.00006956895,0.26068482,0.0001362463,0.000036572543,0.00009784688,0.0002244998,0.00038083104,0.0014766227],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9961981,0.000793421,0.00016792647,0.0004497461,0.0019761936,0.00041457728],"domain_scores_gemma":[0.9899187,0.005412287,0.00070806494,0.0022822095,0.0013646467,0.00031409808],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020946786,0.00062383583,0.0010377716,0.0017643026,0.0006782277,0.0018789396,0.0019429447,0.0008484259,0.005137042],"category_scores_gemma":[0.017390154,0.00043605664,0.0003969943,0.0010019041,0.0017342593,0.0025918717,0.0029210253,0.0014441932,0.00094243727],"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.0022765754,0.00027158926,0.012807237,0.00042418932,0.00011572623,0.0004092023,0.0004984905,0.27174795,0.04909331,0.16106278,0.00876074,0.49253216],"study_design_scores_gemma":[0.00009269707,0.00013259755,0.0004961911,0.000031673684,0.000014078831,0.00014894572,0.000048410595,0.9283032,0.025427628,0.04245275,0.002810913,0.00004095437],"about_ca_topic_score_codex":0.0022991267,"about_ca_topic_score_gemma":0.0016847566,"teacher_disagreement_score":0.005137042,"about_ca_system_score_codex":0.0014230371,"about_ca_system_score_gemma":0.002624194,"threshold_uncertainty_score":0.017185152},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039142877,0.004079635,0.7650148,0.034367386,0.0025008495,0.00036043927,0.00058364077,0.0031669221,0.15078342],"genre_scores_gemma":[0.70843226,0.00267043,0.2519577,0.0058330027,0.002349481,0.0007459197,0.0013970957,0.00152384,0.025090389],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98498803,0.0053714747,0.0011783787,0.0027809555,0.003984135,0.0016969948],"domain_scores_gemma":[0.9574881,0.031602968,0.0012419391,0.0065730973,0.002235373,0.0008585261],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0079437,0.0009693663,0.00166114,0.001879012,0.0023481762,0.007199467,0.0025165381,0.0047559966,0.017699188],"category_scores_gemma":[0.0834331,0.0015144504,0.0015662436,0.001995264,0.0098491255,0.02417618,0.007933012,0.00916999,0.002873151],"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.00011036893,0.000062748535,0.00032084002,0.00021250585,0.000038912916,0.00015071653,0.00039717928,0.0061325873,0.00064052903,0.96646065,0.005212092,0.020260861],"study_design_scores_gemma":[0.000024726918,0.000011063436,0.000027402564,0.000030965715,0.000010345699,0.000036425783,0.000065244494,0.012289507,0.0006053695,0.9814408,0.005448988,0.000009144905],"about_ca_topic_score_codex":0.002540792,"about_ca_topic_score_gemma":0.0024722598,"teacher_disagreement_score":0.017699188,"about_ca_system_score_codex":0.0024429986,"about_ca_system_score_gemma":0.003405764,"threshold_uncertainty_score":0.059209645},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01035334,0.00011887295,0.9261281,0.00026706935,0.00013926817,0.00017131031,0.0008346009,0.057456218,0.004531199],"genre_scores_gemma":[0.37750742,0.00037030297,0.5984683,0.0007076723,0.00013653345,0.0005493681,0.0026576186,0.009869783,0.009733019],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99696773,0.0008134603,0.00024278503,0.00051733834,0.0011780345,0.00028062135],"domain_scores_gemma":[0.9931852,0.003295965,0.0004938476,0.0019437294,0.00093986024,0.00014147082],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024694602,0.0015446168,0.0012952369,0.001276823,0.0008738946,0.002313664,0.0036758606,0.0014896635,0.01993782],"category_scores_gemma":[0.008611308,0.0014173737,0.002041014,0.001026654,0.00144745,0.004647913,0.0026598233,0.0028054884,0.0033086166],"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.00211216,0.000605447,0.00438598,0.0021293552,0.0004727331,0.0007173164,0.00034753958,0.41711578,0.050922614,0.101403266,0.06418898,0.35559878],"study_design_scores_gemma":[0.00030986435,0.00013731173,0.0002583442,0.00006966321,0.00010044139,0.000115834904,0.000026129688,0.92828655,0.028800631,0.02562365,0.016220804,0.000050738523],"about_ca_topic_score_codex":0.007044921,"about_ca_topic_score_gemma":0.013202623,"teacher_disagreement_score":0.01993782,"about_ca_system_score_codex":0.0015815498,"about_ca_system_score_gemma":0.004675716,"threshold_uncertainty_score":0.06669861},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015990076,0.009328432,0.09034767,0.004005243,0.0011748655,0.00007511818,0.00010239413,0.00030531394,0.8930619],"genre_scores_gemma":[0.2165033,0.015778674,0.08653724,0.0053021973,0.0023562275,0.00058790407,0.00047925094,0.00067388854,0.6717814],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990096,0.00027998706,0.000042268217,0.00020723105,0.00037044942,0.00009041209],"domain_scores_gemma":[0.998941,0.00048872334,0.00004956636,0.00027506016,0.0001462781,0.000099424185],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001021743,0.0008102823,0.0005185162,0.0011783964,0.0019614103,0.0056987456,0.0013946659,0.0013387391,0.022419238],"category_scores_gemma":[0.0028061713,0.00064052484,0.0005037642,0.0010896247,0.006279726,0.007087806,0.0018986182,0.0044817505,0.006717073],"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.0000024994818,0.000003795589,0.000008851702,0.000012441731,8.201533e-7,0.0000058751866,0.00012323953,0.00005915997,0.000059964685,0.99151456,0.0039166175,0.0042921295],"study_design_scores_gemma":[0.0000048424413,0.0000052581554,0.000026131498,0.000038194787,0.0000024492347,0.00005464012,0.000071820206,0.00040439417,0.00014113533,0.79324764,0.20599927,0.0000041089193],"about_ca_topic_score_codex":0.0023542081,"about_ca_topic_score_gemma":0.0030045444,"teacher_disagreement_score":0.022419238,"about_ca_system_score_codex":0.0023338154,"about_ca_system_score_gemma":0.0018406003,"threshold_uncertainty_score":0.07499987},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001689069,0.0036702685,0.060235135,0.0026007267,0.00045489144,0.00004256367,0.00029813996,0.0001832535,0.93082607],"genre_scores_gemma":[0.3347139,0.011140231,0.06996327,0.0027759937,0.0016898533,0.00043385074,0.0026192672,0.0005975353,0.57606614],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993492,0.00025071716,0.000031517367,0.00013345756,0.00018208446,0.000052996016],"domain_scores_gemma":[0.9995993,0.00018566892,0.000019114925,0.00009859458,0.00007321387,0.00002418993],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070439925,0.0008727288,0.0005332431,0.001718612,0.0015797783,0.005232687,0.00092256285,0.0011931862,0.02646497],"category_scores_gemma":[0.0015980867,0.00045186377,0.00046726366,0.0016517155,0.0069248355,0.006999118,0.0016940895,0.003184207,0.008543527],"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.0000012694354,0.0000021103704,0.000004864285,0.000010113532,5.384091e-7,0.000003504596,0.00006197358,0.000046307166,0.000030063014,0.9942947,0.002355682,0.0031887975],"study_design_scores_gemma":[0.0000022912418,0.000001998672,0.000019161496,0.000019628547,0.0000012048828,0.000025424737,0.00007548821,0.00019133877,0.00009861287,0.8730105,0.12655288,0.0000015785681],"about_ca_topic_score_codex":0.0011584437,"about_ca_topic_score_gemma":0.00094308757,"teacher_disagreement_score":0.02646497,"about_ca_system_score_codex":0.0019271886,"about_ca_system_score_gemma":0.00089165714,"threshold_uncertainty_score":0.08853412},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020158382,0.0015073955,0.9411346,0.0006297792,0.0005905292,0.00011677718,0.0005982534,0.017911438,0.03549549],"genre_scores_gemma":[0.08828183,0.0035502892,0.8044212,0.0009123542,0.00059959636,0.00061260856,0.0041727326,0.018631907,0.07881751],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974807,0.0007558036,0.00012504504,0.0004378592,0.001030376,0.00017021653],"domain_scores_gemma":[0.99784803,0.0009553388,0.00009014786,0.00063955475,0.00039914102,0.00006782508],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029731407,0.0016521307,0.00085196126,0.0012703708,0.0007062407,0.0022742937,0.002577071,0.0014754379,0.02670122],"category_scores_gemma":[0.005276737,0.001245689,0.0017492883,0.0010078897,0.0018709173,0.003933395,0.0023163876,0.0032889019,0.013527586],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021479504,0.00008649684,0.00020425094,0.0010834964,0.00007275586,0.00018226255,0.00043580058,0.01936348,0.011465994,0.50008625,0.105313875,0.36149064],"study_design_scores_gemma":[0.00014949837,0.0001414023,0.00029314522,0.00045993895,0.00007413371,0.00047029613,0.00006257962,0.09388461,0.035295635,0.36953613,0.49953535,0.0000971891],"about_ca_topic_score_codex":0.0011493077,"about_ca_topic_score_gemma":0.0007598016,"teacher_disagreement_score":0.02670122,"about_ca_system_score_codex":0.0011066556,"about_ca_system_score_gemma":0.0015527147,"threshold_uncertainty_score":0.089324474},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019460505,0.0021635538,0.93316674,0.0028458426,0.0006424398,0.00021965468,0.00053681695,0.0030539269,0.03791055],"genre_scores_gemma":[0.6377822,0.0030119484,0.31338596,0.0023186358,0.0013105216,0.00061232713,0.0018453087,0.001784032,0.03794903],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99603194,0.0017522487,0.0001755732,0.0006658233,0.0010588542,0.00031542237],"domain_scores_gemma":[0.98951143,0.007486524,0.00046793988,0.0012475898,0.00092592475,0.00036047242],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033039153,0.0011681013,0.0009042692,0.0016834578,0.0020160913,0.0035947554,0.0018439322,0.001770662,0.016685259],"category_scores_gemma":[0.009329093,0.0008834023,0.0015313092,0.0023813648,0.0036986277,0.005395153,0.0034336792,0.0048742956,0.0029028954],"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.0001528672,0.000052644762,0.00010517407,0.00040783954,0.000022794367,0.00009948065,0.00025689928,0.0051943557,0.0023489653,0.95220155,0.0057615964,0.033395838],"study_design_scores_gemma":[0.000037627036,0.000020464668,0.00003545087,0.000053647786,0.000018139648,0.00003311805,0.00001706064,0.009113816,0.0018376391,0.9754419,0.013371876,0.000019245412],"about_ca_topic_score_codex":0.0021045303,"about_ca_topic_score_gemma":0.0018754107,"teacher_disagreement_score":0.016685259,"about_ca_system_score_codex":0.0042152535,"about_ca_system_score_gemma":0.0035143925,"threshold_uncertainty_score":0.055817723},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044430148,0.00022577346,0.9513042,0.0005872129,0.00004937127,0.00012586203,0.00024303499,0.000921432,0.0021129758],"genre_scores_gemma":[0.79543424,0.00033143465,0.2021489,0.00021791745,0.00006895781,0.00021718342,0.00044796453,0.00018045827,0.00095296785],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98916095,0.0046293475,0.00069275685,0.0012254069,0.0033324107,0.0009591157],"domain_scores_gemma":[0.9738452,0.021526432,0.0014188746,0.001895449,0.0010038574,0.00031026392],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008128483,0.0013077529,0.0012898264,0.0014521014,0.001390217,0.0037226772,0.0022364021,0.0014979865,0.0022334673],"category_scores_gemma":[0.029727481,0.0011925135,0.0031867009,0.00097026397,0.004225548,0.0051461444,0.0043753413,0.0031984446,0.00018276474],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021437104,0.00007035854,0.002090459,0.00028597898,0.0001769733,0.00081530056,0.0005525495,0.8058213,0.0049877665,0.16785437,0.0006503047,0.016480256],"study_design_scores_gemma":[0.000044640845,0.0000340998,0.00014864339,0.000046728666,0.000044514072,0.00008085579,0.00009320558,0.83676064,0.00403728,0.15762372,0.0010639793,0.000021748616],"about_ca_topic_score_codex":0.008268993,"about_ca_topic_score_gemma":0.006796923,"teacher_disagreement_score":0.008268993,"about_ca_system_score_codex":0.002632693,"about_ca_system_score_gemma":0.002836379,"threshold_uncertainty_score":0.042988002},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07569308,0.00013448267,0.9189292,0.00026773018,0.000054198255,0.000116585914,0.00014436172,0.0011580901,0.0035022371],"genre_scores_gemma":[0.91720736,0.00012803802,0.07960168,0.000093017734,0.000026648046,0.00018090021,0.00018828557,0.00029107506,0.0022830344],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996759,0.0008927465,0.00020746638,0.0007280363,0.0009401806,0.00047262333],"domain_scores_gemma":[0.98474485,0.009896563,0.0014087083,0.001858208,0.0018489646,0.00024262228],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003723974,0.0008371821,0.0008095033,0.000784992,0.00084348826,0.0024873493,0.0021197845,0.001485535,0.0031785711],"category_scores_gemma":[0.017269697,0.0005898297,0.0014180952,0.0005187318,0.003897008,0.0031715187,0.0022021018,0.0017862761,0.00039770492],"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.00020741991,0.000067715606,0.0025311152,0.00025767979,0.00009469489,0.0005583569,0.00049625355,0.7635264,0.01354468,0.2026383,0.0005444149,0.0155330505],"study_design_scores_gemma":[0.00002162954,0.000035508434,0.00024182606,0.000022004586,0.000024792549,0.00006113084,0.000044980457,0.9202393,0.008844838,0.06932675,0.0011242365,0.000012921157],"about_ca_topic_score_codex":0.0138400765,"about_ca_topic_score_gemma":0.0101943975,"teacher_disagreement_score":0.0138400765,"about_ca_system_score_codex":0.0027681515,"about_ca_system_score_gemma":0.0030515941,"threshold_uncertainty_score":0.027519047},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006283009,0.000067376284,0.9823989,0.00009887771,0.000048977665,0.000069983726,0.0004778569,0.0051653357,0.0053898226],"genre_scores_gemma":[0.2445652,0.00034020602,0.7360747,0.00026631448,0.00004682948,0.00030665853,0.0019949647,0.0023374842,0.014067717],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990577,0.00021789169,0.00008373694,0.00013602972,0.00039813505,0.00010651903],"domain_scores_gemma":[0.9992481,0.000325305,0.00006147938,0.00019878028,0.00013574964,0.000030490659],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011657409,0.0007114659,0.000619078,0.0006797693,0.00064588955,0.0022624086,0.001980973,0.0009937244,0.0067518163],"category_scores_gemma":[0.0018613471,0.000877845,0.0017366309,0.0005345879,0.0014743122,0.0018320063,0.0015365939,0.0014800662,0.0017164528],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002948433,0.00009637364,0.001248182,0.00046535276,0.0000857375,0.00046981467,0.0010130678,0.22404127,0.015718108,0.6865461,0.0066123917,0.063408814],"study_design_scores_gemma":[0.00008502145,0.00009144673,0.00029151147,0.00011998628,0.00010790935,0.00020724852,0.00023213455,0.67911196,0.025220003,0.21923605,0.07523802,0.00005872881],"about_ca_topic_score_codex":0.0087659815,"about_ca_topic_score_gemma":0.011408719,"teacher_disagreement_score":0.0087659815,"about_ca_system_score_codex":0.0007452477,"about_ca_system_score_gemma":0.0014536746,"threshold_uncertainty_score":0.02258706},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01111479,0.0073378677,0.9183724,0.0025204131,0.0013671047,0.00016704532,0.0005294023,0.0019344722,0.056656476],"genre_scores_gemma":[0.25660977,0.011558477,0.5971296,0.0024102388,0.0008747161,0.00027307298,0.0026228623,0.0014083429,0.12711297],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995277,0.000115170486,0.000023234867,0.00010889823,0.00018486094,0.000040207633],"domain_scores_gemma":[0.999278,0.00049593986,0.000022996303,0.000057124882,0.0001224621,0.000023501421],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008964442,0.00041001415,0.00027888687,0.00061334216,0.00028381732,0.0010738847,0.00055288634,0.00050781516,0.014011239],"category_scores_gemma":[0.0021039376,0.00028068907,0.00052105886,0.0011272164,0.00065987115,0.001340494,0.0006890197,0.0009785701,0.0024242604],"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.00015248763,0.00007635765,0.00040033777,0.00076736783,0.00004684913,0.0003588673,0.00034885792,0.01596717,0.01741336,0.4882926,0.07372406,0.40245166],"study_design_scores_gemma":[0.000085425236,0.00007594495,0.00063427794,0.00042054072,0.000057379093,0.0007155689,0.00012150408,0.089434266,0.0337534,0.4677232,0.40693521,0.00004329231],"about_ca_topic_score_codex":0.0018069192,"about_ca_topic_score_gemma":0.0017765049,"teacher_disagreement_score":0.014011239,"about_ca_system_score_codex":0.00073083484,"about_ca_system_score_gemma":0.00079248287,"threshold_uncertainty_score":0.04687226},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08566735,0.00015224075,0.90563077,0.00033158387,0.00008373126,0.000100338664,0.00013141081,0.0026270137,0.0052755564],"genre_scores_gemma":[0.80241674,0.0001290278,0.19277632,0.00010716202,0.00003429552,0.00014791926,0.0002542348,0.0003723342,0.003761909],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99697137,0.0009710446,0.0002412874,0.0003938005,0.001039458,0.00038300708],"domain_scores_gemma":[0.9913796,0.0064476645,0.00046151047,0.0011919413,0.0003643426,0.00015495889],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00299992,0.0008040231,0.00095174595,0.0008338971,0.00062401243,0.0034239143,0.002234673,0.0014446175,0.0031497618],"category_scores_gemma":[0.011215038,0.00088306866,0.001983856,0.0009598987,0.0028327235,0.0054295072,0.0036751758,0.0030938867,0.0005799613],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000659384,0.00009817127,0.000924611,0.00023290684,0.00012476143,0.00037240598,0.0005743034,0.4741593,0.015672913,0.46312603,0.0014553784,0.04259992],"study_design_scores_gemma":[0.000062363055,0.00005398102,0.0000834533,0.000023220979,0.000034831202,0.000053809657,0.00005711557,0.7738475,0.0104172975,0.21397354,0.0013676848,0.000025242938],"about_ca_topic_score_codex":0.0022224288,"about_ca_topic_score_gemma":0.002726779,"teacher_disagreement_score":0.0034239143,"about_ca_system_score_codex":0.0016593531,"about_ca_system_score_gemma":0.0014941045,"threshold_uncertainty_score":0.015865266},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025655344,0.00049066276,0.9590935,0.00013180204,0.00010308624,0.00014383902,0.00013512709,0.012110515,0.0021359853],"genre_scores_gemma":[0.7692829,0.0002412273,0.22632042,0.0002474502,0.000081468934,0.00022215355,0.0002962125,0.0007033611,0.0026048883],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977701,0.0005402088,0.00016473554,0.00050975906,0.0008027953,0.0002124643],"domain_scores_gemma":[0.9956049,0.0018518924,0.0006007352,0.001390299,0.00041715614,0.0001349747],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014279705,0.00096789113,0.0007332545,0.0010787947,0.00042224975,0.0011072572,0.0018449761,0.000763572,0.0046432274],"category_scores_gemma":[0.007676444,0.0003767456,0.0007664399,0.0004575313,0.0010486341,0.0020327275,0.0014681353,0.0015410476,0.000617657],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002325353,0.00045754624,0.010089978,0.0009616436,0.00015382204,0.0015887865,0.0011183574,0.10552693,0.14593923,0.07800836,0.008576367,0.6452536],"study_design_scores_gemma":[0.00012391592,0.0006533963,0.0019518011,0.00012668561,0.0001317254,0.00088406535,0.0000940534,0.8374112,0.11157413,0.031093707,0.015867915,0.000087328626],"about_ca_topic_score_codex":0.0011545407,"about_ca_topic_score_gemma":0.0013443513,"teacher_disagreement_score":0.0046432274,"about_ca_system_score_codex":0.0007041496,"about_ca_system_score_gemma":0.0010824106,"threshold_uncertainty_score":0.015533149},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009753532,0.000581634,0.9758748,0.00065040844,0.00023416891,0.00008676116,0.0001703097,0.00096355233,0.011684799],"genre_scores_gemma":[0.7071244,0.0013025041,0.2524553,0.0011280663,0.00042244114,0.00043314422,0.00087417726,0.0011435514,0.03511641],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979108,0.00049985404,0.00012215374,0.00058820494,0.0005268686,0.00035204188],"domain_scores_gemma":[0.98869497,0.0077891857,0.0006645608,0.0015501841,0.000871176,0.0004299112],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029713488,0.0012090073,0.0014676074,0.0010935351,0.0016453422,0.0024230555,0.002642819,0.002306298,0.018667055],"category_scores_gemma":[0.023872007,0.00071941235,0.0013417987,0.0008568085,0.0029813757,0.0056608156,0.006609188,0.0033062245,0.0020665182],"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.0009454475,0.00009055796,0.0011790295,0.0006659344,0.00008673995,0.00040475297,0.00048829045,0.26917768,0.005625058,0.6031323,0.010315272,0.10788903],"study_design_scores_gemma":[0.000057197947,0.0000957572,0.0001382679,0.000111598994,0.000030600822,0.00008420552,0.000061912586,0.5685962,0.0017001779,0.42433614,0.0047586607,0.000029323633],"about_ca_topic_score_codex":0.0037493848,"about_ca_topic_score_gemma":0.0041360925,"teacher_disagreement_score":0.018667055,"about_ca_system_score_codex":0.0018956512,"about_ca_system_score_gemma":0.0020930902,"threshold_uncertainty_score":0.06244749},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014064362,0.0060156146,0.5880264,0.0024216839,0.00047719086,0.000070426744,0.0006587206,0.0008730084,0.3873926],"genre_scores_gemma":[0.61493325,0.0075573684,0.20171776,0.0010169559,0.0009900313,0.00034798932,0.0015502846,0.00064494275,0.17124131],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995202,0.00011721735,0.000024418956,0.00009462679,0.00018070822,0.00006281425],"domain_scores_gemma":[0.9995778,0.00019797811,0.000035071844,0.00008876465,0.00007719056,0.000023245519],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051692623,0.0011727783,0.0007055175,0.0011349801,0.0005658261,0.0023944199,0.0015767441,0.0012351872,0.013540121],"category_scores_gemma":[0.0014209801,0.00062579266,0.0010898603,0.000972341,0.0019785047,0.003626684,0.00066426524,0.0024141897,0.0027347226],"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.0000048134475,0.000003504995,0.000010528788,0.000021357437,0.000002174324,0.000017068605,0.00004403342,0.0025644049,0.00035606322,0.9900703,0.0014133276,0.0054923436],"study_design_scores_gemma":[0.0000063382745,0.0000058816454,0.000020697174,0.000021771442,0.000003104397,0.000035434245,0.000014986901,0.009894412,0.0004098506,0.9690138,0.020567512,0.000006094907],"about_ca_topic_score_codex":0.0021547033,"about_ca_topic_score_gemma":0.002027472,"teacher_disagreement_score":0.013540121,"about_ca_system_score_codex":0.0022644384,"about_ca_system_score_gemma":0.0005641564,"threshold_uncertainty_score":0.045296192},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021857291,0.00004226894,0.97569907,0.000046996378,0.000014940211,0.000025556023,0.000022889468,0.00043182462,0.0018590868],"genre_scores_gemma":[0.9243898,0.00005828774,0.07412315,0.000027034983,0.0000105945965,0.00007945235,0.000055171196,0.00003825389,0.0012183065],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99971646,0.000036591453,0.000016768678,0.00007746544,0.00011872003,0.000034003773],"domain_scores_gemma":[0.9996704,0.0001469214,0.0000564644,0.00006796619,0.00004280793,0.000015416676],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037704743,0.0005829884,0.00037581046,0.00017305501,0.00024324814,0.00051640935,0.00065132347,0.00026266996,0.001534931],"category_scores_gemma":[0.0008470168,0.00020361909,0.00047001097,0.00015128784,0.00053874997,0.00047579376,0.0008062092,0.0006688757,0.00018397077],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007409874,0.000034679273,0.00022240446,0.000094746436,0.00002029831,0.00008222722,0.000085449465,0.9102975,0.03292423,0.0193497,0.00031979926,0.036495026],"study_design_scores_gemma":[0.000006826869,0.00005452843,0.000044042474,0.0000040529717,0.0000035238397,0.000008274042,0.000005306857,0.99155337,0.0051817326,0.0027181504,0.00041715582,0.0000030416036],"about_ca_topic_score_codex":0.001316191,"about_ca_topic_score_gemma":0.0015113062,"teacher_disagreement_score":0.001534931,"about_ca_system_score_codex":0.00045967932,"about_ca_system_score_gemma":0.0006069957,"threshold_uncertainty_score":0.0051348805},"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":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010362538,0.0028760924,0.012281069,0.00519628,0.0009211649,0.000024221621,0.00012829731,0.00011198084,0.9774245],"genre_scores_gemma":[0.10851428,0.004499447,0.0070175864,0.0059571513,0.0018384997,0.00017353822,0.0005129854,0.00051162747,0.87097484],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99898547,0.00033292267,0.00002793643,0.00019916592,0.00034369229,0.000110718465],"domain_scores_gemma":[0.9992505,0.00035884455,0.000031233896,0.00014320399,0.00017343106,0.000042818076],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009439686,0.00068641966,0.000545068,0.0010576688,0.001901061,0.0039867642,0.00090372784,0.002038692,0.10000191],"category_scores_gemma":[0.0044273753,0.00031817422,0.00060042564,0.0008459198,0.002803944,0.0053926283,0.0021664535,0.0037402126,0.023781125],"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.000009767687,0.000010278982,0.000026396103,0.000035986963,0.0000025477082,0.000015910988,0.00013653205,0.00011320286,0.000079201636,0.94498175,0.03992753,0.0146608455],"study_design_scores_gemma":[0.000007316186,0.000006615274,0.00009674932,0.00012806633,0.000004750497,0.000038067836,0.000121308825,0.00027725368,0.00020307637,0.5661014,0.4330103,0.0000051415846],"about_ca_topic_score_codex":0.0015010093,"about_ca_topic_score_gemma":0.0014231278,"teacher_disagreement_score":0.10000191,"about_ca_system_score_codex":0.0030676255,"about_ca_system_score_gemma":0.001055471,"threshold_uncertainty_score":0.3345397},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007662212,0.00022262058,0.9736656,0.0010662365,0.00007388461,0.00005184994,0.00011203635,0.00042112134,0.016724514],"genre_scores_gemma":[0.5077503,0.0006848505,0.46765718,0.00086655776,0.00025031457,0.00049200095,0.00032231578,0.0003250356,0.021651477],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99922085,0.0002228775,0.00003962132,0.0001364446,0.00029999,0.00008023039],"domain_scores_gemma":[0.99938965,0.00018738661,0.000053332395,0.00016714993,0.00014191419,0.000060588987],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012525677,0.0005059781,0.00043433663,0.0009250023,0.0008053903,0.0027156505,0.00159633,0.0012868176,0.0042754],"category_scores_gemma":[0.0016446969,0.00048547014,0.0010063498,0.00068370206,0.003931988,0.004102005,0.0017400899,0.0030340827,0.00095598365],"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.0000055006803,0.000008270708,0.000033855198,0.00001194203,0.00000232109,0.0000333424,0.00012681838,0.0039346945,0.0005141391,0.9937568,0.00020271938,0.0013696235],"study_design_scores_gemma":[0.000012810721,0.000022054639,0.000047279562,0.000022086948,0.0000056672384,0.00004655859,0.000058016805,0.053688377,0.0009618223,0.9340675,0.0110597005,0.000008064878],"about_ca_topic_score_codex":0.0023442674,"about_ca_topic_score_gemma":0.002134829,"teacher_disagreement_score":0.0042754,"about_ca_system_score_codex":0.0015408305,"about_ca_system_score_gemma":0.0013362373,"threshold_uncertainty_score":0.014302671},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24958077,0.0023610303,0.7159,0.010954611,0.00019415871,0.00046647288,0.0012801265,0.0008682044,0.018394573],"genre_scores_gemma":[0.7690903,0.0012941739,0.21382415,0.001289081,0.000404124,0.0004014493,0.001758053,0.0002315688,0.011707116],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99222577,0.0027974772,0.0006173961,0.0021803516,0.0012394856,0.0009394866],"domain_scores_gemma":[0.9600389,0.036011904,0.0012223939,0.0010216611,0.001165478,0.00053954456],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0073051983,0.0008577944,0.0011528345,0.0011880016,0.0019919872,0.0049692756,0.0020568997,0.0019632343,0.0069577047],"category_scores_gemma":[0.020897856,0.0011108705,0.003253617,0.0010979171,0.005674647,0.008924419,0.004320456,0.0070728078,0.00068352616],"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.0005025725,0.00029480454,0.0023406732,0.0008853178,0.0002505228,0.00034834063,0.001203413,0.057498906,0.0035317838,0.88176686,0.00504692,0.04632979],"study_design_scores_gemma":[0.00010883588,0.000064846725,0.00033128096,0.00005127323,0.0000709382,0.00009451767,0.0001936091,0.07070291,0.003052126,0.9226341,0.0026531483,0.000042391584],"about_ca_topic_score_codex":0.0039760806,"about_ca_topic_score_gemma":0.0039843586,"teacher_disagreement_score":0.0073051983,"about_ca_system_score_codex":0.004773929,"about_ca_system_score_gemma":0.0031244222,"threshold_uncertainty_score":0.03863406},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44392458,0.0004458794,0.5187839,0.0004603195,0.00019742362,0.00046612308,0.0025073101,0.0068845414,0.026329916],"genre_scores_gemma":[0.93901247,0.00012203866,0.054023776,0.000069490714,0.000009256624,0.00026176052,0.0012234935,0.00026210924,0.0050154952],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998684,0.0003499118,0.00009958562,0.00018898121,0.00053953694,0.00013803868],"domain_scores_gemma":[0.99782205,0.0012179473,0.00025430435,0.00026827917,0.00036644243,0.00007096674],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007396054,0.001146888,0.00039410213,0.0005579556,0.00028159018,0.00083706283,0.0012282231,0.0011802871,0.0047243475],"category_scores_gemma":[0.0033296992,0.0002937896,0.000658791,0.00022399331,0.00042224396,0.00065512076,0.00045669082,0.0008120783,0.0005387273],"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.0015496396,0.0004941577,0.0037985859,0.0010134489,0.00011932473,0.0013450854,0.0007270874,0.85748845,0.0654236,0.031226946,0.002556402,0.03425728],"study_design_scores_gemma":[0.0002849872,0.000739221,0.0013738362,0.00006998346,0.00009469557,0.00030494528,0.00010973957,0.9215575,0.05612641,0.0039081154,0.015390622,0.00004002923],"about_ca_topic_score_codex":0.0035238774,"about_ca_topic_score_gemma":0.0032873438,"teacher_disagreement_score":0.0047243475,"about_ca_system_score_codex":0.00055851165,"about_ca_system_score_gemma":0.0007592215,"threshold_uncertainty_score":0.01580453},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09424745,0.006164929,0.17153668,0.017442927,0.02623155,0.0026756318,0.16486493,0.12362336,0.3932126],"genre_scores_gemma":[0.25835255,0.0015483015,0.14766318,0.0049348935,0.0019974334,0.0023045053,0.38044694,0.036322642,0.16642955],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9670776,0.007140775,0.0013383682,0.0030694187,0.017894467,0.0034793746],"domain_scores_gemma":[0.9327696,0.016147673,0.0017914502,0.018336726,0.025647126,0.0053074234],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.026384315,0.0026856202,0.0017627002,0.005952384,0.003740003,0.012320133,0.0049367035,0.004163505,0.06295916],"category_scores_gemma":[0.04131593,0.00091566565,0.002367787,0.0036370025,0.0025554844,0.0060948404,0.008365132,0.005161822,0.04791172],"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.0025232644,0.00076333486,0.0034282652,0.00088665297,0.0001381156,0.00033024608,0.000321315,0.006499574,0.004299442,0.032259297,0.8742803,0.07427027],"study_design_scores_gemma":[0.0008442702,0.0015186324,0.0050899433,0.00049341936,0.00013506938,0.00085699034,0.0010386286,0.031496227,0.039036956,0.03695839,0.88227594,0.00025555122],"about_ca_topic_score_codex":0.009884736,"about_ca_topic_score_gemma":0.011269022,"teacher_disagreement_score":0.06295916,"about_ca_system_score_codex":0.005271978,"about_ca_system_score_gemma":0.0067266994,"threshold_uncertainty_score":0.21061939},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.061048545,0.00005121193,0.9344028,0.00030056297,0.000046816178,0.0002273321,0.00036494885,0.0016240907,0.0019337293],"genre_scores_gemma":[0.76992536,0.00011594157,0.22625306,0.00020016405,0.000028227265,0.0004778537,0.0008499038,0.00037046656,0.0017789061],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99238974,0.0020073634,0.0006721664,0.0010230803,0.00317142,0.00073613256],"domain_scores_gemma":[0.9807138,0.012840772,0.0018097599,0.002355608,0.0019787368,0.00030130535],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00594704,0.0009706052,0.0008504956,0.00091166294,0.0011372172,0.0026333842,0.0022282305,0.001331481,0.002959432],"category_scores_gemma":[0.022076508,0.0007793274,0.0027988222,0.000878743,0.0032863568,0.0032749386,0.0026505159,0.0024461558,0.0003390405],"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.0004888613,0.00021921397,0.0028814445,0.0003764436,0.0001636737,0.0010680204,0.0009533152,0.61268353,0.021316502,0.33588746,0.001368438,0.022593059],"study_design_scores_gemma":[0.000092598355,0.0000710632,0.00016984,0.000036032965,0.000044424134,0.000084619955,0.00012795962,0.91385347,0.019664949,0.06383374,0.0019909772,0.00003047411],"about_ca_topic_score_codex":0.0109497085,"about_ca_topic_score_gemma":0.009184274,"teacher_disagreement_score":0.0109497085,"about_ca_system_score_codex":0.002834563,"about_ca_system_score_gemma":0.005006898,"threshold_uncertainty_score":0.031451344},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.072940476,0.0003521665,0.92107373,0.0001419608,0.000020537704,0.00006596479,0.00017693729,0.00037346763,0.004854865],"genre_scores_gemma":[0.774611,0.00048135294,0.2218378,0.000057883422,0.000032684427,0.00016360273,0.0002778852,0.000093012,0.0024447218],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99876666,0.00030776966,0.00009747149,0.00026180502,0.00048471728,0.00008160266],"domain_scores_gemma":[0.99762243,0.0016398915,0.0002764455,0.00024823632,0.00015577891,0.00005715874],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013742959,0.0005969142,0.00040330697,0.00060576963,0.00028075118,0.0012928939,0.0010694014,0.0004031759,0.0010211383],"category_scores_gemma":[0.004683087,0.00031770198,0.00079342356,0.00066698604,0.0012711193,0.0018531431,0.000923918,0.0010022207,0.000102149155],"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.00022544901,0.00008190623,0.0020670684,0.00035974942,0.00006300989,0.00089573953,0.0006481106,0.47176987,0.05577363,0.42039174,0.0003210042,0.047402654],"study_design_scores_gemma":[0.000023666067,0.000061445906,0.00025502476,0.000032068718,0.000035545752,0.00023528129,0.000053413238,0.83201045,0.013059647,0.15105686,0.0031601707,0.000016496042],"about_ca_topic_score_codex":0.0010651138,"about_ca_topic_score_gemma":0.0008524176,"teacher_disagreement_score":0.0013742959,"about_ca_system_score_codex":0.0011399215,"about_ca_system_score_gemma":0.0005742706,"threshold_uncertainty_score":0.0082707405},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0043074195,0.000078811514,0.9605464,0.0002842882,0.000052805637,0.0001599655,0.0006016292,0.014627485,0.01934122],"genre_scores_gemma":[0.22418307,0.00023424371,0.75236267,0.00030456766,0.00007056565,0.00044042504,0.002878079,0.0029341849,0.016592262],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981027,0.00038320685,0.00016332071,0.0003265444,0.0007587224,0.0002654562],"domain_scores_gemma":[0.9974995,0.0008022539,0.00018939775,0.00091084524,0.00048588906,0.00011205319],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019843131,0.0010962924,0.0004937619,0.0010449034,0.0009170081,0.0026376068,0.0027103722,0.0014289062,0.027941113],"category_scores_gemma":[0.005795365,0.0006183986,0.0011750255,0.0007367897,0.0022956892,0.003636201,0.0022828826,0.001926642,0.006038108],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000502098,0.00014738379,0.0015308561,0.0004991967,0.000068447865,0.0006247456,0.0009057851,0.18254708,0.02811574,0.43730754,0.042005986,0.30574512],"study_design_scores_gemma":[0.00008735343,0.00013705688,0.0005818341,0.00013967401,0.000041812702,0.000269797,0.00015451187,0.6807195,0.051875617,0.14128357,0.124617755,0.00009150406],"about_ca_topic_score_codex":0.01329574,"about_ca_topic_score_gemma":0.011174526,"teacher_disagreement_score":0.027941113,"about_ca_system_score_codex":0.0016745398,"about_ca_system_score_gemma":0.0026806234,"threshold_uncertainty_score":0.0934723},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009669255,0.000046989055,0.98933464,0.000053638934,0.000012029558,0.000021990778,0.000011906749,0.00020340714,0.0006462068],"genre_scores_gemma":[0.75080687,0.00015395331,0.24762571,0.00009265992,0.000031614283,0.00014501522,0.0000940023,0.00013904915,0.0009112302],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9964994,0.00095649005,0.0001927004,0.00066160684,0.0014139438,0.00027586214],"domain_scores_gemma":[0.9932916,0.0039449357,0.0006941378,0.0014274446,0.0005525503,0.00008938843],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035143127,0.00080575224,0.00085183873,0.0006356779,0.0004647246,0.0011456307,0.0012770364,0.0008189888,0.001303402],"category_scores_gemma":[0.013461441,0.00056988373,0.0012699158,0.00030728398,0.0023302566,0.00223887,0.0022563771,0.0018212091,0.00021146414],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008737249,0.000033360287,0.0006439935,0.00013273458,0.000036775567,0.00007655292,0.0002282329,0.71016556,0.009061762,0.24944021,0.00029560018,0.029797781],"study_design_scores_gemma":[0.000014960141,0.00004838906,0.000083389015,0.000014023372,0.000010747901,0.000026039865,0.00001199644,0.9108505,0.0064776307,0.0811829,0.0012686539,0.000010723554],"about_ca_topic_score_codex":0.0011211043,"about_ca_topic_score_gemma":0.0010410785,"teacher_disagreement_score":0.0035143127,"about_ca_system_score_codex":0.001093931,"about_ca_system_score_gemma":0.0015468606,"threshold_uncertainty_score":0.018585742},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007051299,0.000059148333,0.9861937,0.0001503681,0.000027558573,0.000060266288,0.00012005597,0.005386319,0.00095133175],"genre_scores_gemma":[0.21629883,0.000104627296,0.77724695,0.0003551943,0.000045703833,0.00024930126,0.00057189184,0.0024447248,0.0026827138],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99687994,0.0010894078,0.00021145404,0.00059374946,0.00095877354,0.00026677016],"domain_scores_gemma":[0.98974437,0.0062655346,0.00037009426,0.0025172504,0.00092498556,0.00017769616],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035386262,0.0009131313,0.0008432158,0.00084769254,0.0007024431,0.0014814226,0.0028529344,0.0015165211,0.0051929094],"category_scores_gemma":[0.018090418,0.0010423423,0.0015297286,0.0007291269,0.0023447804,0.003694425,0.003641792,0.0038196142,0.0018156638],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005652127,0.00031109105,0.0045625754,0.00087008084,0.00015702502,0.00037639507,0.0010156659,0.24111463,0.026745267,0.27239215,0.015067453,0.43682238],"study_design_scores_gemma":[0.000044128068,0.00005709431,0.00015751441,0.000051933574,0.000043136642,0.00011649383,0.000049971764,0.7929521,0.015059828,0.18633832,0.005103501,0.000025939944],"about_ca_topic_score_codex":0.0019840053,"about_ca_topic_score_gemma":0.004740565,"teacher_disagreement_score":0.0051929094,"about_ca_system_score_codex":0.0011613833,"about_ca_system_score_gemma":0.0025509985,"threshold_uncertainty_score":0.01871425},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003338599,0.00030985352,0.9259783,0.0025369516,0.00035232262,0.00014631504,0.00014639572,0.0012548303,0.06593647],"genre_scores_gemma":[0.35673127,0.0010274821,0.5677276,0.0017787202,0.00082604773,0.0009517013,0.0005196737,0.0016964439,0.068741076],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99498415,0.0018695196,0.00026793362,0.00043268796,0.002085228,0.00036051674],"domain_scores_gemma":[0.9959304,0.002084266,0.00009375084,0.0013343723,0.00045582379,0.00010146515],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034701957,0.0009591632,0.0011695755,0.0013055296,0.0024624004,0.0045590405,0.002625752,0.00197429,0.013218704],"category_scores_gemma":[0.00851468,0.0013934624,0.002221954,0.0015518301,0.007105354,0.0075696185,0.004971268,0.0065906276,0.0027701436],"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.000011036871,0.000014732672,0.000015391412,0.000037631024,0.0000048618695,0.000023917592,0.00014511908,0.0009573157,0.0004313565,0.9883342,0.0014353943,0.008588957],"study_design_scores_gemma":[0.000014274927,0.000014018557,0.000020163077,0.000016638021,0.000014412704,0.00004140609,0.00004208759,0.008430039,0.0012596942,0.974329,0.015803829,0.000014576798],"about_ca_topic_score_codex":0.0015673155,"about_ca_topic_score_gemma":0.0027868992,"teacher_disagreement_score":0.013218704,"about_ca_system_score_codex":0.0020867744,"about_ca_system_score_gemma":0.0023245001,"threshold_uncertainty_score":0.044220984},"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":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0088723805,0.0009438104,0.8985001,0.001665512,0.00091763615,0.0004468243,0.002865314,0.034907877,0.05088054],"genre_scores_gemma":[0.17523703,0.0012653971,0.7780542,0.0028519032,0.0005009181,0.0006041275,0.0063052564,0.005369415,0.029811805],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99707437,0.00042946677,0.00022209756,0.0005996188,0.001182567,0.0004918802],"domain_scores_gemma":[0.997259,0.0011594604,0.00018591348,0.0005671966,0.00067709875,0.00015125444],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002123442,0.0010539367,0.0008420592,0.0020740791,0.0011287675,0.003503001,0.003761917,0.0017639794,0.02002615],"category_scores_gemma":[0.006947459,0.00090724014,0.002258467,0.00113935,0.0016279201,0.0063821734,0.0027415415,0.0034308722,0.0047411816],"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.0005807695,0.0003801875,0.0032412622,0.0011616701,0.00012698614,0.0013780067,0.00031520904,0.021869216,0.009542109,0.48802853,0.09677736,0.3765987],"study_design_scores_gemma":[0.00025523562,0.00020748422,0.00088632863,0.00038264864,0.000206649,0.0022234432,0.00008751563,0.14119002,0.016932996,0.3449261,0.49254414,0.00015751552],"about_ca_topic_score_codex":0.005395296,"about_ca_topic_score_gemma":0.004697253,"teacher_disagreement_score":0.02002615,"about_ca_system_score_codex":0.0015470284,"about_ca_system_score_gemma":0.002590293,"threshold_uncertainty_score":0},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0061204317,0.00018795376,0.98696005,0.00018571143,0.000059337013,0.00013005923,0.00022750346,0.0040418934,0.0020869724],"genre_scores_gemma":[0.3076414,0.00050052913,0.6856936,0.00044089786,0.000094538744,0.00035340953,0.0013027095,0.00095000456,0.003022862],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99650466,0.0007247011,0.00036859684,0.0006550177,0.0015080709,0.00023889584],"domain_scores_gemma":[0.9883471,0.006838471,0.0012927622,0.001670564,0.0016657356,0.00018543402],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002062981,0.0013952047,0.00057565543,0.00223441,0.0006384623,0.002147503,0.0016380294,0.0012730949,0.0046607475],"category_scores_gemma":[0.015397203,0.00060434407,0.0017907378,0.00093719177,0.0019695172,0.0037153352,0.0018457278,0.0025371742,0.0009964453],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00058636814,0.00027990204,0.0070215696,0.0014298664,0.00018287606,0.002667886,0.001513951,0.14642411,0.08626888,0.40392116,0.008895095,0.34080833],"study_design_scores_gemma":[0.00007837001,0.00021598821,0.0005499779,0.00025959525,0.00009624556,0.0011436443,0.00016552939,0.7455248,0.074032396,0.14570202,0.032141764,0.000089678986],"about_ca_topic_score_codex":0.0030746975,"about_ca_topic_score_gemma":0.0030725962,"teacher_disagreement_score":0.0046607475,"about_ca_system_score_codex":0.0014728514,"about_ca_system_score_gemma":0.0021160638,"threshold_uncertainty_score":0.0155918},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011408123,0.00006010861,0.99787664,0.000047205845,0.000011529335,0.000030972024,0.000032557982,0.0004659619,0.00033415863],"genre_scores_gemma":[0.2699105,0.0005390887,0.7268924,0.00014808054,0.000101269055,0.0006033078,0.00035668613,0.00035597314,0.0010926503],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99586064,0.0014541575,0.00031925266,0.00049669965,0.0015550107,0.00031425906],"domain_scores_gemma":[0.99024093,0.005999399,0.0009159326,0.0018344237,0.0008464338,0.00016294407],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0060390895,0.0016275297,0.0021117467,0.0027663223,0.0010967541,0.0027675838,0.0033772478,0.0014969619,0.0017117352],"category_scores_gemma":[0.013335447,0.0011547656,0.0038655645,0.0015313041,0.003511989,0.0033412804,0.0021719104,0.0029729428,0.00044503913],"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.000031603213,0.00008554574,0.00092276867,0.00012708783,0.00013374671,0.00011497252,0.00008041561,0.6930826,0.0024676102,0.28359473,0.0005842454,0.018774675],"study_design_scores_gemma":[0.000009232438,0.00002064751,0.00008766539,0.00001844368,0.000026584717,0.00002349844,0.000009480575,0.91121006,0.00078154984,0.0869838,0.0008159332,0.000013078128],"about_ca_topic_score_codex":0.009428974,"about_ca_topic_score_gemma":0.00873836,"teacher_disagreement_score":0.009428974,"about_ca_system_score_codex":0.0016411453,"about_ca_system_score_gemma":0.006057998,"threshold_uncertainty_score":0.031938076},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8313771,0.0064256485,0.0428154,0.0015649083,0.00016533746,0.0008370948,0.0149601195,0.002300593,0.09955384],"genre_scores_gemma":[0.93727696,0.0021600542,0.026700525,0.00019678613,0.00009140982,0.00040914485,0.019129902,0.00091177574,0.0131235495],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9863477,0.0026318522,0.0010996772,0.00070084934,0.008253768,0.0009662265],"domain_scores_gemma":[0.9042319,0.061522976,0.005788367,0.008031172,0.019255035,0.0011706015],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0074978275,0.0005760808,0.0008103058,0.022946358,0.0014557414,0.005689232,0.0015683158,0.0010846474,0.004696415],"category_scores_gemma":[0.08919588,0.00039499358,0.0011802994,0.02598443,0.0014864936,0.007462854,0.002311036,0.0009555288,0.001628262],"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.0022397963,0.0011902356,0.17749052,0.004205859,0.000757419,0.0027857574,0.007811951,0.03848867,0.009983362,0.37694287,0.034059703,0.34404394],"study_design_scores_gemma":[0.00024560298,0.0007169643,0.20844725,0.0015919516,0.0005397233,0.0054153535,0.012356228,0.3559193,0.02333654,0.16878116,0.22222878,0.0004211858],"about_ca_topic_score_codex":0.010961723,"about_ca_topic_score_gemma":0.006437065,"teacher_disagreement_score":0.022946358,"about_ca_system_score_codex":0.0025252216,"about_ca_system_score_gemma":0.0025693083,"threshold_uncertainty_score":0.039652824},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00067518256,0.0062311552,0.6274278,0.0017828783,0.0012343808,0.00023801017,0.0010269613,0.0046305307,0.35675314],"genre_scores_gemma":[0.03871019,0.009021423,0.34486467,0.0014603351,0.001055855,0.0007963633,0.003469273,0.0037600845,0.5968618],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99790657,0.00047000914,0.0001356939,0.000334912,0.0010364997,0.00011632178],"domain_scores_gemma":[0.99840003,0.0008068858,0.00004696502,0.00042026545,0.00027785986,0.00004783869],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021501582,0.0014205944,0.0010150437,0.0019192192,0.0010611336,0.003897138,0.0019904901,0.0012635184,0.11791032],"category_scores_gemma":[0.004188138,0.001110332,0.001345952,0.0013157624,0.0018632796,0.004584806,0.0020034753,0.0031420232,0.063178726],"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.000023799636,0.000044737495,0.000086311935,0.00044011237,0.000019575702,0.0000528021,0.0003455254,0.0008283769,0.0009924633,0.66724193,0.099856764,0.2300677],"study_design_scores_gemma":[0.000020400112,0.000012063474,0.00007380653,0.00022146573,0.000010906821,0.00015941891,0.000053340213,0.0016966196,0.0011695895,0.27424115,0.7223288,0.000012513966],"about_ca_topic_score_codex":0.0008865395,"about_ca_topic_score_gemma":0.0009177103,"teacher_disagreement_score":0.11791032,"about_ca_system_score_codex":0.0013518005,"about_ca_system_score_gemma":0.0012534998,"threshold_uncertainty_score":0.39444935},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14041172,0.000094158044,0.84981364,0.00017278506,0.00002927604,0.00010587422,0.0002276252,0.00047792235,0.008666969],"genre_scores_gemma":[0.98125744,0.00005096068,0.015444619,0.000047575195,0.000010145954,0.00013919716,0.0002179054,0.000094239775,0.0027379296],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989862,0.00016847564,0.00007138682,0.00014783556,0.0004863724,0.00013979326],"domain_scores_gemma":[0.99652135,0.0015956264,0.0005772675,0.00024988828,0.0009186764,0.0001373211],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012629799,0.00082481303,0.00061337894,0.0009115956,0.0004164046,0.001605936,0.0009890754,0.0009028861,0.0042220904],"category_scores_gemma":[0.004880181,0.0004070334,0.0008576441,0.00033272858,0.0009468109,0.0014664717,0.0013899514,0.0012543506,0.00044809768],"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.0004470019,0.00013488493,0.0021523198,0.00035981668,0.00012571987,0.0007302786,0.00083585165,0.41997063,0.07803165,0.47334722,0.0013881797,0.02247644],"study_design_scores_gemma":[0.00003992088,0.00018118706,0.000434184,0.000029561788,0.000022877828,0.000073454445,0.000113476985,0.92813003,0.012590928,0.05719661,0.001159472,0.000028252556],"about_ca_topic_score_codex":0.001804535,"about_ca_topic_score_gemma":0.0013735016,"teacher_disagreement_score":0.0042220904,"about_ca_system_score_codex":0.0009734844,"about_ca_system_score_gemma":0.00118658,"threshold_uncertainty_score":0.014124334},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010544551,0.015653733,0.68404984,0.0012408418,0.0007588616,0.00010464128,0.000740879,0.001551426,0.29484528],"genre_scores_gemma":[0.09177021,0.02571327,0.6163778,0.0012519667,0.001057734,0.0008030368,0.003072105,0.0020042663,0.25794965],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99904066,0.00026469352,0.00007227676,0.00016933098,0.00039656344,0.000056426084],"domain_scores_gemma":[0.9993462,0.00038523626,0.000029920768,0.00010714876,0.00011150775,0.000019948795],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007927476,0.0016226409,0.0010168764,0.0016918484,0.00066128647,0.0032346684,0.0012321132,0.0009282831,0.043516666],"category_scores_gemma":[0.0023914147,0.0007752325,0.00095103297,0.0023964676,0.0015736523,0.00345662,0.001307982,0.0025051045,0.012542522],"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.000012387984,0.000021150769,0.00003425632,0.00022649813,0.000012990359,0.000029699324,0.00009298479,0.0032230518,0.0006170477,0.8633454,0.02702602,0.10535846],"study_design_scores_gemma":[0.000008410184,0.00000853642,0.00004981746,0.0001246327,0.000009698302,0.000065914,0.000023360464,0.0053063217,0.0005399067,0.7765221,0.21733159,0.00000976357],"about_ca_topic_score_codex":0.0015340238,"about_ca_topic_score_gemma":0.0019983687,"teacher_disagreement_score":0.043516666,"about_ca_system_score_codex":0.0019238264,"about_ca_system_score_gemma":0.001008173,"threshold_uncertainty_score":0.14557773},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08662875,0.0004448129,0.9027931,0.0008223473,0.00006834118,0.00010309628,0.00019434068,0.0008349625,0.008110129],"genre_scores_gemma":[0.6973527,0.00036811334,0.29642767,0.0003298897,0.000078452125,0.0002116378,0.00046053066,0.0002202459,0.0045506917],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973416,0.0007143223,0.00017716602,0.00066428294,0.00090084627,0.00020181945],"domain_scores_gemma":[0.98954904,0.007939549,0.0006954565,0.00088421797,0.00073719205,0.00019449272],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001947391,0.0005652824,0.0005095818,0.0013449078,0.00073001516,0.0020923056,0.0015264374,0.001220332,0.003616929],"category_scores_gemma":[0.010636899,0.0004962769,0.0014597832,0.0012981663,0.0025409493,0.003980415,0.0020324606,0.0023315183,0.00038733118],"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.00010205977,0.000039920895,0.0010664077,0.00015836206,0.00004278413,0.00017977884,0.00040295825,0.043808777,0.0043115537,0.917027,0.0010842182,0.03177615],"study_design_scores_gemma":[0.000020547213,0.00004129977,0.00038829356,0.00004068034,0.000037591246,0.0001309271,0.00005883219,0.20289956,0.0050513954,0.78674996,0.004553867,0.000027107066],"about_ca_topic_score_codex":0.0013551932,"about_ca_topic_score_gemma":0.001125964,"teacher_disagreement_score":0.003616929,"about_ca_system_score_codex":0.0025373383,"about_ca_system_score_gemma":0.00093163684,"threshold_uncertainty_score":0.018409789},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.040177405,0.00027246616,0.93503016,0.00014866603,0.00007712008,0.000092047754,0.00032411562,0.0037539904,0.020123988],"genre_scores_gemma":[0.5969176,0.0007059616,0.37141255,0.000099815305,0.00003414074,0.0002209877,0.0007112126,0.0007231031,0.029174713],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99975663,0.00004892553,0.00002246893,0.0000440532,0.000093489834,0.0000343663],"domain_scores_gemma":[0.9997844,0.00008635611,0.000029238436,0.00003940676,0.000049910777,0.000010758999],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030763834,0.0006091427,0.00034225755,0.0005145999,0.00032982585,0.0014074127,0.00095463346,0.00091721385,0.00761417],"category_scores_gemma":[0.000639686,0.00042908514,0.0010300311,0.0003681319,0.00058505766,0.0010159977,0.0009274746,0.00059325167,0.0015297374],"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.00024034205,0.000047627065,0.0018212047,0.0005806338,0.000069664595,0.0014502867,0.00083941716,0.6645808,0.03913578,0.21055865,0.0021804846,0.07849509],"study_design_scores_gemma":[0.000050112445,0.000119752134,0.0002657284,0.00008910154,0.00007498094,0.00042327546,0.00010595812,0.88625026,0.022402054,0.031974778,0.058214746,0.000029237412],"about_ca_topic_score_codex":0.005783451,"about_ca_topic_score_gemma":0.004943323,"teacher_disagreement_score":0.00761417,"about_ca_system_score_codex":0.00056924776,"about_ca_system_score_gemma":0.00088990026,"threshold_uncertainty_score":0.025471926},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030457897,0.00022139635,0.94582254,0.00013513103,0.00041150686,0.000096275304,0.00086506666,0.0416671,0.007735201],"genre_scores_gemma":[0.15051799,0.0009264647,0.77441484,0.00074395974,0.000405648,0.00056030374,0.0049130386,0.028716244,0.038801562],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99838185,0.00024429057,0.00025669913,0.00032994812,0.00062993844,0.00015728107],"domain_scores_gemma":[0.9978987,0.0006751916,0.00016735258,0.0007189729,0.00042306562,0.0001167385],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018534388,0.001456525,0.0006489396,0.0008815091,0.0004948034,0.0019671763,0.002285482,0.0011597151,0.024085654],"category_scores_gemma":[0.003335992,0.0011254397,0.0019534987,0.0007450013,0.0014375184,0.0034197546,0.0030784719,0.0029799999,0.011030677],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017823208,0.00023504983,0.0013831446,0.002322135,0.00011800778,0.0008665157,0.0011004944,0.028063873,0.08238675,0.27100396,0.08997415,0.5207635],"study_design_scores_gemma":[0.0002832732,0.00031791485,0.00036148197,0.00036779334,0.00017491747,0.0010867675,0.00010575097,0.083762765,0.06916689,0.11265236,0.73157465,0.00014533773],"about_ca_topic_score_codex":0.00087520084,"about_ca_topic_score_gemma":0.0011836174,"teacher_disagreement_score":0.024085654,"about_ca_system_score_codex":0.0007215683,"about_ca_system_score_gemma":0.0010742008,"threshold_uncertainty_score":0.08057451},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04414262,0.000080673264,0.9541957,0.000039675404,0.0000061348665,0.000025512458,0.00006713347,0.00030663,0.0011359592],"genre_scores_gemma":[0.87964684,0.00019376817,0.11834663,0.0000314286,0.0000091299835,0.00012324913,0.0002279883,0.00007071403,0.0013503192],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993799,0.00014801783,0.000035758643,0.00010907148,0.0002476455,0.00007963207],"domain_scores_gemma":[0.9980192,0.0014401404,0.0002201774,0.00015226174,0.00013554546,0.000032681324],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007630912,0.0007292583,0.0006398835,0.00077675947,0.00043289966,0.00087625143,0.0006544976,0.00060316705,0.0018818607],"category_scores_gemma":[0.0039569596,0.00032187323,0.0011433166,0.0003006413,0.0010095735,0.0009821989,0.001000198,0.0010121154,0.00016947991],"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.00006124244,0.000013676352,0.00095524505,0.000062436404,0.000018590386,0.00007318766,0.0000787501,0.9643836,0.00336228,0.020282742,0.00007678484,0.010631523],"study_design_scores_gemma":[0.0000016121252,0.000013457414,0.00010730593,0.000006113242,0.0000039093,0.000014490681,0.000007862451,0.9935343,0.001002161,0.005140333,0.00016555341,0.0000028983268],"about_ca_topic_score_codex":0.0043045883,"about_ca_topic_score_gemma":0.0035577035,"teacher_disagreement_score":0.0043045883,"about_ca_system_score_codex":0.0009792281,"about_ca_system_score_gemma":0.001183047,"threshold_uncertainty_score":0.008559048},"labels":[],"label_agreement":null},{"id":"W4376644468","doi":"10.1007/s10703-023-00417-y","title":"Partial bounding for recursive function synthesis","year":2023,"lang":"en","type":"article","venue":"Formal Methods in System Design","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Recursion (computer science); Bounding overwatch; μ operator; Primitive recursive function; Function (biology); Set (abstract data type); Computer science; Recursive functions; Counterexample; Context (archaeology); Algorithm; Mathematics; Theoretical computer science; Discrete mathematics","score_opus":0.13741997515113363,"score_gpt":0.3972174777857111,"score_spread":0.25979750263457746,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4376644468","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00481299,0.00031225017,0.9870423,0.00009722725,0.00003840005,0.000024388753,0.00003435101,0.0010595478,0.0065785274],"genre_scores_gemma":[0.5456899,0.0008265512,0.43942142,0.00023860928,0.00014825974,0.00031470123,0.00027834327,0.00113815,0.011944123],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99660516,0.0011715053,0.0001750396,0.0004554712,0.0012372546,0.0003556812],"domain_scores_gemma":[0.99143267,0.0058842865,0.00025690696,0.0017952755,0.0005002011,0.00013066182],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029938181,0.0013003468,0.001660313,0.0013263393,0.0010261344,0.0023553441,0.0015512599,0.001242179,0.0082598245],"category_scores_gemma":[0.012728723,0.0011115575,0.0017194165,0.0009008122,0.003197575,0.0037641635,0.0031905926,0.0032326167,0.0016264459],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013525467,0.000039377872,0.00024060206,0.00025101393,0.00004353324,0.000088655484,0.00020656094,0.11973627,0.0069844793,0.76763153,0.0018907879,0.10275206],"study_design_scores_gemma":[0.000027741644,0.00004919001,0.000109423876,0.00009796353,0.00005819378,0.00006441532,0.000023332197,0.41342703,0.01053214,0.56599927,0.00957953,0.000031759486],"about_ca_topic_score_codex":0.0023637367,"about_ca_topic_score_gemma":0.0026602093,"teacher_disagreement_score":0.0082598245,"about_ca_system_score_codex":0.0018978827,"about_ca_system_score_gemma":0.0015661633,"threshold_uncertainty_score":0.027631879},"labels":[],"label_agreement":null},{"id":"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0080906665,0.03570202,0.35842195,0.00741953,0.00088942057,0.000085817315,0.000372313,0.00065148086,0.58836675],"genre_scores_gemma":[0.36079234,0.042407148,0.15474401,0.0021722643,0.0027480228,0.0005879685,0.0012002446,0.00077262946,0.43457535],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99948055,0.00010043409,0.0000225253,0.00008666791,0.00027100605,0.000038784987],"domain_scores_gemma":[0.9992556,0.0005259099,0.000031002757,0.00008494452,0.00008158244,0.000020950085],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060034497,0.0010545303,0.000742221,0.0016646825,0.0009774743,0.0034280901,0.0011594362,0.0011314404,0.013774212],"category_scores_gemma":[0.0015064103,0.00069915625,0.0006810507,0.0021538804,0.0033791037,0.0074417945,0.0009410223,0.0034129394,0.0021812764],"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.000003708374,0.0000063720304,0.000016084221,0.000054604607,0.000002935015,0.000008053496,0.000078198245,0.0006197812,0.00013381071,0.977098,0.0062500485,0.015728459],"study_design_scores_gemma":[0.0000033475574,0.0000027434944,0.00003082087,0.000032879212,0.0000032040184,0.000025418722,0.000021697622,0.0008977871,0.00017197372,0.95951325,0.039292417,0.0000045736397],"about_ca_topic_score_codex":0.0012938023,"about_ca_topic_score_gemma":0.0011689061,"teacher_disagreement_score":0.013774212,"about_ca_system_score_codex":0.0031126356,"about_ca_system_score_gemma":0.00084288645,"threshold_uncertainty_score":0.046079338},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.054807216,0.0023702912,0.88831997,0.0012814375,0.0006155022,0.00037833588,0.0028089096,0.009258919,0.040159486],"genre_scores_gemma":[0.21326992,0.0021046503,0.73566717,0.0005815697,0.00029979597,0.0005017839,0.007784007,0.0034703505,0.03632082],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99850047,0.00022499019,0.00008932412,0.00021894964,0.0007702678,0.00019607735],"domain_scores_gemma":[0.993769,0.0034950287,0.00018697852,0.0017904198,0.00059770513,0.00016093612],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010068138,0.0009826157,0.0014933413,0.0024914746,0.0007871523,0.0019039279,0.001924331,0.0009862651,0.020643163],"category_scores_gemma":[0.009808984,0.0008495439,0.0011123392,0.004900267,0.0010063512,0.004842835,0.002537512,0.002739614,0.0057511795],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005113203,0.00022709716,0.0006975423,0.00061725226,0.0000581196,0.00014885925,0.00034932475,0.097902134,0.008755046,0.12423119,0.034930825,0.73157126],"study_design_scores_gemma":[0.00012831963,0.00016033178,0.00050022756,0.00022147392,0.00009842201,0.00016730146,0.00019314463,0.42354187,0.011033773,0.510086,0.05382882,0.000040336687],"about_ca_topic_score_codex":0.0035699578,"about_ca_topic_score_gemma":0.006473903,"teacher_disagreement_score":0.020643163,"about_ca_system_score_codex":0.001353635,"about_ca_system_score_gemma":0.0019166504,"threshold_uncertainty_score":0.0690583},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008652754,0.000109723434,0.98965454,0.0001081189,0.000011547881,0.000041991814,0.0000136114,0.00026934914,0.0011382691],"genre_scores_gemma":[0.5992487,0.00023468603,0.39746442,0.00015056648,0.000036766847,0.00030609762,0.00006882196,0.00013705587,0.0023528787],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994815,0.00019537212,0.000029959541,0.00011456006,0.000113913586,0.00006481724],"domain_scores_gemma":[0.9985424,0.0009959957,0.0001390133,0.0001427819,0.0001101075,0.000069653266],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012151969,0.00077385816,0.0008383172,0.00047031368,0.00032840043,0.00061208307,0.0014541239,0.0008634132,0.0016264011],"category_scores_gemma":[0.003270451,0.0005144645,0.00062773586,0.0002831573,0.0014841415,0.0010586305,0.0011101781,0.0015268662,0.00023696604],"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.000040268817,0.000053620246,0.00026509224,0.000055692937,0.000023239618,0.00004746066,0.00007779877,0.9485207,0.0015071888,0.016493816,0.00031217246,0.03260303],"study_design_scores_gemma":[0.000008812477,0.000016302463,0.00002551992,0.000005245636,0.0000033789493,0.0000058677056,0.0000048499446,0.9927125,0.0003093961,0.0066692857,0.0002362088,0.0000027391973],"about_ca_topic_score_codex":0.003594031,"about_ca_topic_score_gemma":0.0037082727,"teacher_disagreement_score":0.003594031,"about_ca_system_score_codex":0.0010912206,"about_ca_system_score_gemma":0.0014428783,"threshold_uncertainty_score":0.007917464},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002045257,0.00006918847,0.9969338,0.000034480123,0.000010761175,0.000025351655,0.00003551413,0.00036274645,0.00048280452],"genre_scores_gemma":[0.27399698,0.0005771864,0.72221184,0.00013313563,0.000060081085,0.000554689,0.0005165474,0.0003305648,0.0016189931],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9964676,0.00096975814,0.0003417987,0.00052851846,0.0014555719,0.0002367408],"domain_scores_gemma":[0.9938637,0.0036333913,0.00064948236,0.0012036541,0.0005353651,0.00011433256],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003425153,0.0015132063,0.0010675086,0.00096340233,0.00054158195,0.0019621227,0.0016099726,0.0010525525,0.0021896046],"category_scores_gemma":[0.0090092765,0.00088012347,0.0026876684,0.00073732034,0.0026063023,0.0023561665,0.0023709068,0.0036109847,0.0006038443],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000106771506,0.000036843267,0.00027921112,0.000314475,0.00007655924,0.00020462587,0.00037157137,0.55273134,0.013136146,0.39566153,0.0005843871,0.036496606],"study_design_scores_gemma":[0.000037043166,0.00007424863,0.00007277456,0.000060150167,0.00004990273,0.000062982814,0.00003482822,0.77638537,0.015294016,0.20116366,0.006733008,0.000032023723],"about_ca_topic_score_codex":0.0014070985,"about_ca_topic_score_gemma":0.0013340914,"teacher_disagreement_score":0.003425153,"about_ca_system_score_codex":0.0016346414,"about_ca_system_score_gemma":0.0024623147,"threshold_uncertainty_score":0.01811415},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014276745,0.00019327692,0.96953034,0.00015208505,0.00012400396,0.00014618471,0.00073016004,0.006046933,0.008800283],"genre_scores_gemma":[0.5894444,0.0007759302,0.36464587,0.0008320155,0.00012258846,0.0006266424,0.0038405615,0.0037506719,0.035961334],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99600726,0.00050218136,0.00025812685,0.0010582928,0.0014911958,0.00068299077],"domain_scores_gemma":[0.9868123,0.0029042065,0.00063543866,0.007483039,0.0018922397,0.00027282638],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028178524,0.0011342565,0.0009910223,0.001702866,0.0012434793,0.0024234832,0.0032365478,0.0018035079,0.010022527],"category_scores_gemma":[0.013085001,0.001530149,0.001840434,0.0015204534,0.0021238069,0.00585536,0.0060953344,0.0028496913,0.0039676693],"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.001067303,0.00028697582,0.013907046,0.00078075874,0.00029256011,0.0013755796,0.0013355901,0.13103306,0.061208412,0.48415008,0.023239171,0.28132346],"study_design_scores_gemma":[0.00010812922,0.00019631333,0.0020095594,0.00022256759,0.00027834854,0.00087291194,0.00017671478,0.47371885,0.15010832,0.29624626,0.075851984,0.00021007705],"about_ca_topic_score_codex":0.007772111,"about_ca_topic_score_gemma":0.0094028795,"teacher_disagreement_score":0.010022527,"about_ca_system_score_codex":0.0014149016,"about_ca_system_score_gemma":0.0029139414,"threshold_uncertainty_score":0.033528686},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010909921,0.00047528016,0.94391537,0.00086184783,0.00021159327,0.00013705413,0.0004839247,0.001527438,0.041477606],"genre_scores_gemma":[0.5091131,0.00068139867,0.45594272,0.00068350806,0.0002489158,0.0004103386,0.0008323828,0.00040929666,0.03167855],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976597,0.00057630765,0.00017706306,0.0005230845,0.0008268857,0.00023690377],"domain_scores_gemma":[0.99834025,0.00066088495,0.0001061099,0.00031471063,0.00047895647,0.00009906729],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002225439,0.00062482245,0.00048980414,0.0009931731,0.0009329493,0.0022181724,0.0013592488,0.00075079926,0.0069683935],"category_scores_gemma":[0.0027733399,0.00052078505,0.001566683,0.00087063375,0.002799855,0.0038616427,0.0018849847,0.0023134241,0.0013346602],"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.0000196074,0.000013192389,0.00010991661,0.00004167375,0.000012779261,0.00012696964,0.00020462814,0.0047248453,0.0012980035,0.9837437,0.0011876157,0.008517017],"study_design_scores_gemma":[0.00004033035,0.000033169432,0.00019197259,0.000040042345,0.00005251498,0.00020967246,0.00008934582,0.07572269,0.003704479,0.8631835,0.05669497,0.000037360463],"about_ca_topic_score_codex":0.004458231,"about_ca_topic_score_gemma":0.0021277445,"teacher_disagreement_score":0.0069683935,"about_ca_system_score_codex":0.0017978548,"about_ca_system_score_gemma":0.0013626757,"threshold_uncertainty_score":0.023311555},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05947013,0.00017027638,0.9294631,0.000686043,0.00006743427,0.0003265933,0.00031830068,0.0054435283,0.004054635],"genre_scores_gemma":[0.45869446,0.00014372925,0.5380265,0.00030926755,0.00002732098,0.00026404814,0.00071837765,0.00046998012,0.001346262],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9875986,0.0055337423,0.0007167723,0.0012400303,0.003917176,0.0009938162],"domain_scores_gemma":[0.95774424,0.03416862,0.0022241536,0.0029278793,0.002571791,0.00036321144],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008250213,0.0011173211,0.001067468,0.002288562,0.0008823731,0.0025568,0.0030205129,0.0017255693,0.005170941],"category_scores_gemma":[0.0382261,0.00089954707,0.002587215,0.0014497843,0.003078623,0.0035587568,0.0031283023,0.0027376425,0.00076452654],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000889439,0.0008852248,0.008120127,0.0010842846,0.00029706626,0.0016354716,0.0007139942,0.5871564,0.056738548,0.1609168,0.005687575,0.17587505],"study_design_scores_gemma":[0.000102258105,0.00010150859,0.00027413538,0.000080616956,0.00004612819,0.00010811563,0.00007496875,0.9291105,0.025336431,0.04279326,0.0019480282,0.000024048904],"about_ca_topic_score_codex":0.007585051,"about_ca_topic_score_gemma":0.007983262,"teacher_disagreement_score":0.008250213,"about_ca_system_score_codex":0.002162176,"about_ca_system_score_gemma":0.0053519635,"threshold_uncertainty_score":0.043631792},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023629956,0.000395067,0.95544714,0.00030814655,0.000097761236,0.0000880204,0.00035861446,0.012015827,0.007659461],"genre_scores_gemma":[0.33146176,0.00038586036,0.6551256,0.00036686196,0.00006421485,0.0001821267,0.0014509417,0.003078086,0.007884474],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99598014,0.0009903236,0.00014835544,0.00044701708,0.0019521042,0.00048191135],"domain_scores_gemma":[0.9944289,0.0033252423,0.00020931638,0.001287734,0.00065719354,0.00009165861],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025881357,0.001090205,0.0011370671,0.0014268272,0.00067640154,0.0022519757,0.0024446074,0.00076947955,0.011860725],"category_scores_gemma":[0.010496101,0.0008448166,0.0020863535,0.0014102586,0.001870936,0.00432855,0.0037101265,0.0030321246,0.0024604544],"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.0007796432,0.00023200485,0.00262205,0.00089409976,0.00014999323,0.00031910115,0.0006130971,0.27119675,0.026302781,0.3528886,0.0209637,0.32303807],"study_design_scores_gemma":[0.00008172215,0.00008493976,0.00029995025,0.00008630222,0.000044808156,0.00010148492,0.0000815312,0.7729696,0.023967491,0.1824132,0.019837096,0.000031787044],"about_ca_topic_score_codex":0.005696927,"about_ca_topic_score_gemma":0.0072560906,"teacher_disagreement_score":0.011860725,"about_ca_system_score_codex":0.002364209,"about_ca_system_score_gemma":0.0020226885,"threshold_uncertainty_score":0.039678097},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41726717,0.0009164854,0.5445199,0.00767437,0.00020622762,0.00026562324,0.0013111319,0.0038326408,0.024006484],"genre_scores_gemma":[0.9375468,0.00040180288,0.05579814,0.00071542815,0.000387047,0.0001438513,0.0006996489,0.0005800371,0.0037273206],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99384487,0.0010934367,0.00031487236,0.0016452881,0.0016292182,0.0014722086],"domain_scores_gemma":[0.9445589,0.046835992,0.0019922396,0.0038045307,0.0014840409,0.0013242385],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0044720555,0.00111262,0.0016676759,0.0018161001,0.0028534161,0.0050888993,0.0032342873,0.0021863366,0.0061585316],"category_scores_gemma":[0.028927801,0.0012099872,0.003924629,0.001551825,0.008235572,0.013240835,0.007182861,0.0081777,0.0008034548],"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.001428734,0.0004255719,0.0050218734,0.0008686826,0.00015707391,0.00058509555,0.0018385871,0.09809736,0.010299454,0.8220324,0.008941544,0.050303552],"study_design_scores_gemma":[0.00007875711,0.000089171015,0.0005811764,0.000047128633,0.00007831798,0.00014663546,0.00020012035,0.11179743,0.0060790423,0.87896717,0.001879292,0.00005579365],"about_ca_topic_score_codex":0.0022498854,"about_ca_topic_score_gemma":0.0022828358,"teacher_disagreement_score":0.0061585316,"about_ca_system_score_codex":0.0031566399,"about_ca_system_score_gemma":0.00241413,"threshold_uncertainty_score":0.023650825},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005570732,0.00008522797,0.99206585,0.000053671618,0.0000394029,0.00002831969,0.00002210134,0.00041069128,0.0017240092],"genre_scores_gemma":[0.22280103,0.0002385895,0.76720935,0.00007353144,0.000040860185,0.00014049876,0.00010167515,0.0005423769,0.008852063],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.997623,0.0006328617,0.0002260475,0.00037322444,0.0009808068,0.00016400481],"domain_scores_gemma":[0.992281,0.0041242214,0.00035663188,0.0023882173,0.0006855581,0.00016427046],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028789202,0.00082277786,0.0009483682,0.0010465432,0.0007409059,0.002390806,0.002451627,0.0015203492,0.005841223],"category_scores_gemma":[0.009561639,0.00087318046,0.0013224417,0.0011252637,0.0029388755,0.0058032777,0.003978094,0.002647942,0.0010447656],"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.00024161415,0.0000926476,0.0005870953,0.0003925407,0.000077985416,0.00023857584,0.0010765488,0.064937204,0.014548528,0.7050693,0.0015790941,0.21115892],"study_design_scores_gemma":[0.000083838226,0.00010498035,0.00015888171,0.00013775541,0.0001002082,0.00029567792,0.00024723305,0.518451,0.024306009,0.43377006,0.022266367,0.000078060984],"about_ca_topic_score_codex":0.00067353,"about_ca_topic_score_gemma":0.0014451005,"teacher_disagreement_score":0.005841223,"about_ca_system_score_codex":0.00088305096,"about_ca_system_score_gemma":0.0010146328,"threshold_uncertainty_score":0.019540846},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04887285,0.0035436826,0.8707456,0.0013343575,0.0009855512,0.00012831014,0.00018073866,0.00060983247,0.07359915],"genre_scores_gemma":[0.75718224,0.0030953896,0.21180522,0.00069653377,0.0007048145,0.00018154,0.00026739013,0.00033271435,0.025734222],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974331,0.0007386215,0.00015447335,0.00047108094,0.0009428162,0.00025989945],"domain_scores_gemma":[0.9972301,0.0012191099,0.00027146094,0.0004701571,0.0006917845,0.00011728789],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002687675,0.00094377075,0.0006770607,0.0021027555,0.0011572659,0.002587663,0.0006755389,0.0008970406,0.0046424544],"category_scores_gemma":[0.011194255,0.00043277853,0.0009481997,0.0010862325,0.004707617,0.0036543265,0.0020386474,0.0031831388,0.0022985623],"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.000038396473,0.00002215727,0.0011494126,0.00009476294,0.000021618747,0.00013277118,0.0007427952,0.0028354665,0.0051921653,0.9446709,0.0023263933,0.042773113],"study_design_scores_gemma":[0.00002274646,0.00014511668,0.0017245708,0.00013518082,0.000038759958,0.00047313637,0.00053626363,0.040761963,0.016261505,0.89000577,0.049818445,0.00007657664],"about_ca_topic_score_codex":0.0021434042,"about_ca_topic_score_gemma":0.0022614982,"teacher_disagreement_score":0.0046424544,"about_ca_system_score_codex":0.0012367418,"about_ca_system_score_gemma":0.0011761878,"threshold_uncertainty_score":0.015530586},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019528624,0.00035118483,0.95944357,0.0003205253,0.000055358487,0.0000692127,0.00036277348,0.0019496442,0.01791911],"genre_scores_gemma":[0.22025129,0.00025820988,0.7716812,0.0001032779,0.000029230327,0.00027020488,0.0005768085,0.00030678834,0.006523036],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99974483,0.00006738765,0.000013989576,0.000052090916,0.00008569621,0.000036011166],"domain_scores_gemma":[0.99912244,0.0006454418,0.00004487397,0.00006641018,0.000100176025,0.000020667447],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048123003,0.00056732056,0.0006366834,0.00043191737,0.00038037467,0.0007948652,0.0013910686,0.0007603347,0.0057686362],"category_scores_gemma":[0.0023335924,0.00040109814,0.0004540646,0.0008560243,0.00048992503,0.00084337016,0.0009714826,0.0010559391,0.0007518998],"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.00005833883,0.000040490904,0.00036548453,0.00014456871,0.000019534653,0.0000549014,0.000044595636,0.8713294,0.001151655,0.0369438,0.004124365,0.08572279],"study_design_scores_gemma":[0.000016752412,0.000008198586,0.00002435935,0.000005900616,0.00000325968,0.000010003627,0.000007792914,0.99138474,0.0004517528,0.0066928673,0.001392402,0.0000018458566],"about_ca_topic_score_codex":0.0054871766,"about_ca_topic_score_gemma":0.010709231,"teacher_disagreement_score":0.0057686362,"about_ca_system_score_codex":0.0007431627,"about_ca_system_score_gemma":0.001748226,"threshold_uncertainty_score":0.019297957},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.056135356,0.000092081784,0.9411904,0.00032317537,0.00005268272,0.00007812435,0.000106862186,0.0005020413,0.0015192664],"genre_scores_gemma":[0.91154414,0.00007301586,0.08662324,0.00011340887,0.00003075858,0.00013295357,0.00014013718,0.000117088886,0.0012251685],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99074465,0.003476968,0.00063091575,0.0014093268,0.0026732606,0.0010649719],"domain_scores_gemma":[0.97093934,0.021581896,0.0020556804,0.0030768858,0.0018224305,0.0005238281],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009729077,0.00096783164,0.0015745291,0.0011375112,0.0009131286,0.0044743167,0.0032201784,0.0016095212,0.0022469244],"category_scores_gemma":[0.030548478,0.0010418057,0.0028896816,0.0010425047,0.0045190887,0.0068360264,0.0055912845,0.003594031,0.00021187688],"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.00035188053,0.00011132049,0.0015467714,0.00017134484,0.00022939936,0.00041811462,0.00032209008,0.7366135,0.0034997293,0.24695565,0.00042727112,0.009352899],"study_design_scores_gemma":[0.000028873115,0.000020506466,0.00008782534,0.000013462416,0.000027312646,0.000022329166,0.000034375877,0.92565614,0.001746852,0.07218462,0.0001657469,0.000011959603],"about_ca_topic_score_codex":0.0060114204,"about_ca_topic_score_gemma":0.0057557505,"teacher_disagreement_score":0.009729077,"about_ca_system_score_codex":0.002818052,"about_ca_system_score_gemma":0.0036305941,"threshold_uncertainty_score":0.051452875},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038633335,0.000102987295,0.95704055,0.00011797208,0.000027609485,0.000057176218,0.00009509429,0.0009765843,0.0029486425],"genre_scores_gemma":[0.9563122,0.00009025971,0.042074904,0.000020791096,0.00001928853,0.00008442998,0.000088076646,0.00012507023,0.0011850185],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99727315,0.0012313074,0.0001264517,0.00025714794,0.00086784293,0.00024408562],"domain_scores_gemma":[0.9919518,0.0054551074,0.0006712038,0.0007934523,0.0009685864,0.00015988696],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004020154,0.00092377583,0.0008281625,0.001055483,0.00044191486,0.0019642175,0.0012210744,0.0006214645,0.0033647332],"category_scores_gemma":[0.011923215,0.00034333012,0.0009704539,0.0005129977,0.0017003396,0.0022160786,0.0008951788,0.00097376364,0.00033281205],"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.00008241069,0.00003866805,0.0006632803,0.000087677625,0.000023169463,0.000038653707,0.000067206885,0.9421108,0.002068032,0.047023483,0.00017274637,0.0076239966],"study_design_scores_gemma":[0.000003333164,0.000016063874,0.00006703732,0.0000052385644,0.000006070331,0.0000037519753,0.0000066968782,0.9925217,0.0008364033,0.006412352,0.000118388234,0.0000030321723],"about_ca_topic_score_codex":0.005193983,"about_ca_topic_score_gemma":0.0028510334,"teacher_disagreement_score":0.005193983,"about_ca_system_score_codex":0.001993644,"about_ca_system_score_gemma":0.0018907053,"threshold_uncertainty_score":0.021260858},"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":"review","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0077001383,0.4378195,0.30915192,0.010952893,0.0029722485,0.00013292888,0.0002460848,0.0015857904,0.22943848],"genre_scores_gemma":[0.061551563,0.5298857,0.28052518,0.0022236744,0.0056419102,0.0002531424,0.00074120815,0.0008390135,0.11833862],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9978848,0.00047782302,0.00015743622,0.0002598389,0.0011409309,0.00007915991],"domain_scores_gemma":[0.99180835,0.005746447,0.00026738908,0.0006664819,0.001250068,0.00026114422],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026999975,0.0006128676,0.0006573839,0.0040594935,0.0005284809,0.003173283,0.0015033917,0.0007465431,0.025239678],"category_scores_gemma":[0.0067701135,0.0006392725,0.00063655054,0.0058526373,0.0019737387,0.0064741573,0.0019021854,0.002515959,0.008602077],"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.00004172669,0.00006749272,0.0002768875,0.0020486102,0.000018928196,0.00005751192,0.0002415157,0.00091704045,0.001954491,0.29289454,0.026999164,0.6744821],"study_design_scores_gemma":[0.00002216173,0.00008251761,0.00045681268,0.00049098505,0.000023575743,0.00082808116,0.00013198303,0.003125843,0.0019262498,0.1253705,0.8675139,0.00002744114],"about_ca_topic_score_codex":0.0003578811,"about_ca_topic_score_gemma":0.0006284246,"teacher_disagreement_score":0.025239678,"about_ca_system_score_codex":0.001081536,"about_ca_system_score_gemma":0.0011995467,"threshold_uncertainty_score":0.084435105},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023835847,0.00044253335,0.9333399,0.0005747184,0.00027131665,0.00015524961,0.0004880515,0.01179866,0.029093862],"genre_scores_gemma":[0.50279427,0.0010451261,0.45703727,0.00074288493,0.00033342885,0.00028519385,0.0034090485,0.0058197803,0.028533041],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99517196,0.000990501,0.00038750737,0.00063917105,0.0020630283,0.0007478951],"domain_scores_gemma":[0.98859626,0.007812668,0.00046202872,0.0017917226,0.0010801035,0.00025731788],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034432935,0.001656369,0.0015561768,0.0018661808,0.0012133174,0.0045358925,0.0034183152,0.0014628745,0.014660762],"category_scores_gemma":[0.0118460525,0.0020261875,0.0038783394,0.0019553246,0.0049726297,0.009346949,0.006006029,0.005681137,0.005062001],"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.0004984078,0.00032185117,0.0028705301,0.0013796961,0.00019716816,0.0010990764,0.0011761936,0.038424283,0.019404273,0.7281192,0.024191745,0.18231763],"study_design_scores_gemma":[0.00016930563,0.00018282418,0.00077755324,0.0003039044,0.00032666087,0.00053876924,0.00046541516,0.12256789,0.04979091,0.78452325,0.040259365,0.000094176714],"about_ca_topic_score_codex":0.00303869,"about_ca_topic_score_gemma":0.0049308864,"teacher_disagreement_score":0.014660762,"about_ca_system_score_codex":0.0021923992,"about_ca_system_score_gemma":0.0018513113,"threshold_uncertainty_score":0.049045205},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012284796,0.08836255,0.3377018,0.0043428023,0.0041157487,0.00013222813,0.0003553293,0.0016559007,0.56210524],"genre_scores_gemma":[0.026665198,0.048573904,0.1008369,0.0015496735,0.0021620109,0.00035407912,0.0007760388,0.0014379631,0.8176443],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990625,0.00019314447,0.000040461615,0.000115436145,0.00054066,0.00004781463],"domain_scores_gemma":[0.9991178,0.00058544,0.000027217366,0.00012482457,0.00011467794,0.000029964865],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00096499163,0.0017892614,0.0015259272,0.002186245,0.0008283988,0.0029726913,0.0012206598,0.0012783982,0.051670842],"category_scores_gemma":[0.0021828744,0.0009836348,0.0008431102,0.0024177718,0.002274221,0.0041992837,0.0014505687,0.003186348,0.027393917],"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.000020916856,0.000057022226,0.00006528297,0.0005961781,0.00001990591,0.00004712603,0.00033453602,0.0018190123,0.0009545088,0.55784357,0.14153156,0.2967104],"study_design_scores_gemma":[0.000013609224,0.00001869408,0.00009864423,0.00031921925,0.000011111624,0.0001319827,0.000051037587,0.0018884394,0.0004373792,0.3971087,0.5999086,0.000012575939],"about_ca_topic_score_codex":0.0010565328,"about_ca_topic_score_gemma":0.001304721,"teacher_disagreement_score":0.051670842,"about_ca_system_score_codex":0.0014025378,"about_ca_system_score_gemma":0.0011635603,"threshold_uncertainty_score":0.17285621},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007007031,0.000083470324,0.9899406,0.00011686796,0.000030630737,0.000089430505,0.00003288738,0.0011361022,0.0015629603],"genre_scores_gemma":[0.12545417,0.00021059714,0.870269,0.00008503118,0.000017532355,0.000193996,0.00014996126,0.0003230821,0.0032966551],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99907386,0.00025669776,0.00006231376,0.00012462877,0.00037467066,0.00010778604],"domain_scores_gemma":[0.9987004,0.0007275326,0.00010653324,0.00018576432,0.00024307618,0.00003664278],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016875162,0.00081541186,0.00028513654,0.00067814166,0.0006267354,0.0015589731,0.0010753307,0.0009141476,0.003192852],"category_scores_gemma":[0.0027851784,0.000478202,0.0013683387,0.00029197906,0.0018983163,0.001123374,0.0014619248,0.0012929001,0.00067777955],"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.00012736105,0.00021653132,0.002147341,0.0007857123,0.00010095478,0.000845172,0.0015166552,0.46760315,0.037223443,0.30681446,0.0025806976,0.18003854],"study_design_scores_gemma":[0.00008085236,0.00016077663,0.00033560602,0.00024016772,0.000073714,0.00021224744,0.00014323354,0.8574527,0.033726364,0.06450909,0.04302037,0.000044921107],"about_ca_topic_score_codex":0.0069767963,"about_ca_topic_score_gemma":0.0068176207,"teacher_disagreement_score":0.0069767963,"about_ca_system_score_codex":0.001102724,"about_ca_system_score_gemma":0.0022991933,"threshold_uncertainty_score":0.013872325},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011398002,0.000030170231,0.9958748,0.000026088454,0.00002001313,0.00004446277,0.000019890651,0.00051923114,0.0023254785],"genre_scores_gemma":[0.17081276,0.00014450445,0.81938714,0.00011557215,0.00007052613,0.00025266397,0.00015897992,0.0005362503,0.008521512],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99644023,0.0008098625,0.00016196509,0.00047291216,0.0018893075,0.00022571492],"domain_scores_gemma":[0.9972019,0.0010679747,0.0001221733,0.00092009886,0.00061203685,0.00007568707],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002583003,0.0009327026,0.000947871,0.0011693225,0.00086176407,0.001924853,0.0030450905,0.0013795793,0.0093720835],"category_scores_gemma":[0.005261277,0.00083985715,0.0017037733,0.000704729,0.0017864242,0.003478234,0.003620772,0.0023930247,0.0030551662],"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.00036412163,0.00018543303,0.00042240138,0.00040149948,0.000099899386,0.00048350383,0.00039054398,0.09061235,0.055240624,0.6526805,0.0026459876,0.19647314],"study_design_scores_gemma":[0.00006509757,0.00012369273,0.00014698741,0.000046670266,0.00009501378,0.0003580733,0.000028786822,0.7184867,0.029781898,0.23665544,0.01416295,0.000048620383],"about_ca_topic_score_codex":0.0009779633,"about_ca_topic_score_gemma":0.0012147808,"teacher_disagreement_score":0.0093720835,"about_ca_system_score_codex":0.0006877155,"about_ca_system_score_gemma":0.001392845,"threshold_uncertainty_score":0.03135276},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012366067,0.00036020993,0.97625387,0.00054331723,0.00010440454,0.00011678355,0.00016912157,0.0014477707,0.008638491],"genre_scores_gemma":[0.4110432,0.0012839757,0.5692017,0.0011180375,0.00041766357,0.0007706778,0.0009740789,0.0023899,0.012800748],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9859321,0.0044567143,0.0011298878,0.0024964497,0.0049303956,0.0010545487],"domain_scores_gemma":[0.97738636,0.013771359,0.0011109696,0.0048141014,0.0025692892,0.0003480303],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007600811,0.0010493146,0.0010429368,0.0015313618,0.0014577813,0.003361171,0.0024885125,0.0011241747,0.004427005],"category_scores_gemma":[0.02070291,0.0012164047,0.003808521,0.0011647359,0.005210455,0.008526946,0.0063997414,0.0063571967,0.0013670068],"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.00007964665,0.000058906466,0.00039159285,0.00031044352,0.00006590243,0.00022589232,0.0009710167,0.010911877,0.008952744,0.94429713,0.002151711,0.031583153],"study_design_scores_gemma":[0.000045156157,0.00007033372,0.00018397911,0.000092446375,0.00009922712,0.00024862785,0.00012264571,0.037589803,0.023951398,0.89254755,0.044990633,0.00005825101],"about_ca_topic_score_codex":0.0016250629,"about_ca_topic_score_gemma":0.0012995952,"teacher_disagreement_score":0.007600811,"about_ca_system_score_codex":0.002587183,"about_ca_system_score_gemma":0.0029701116,"threshold_uncertainty_score":0.040197432},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012345935,0.00009499468,0.98427725,0.00015280746,0.00002092212,0.000047283724,0.00004975018,0.00011969098,0.0028913624],"genre_scores_gemma":[0.86190546,0.00034320288,0.13217169,0.0001601911,0.000048873702,0.0007855221,0.00023041158,0.00015081318,0.0042038052],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977381,0.0006507142,0.00020692211,0.0002846726,0.0009255211,0.0001940908],"domain_scores_gemma":[0.9942853,0.0033687595,0.0007314578,0.00034814095,0.0010673018,0.000199044],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037624992,0.0011191831,0.0006421984,0.0011099782,0.00054353365,0.0013624551,0.0009190504,0.0010084334,0.0024212615],"category_scores_gemma":[0.011350863,0.00045155894,0.0012335659,0.00048571458,0.0015079301,0.0017898807,0.0021343902,0.001980528,0.00039657936],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007777203,0.000036840822,0.00048813538,0.0001850094,0.00003757536,0.0002433183,0.0002304811,0.34309393,0.009532631,0.63156503,0.0004892439,0.014020065],"study_design_scores_gemma":[0.000025813068,0.000114684,0.00016269599,0.00003960577,0.000018744766,0.00007458155,0.00004763669,0.84217757,0.005460837,0.14951546,0.0023386646,0.00002377696],"about_ca_topic_score_codex":0.0010199872,"about_ca_topic_score_gemma":0.0008082965,"teacher_disagreement_score":0.0037624992,"about_ca_system_score_codex":0.001237351,"about_ca_system_score_gemma":0.0021123164,"threshold_uncertainty_score":0.019898236},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012526128,0.00030164554,0.977749,0.000453668,0.00010734701,0.00014996216,0.00017849237,0.002321085,0.0062127304],"genre_scores_gemma":[0.45544684,0.0004827987,0.5305682,0.00063407765,0.00026828202,0.00041039786,0.0009614148,0.0007008272,0.010527126],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9942555,0.0017257287,0.00036781467,0.0009978131,0.001940771,0.0007125284],"domain_scores_gemma":[0.98915696,0.0043092277,0.0006022432,0.0046768016,0.0009862062,0.00026852192],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037599516,0.0012351531,0.0017479705,0.0011679194,0.0018209179,0.002557048,0.0020705282,0.0013603682,0.012314146],"category_scores_gemma":[0.021054314,0.000639306,0.0020578513,0.0014009352,0.0023674774,0.0052795657,0.004747612,0.0025710221,0.0031368018],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00077590585,0.0003987536,0.0016301083,0.0006877365,0.00013102355,0.00055385137,0.0006965956,0.14758438,0.013073948,0.33919674,0.026093068,0.4691779],"study_design_scores_gemma":[0.00010108742,0.00010892372,0.00024120287,0.00006672753,0.000045607878,0.0003075385,0.000113381306,0.65736395,0.009712021,0.3170103,0.01488571,0.000043564854],"about_ca_topic_score_codex":0.0030972653,"about_ca_topic_score_gemma":0.005381749,"teacher_disagreement_score":0.012314146,"about_ca_system_score_codex":0.0013956147,"about_ca_system_score_gemma":0.002091356,"threshold_uncertainty_score":0.041194916},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.059985135,0.0011799174,0.90097237,0.00201942,0.00018597179,0.00040929715,0.0015324308,0.0134254005,0.020290026],"genre_scores_gemma":[0.3712089,0.0006795581,0.61221457,0.00090994785,0.00012394843,0.0003190929,0.003920116,0.0025960074,0.008027839],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9953435,0.0020337338,0.00022348415,0.00046015496,0.0016906956,0.00024845867],"domain_scores_gemma":[0.96475273,0.028398158,0.0010445314,0.0038648257,0.0016798215,0.00025997346],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034777662,0.00083755393,0.00057873206,0.0012658964,0.0008983364,0.0022762106,0.0019676874,0.00073558616,0.016901722],"category_scores_gemma":[0.019113753,0.00084707566,0.0013005405,0.0014582889,0.0014669711,0.0036488113,0.002492863,0.0031468556,0.002959875],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00069312105,0.0005133904,0.0025890598,0.0022114017,0.00020085782,0.0008136402,0.0007198969,0.10212826,0.04556682,0.31007484,0.05618404,0.47830468],"study_design_scores_gemma":[0.00024564008,0.00019626682,0.0005583017,0.00022943584,0.00012216784,0.0006998886,0.0001880815,0.5969406,0.07450481,0.28880882,0.037451394,0.000054615066],"about_ca_topic_score_codex":0.0010430609,"about_ca_topic_score_gemma":0.0022847175,"teacher_disagreement_score":0.016901722,"about_ca_system_score_codex":0.001585491,"about_ca_system_score_gemma":0.0016859905,"threshold_uncertainty_score":0.05654192},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.085180126,0.0011934971,0.89000845,0.0016292252,0.0003374032,0.0002958227,0.001708674,0.0051034526,0.014543287],"genre_scores_gemma":[0.3925232,0.0010025426,0.5876303,0.00055044744,0.00017627787,0.0004089281,0.0038051608,0.0018170648,0.012086043],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974915,0.00055791356,0.00014419651,0.0003334208,0.0011463767,0.00032656893],"domain_scores_gemma":[0.9877588,0.007921702,0.00041627756,0.002754333,0.0009038938,0.00024509357],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017274924,0.00091314997,0.001625224,0.0024529018,0.00094955094,0.0021394528,0.0018012689,0.0011707218,0.011749139],"category_scores_gemma":[0.018554633,0.00086122804,0.001369414,0.003622451,0.001366382,0.005925966,0.0027847637,0.003100907,0.0023618923],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000827483,0.00031755774,0.0017162065,0.00066893845,0.000092279566,0.00025692096,0.0005541623,0.23764503,0.008721586,0.22359978,0.017496975,0.50810313],"study_design_scores_gemma":[0.00008938624,0.00009908526,0.00029622004,0.000110271525,0.000066307344,0.00007240306,0.00012081599,0.52794504,0.0067460886,0.4522524,0.01217832,0.00002372218],"about_ca_topic_score_codex":0.00398706,"about_ca_topic_score_gemma":0.0073602353,"teacher_disagreement_score":0.011749139,"about_ca_system_score_codex":0.0015520348,"about_ca_system_score_gemma":0.0028698894,"threshold_uncertainty_score":0.039304793},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019391883,0.010468087,0.07979924,0.040179502,0.035556007,0.004209432,0.1840944,0.028199561,0.59810185],"genre_scores_gemma":[0.04591146,0.003264993,0.072065875,0.0068956525,0.0051391646,0.0023836887,0.46947938,0.023218172,0.3716416],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.98165315,0.0030360147,0.0006436594,0.001523778,0.010452422,0.0026910352],"domain_scores_gemma":[0.9671011,0.0037534193,0.0005331127,0.0024606183,0.018229486,0.007922264],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.024616716,0.0034157906,0.0019379329,0.0038786726,0.0035786768,0.011526851,0.006229092,0.00530194,0.1605502],"category_scores_gemma":[0.027251154,0.0014025364,0.0026295634,0.0054685352,0.0011934674,0.0055693784,0.005462623,0.005760105,0.12698969],"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.0002757692,0.0001333903,0.00013170118,0.00017459823,0.000025132396,0.00004398326,0.000027793969,0.0010056455,0.000577106,0.0048726746,0.97655255,0.016179653],"study_design_scores_gemma":[0.0006209502,0.00028911227,0.0008738373,0.00016377488,0.000032122818,0.00013493781,0.00008330404,0.007134559,0.0027832903,0.0058958344,0.98191375,0.0000745518],"about_ca_topic_score_codex":0.035067566,"about_ca_topic_score_gemma":0.036316797,"teacher_disagreement_score":0.1605502,"about_ca_system_score_codex":0.005708329,"about_ca_system_score_gemma":0.016364357,"threshold_uncertainty_score":0.53709394},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.067217246,0.0002549702,0.8797522,0.0008598325,0.00012368428,0.00028253195,0.0013070164,0.0024402032,0.047762178],"genre_scores_gemma":[0.9301528,0.00024590726,0.049319256,0.00017620952,0.000029146659,0.0003316335,0.00060255785,0.00015674194,0.01898578],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995745,0.000088757246,0.000025987074,0.00010480975,0.00013934635,0.00006673463],"domain_scores_gemma":[0.9996562,0.0001374805,0.000051544517,0.000041523734,0.00008248417,0.00003069949],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004340184,0.0007404001,0.00048874144,0.0006392776,0.00060908054,0.0022373463,0.001302937,0.0016995838,0.01133411],"category_scores_gemma":[0.0007387865,0.00038687358,0.00082007627,0.00031985214,0.0010085428,0.001237153,0.0009793796,0.0009435977,0.0012695688],"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.0003992333,0.0001387693,0.0013482191,0.00019050272,0.00006504836,0.0011853793,0.00047967638,0.66030663,0.018279586,0.30699742,0.0016204154,0.008989088],"study_design_scores_gemma":[0.00012273266,0.0000892111,0.00033693545,0.00002814008,0.000038668008,0.00009415581,0.00008036893,0.94261307,0.0029695076,0.046533283,0.00706777,0.000026086249],"about_ca_topic_score_codex":0.02028716,"about_ca_topic_score_gemma":0.008328493,"teacher_disagreement_score":0.02028716,"about_ca_system_score_codex":0.0010974841,"about_ca_system_score_gemma":0.0012412523,"threshold_uncertainty_score":0.04033816},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.049661685,0.00013376144,0.926953,0.0002387074,0.000105051135,0.00019500649,0.00031575974,0.0027049803,0.019691935],"genre_scores_gemma":[0.9431696,0.00016247731,0.045616582,0.000058454527,0.000023283492,0.0001727714,0.00016141767,0.00011190708,0.010523542],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996228,0.00008488907,0.000023278355,0.000081238904,0.00013762768,0.000050197406],"domain_scores_gemma":[0.9996699,0.00014649432,0.000054757584,0.00003756642,0.00006714589,0.00002421024],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042294772,0.00069730706,0.0005636638,0.000606236,0.0007077125,0.0015991962,0.0012881352,0.001123786,0.009582343],"category_scores_gemma":[0.00078703085,0.00035285062,0.0006637236,0.0003143049,0.000618322,0.00105937,0.0006527748,0.000693356,0.0009811855],"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.00015721991,0.00007791096,0.0007381434,0.00010119255,0.00003326605,0.00029176727,0.00014227402,0.9442994,0.007035381,0.038591318,0.00056548964,0.007966686],"study_design_scores_gemma":[0.000019568834,0.00003371396,0.00010245681,0.000005747079,0.000010545676,0.00002143466,0.000007804511,0.994125,0.0015611466,0.002604591,0.0015017473,0.0000062219137],"about_ca_topic_score_codex":0.012874821,"about_ca_topic_score_gemma":0.0051366934,"teacher_disagreement_score":0.012874821,"about_ca_system_score_codex":0.00060890266,"about_ca_system_score_gemma":0.0009195234,"threshold_uncertainty_score":0.032056153},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005881211,0.000085217085,0.98857343,0.00011509163,0.00004502117,0.00015297164,0.00012849015,0.0025198725,0.0024988134],"genre_scores_gemma":[0.1945676,0.00017349655,0.79834807,0.00016271237,0.00006350578,0.0003187024,0.00074198004,0.0009423363,0.004681681],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960383,0.00087436667,0.00036764442,0.00070437806,0.0014809658,0.00053425925],"domain_scores_gemma":[0.985499,0.0062822974,0.00059501635,0.0057267016,0.0015694476,0.000327558],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030454046,0.0013981841,0.0015284271,0.0020797777,0.0013721583,0.0032351436,0.004338005,0.0017154205,0.01848751],"category_scores_gemma":[0.019728566,0.0012220273,0.0021062002,0.0018100913,0.0022395966,0.0059408443,0.004465664,0.0031616238,0.0041692187],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00105685,0.00035588077,0.0011142332,0.00055926025,0.0001195054,0.0001729328,0.00046684273,0.18995474,0.012030885,0.276013,0.013101328,0.50505453],"study_design_scores_gemma":[0.00020342387,0.000090691705,0.00033140177,0.000055916553,0.00011151844,0.00012322702,0.00007395577,0.6296661,0.011530184,0.35023242,0.0075272084,0.00005396914],"about_ca_topic_score_codex":0.005097182,"about_ca_topic_score_gemma":0.007783787,"teacher_disagreement_score":0.01848751,"about_ca_system_score_codex":0.0026400653,"about_ca_system_score_gemma":0.003463254,"threshold_uncertainty_score":0.061846912},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042037185,0.00037647763,0.9393032,0.0002543074,0.00008311516,0.00009545617,0.0001850378,0.0054581393,0.0122070005],"genre_scores_gemma":[0.33536282,0.00032613668,0.6595973,0.0001504067,0.000039344035,0.00012068979,0.00043649462,0.00035781102,0.0036089642],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99956375,0.00010582222,0.00002558869,0.00007281952,0.00015397422,0.0000780116],"domain_scores_gemma":[0.999445,0.00030134403,0.00004469883,0.00008780574,0.00009843544,0.000022751748],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032594474,0.0008223981,0.0003634849,0.0005456572,0.00030898725,0.0006888522,0.00090076675,0.00038016168,0.0115107205],"category_scores_gemma":[0.0013785543,0.00030033247,0.00043855258,0.0007558301,0.00033823517,0.0008742653,0.0006299828,0.00089324557,0.0015377817],"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.00032647888,0.00022249066,0.0013855933,0.00056339684,0.00008467761,0.00038424061,0.00011168825,0.31730762,0.06618593,0.059977688,0.013044741,0.5404055],"study_design_scores_gemma":[0.00011634978,0.0001466453,0.0002903624,0.00003354224,0.000031049858,0.00014926806,0.000037747926,0.941369,0.032408297,0.013442115,0.011960443,0.000015169613],"about_ca_topic_score_codex":0.0024390926,"about_ca_topic_score_gemma":0.0065194843,"teacher_disagreement_score":0.0115107205,"about_ca_system_score_codex":0.00051400793,"about_ca_system_score_gemma":0.0011155492,"threshold_uncertainty_score":0.038507223},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008700169,0.0039763707,0.92566997,0.0009310083,0.00056705065,0.00014854276,0.00050291064,0.0012171749,0.058286864],"genre_scores_gemma":[0.32793784,0.0062330905,0.62283254,0.00059202657,0.0016444094,0.0006588118,0.001715404,0.0008312823,0.037554555],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99869424,0.00028787347,0.00015450649,0.00020929224,0.00053780305,0.00011635998],"domain_scores_gemma":[0.9985952,0.0007472019,0.000108487264,0.0002860781,0.0002017531,0.000061293256],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016075133,0.0008804196,0.0007490245,0.0014206859,0.001021456,0.004244446,0.0017154163,0.00094939576,0.010192743],"category_scores_gemma":[0.0034063337,0.0007786263,0.0011796519,0.0021811842,0.0021153723,0.008448958,0.0014954766,0.0034221918,0.0024256618],"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.000015231884,0.000011865081,0.00001933626,0.000060313465,0.0000041587086,0.000028979977,0.00023515089,0.0008715436,0.00081862585,0.9838757,0.0013141643,0.0127449725],"study_design_scores_gemma":[0.00002051871,0.000020973268,0.00005183355,0.00004812628,0.000012872366,0.0000657118,0.00008446789,0.005502871,0.0010240464,0.96062624,0.03252915,0.000013195798],"about_ca_topic_score_codex":0.0012585362,"about_ca_topic_score_gemma":0.0010076531,"teacher_disagreement_score":0.010192743,"about_ca_system_score_codex":0.001714187,"about_ca_system_score_gemma":0.0008736852,"threshold_uncertainty_score":0.03409815},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.040046513,0.00037368617,0.9295003,0.000250202,0.00015251004,0.00012160227,0.00050266704,0.0031347245,0.02591787],"genre_scores_gemma":[0.8858139,0.00050053897,0.08514544,0.00009536423,0.0000419602,0.00021230221,0.0003742971,0.000316614,0.027499638],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998287,0.000033883858,0.00001403841,0.00003504196,0.000061316314,0.000026992808],"domain_scores_gemma":[0.9998332,0.000077772675,0.000023740462,0.000022023423,0.000032694545,0.000010553448],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022195939,0.000454534,0.00050065527,0.00025687634,0.0003894945,0.0011632956,0.0010521434,0.0010690484,0.0108613605],"category_scores_gemma":[0.00040472948,0.00031415,0.0008736403,0.00017038615,0.0005377285,0.0006742673,0.0007902194,0.0005428396,0.0014165767],"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.0001435227,0.000027642507,0.00070405524,0.0002647711,0.00003914002,0.00054743316,0.00020808399,0.906052,0.02382414,0.048227843,0.0010307033,0.01893066],"study_design_scores_gemma":[0.000026926331,0.00006198028,0.00017533242,0.000025270305,0.000027564081,0.00013937692,0.000024405756,0.9747838,0.0069899834,0.007919835,0.009809801,0.000015739186],"about_ca_topic_score_codex":0.0037048196,"about_ca_topic_score_gemma":0.0022349046,"teacher_disagreement_score":0.0108613605,"about_ca_system_score_codex":0.00044284514,"about_ca_system_score_gemma":0.00077247375,"threshold_uncertainty_score":0.036334872},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01760765,0.00010539713,0.9697804,0.000722377,0.00010814986,0.0001484114,0.0002380297,0.0057340297,0.005555569],"genre_scores_gemma":[0.5868103,0.00022182109,0.40463278,0.0005878332,0.00012838226,0.0003973043,0.0009312922,0.0016370629,0.004653318],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98613936,0.0040292917,0.0006706654,0.0019145788,0.005801453,0.0014446591],"domain_scores_gemma":[0.96484095,0.015643924,0.001715836,0.011898728,0.005277713,0.00062282383],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0052152276,0.0011080411,0.0012178841,0.0014138194,0.0012037595,0.0046064816,0.0041278186,0.0017819589,0.008617804],"category_scores_gemma":[0.04411899,0.00085360184,0.001911894,0.0011221092,0.0038386995,0.00715664,0.005017899,0.004456953,0.0016884941],"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.00035789743,0.00028466052,0.003016355,0.00046232934,0.000099208904,0.0004297713,0.00052588974,0.19862324,0.016901659,0.6848893,0.008365062,0.08604464],"study_design_scores_gemma":[0.00007598308,0.00010837238,0.00032461536,0.000110902685,0.000057805213,0.00021223987,0.00012588163,0.69746226,0.030835416,0.2570743,0.01355244,0.00005982973],"about_ca_topic_score_codex":0.0044259652,"about_ca_topic_score_gemma":0.004362815,"teacher_disagreement_score":0.008617804,"about_ca_system_score_codex":0.0040332917,"about_ca_system_score_gemma":0.0064441236,"threshold_uncertainty_score":0.029263735},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05682646,0.0015324653,0.8739302,0.0009963643,0.00041864693,0.00024259773,0.0008640715,0.016285576,0.048903532],"genre_scores_gemma":[0.2647792,0.0006367566,0.71899253,0.00040494424,0.00011141751,0.0002125458,0.0018934367,0.0007494666,0.012219642],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99914217,0.00017411342,0.00004431146,0.00016109401,0.00034858985,0.00012971109],"domain_scores_gemma":[0.9991222,0.0003035486,0.00006882856,0.00019197918,0.00027457142,0.0000388434],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004167294,0.0009908746,0.00045123405,0.00072165945,0.00036201152,0.000999537,0.0015953773,0.0006484356,0.017715335],"category_scores_gemma":[0.0018089965,0.00040003538,0.0008227602,0.00090478937,0.0003556233,0.0011854696,0.00096772506,0.0013081664,0.0034435946],"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.00046094568,0.00039897132,0.0018948626,0.0010236986,0.0001384369,0.0003911706,0.00016663043,0.25070614,0.061104354,0.0728419,0.043509673,0.5673632],"study_design_scores_gemma":[0.00020009061,0.00025226202,0.00057453103,0.00007245828,0.0000599567,0.0002361728,0.00005838728,0.895005,0.031796653,0.024970908,0.046747625,0.000025908925],"about_ca_topic_score_codex":0.0023693272,"about_ca_topic_score_gemma":0.0065272534,"teacher_disagreement_score":0.017715335,"about_ca_system_score_codex":0.0008260333,"about_ca_system_score_gemma":0.0016630833,"threshold_uncertainty_score":0.059263706},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012796012,0.0000268673,0.98135376,0.000049377988,0.000013177243,0.00014304832,0.00019900355,0.004370932,0.0010478209],"genre_scores_gemma":[0.23872429,0.00009179546,0.75739974,0.000063143,0.000008449447,0.00042388105,0.0006451953,0.0011345181,0.0015090066],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987204,0.0004168293,0.0001236319,0.00019221593,0.00047047704,0.00007649847],"domain_scores_gemma":[0.994034,0.0034604087,0.00066665944,0.0010147764,0.0007342338,0.00008992585],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018779169,0.0011588191,0.00044143008,0.00085910276,0.00031288687,0.0008701605,0.0008772668,0.00055234437,0.00443918],"category_scores_gemma":[0.008125001,0.00062022783,0.0010446601,0.0003034047,0.00085061474,0.0013688593,0.0011343689,0.0010790372,0.00064569263],"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.0006314661,0.0001501987,0.0039171944,0.0012726373,0.00011990197,0.0011138484,0.00268612,0.6101621,0.15370403,0.0695039,0.0031517877,0.15358682],"study_design_scores_gemma":[0.00006489301,0.00017724789,0.0003935008,0.00012852198,0.00006114061,0.00015603169,0.0002234714,0.8548912,0.10717329,0.02265156,0.014038254,0.00004091139],"about_ca_topic_score_codex":0.0020200904,"about_ca_topic_score_gemma":0.0036838674,"teacher_disagreement_score":0.00443918,"about_ca_system_score_codex":0.0007484173,"about_ca_system_score_gemma":0.0014322945,"threshold_uncertainty_score":0.014850497},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5853966,0.00039096933,0.39114994,0.00071176526,0.000083608225,0.00017994134,0.001011284,0.0028635396,0.018212445],"genre_scores_gemma":[0.9540342,0.00011794395,0.043747433,0.00004516063,0.000014900109,0.000028352151,0.00062933826,0.00013569582,0.0012468768],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959274,0.0015464366,0.00022053633,0.00053865666,0.0014019987,0.00036491046],"domain_scores_gemma":[0.946393,0.0442967,0.0012139317,0.0055522826,0.0017967749,0.0007473743],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005744002,0.00070086174,0.0006425458,0.0010653863,0.00044617566,0.0032298397,0.0022353183,0.0016488965,0.007745976],"category_scores_gemma":[0.04183219,0.0006155848,0.001214918,0.0006531202,0.0014960885,0.008475284,0.0025252937,0.001601318,0.00094805245],"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.004657588,0.001185784,0.012960548,0.0007699303,0.00042409904,0.0005179297,0.0009024553,0.5771709,0.021639278,0.2304316,0.0034761361,0.14586371],"study_design_scores_gemma":[0.000111042384,0.00024533606,0.00041826387,0.000032060394,0.00012741445,0.000100450256,0.00014950626,0.90965456,0.012912851,0.07542057,0.0008060709,0.000021875512],"about_ca_topic_score_codex":0.002437914,"about_ca_topic_score_gemma":0.0030627802,"teacher_disagreement_score":0.007745976,"about_ca_system_score_codex":0.0011778387,"about_ca_system_score_gemma":0.0016417532,"threshold_uncertainty_score":0.030377507},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22918852,0.0002573668,0.7576969,0.00062866596,0.00009935251,0.00013027647,0.00060146354,0.0057833274,0.0056141107],"genre_scores_gemma":[0.8486018,0.000079114056,0.14823844,0.00015670934,0.000060246188,0.00007707868,0.00072619016,0.00044164885,0.0016187052],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9930782,0.0023263916,0.00055534736,0.0011026153,0.0017355268,0.0012019953],"domain_scores_gemma":[0.9749826,0.01762834,0.0014160244,0.0037190346,0.00184088,0.00041310705],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005915489,0.0008560814,0.0012648429,0.0017668054,0.0012809577,0.003712179,0.0027539858,0.0009069852,0.0043038647],"category_scores_gemma":[0.021976123,0.0010891701,0.0030516798,0.0020332674,0.0024218836,0.0069930884,0.004039173,0.0024890513,0.0004920168],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0030819513,0.00072271685,0.015960153,0.00088366197,0.0006171635,0.0011730288,0.0013037066,0.39731833,0.04503578,0.32576838,0.0070239846,0.20111111],"study_design_scores_gemma":[0.000096944335,0.00006915474,0.00065833534,0.000060361508,0.00012875721,0.00006626994,0.00014085129,0.76873684,0.021002611,0.2077848,0.0012241638,0.00003093989],"about_ca_topic_score_codex":0.008948867,"about_ca_topic_score_gemma":0.011977366,"teacher_disagreement_score":0.008948867,"about_ca_system_score_codex":0.0023753582,"about_ca_system_score_gemma":0.0029630726,"threshold_uncertainty_score":0.03128451},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0040430822,0.01449964,0.49331102,0.005536585,0.0028085625,0.00008644972,0.0006018906,0.0026011036,0.4765116],"genre_scores_gemma":[0.2142547,0.01924675,0.3221269,0.008565593,0.0035248457,0.0007464561,0.00174848,0.0042690393,0.42551735],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991308,0.00012508144,0.000039286133,0.0001782849,0.00045038533,0.00007622442],"domain_scores_gemma":[0.9990827,0.00052212714,0.000047371876,0.00015293332,0.00016620636,0.000028543802],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00076711876,0.0009526473,0.0005972192,0.0010812959,0.0006605765,0.0026383498,0.0010718589,0.001077614,0.03153469],"category_scores_gemma":[0.004702091,0.00042007357,0.0008451186,0.0009434885,0.002733741,0.004147134,0.0015614496,0.0041695316,0.011667233],"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.000022704155,0.000014328032,0.000070054404,0.00017849602,0.00000800475,0.000046388705,0.00020126444,0.0019799082,0.0008245807,0.8520091,0.05575438,0.08889073],"study_design_scores_gemma":[0.000008805059,0.00002842167,0.00021419078,0.00021247711,0.000011820173,0.00013988167,0.00005172499,0.0056772158,0.0014857029,0.71721613,0.2749349,0.000018830597],"about_ca_topic_score_codex":0.001217641,"about_ca_topic_score_gemma":0.00095346314,"teacher_disagreement_score":0.03153469,"about_ca_system_score_codex":0.0017068848,"about_ca_system_score_gemma":0.0009330919,"threshold_uncertainty_score":0.10549408},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041886665,0.00024284566,0.9381672,0.00034764924,0.000026571866,0.00009375875,0.0005122164,0.016263975,0.0024591677],"genre_scores_gemma":[0.35299405,0.00029702613,0.6417225,0.00018182765,0.000014615746,0.00020381762,0.0007397878,0.0024237665,0.0014226328],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99742496,0.0010404205,0.00017330504,0.0004691665,0.00072434486,0.00016775976],"domain_scores_gemma":[0.9899828,0.007275606,0.00066406094,0.0014305398,0.00048123204,0.00016570442],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037147666,0.0019073861,0.00069988956,0.0033440273,0.0007432013,0.0030148635,0.0015767411,0.0014198384,0.00447937],"category_scores_gemma":[0.014968986,0.0009304707,0.0010467112,0.0013132103,0.0026441466,0.006956937,0.003225066,0.0019334024,0.0009184705],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014029164,0.0005760317,0.027805869,0.0019152896,0.00031798086,0.0028219419,0.014397244,0.13674547,0.10035993,0.20962486,0.014770945,0.48926154],"study_design_scores_gemma":[0.00022595443,0.0003723657,0.004485516,0.0008224222,0.00020486962,0.0009675879,0.001958424,0.5670105,0.081861585,0.30969083,0.03213635,0.0002636128],"about_ca_topic_score_codex":0.001959483,"about_ca_topic_score_gemma":0.0027784558,"teacher_disagreement_score":0.00447937,"about_ca_system_score_codex":0.00073259306,"about_ca_system_score_gemma":0.0014543156,"threshold_uncertainty_score":0.01964581},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007924654,0.0044655083,0.6248156,0.008334802,0.0038198137,0.00011512935,0.00064039754,0.0072318506,0.34265223],"genre_scores_gemma":[0.22876158,0.0031257328,0.26421836,0.0031044579,0.0023157883,0.00025196135,0.0017855348,0.0065904963,0.4898461],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99639326,0.00079903356,0.00013273786,0.0003971615,0.0019630005,0.0003148397],"domain_scores_gemma":[0.9940777,0.0026279537,0.00009324166,0.0017191564,0.0010993612,0.00038262125],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0057607573,0.0009810219,0.0009364152,0.00092052104,0.0016710343,0.005909058,0.0022450052,0.0024817323,0.06099211],"category_scores_gemma":[0.007205335,0.0013839706,0.0015203056,0.0012880623,0.0023652362,0.0065426794,0.0039752065,0.006242442,0.020069182],"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.00029532544,0.000062429805,0.0001680696,0.00020052379,0.000023676503,0.00016352857,0.00021902709,0.0072531574,0.0027740218,0.7030381,0.13353893,0.15226322],"study_design_scores_gemma":[0.00007368328,0.00008848557,0.00029966727,0.00013828192,0.000018139435,0.00035818547,0.00009711716,0.054270048,0.0062722424,0.40191194,0.53641486,0.00005738361],"about_ca_topic_score_codex":0.0029251573,"about_ca_topic_score_gemma":0.0049128877,"teacher_disagreement_score":0.06099211,"about_ca_system_score_codex":0.0027452374,"about_ca_system_score_gemma":0.0025800266,"threshold_uncertainty_score":0.20403892},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16946599,0.00039966093,0.7784648,0.0018931979,0.00014542525,0.00032520836,0.0010722224,0.0012950973,0.046938397],"genre_scores_gemma":[0.9087211,0.0002131115,0.079907775,0.00032210376,0.000036612844,0.0002997188,0.00043845398,0.0003515388,0.009709528],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966953,0.0010026392,0.0001236026,0.00044749488,0.0010099823,0.00072107936],"domain_scores_gemma":[0.99023813,0.0064010588,0.0007011349,0.0014385423,0.00061327475,0.00060785847],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031008227,0.00096350105,0.0012190348,0.0010857959,0.0017350914,0.0033996191,0.003189163,0.0018559659,0.009334052],"category_scores_gemma":[0.019132532,0.0008708104,0.0024660842,0.0008036657,0.0048261085,0.00488329,0.003864228,0.003645571,0.00062994706],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021561261,0.00007827932,0.0013245133,0.00008935339,0.000050652056,0.0005173037,0.00038619994,0.36737752,0.0010194435,0.6230495,0.0018688024,0.004022842],"study_design_scores_gemma":[0.000055573328,0.000030732564,0.0001500344,0.000026173711,0.00001829619,0.00008254501,0.00007983739,0.78135073,0.0006443998,0.21558441,0.0019511906,0.000026063566],"about_ca_topic_score_codex":0.021378359,"about_ca_topic_score_gemma":0.013010745,"teacher_disagreement_score":0.021378359,"about_ca_system_score_codex":0.0030087924,"about_ca_system_score_gemma":0.004159944,"threshold_uncertainty_score":0.042507887},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02778191,0.00004120724,0.9711954,0.000032164295,0.0000049646173,0.000028396045,0.000017356797,0.00014841802,0.0007501663],"genre_scores_gemma":[0.6810501,0.00011224441,0.3173661,0.000032418633,0.000007864096,0.00015908752,0.00010396524,0.00008021822,0.0010879624],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99939454,0.00018014248,0.00004003943,0.00005917625,0.000267623,0.000058504564],"domain_scores_gemma":[0.9973188,0.0016449011,0.00036364346,0.00038765467,0.00023070035,0.0000542585],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001385988,0.0007320044,0.0006099397,0.0007766363,0.00032716326,0.0010288199,0.0008327501,0.0006943422,0.0009795075],"category_scores_gemma":[0.006068329,0.00039853813,0.0008694088,0.00023675148,0.0012273507,0.0011854018,0.0014898075,0.0012346503,0.00018191316],"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.000042103504,0.0000210261,0.0006649492,0.000051991832,0.000012447149,0.000081490354,0.00018021121,0.9587967,0.0057501215,0.021448284,0.00007044456,0.012880257],"study_design_scores_gemma":[0.000002251482,0.000011920579,0.000042392505,0.000007199811,0.0000015633802,0.000010259896,0.0000078419225,0.9939774,0.001639552,0.0041259583,0.00017042781,0.0000031713403],"about_ca_topic_score_codex":0.0026315164,"about_ca_topic_score_gemma":0.0022584274,"teacher_disagreement_score":0.0026315164,"about_ca_system_score_codex":0.0008711258,"about_ca_system_score_gemma":0.0010005325,"threshold_uncertainty_score":0.007329881},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03475274,0.00042079404,0.9255396,0.00034894602,0.00013618347,0.00015358024,0.0003858007,0.033947114,0.0043152166],"genre_scores_gemma":[0.77062756,0.00047610508,0.21568333,0.00036321933,0.000054576038,0.00023016999,0.0021648684,0.0022125673,0.008187522],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985997,0.00028614243,0.000109156514,0.00018478339,0.00061581016,0.00020443789],"domain_scores_gemma":[0.99793434,0.0006463429,0.0002372098,0.0008327956,0.00025963603,0.00008969257],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018712298,0.0008398184,0.0005140856,0.00068028166,0.00044042675,0.0010288542,0.0017829619,0.0007758244,0.0035891014],"category_scores_gemma":[0.004433418,0.0005162029,0.0007453422,0.00029677455,0.0014930044,0.0020821383,0.0030202027,0.001461892,0.0013687115],"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.0015349824,0.00031025332,0.0044643534,0.0009005745,0.00016678053,0.0012215792,0.00075036066,0.43563795,0.07851032,0.091504015,0.035064008,0.34993476],"study_design_scores_gemma":[0.00012619083,0.0002668631,0.00046286837,0.00006503986,0.00005029602,0.00030821332,0.00011097817,0.9080359,0.047169436,0.025159726,0.018194202,0.00005033633],"about_ca_topic_score_codex":0.002597667,"about_ca_topic_score_gemma":0.002923184,"teacher_disagreement_score":0.0035891014,"about_ca_system_score_codex":0.00059232395,"about_ca_system_score_gemma":0.0015657158,"threshold_uncertainty_score":0.0120067},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012394844,0.00007603768,0.9818543,0.00008521585,0.000021762007,0.000054494154,0.000073263705,0.00077465887,0.0046653217],"genre_scores_gemma":[0.66225266,0.00023452796,0.33132374,0.00013267522,0.000024937946,0.00017472274,0.00028083808,0.00021461444,0.00536131],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99915886,0.00018497804,0.000052520365,0.00017496374,0.000343441,0.000085293206],"domain_scores_gemma":[0.9991191,0.0004339755,0.00013022407,0.000119522214,0.00015732579,0.000039876904],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008267526,0.00065768184,0.0003227305,0.0004435714,0.00033114696,0.0011007335,0.0006662028,0.00058103877,0.0032984035],"category_scores_gemma":[0.0026312836,0.00024450634,0.0006613274,0.0004601315,0.0009897593,0.00094286166,0.0007502686,0.00071280054,0.000578286],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026477658,0.00006337184,0.0005303373,0.00025620245,0.00003063994,0.0004070635,0.00021552866,0.70388293,0.027461816,0.16134824,0.0015503494,0.10398883],"study_design_scores_gemma":[0.000030354613,0.00014700758,0.00010221662,0.000023096713,0.00001592463,0.00008972443,0.000029384639,0.9533782,0.013931135,0.027297143,0.004940856,0.000015006545],"about_ca_topic_score_codex":0.0027902448,"about_ca_topic_score_gemma":0.0019059768,"teacher_disagreement_score":0.0032984035,"about_ca_system_score_codex":0.00078177755,"about_ca_system_score_gemma":0.0012981021,"threshold_uncertainty_score":0.01103425},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00045265027,0.0004060169,0.0013225012,0.0003967611,0.00025405805,0.00009469701,0.00070355396,0.0012048018,0.9951649],"genre_scores_gemma":[0.0006513332,0.0001698772,0.0004782088,0.00015588466,0.00004473519,0.000042554926,0.00043709844,0.00018895368,0.9978313],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.999213,0.000069772796,0.000067811976,0.0002785628,0.00022638208,0.0001444688],"domain_scores_gemma":[0.9977798,0.0005745766,0.0001726404,0.000342223,0.00046614066,0.0006646598],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0012202738,0.0026405137,0.0013954891,0.0027796638,0.0022852425,0.004069513,0.003200397,0.005649527,0.98636496],"category_scores_gemma":[0.0018257275,0.00085399725,0.0013094504,0.0025655571,0.0019854493,0.0058928896,0.0032663718,0.0023177124,0.9896152],"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.0002716155,0.0001899091,0.0009058761,0.0005543015,0.000036434147,0.00026905225,0.00013633682,0.00048661465,0.0024010972,0.0106467,0.29552487,0.6885772],"study_design_scores_gemma":[0.00003381389,0.00008508215,0.0005348632,0.00025079044,0.000012899573,0.00029432125,0.0001156869,0.00025244858,0.00045814918,0.0010394974,0.99690324,0.000019281553],"about_ca_topic_score_codex":0.0037819096,"about_ca_topic_score_gemma":0.0030090755,"teacher_disagreement_score":0.013635039,"about_ca_system_score_codex":0.0012540461,"about_ca_system_score_gemma":0.0013438584,"threshold_uncertainty_score":0.019448638},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004798422,0.0068038255,0.92506176,0.001875833,0.00053767406,0.00011348281,0.00035451952,0.0026956897,0.057758763],"genre_scores_gemma":[0.32628953,0.01453417,0.586654,0.0010044216,0.0012585018,0.0007320725,0.0018228402,0.00237,0.065334454],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963929,0.0010970522,0.00021307441,0.00050899154,0.0015435782,0.00024442127],"domain_scores_gemma":[0.9966515,0.0020584525,0.00015828534,0.0008658004,0.00022801611,0.000038014645],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002284073,0.0020004,0.002191859,0.0018119575,0.0011815142,0.0047096284,0.0022169033,0.0013973576,0.01031505],"category_scores_gemma":[0.008346246,0.0015036982,0.002836306,0.0029745656,0.005500944,0.007320841,0.0024565975,0.004843175,0.0025525133],"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.00008199141,0.00005356472,0.00015681554,0.00040306742,0.000044031138,0.00007725642,0.00016283407,0.018601328,0.0022100317,0.86693424,0.012668779,0.09860611],"study_design_scores_gemma":[0.000021902197,0.000012610787,0.00005618942,0.000062767154,0.00002671912,0.00004894968,0.000017088449,0.01805073,0.0015792669,0.9670379,0.013072021,0.0000138030855],"about_ca_topic_score_codex":0.0028240923,"about_ca_topic_score_gemma":0.0022514905,"teacher_disagreement_score":0.01031505,"about_ca_system_score_codex":0.0024031422,"about_ca_system_score_gemma":0.0019355807,"threshold_uncertainty_score":0.034507334},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004798422,0.0068038255,0.92506176,0.001875833,0.00053767406,0.00011348281,0.00035451952,0.0026956897,0.057758763],"genre_scores_gemma":[0.32628953,0.01453417,0.586654,0.0010044216,0.0012585018,0.0007320725,0.0018228402,0.00237,0.065334454],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963929,0.0010970522,0.00021307441,0.00050899154,0.0015435782,0.00024442127],"domain_scores_gemma":[0.9966515,0.0020584525,0.00015828534,0.0008658004,0.00022801611,0.000038014645],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002284073,0.0020004,0.002191859,0.0018119575,0.0011815142,0.0047096284,0.0022169033,0.0013973576,0.01031505],"category_scores_gemma":[0.008346246,0.0015036982,0.002836306,0.0029745656,0.005500944,0.007320841,0.0024565975,0.004843175,0.0025525133],"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.00008199141,0.00005356472,0.00015681554,0.00040306742,0.000044031138,0.00007725642,0.00016283407,0.018601328,0.0022100317,0.86693424,0.012668779,0.09860611],"study_design_scores_gemma":[0.000021902197,0.000012610787,0.00005618942,0.000062767154,0.00002671912,0.00004894968,0.000017088449,0.01805073,0.0015792669,0.9670379,0.013072021,0.0000138030855],"about_ca_topic_score_codex":0.0028240923,"about_ca_topic_score_gemma":0.0022514905,"teacher_disagreement_score":0.01031505,"about_ca_system_score_codex":0.0024031422,"about_ca_system_score_gemma":0.0019355807,"threshold_uncertainty_score":0.034507334},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024685465,0.000119592674,0.96480376,0.000090931775,0.000051391842,0.000118411495,0.0001065767,0.001813044,0.008210687],"genre_scores_gemma":[0.5575163,0.00035997288,0.43252143,0.00006830485,0.000032234388,0.00041243338,0.0004833084,0.000810844,0.0077952086],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992162,0.00019754237,0.000079615835,0.00012043814,0.00028620334,0.00009998794],"domain_scores_gemma":[0.998279,0.0009862698,0.00014688798,0.00039678198,0.00014191055,0.000049302955],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011098847,0.00062056957,0.0006242087,0.00040412112,0.0004176503,0.0011739664,0.0010877625,0.00068563735,0.005061139],"category_scores_gemma":[0.0031892145,0.0007895476,0.000946469,0.0004282634,0.0011111647,0.0014044491,0.0013688803,0.001303929,0.0010452853],"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.0003787475,0.00011554286,0.00028554784,0.0006327786,0.000056018267,0.0004390733,0.00047896968,0.14508815,0.09164255,0.6195853,0.002053772,0.13924353],"study_design_scores_gemma":[0.0001976367,0.000263141,0.0001737159,0.00013278726,0.00011617465,0.00028301292,0.0001302532,0.4988754,0.19736864,0.27959156,0.022816572,0.00005115471],"about_ca_topic_score_codex":0.00032503926,"about_ca_topic_score_gemma":0.0005666504,"teacher_disagreement_score":0.005061139,"about_ca_system_score_codex":0.0006499336,"about_ca_system_score_gemma":0.00107609,"threshold_uncertainty_score":0.016931236},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034780066,0.0015511161,0.9491686,0.0008402557,0.00016147716,0.00024094194,0.0010225653,0.008778667,0.0034562317],"genre_scores_gemma":[0.5466923,0.00063672994,0.43447146,0.0014648482,0.00027456807,0.00076614885,0.005310241,0.0010115268,0.009372218],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.99919254,0.00024637498,0.000045285848,0.0002649641,0.00015325632,0.0000975417],"domain_scores_gemma":[0.99814093,0.0011560916,0.00014920867,0.0002050307,0.00026096043,0.00008775291],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014743156,0.0020165222,0.0014346082,0.0014775046,0.0005392188,0.0009727894,0.0028480454,0.001717939,0.0048821056],"category_scores_gemma":[0.0033326533,0.00073800085,0.0019923626,0.0011950613,0.00081833,0.0015659522,0.0014810897,0.002202829,0.0011852082],"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.00025049777,0.00029938287,0.0016603887,0.00028809978,0.00013745652,0.00009308031,0.000053746873,0.6806851,0.0035011151,0.0041968334,0.010524062,0.29831028],"study_design_scores_gemma":[0.000016353195,0.000040322982,0.00008556696,0.0000058839964,0.000009835579,0.0000088568795,0.0000064866704,0.99402654,0.0005467696,0.0046124663,0.00063703314,0.0000038010155],"about_ca_topic_score_codex":0.00608392,"about_ca_topic_score_gemma":0.013431812,"teacher_disagreement_score":0.00608392,"about_ca_system_score_codex":0.001774251,"about_ca_system_score_gemma":0.0018084035,"threshold_uncertainty_score":0.016332269},"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":"methods","model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":"methods","domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018184278,0.20954643,0.43144032,0.24043347,0.051307175,0.0022899213,0.0017922919,0.00061604276,0.060755946],"genre_scores_gemma":[0.115281224,0.1422588,0.46372443,0.19515856,0.036865816,0.020703048,0.00089647935,0.00084883394,0.024262872],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.88372093,0.094689265,0.011238791,0.0033103838,0.005948363,0.0010922647],"domain_scores_gemma":[0.7380443,0.23602797,0.009944853,0.0064422553,0.00810866,0.001431972],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.0897808,0.0013547635,0.0026826358,0.0042462177,0.0014977983,0.00598775,0.0026310682,0.0066680755,0.01872022],"category_scores_gemma":[0.25428706,0.00084828364,0.002626409,0.0046242015,0.017046476,0.0077454196,0.003862907,0.0082858205,0.0036561848],"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.00018705241,0.000019757266,0.000088793095,0.0059980373,0.000095020914,0.000081764934,0.00081597536,0.00035655315,0.00019792051,0.9273696,0.03005923,0.03473012],"study_design_scores_gemma":[0.0002726912,0.00015218648,0.00017053622,0.013088043,0.00014558523,0.0004188141,0.0004227828,0.0006999667,0.00037545533,0.72298485,0.26121846,0.00005073011],"about_ca_topic_score_codex":0.0014392507,"about_ca_topic_score_gemma":0.0011521993,"teacher_disagreement_score":0.9102192,"about_ca_system_score_codex":0.0044811675,"about_ca_system_score_gemma":0.0077432753,"threshold_uncertainty_score":0.4748119},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018764807,0.00013253433,0.97751087,0.000078216,0.00002949858,0.00009020171,0.000037363883,0.0014576943,0.0018988216],"genre_scores_gemma":[0.5665956,0.00014592712,0.42959157,0.00019608365,0.000038850176,0.0002286678,0.000173082,0.00050919486,0.0025209847],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9947429,0.0020670278,0.00026644496,0.0009959363,0.0014100616,0.0005176682],"domain_scores_gemma":[0.98951066,0.0055909688,0.000624811,0.0024475034,0.0014833799,0.00034268407],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0049344534,0.00092594186,0.0009506498,0.0011747602,0.0006543741,0.0016786947,0.003585152,0.0011550956,0.0034494284],"category_scores_gemma":[0.015721349,0.00075596443,0.00070834573,0.0007944495,0.0026780053,0.003434539,0.0022285383,0.0013816733,0.0007479399],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010222181,0.00028636394,0.004615762,0.0005116831,0.000096608994,0.0003588936,0.0005589175,0.12189756,0.031850893,0.41413572,0.003974013,0.42069125],"study_design_scores_gemma":[0.0001375983,0.00037644795,0.00040753867,0.00011046797,0.00006429243,0.00030728843,0.000056471956,0.7588647,0.047538646,0.18425569,0.007836872,0.00004407908],"about_ca_topic_score_codex":0.0028680502,"about_ca_topic_score_gemma":0.0034777215,"teacher_disagreement_score":0.0049344534,"about_ca_system_score_codex":0.0017094413,"about_ca_system_score_gemma":0.0026123507,"threshold_uncertainty_score":0.026096225},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0688223,0.000055648936,0.9180387,0.00021296521,0.000042728112,0.0002659718,0.0002738186,0.0098439045,0.002443974],"genre_scores_gemma":[0.60367686,0.00020793833,0.38821352,0.0003186787,0.00004325963,0.00071705517,0.0011366075,0.0021107546,0.0035753346],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9946104,0.0014927073,0.00034351755,0.00070000294,0.002367551,0.0004858393],"domain_scores_gemma":[0.98600334,0.009959133,0.0008246717,0.0018470677,0.0011732859,0.00019253229],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003902224,0.0011745805,0.00051510584,0.0007323844,0.0004755623,0.0018255076,0.002107972,0.0013080774,0.005328082],"category_scores_gemma":[0.018833164,0.0006328624,0.0015313319,0.000319576,0.0023205138,0.0032960328,0.0023677545,0.0018459924,0.0007221238],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018605748,0.0014518951,0.017346362,0.0018771911,0.00023020971,0.0019535865,0.0013916667,0.37889042,0.16399877,0.2537657,0.007021703,0.17021193],"study_design_scores_gemma":[0.000121397934,0.0005351462,0.00059163955,0.0001291636,0.000082062244,0.0003010691,0.00012283503,0.7098809,0.23688856,0.043327503,0.007972713,0.000047018977],"about_ca_topic_score_codex":0.0015387564,"about_ca_topic_score_gemma":0.002135957,"teacher_disagreement_score":0.005328082,"about_ca_system_score_codex":0.0010901255,"about_ca_system_score_gemma":0.0025174231,"threshold_uncertainty_score":0.020637214},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016252723,0.00027595263,0.9557929,0.0004029141,0.00012369842,0.00012756274,0.0003461977,0.023272214,0.003405812],"genre_scores_gemma":[0.357534,0.00014784953,0.63374686,0.0005404018,0.00013736951,0.00028234549,0.001284187,0.0032018295,0.0031252678],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99155444,0.0034146872,0.0007228331,0.0012539687,0.0023477173,0.00070639915],"domain_scores_gemma":[0.9897357,0.0060222275,0.0006864029,0.0023922632,0.0010185353,0.00014474711],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039259363,0.0014023848,0.00092854985,0.0015108249,0.0006307876,0.002250589,0.0025730552,0.0010563838,0.011496856],"category_scores_gemma":[0.015714651,0.00070783455,0.002035207,0.0011884419,0.0012065731,0.0040997444,0.0024759737,0.0017374669,0.0031911011],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014531683,0.00032603435,0.0046715653,0.0010397426,0.0002505561,0.00029043513,0.0002220958,0.10930038,0.03487075,0.11914599,0.037136454,0.69129294],"study_design_scores_gemma":[0.00020835243,0.00025858416,0.00039380745,0.00012584706,0.000070206544,0.00019015935,0.00004472868,0.80675584,0.06718089,0.11282786,0.011879964,0.000063753076],"about_ca_topic_score_codex":0.0010577398,"about_ca_topic_score_gemma":0.0018847308,"teacher_disagreement_score":0.011496856,"about_ca_system_score_codex":0.0013775765,"about_ca_system_score_gemma":0.0018825649,"threshold_uncertainty_score":0.03846079},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.099881634,0.000117896074,0.8914877,0.0014073503,0.0000626688,0.00019370842,0.0008918256,0.0016087911,0.004348333],"genre_scores_gemma":[0.7191644,0.00014607413,0.2766532,0.0003886753,0.00006403581,0.00030328607,0.0015538111,0.0002929438,0.0014336236],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9902333,0.00332118,0.0006785485,0.0020153995,0.0026111905,0.0011404575],"domain_scores_gemma":[0.95581126,0.03430247,0.0026150662,0.003906884,0.0026858677,0.00067840563],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006452347,0.0009056114,0.0017912134,0.0009974854,0.0012802546,0.0037769275,0.0029011061,0.0013325302,0.005373786],"category_scores_gemma":[0.04041839,0.0010302018,0.002255836,0.0017423806,0.0022818812,0.008300704,0.0033707013,0.003965512,0.0007608939],"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.0015370826,0.00058398605,0.008672781,0.0012697668,0.0005239852,0.000863459,0.0009855719,0.4317502,0.019796127,0.40569457,0.007877086,0.1204453],"study_design_scores_gemma":[0.00021993842,0.00012403734,0.0005550204,0.000054757158,0.000096023934,0.00021032804,0.0002696027,0.5083614,0.013136922,0.4744911,0.0024367818,0.00004411958],"about_ca_topic_score_codex":0.0046273167,"about_ca_topic_score_gemma":0.005936996,"teacher_disagreement_score":0.006452347,"about_ca_system_score_codex":0.0025730112,"about_ca_system_score_gemma":0.004901469,"threshold_uncertainty_score":0.03412372},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0031987734,0.00059768395,0.98414177,0.00023543126,0.000116477146,0.000051312567,0.0008207185,0.002111984,0.008725749],"genre_scores_gemma":[0.13374114,0.0022776562,0.83827317,0.00028113046,0.0002594429,0.00061546825,0.0038766325,0.0012874719,0.01938782],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99927,0.00020907345,0.00010558772,0.0001308684,0.00024307708,0.00004142046],"domain_scores_gemma":[0.9978009,0.0012603877,0.00013954287,0.00047993832,0.00024420896,0.00007504964],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011144679,0.0005573914,0.00052020827,0.0021342582,0.00075980596,0.0029076722,0.0015260748,0.00074337405,0.0064774062],"category_scores_gemma":[0.0039250003,0.00059846655,0.00063716905,0.0025663832,0.0016828536,0.0045181685,0.0017921482,0.0015292866,0.0022138096],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000335578,0.000015424574,0.00020895166,0.00014525748,0.000007965889,0.000078907666,0.00024988642,0.007851265,0.002262016,0.9226545,0.0048104804,0.06168188],"study_design_scores_gemma":[0.000014539536,0.000019878858,0.00008937364,0.00013183526,0.000016224822,0.00011641212,0.000047478028,0.054528557,0.0060043465,0.7621081,0.17689838,0.00002494069],"about_ca_topic_score_codex":0.0013030351,"about_ca_topic_score_gemma":0.0015097952,"teacher_disagreement_score":0.0064774062,"about_ca_system_score_codex":0.0011245998,"about_ca_system_score_gemma":0.0010930388,"threshold_uncertainty_score":0.02166909},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035206378,0.0011960167,0.9330436,0.00036991233,0.00015256848,0.00021166606,0.00029686576,0.018995555,0.010527431],"genre_scores_gemma":[0.5602323,0.00041383022,0.42616475,0.0006026959,0.00008994907,0.00025207215,0.00069139374,0.002635605,0.008917527],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980268,0.00028493587,0.00012256143,0.00037172184,0.00082957576,0.00036442917],"domain_scores_gemma":[0.99853516,0.0003819307,0.00019810042,0.000581027,0.00023054816,0.000073258234],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009869044,0.0012158436,0.00058719475,0.0009891047,0.0006390382,0.0016643205,0.0022087859,0.0005867693,0.0051449384],"category_scores_gemma":[0.0028460461,0.00049585983,0.00096044067,0.00062653207,0.0017055317,0.0027851758,0.002536058,0.001370514,0.0012519027],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009949702,0.00026396953,0.006423177,0.001025769,0.00014518845,0.0005593343,0.00045396862,0.1532568,0.08751196,0.14783987,0.020304326,0.5812207],"study_design_scores_gemma":[0.00015994482,0.00046949822,0.00092949485,0.0001652335,0.00014988986,0.00051757816,0.00015331291,0.6819616,0.1318478,0.12927923,0.054248933,0.00011747982],"about_ca_topic_score_codex":0.0033788453,"about_ca_topic_score_gemma":0.006210232,"teacher_disagreement_score":0.0051449384,"about_ca_system_score_codex":0.0013921844,"about_ca_system_score_gemma":0.0026294708,"threshold_uncertainty_score":0.017211497},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017566076,0.037781294,0.37762707,0.005444547,0.0012395402,0.000063910345,0.0002683813,0.00061753666,0.55939156],"genre_scores_gemma":[0.6350188,0.026362313,0.2151005,0.00201291,0.0021145893,0.00024469022,0.0004033013,0.0005847035,0.11815822],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99841595,0.0007398176,0.0001063609,0.00020901691,0.00040770706,0.00012106112],"domain_scores_gemma":[0.9975642,0.0017752696,0.000073615265,0.00033488395,0.00019032968,0.00006173576],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025819195,0.00076312246,0.0006212087,0.0020359368,0.0018924114,0.0043215663,0.0011460154,0.0012452885,0.0092691295],"category_scores_gemma":[0.003809232,0.0009127885,0.0012703278,0.0023991184,0.0065526986,0.008913161,0.00219835,0.0030656632,0.0015114049],"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.000007911008,0.0000051654306,0.000021203,0.00002851614,0.0000030174663,0.000021330346,0.00023062802,0.00015601114,0.00017967787,0.99065125,0.0010644872,0.0076307915],"study_design_scores_gemma":[0.000005210444,0.000007348143,0.000040632403,0.000033238335,0.00000545352,0.000077298035,0.000063565494,0.0008895507,0.0003567732,0.96370965,0.03480344,0.000007819029],"about_ca_topic_score_codex":0.0009502187,"about_ca_topic_score_gemma":0.0011814187,"teacher_disagreement_score":0.0092691295,"about_ca_system_score_codex":0.002245503,"about_ca_system_score_gemma":0.00046488855,"threshold_uncertainty_score":0.031008303},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039128367,0.00016871066,0.9517185,0.00019881647,0.000020109168,0.00014710602,0.00050861906,0.0021344016,0.005975343],"genre_scores_gemma":[0.49217367,0.00032646506,0.4986021,0.00010518505,0.000013749647,0.00043221656,0.0014998341,0.00042887428,0.0064178933],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987218,0.00048102794,0.00008903508,0.00020377319,0.00038942404,0.00011495894],"domain_scores_gemma":[0.99767,0.0013531655,0.00020867142,0.00047721018,0.0002288444,0.00006204996],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010992781,0.0007288335,0.00057841995,0.00068678346,0.0005033555,0.0014917324,0.0012192983,0.0007881307,0.0049428307],"category_scores_gemma":[0.0037974203,0.0005540464,0.0016787769,0.00046705527,0.0014309939,0.0024765192,0.0028899591,0.0012141655,0.00058203645],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035072624,0.00011050641,0.0023063966,0.0004266842,0.00006479482,0.00057616987,0.00076993497,0.68920875,0.014454392,0.23773545,0.0018048967,0.052191366],"study_design_scores_gemma":[0.000036454887,0.000071371665,0.00018357846,0.000051128347,0.000022626074,0.00010120314,0.00012381695,0.8686691,0.010953591,0.11096785,0.008798323,0.000021009882],"about_ca_topic_score_codex":0.0026813096,"about_ca_topic_score_gemma":0.0050399546,"teacher_disagreement_score":0.0049428307,"about_ca_system_score_codex":0.00079992117,"about_ca_system_score_gemma":0.0012917405,"threshold_uncertainty_score":0.016535401},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007124159,0.0004325744,0.97677165,0.0003489367,0.00015410653,0.00021359282,0.0005247145,0.003581866,0.010848412],"genre_scores_gemma":[0.2845131,0.0017916767,0.69950384,0.00044492536,0.00017627413,0.0009989,0.0021109548,0.0006972203,0.009763215],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99789435,0.0007201617,0.00021520088,0.00035925145,0.0006427276,0.00016832649],"domain_scores_gemma":[0.99533916,0.0026802344,0.00044148002,0.0006918579,0.00066120154,0.00018598183],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002104262,0.0007345267,0.0003404344,0.0012898959,0.0008781934,0.001958025,0.0011957621,0.0012141914,0.0081854975],"category_scores_gemma":[0.006287631,0.0004946921,0.0009094159,0.001274821,0.0028431315,0.0028260374,0.0017314752,0.0015825054,0.00096374704],"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.00007447306,0.000047003,0.00095458154,0.00035697265,0.000029502558,0.0002518692,0.00095306744,0.0177911,0.005833532,0.8828476,0.0060695712,0.08479073],"study_design_scores_gemma":[0.00014687222,0.00017780466,0.0006189962,0.00026570886,0.00008946358,0.0006246557,0.00020037018,0.09971848,0.016845765,0.50096357,0.3802551,0.00009324911],"about_ca_topic_score_codex":0.004191759,"about_ca_topic_score_gemma":0.0039279414,"teacher_disagreement_score":0.0081854975,"about_ca_system_score_codex":0.0012393236,"about_ca_system_score_gemma":0.0024654919,"threshold_uncertainty_score":0.027383268},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009542654,0.00015048444,0.98664814,0.00009731706,0.000044792127,0.00006445885,0.00008525666,0.00095398974,0.0024128426],"genre_scores_gemma":[0.42137593,0.00038008468,0.5719288,0.00018753535,0.000080809936,0.00027045322,0.0006921189,0.00055214984,0.0045320736],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9955407,0.0015580865,0.00028407978,0.0008319397,0.0015753151,0.00020985298],"domain_scores_gemma":[0.992015,0.0046984176,0.0006402666,0.0016895472,0.0007792568,0.00017758904],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002715622,0.00075295195,0.000745105,0.0012684846,0.0005949629,0.0018093626,0.0017902863,0.0011636707,0.005542072],"category_scores_gemma":[0.011327513,0.00044786927,0.000993387,0.0013083384,0.0018527992,0.002468051,0.002515722,0.0022512646,0.0016201455],"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.0002905608,0.000119203265,0.0005515368,0.00036093415,0.000080000296,0.0002456661,0.00027673913,0.34885576,0.03707734,0.47608185,0.0027703342,0.13329001],"study_design_scores_gemma":[0.00001995213,0.00005444067,0.0001060639,0.000035366586,0.000013722409,0.00009069037,0.00001991113,0.6523313,0.013003661,0.32959002,0.0047075422,0.000027339138],"about_ca_topic_score_codex":0.00070887886,"about_ca_topic_score_gemma":0.00047927667,"teacher_disagreement_score":0.005542072,"about_ca_system_score_codex":0.0012578561,"about_ca_system_score_gemma":0.0010245045,"threshold_uncertainty_score":0.018540084},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018483777,0.00049289566,0.91030234,0.00043226918,0.00013797042,0.0001600674,0.00059462216,0.06708301,0.0023130288],"genre_scores_gemma":[0.3976838,0.00024964128,0.59067196,0.0006268716,0.000091645714,0.00035367245,0.0026109142,0.004877083,0.0028343962],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99248576,0.0031296285,0.0005460973,0.0011775115,0.0021106524,0.0005503286],"domain_scores_gemma":[0.98967373,0.0060716304,0.0007465494,0.0021477558,0.0011938624,0.0001664967],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004420124,0.002148067,0.0011445066,0.0018422323,0.00063484535,0.0017653493,0.0037040454,0.0011741085,0.007174558],"category_scores_gemma":[0.013679529,0.0008596601,0.002289894,0.0010468758,0.0014357987,0.0028478818,0.0021012332,0.0025190532,0.0019033725],"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.0009623548,0.0004114076,0.00821826,0.0011897574,0.0003948628,0.00027770543,0.00017612497,0.48177093,0.024741333,0.036494832,0.040941138,0.40442127],"study_design_scores_gemma":[0.00005478787,0.00007653899,0.00017293921,0.00003559095,0.00002226715,0.000038175505,0.000012874414,0.9734784,0.013646933,0.009548406,0.002892328,0.000020831572],"about_ca_topic_score_codex":0.004893159,"about_ca_topic_score_gemma":0.0088787535,"teacher_disagreement_score":0.007174558,"about_ca_system_score_codex":0.0016709038,"about_ca_system_score_gemma":0.0040996214,"threshold_uncertainty_score":0.02400124},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.056577254,0.0007796687,0.7665702,0.00096997153,0.00021630217,0.0007012409,0.0043362314,0.15368812,0.01616098],"genre_scores_gemma":[0.24204299,0.00034662607,0.73569417,0.00054214534,0.00007582754,0.00054002705,0.00826399,0.006096298,0.0063978555],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977914,0.0005665868,0.00017728853,0.00052072475,0.00070661306,0.00023743314],"domain_scores_gemma":[0.99518424,0.002674178,0.0002784286,0.0010434474,0.0006620475,0.00015756575],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018731037,0.0014268353,0.0007286782,0.0014587556,0.0006485077,0.0020899395,0.0026396522,0.00087167084,0.009867651],"category_scores_gemma":[0.008776644,0.0010119877,0.0012388286,0.0016663498,0.0009443248,0.00413032,0.0026529005,0.0018595966,0.0027040746],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015080972,0.0009304498,0.0049433494,0.0012002434,0.00013065017,0.0004520464,0.00050419226,0.14637277,0.019242777,0.073686145,0.108205535,0.64282376],"study_design_scores_gemma":[0.00035642827,0.0002902511,0.001038711,0.00009037825,0.000088182904,0.0002593551,0.00019524811,0.8540219,0.0374255,0.035749067,0.07040121,0.00008367402],"about_ca_topic_score_codex":0.006290498,"about_ca_topic_score_gemma":0.0077216127,"teacher_disagreement_score":0.009867651,"about_ca_system_score_codex":0.00163632,"about_ca_system_score_gemma":0.0050212857,"threshold_uncertainty_score":0.033010542},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028937953,0.0003317248,0.95501137,0.0010403962,0.00020414006,0.00025883384,0.00037185973,0.007722481,0.0061211917],"genre_scores_gemma":[0.38099837,0.00015656654,0.60995144,0.00077764934,0.00009617998,0.00037506764,0.000767175,0.0008791013,0.005998378],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9922916,0.002011716,0.0004011222,0.0017220187,0.0028038637,0.00076969236],"domain_scores_gemma":[0.9851968,0.008153597,0.0008532889,0.0035922907,0.0018172952,0.00038669407],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0045921523,0.0012708997,0.0016228033,0.0019833662,0.0012460011,0.0032127667,0.0048870775,0.0018553344,0.011991962],"category_scores_gemma":[0.022887615,0.00096752506,0.001603757,0.0015333396,0.002412735,0.006686248,0.0049598366,0.003210471,0.0022562924],"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.0009812623,0.0004288809,0.0032847838,0.00054132886,0.00018338018,0.00035047418,0.00026521992,0.35877725,0.018265322,0.2698248,0.016657019,0.3304403],"study_design_scores_gemma":[0.00004298557,0.00006301049,0.000086025066,0.00002845886,0.000032067783,0.00007107726,0.000024070216,0.92803794,0.0073496564,0.061097078,0.0031464442,0.00002119179],"about_ca_topic_score_codex":0.0043856795,"about_ca_topic_score_gemma":0.006418331,"teacher_disagreement_score":0.011991962,"about_ca_system_score_codex":0.0030621793,"about_ca_system_score_gemma":0.0068131597,"threshold_uncertainty_score":0.040117085},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3992159,0.0017752753,0.50859225,0.00083529344,0.00014078361,0.00011683666,0.0005298161,0.0012922593,0.08750161],"genre_scores_gemma":[0.90406346,0.00079578895,0.0778382,0.00011209234,0.00008754204,0.00007839222,0.0002978529,0.00017274938,0.01655402],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991615,0.0001772109,0.00009066684,0.0002194164,0.00021808564,0.00013320785],"domain_scores_gemma":[0.9977714,0.001404705,0.00028194484,0.00019247661,0.00017665142,0.0001729603],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00093385734,0.00042102992,0.0003379812,0.0012138122,0.0009842991,0.0016945396,0.000595067,0.00048351663,0.005024815],"category_scores_gemma":[0.0023068322,0.0004784024,0.0005276298,0.0010289111,0.002582826,0.004412836,0.0018270296,0.0011568629,0.00064326247],"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.00018978129,0.00001898232,0.0009237421,0.0001175751,0.000009171051,0.00026901532,0.0006971767,0.012237968,0.004065353,0.9648628,0.00045277763,0.016155621],"study_design_scores_gemma":[0.000025262183,0.00004047768,0.00045874616,0.000034760757,0.000018362947,0.00017719339,0.00024976573,0.025727194,0.0075033484,0.94192374,0.023820352,0.000020848787],"about_ca_topic_score_codex":0.002022777,"about_ca_topic_score_gemma":0.0022247646,"teacher_disagreement_score":0.005024815,"about_ca_system_score_codex":0.0013639287,"about_ca_system_score_gemma":0.000416821,"threshold_uncertainty_score":0.016809702},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002001896,0.0022881958,0.9851828,0.0025662712,0.00019546057,0.000025007072,0.0000419853,0.00022562261,0.007472724],"genre_scores_gemma":[0.4957005,0.009885189,0.47830835,0.0023680548,0.0017735817,0.0003363092,0.00016174467,0.00043340388,0.011032878],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.995387,0.0018755475,0.00032586284,0.0006667929,0.0015199267,0.00022486906],"domain_scores_gemma":[0.9869201,0.008885123,0.0010319477,0.0018252232,0.0010075851,0.00033010502],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006507672,0.0014305803,0.0008940592,0.0017971395,0.0012035639,0.0039131246,0.00213837,0.0027270776,0.004123594],"category_scores_gemma":[0.021982469,0.00077095156,0.0015137179,0.0017320473,0.010138702,0.009497068,0.0031767178,0.0058269384,0.00081278273],"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.000010957127,0.000011308814,0.00020796574,0.00007031228,0.000014820723,0.000034151,0.00012020028,0.014632483,0.00018780239,0.9616217,0.0017302982,0.021357872],"study_design_scores_gemma":[0.0000052415326,0.000025948892,0.00015755597,0.00009460479,0.0000129918235,0.00006682445,0.000041061907,0.05675764,0.0004799129,0.9321238,0.01020803,0.000026388238],"about_ca_topic_score_codex":0.0029186988,"about_ca_topic_score_gemma":0.0016944733,"teacher_disagreement_score":0.006507672,"about_ca_system_score_codex":0.0034375438,"about_ca_system_score_gemma":0.0018533417,"threshold_uncertainty_score":0.03441626},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24486491,0.0013313774,0.7020415,0.0010365071,0.00013294698,0.00017897511,0.00055870693,0.0009957069,0.048859328],"genre_scores_gemma":[0.8475861,0.00054838543,0.14555469,0.0003013321,0.00008955297,0.00043240757,0.00065178954,0.0001973495,0.0046384213],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9975484,0.0006888937,0.00018977134,0.00051863707,0.0006432102,0.0004110225],"domain_scores_gemma":[0.989019,0.0075754193,0.00078826863,0.0014607225,0.00060096243,0.0005556929],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002416666,0.0006531327,0.0006504838,0.001259056,0.0015515418,0.0025439954,0.0017197022,0.0011408775,0.0054300427],"category_scores_gemma":[0.012061987,0.0005926772,0.001224105,0.0013598081,0.0017337581,0.0022965807,0.0018772001,0.001964036,0.00054723775],"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.00023628896,0.00016315318,0.0019672054,0.00018972145,0.00004750347,0.00015278517,0.00026389217,0.05275836,0.009442798,0.89788836,0.003445072,0.033444963],"study_design_scores_gemma":[0.000112596834,0.00023869461,0.0014162563,0.00009014614,0.00008610964,0.00046894196,0.00008475168,0.21566513,0.013343347,0.7547611,0.013666623,0.00006626225],"about_ca_topic_score_codex":0.00067306863,"about_ca_topic_score_gemma":0.0009869016,"teacher_disagreement_score":0.0054300427,"about_ca_system_score_codex":0.0020797877,"about_ca_system_score_gemma":0.0007586986,"threshold_uncertainty_score":0.01816529},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032922454,0.0005455028,0.8815224,0.0043484517,0.0009865852,0.00040377566,0.0011029984,0.045570727,0.032597095],"genre_scores_gemma":[0.6413025,0.00093611324,0.30241886,0.004443996,0.00045388346,0.0006255729,0.0021614812,0.016360898,0.031296633],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99410063,0.0014386844,0.00063533295,0.0006998497,0.0023798964,0.0007457058],"domain_scores_gemma":[0.979182,0.006901271,0.0007785436,0.008943919,0.003846398,0.00034781615],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0079896385,0.00081824814,0.00062285207,0.00055384764,0.00082916993,0.0032132387,0.0014348092,0.0023185273,0.0102513395],"category_scores_gemma":[0.033367403,0.0013183972,0.0009776782,0.00026728373,0.0025635785,0.010728035,0.0036104666,0.005805118,0.0069770906],"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.0012910637,0.00033792804,0.0077137323,0.0014257965,0.00015340296,0.0015454802,0.0024421515,0.010656641,0.05278927,0.54561436,0.08686471,0.2891654],"study_design_scores_gemma":[0.00025588955,0.00021378964,0.002675787,0.0007811261,0.0001559659,0.0014437444,0.00042122658,0.043878213,0.16888608,0.35878763,0.42229056,0.00021006408],"about_ca_topic_score_codex":0.0011919253,"about_ca_topic_score_gemma":0.0011161679,"teacher_disagreement_score":0.0102513395,"about_ca_system_score_codex":0.0009835121,"about_ca_system_score_gemma":0.0021550632,"threshold_uncertainty_score":0.042253792},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13955863,0.0019851916,0.7412657,0.004543024,0.0005574347,0.000111719906,0.00041821817,0.00044485566,0.11111522],"genre_scores_gemma":[0.91836447,0.0013526768,0.063604236,0.0010598436,0.00074796117,0.00019175818,0.000305841,0.00017799661,0.014195345],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99673456,0.0008454747,0.00023618827,0.00067442644,0.0009413211,0.0005680053],"domain_scores_gemma":[0.9939466,0.0023710576,0.0005600298,0.0011235521,0.0010927058,0.0009061424],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004429017,0.00051562436,0.0009949555,0.0019519746,0.004571661,0.004290308,0.0012532538,0.0019054427,0.0074233855],"category_scores_gemma":[0.009540649,0.00049357937,0.0018112737,0.0021240988,0.01056326,0.0142051475,0.0065902555,0.0034373016,0.0010037922],"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.0000069219514,0.0000059233416,0.00007263651,0.0000084711155,0.000002566795,0.00003260906,0.0001084343,0.00018667601,0.0001712965,0.9982029,0.000117986856,0.0010836256],"study_design_scores_gemma":[0.0000075272965,0.000018501869,0.000075752185,0.00001572748,0.0000053701,0.00006818077,0.00008991815,0.001467143,0.00036210948,0.9942854,0.003595829,0.000008583147],"about_ca_topic_score_codex":0.0015767021,"about_ca_topic_score_gemma":0.0009644869,"teacher_disagreement_score":0.0074233855,"about_ca_system_score_codex":0.0014296188,"about_ca_system_score_gemma":0.0017049058,"threshold_uncertainty_score":0.02483368},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033394504,0.0017826596,0.84200346,0.0023973796,0.0005167528,0.00010053106,0.00038573568,0.00074908324,0.11866983],"genre_scores_gemma":[0.68625164,0.0021373408,0.2602426,0.0018315727,0.0008976393,0.00028983448,0.0008688623,0.00028711368,0.047193352],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99804854,0.00044811144,0.0001304178,0.00043180393,0.0007370691,0.00020411627],"domain_scores_gemma":[0.998104,0.00052549044,0.00013340752,0.0004647928,0.0005278005,0.00024456682],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019054844,0.0004906485,0.00044322226,0.00202734,0.0014145431,0.002285573,0.001244404,0.00064478593,0.006631142],"category_scores_gemma":[0.0025549363,0.0003416142,0.00090329914,0.0013410732,0.004447406,0.0070704073,0.005555652,0.001991572,0.001077885],"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.0000034108211,0.000004410514,0.00014538023,0.000025542473,0.0000042628194,0.000035636367,0.00019147484,0.00016503283,0.00031325972,0.9917949,0.00087464374,0.006442208],"study_design_scores_gemma":[0.000009174602,0.000029447501,0.0004906874,0.000036746,0.000017336373,0.0005278605,0.0002568478,0.002586404,0.001521085,0.8867506,0.10775115,0.000022634604],"about_ca_topic_score_codex":0.0009887354,"about_ca_topic_score_gemma":0.00092519756,"teacher_disagreement_score":0.006631142,"about_ca_system_score_codex":0.0009886826,"about_ca_system_score_gemma":0.0009468911,"threshold_uncertainty_score":0.022183359},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32257134,0.0010000952,0.6527632,0.00670668,0.00010977545,0.00038244354,0.0016419486,0.0025158557,0.012308704],"genre_scores_gemma":[0.8968776,0.0004770845,0.09688113,0.0005438039,0.00015587661,0.0002952742,0.0010805426,0.000291882,0.003396871],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99123454,0.0027550797,0.00057660515,0.0018362828,0.0026017625,0.0009956366],"domain_scores_gemma":[0.9087682,0.08120141,0.003145705,0.0042640045,0.0018873862,0.0007333194],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005613591,0.000961615,0.0015325937,0.0010846158,0.0014919654,0.006104704,0.0035184447,0.0019238237,0.0060348604],"category_scores_gemma":[0.03702197,0.0013357105,0.00310863,0.0012832205,0.0039361776,0.012058317,0.004022098,0.004447206,0.00046436815],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015223022,0.00037683663,0.007347587,0.0013011346,0.00040127136,0.0012486507,0.0014488754,0.53711367,0.012815146,0.3689916,0.0051403525,0.062292557],"study_design_scores_gemma":[0.00012168068,0.000038374026,0.00047477582,0.00003213678,0.00008473538,0.00012337853,0.00011651615,0.71339256,0.0032933953,0.28130037,0.0009822954,0.000039806662],"about_ca_topic_score_codex":0.007891197,"about_ca_topic_score_gemma":0.0073080063,"teacher_disagreement_score":0.007891197,"about_ca_system_score_codex":0.0052837743,"about_ca_system_score_gemma":0.004219525,"threshold_uncertainty_score":0.038336635},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014333229,0.00008767582,0.97237384,0.00028500933,0.0001135667,0.00031559213,0.00018963024,0.00809368,0.0042078476],"genre_scores_gemma":[0.1921308,0.00034645185,0.7958923,0.00031076928,0.00005143848,0.0010337352,0.0007452024,0.0035923638,0.005896917],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.97973675,0.007339109,0.0024082172,0.0017829351,0.00789353,0.0008394877],"domain_scores_gemma":[0.95089895,0.017736375,0.0044515776,0.01995615,0.0066489056,0.0003080483],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010784008,0.0013132847,0.0008189958,0.0019500878,0.00096888107,0.0064593204,0.0028192406,0.0024444598,0.0100414185],"category_scores_gemma":[0.06727486,0.0017921993,0.001690862,0.0011625489,0.0033758518,0.006404376,0.0039966092,0.0033239282,0.002195815],"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.0005830546,0.0005757029,0.007892069,0.0020080958,0.00024216683,0.0016215581,0.0045144064,0.12922062,0.034116376,0.42232174,0.0070352983,0.389869],"study_design_scores_gemma":[0.0004642275,0.0005304783,0.0014781173,0.0012763354,0.00028546437,0.00085250905,0.0011124647,0.42903522,0.1434738,0.30327845,0.11794561,0.0002673564],"about_ca_topic_score_codex":0.0025536935,"about_ca_topic_score_gemma":0.002161457,"teacher_disagreement_score":0.010784008,"about_ca_system_score_codex":0.0023495527,"about_ca_system_score_gemma":0.005990205,"threshold_uncertainty_score":0.05703199},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.060530875,0.00006987951,0.93544996,0.00029122128,0.000036046302,0.00007447131,0.0001366362,0.0007182925,0.0026926904],"genre_scores_gemma":[0.95734555,0.00006858981,0.040561877,0.000113450486,0.000022346225,0.00018009005,0.000150826,0.00010557024,0.0014517785],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9933961,0.0015313621,0.00039490638,0.0009127283,0.0028880893,0.000876839],"domain_scores_gemma":[0.97450835,0.018616157,0.0017684516,0.0023163646,0.0022086892,0.0005820067],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004653917,0.0009909879,0.0012015044,0.0010190197,0.0010690948,0.0022864235,0.0019306671,0.001308832,0.0026825366],"category_scores_gemma":[0.026865037,0.0007099004,0.0026380885,0.0005801437,0.0044766855,0.0026134616,0.0034698462,0.0026412068,0.00031652593],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00062078494,0.00011798006,0.0024420896,0.00027999736,0.00016808616,0.0005311899,0.0007150978,0.4880888,0.010353283,0.47918472,0.0005866036,0.016911384],"study_design_scores_gemma":[0.000065349035,0.000068169946,0.00026469742,0.000033659337,0.000039592178,0.0000490769,0.00004510483,0.7527908,0.007596477,0.2384632,0.0005584785,0.000025376863],"about_ca_topic_score_codex":0.0058162413,"about_ca_topic_score_gemma":0.004104963,"teacher_disagreement_score":0.0058162413,"about_ca_system_score_codex":0.002023631,"about_ca_system_score_gemma":0.005338395,"threshold_uncertainty_score":0.024612546},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023386177,0.00027861117,0.96651435,0.00030302486,0.00006502305,0.00008585393,0.00035464513,0.0038287798,0.0051835263],"genre_scores_gemma":[0.30496004,0.0003047124,0.68711376,0.00021550474,0.00009758498,0.0002669809,0.0020254308,0.0015689926,0.0034470598],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99825305,0.00026585496,0.00009352424,0.0002634753,0.00092081266,0.00020325514],"domain_scores_gemma":[0.9969361,0.0018733685,0.00023470585,0.0003676622,0.0004843935,0.0001037868],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00089171284,0.0012835298,0.001514759,0.0019338755,0.0010720688,0.0027903947,0.002197824,0.0009553991,0.0086222915],"category_scores_gemma":[0.008457159,0.00066090084,0.0021241351,0.0021171547,0.0015295219,0.004157823,0.003654681,0.0019529827,0.001411447],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00048199922,0.00012003884,0.002557408,0.00067939673,0.00010966245,0.0003705212,0.0004879438,0.33839598,0.011129799,0.20091589,0.015575449,0.42917585],"study_design_scores_gemma":[0.000032020493,0.000036906116,0.00012309667,0.000030884745,0.00001484803,0.00008132183,0.00009348639,0.88346034,0.006438709,0.106451474,0.0032230776,0.000013755121],"about_ca_topic_score_codex":0.0036650489,"about_ca_topic_score_gemma":0.0062822322,"teacher_disagreement_score":0.0086222915,"about_ca_system_score_codex":0.0017426063,"about_ca_system_score_gemma":0.0018521238,"threshold_uncertainty_score":0.028844416},"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":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0040196897,0.00011707591,0.8095673,0.00013859237,0.00014444569,0.00029362706,0.0012265116,0.17398784,0.010505006],"genre_scores_gemma":[0.11497741,0.00046868116,0.76382816,0.00042259798,0.000094804265,0.00066060666,0.005801888,0.078482404,0.035263557],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988901,0.00026633256,0.00008735985,0.00021257992,0.0004474537,0.00009608209],"domain_scores_gemma":[0.99719596,0.0016558103,0.0001115764,0.0006421722,0.00029438268,0.00010007435],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017317686,0.0014798859,0.000697111,0.0012842458,0.000597067,0.001984928,0.0018065235,0.0010156329,0.045668647],"category_scores_gemma":[0.0057141073,0.0013331186,0.0013438124,0.00068408565,0.00087503024,0.0028206406,0.0029875266,0.0020762654,0.014707585],"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.0009862653,0.0006565502,0.0022029139,0.0012835972,0.0001664318,0.0008354717,0.00090024533,0.016640468,0.036229495,0.082960024,0.16415292,0.69298565],"study_design_scores_gemma":[0.0005324675,0.00024924963,0.0012153633,0.00042608453,0.00017387778,0.0012809462,0.00026992196,0.33096027,0.16322714,0.08683698,0.41463974,0.00018787381],"about_ca_topic_score_codex":0.0010286612,"about_ca_topic_score_gemma":0.0019782532,"teacher_disagreement_score":0.045668647,"about_ca_system_score_codex":0.00079002103,"about_ca_system_score_gemma":0.0010096894,"threshold_uncertainty_score":0.15277678},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07988005,0.00008506637,0.91570324,0.00018852652,0.000047651698,0.0001893619,0.00006881256,0.0021554555,0.0016818129],"genre_scores_gemma":[0.67686135,0.00006283484,0.32123938,0.00013751448,0.0000146140055,0.00021832224,0.0001017532,0.0001953299,0.0011688456],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972019,0.0010485019,0.00012829894,0.00043085832,0.0009807764,0.0002097114],"domain_scores_gemma":[0.9927873,0.0049680704,0.00050060893,0.000625154,0.0008658826,0.00025300405],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002403499,0.0012548752,0.00094005937,0.0022296729,0.00089237024,0.0009267177,0.0020403594,0.0017231676,0.0018574214],"category_scores_gemma":[0.0092423735,0.0004731879,0.0013514078,0.000747993,0.0020812748,0.001550404,0.0014371845,0.0015408443,0.00027929107],"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.0005742132,0.0009549521,0.011863192,0.00032593549,0.00032109505,0.0012256659,0.00042330622,0.61213917,0.113652974,0.06559067,0.0014373189,0.19149151],"study_design_scores_gemma":[0.0000507089,0.00017337357,0.00056588295,0.000011373332,0.000036853988,0.00018050674,0.000032829044,0.9800552,0.011028002,0.007487928,0.00035404266,0.000023222736],"about_ca_topic_score_codex":0.005537814,"about_ca_topic_score_gemma":0.0048787594,"teacher_disagreement_score":0.005537814,"about_ca_system_score_codex":0.0010071396,"about_ca_system_score_gemma":0.0020689701,"threshold_uncertainty_score":0.012711048},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08431802,0.0001388716,0.9130592,0.000121843346,0.000020773576,0.00005074901,0.00006265155,0.0011639714,0.0010639135],"genre_scores_gemma":[0.6414714,0.00009065608,0.357302,0.00005608089,0.000018363882,0.000060004077,0.00017423548,0.000109070286,0.0007182353],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997687,0.0006304715,0.00017416153,0.0002461528,0.0010348506,0.00022742646],"domain_scores_gemma":[0.9948435,0.0035059904,0.0005372502,0.00060579635,0.0004465212,0.0000609936],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011913283,0.00048848765,0.0006050809,0.0010754485,0.00040267865,0.0007687565,0.0007364643,0.0005036461,0.0013408567],"category_scores_gemma":[0.008137353,0.0003486094,0.00035513478,0.00061968336,0.00070507487,0.0010366322,0.0012778639,0.0009043153,0.00030417566],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008368981,0.00018060773,0.0052286484,0.00066877686,0.00012344177,0.0007984359,0.0010200349,0.08832939,0.30412132,0.10763304,0.0024168342,0.48864257],"study_design_scores_gemma":[0.000046350062,0.00020675377,0.0013693895,0.000038633705,0.000034898818,0.00048066556,0.00008610203,0.8585704,0.10262187,0.034116127,0.0023963784,0.00003240768],"about_ca_topic_score_codex":0.0007673253,"about_ca_topic_score_gemma":0.0011807149,"teacher_disagreement_score":0.0013408567,"about_ca_system_score_codex":0.0004207274,"about_ca_system_score_gemma":0.0008691446,"threshold_uncertainty_score":0.0063004494},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004809256,0.000039204828,0.98948026,0.000047534213,0.000037048645,0.00009606535,0.00004567273,0.0020577812,0.003387205],"genre_scores_gemma":[0.17394282,0.0001225033,0.81955695,0.00010785226,0.000045713798,0.00018984995,0.00027002423,0.00082819676,0.0049360595],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99739265,0.0004086646,0.00023349228,0.00038073424,0.0013426766,0.00024171047],"domain_scores_gemma":[0.99660945,0.00096598786,0.00028524577,0.0011908534,0.00081352517,0.0001349364],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002311137,0.0007728073,0.0006709654,0.00095327373,0.00037642338,0.0017195916,0.001368263,0.0006267877,0.0056345677],"category_scores_gemma":[0.0044885273,0.00074330147,0.0013638014,0.00058555696,0.0010282726,0.0016576761,0.0022204511,0.001443334,0.0021429483],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00047798455,0.00025003386,0.001651357,0.0006195782,0.00014402959,0.0007610955,0.00062728254,0.077215806,0.2123976,0.23743619,0.0052879415,0.46313107],"study_design_scores_gemma":[0.00016702028,0.0006587367,0.00077009114,0.00023044224,0.00031836532,0.0012163146,0.00016546847,0.6000501,0.20587161,0.10351661,0.08692485,0.00011039924],"about_ca_topic_score_codex":0.0010476295,"about_ca_topic_score_gemma":0.00135268,"teacher_disagreement_score":0.0056345677,"about_ca_system_score_codex":0.00053110224,"about_ca_system_score_gemma":0.0018989344,"threshold_uncertainty_score":0.018849552},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06884038,0.00085556356,0.9109165,0.0016808466,0.00033852682,0.00020020378,0.00042128377,0.00029543907,0.01645126],"genre_scores_gemma":[0.6903846,0.0007999437,0.29765573,0.0007559088,0.00039156014,0.0007067137,0.00066791725,0.00018286382,0.00845472],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99035573,0.0031086593,0.00095373945,0.0015406314,0.0034568207,0.0005845662],"domain_scores_gemma":[0.98524636,0.0061604115,0.0025392682,0.0012138785,0.0031831856,0.0016569742],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0056677954,0.0009102221,0.0007466246,0.002975044,0.0012286671,0.0041972026,0.0015243334,0.0019753133,0.0032431243],"category_scores_gemma":[0.024143742,0.00046631767,0.0019255979,0.0018934536,0.0045609735,0.00752467,0.0039085364,0.0042623878,0.00049271184],"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.00002937156,0.00002395203,0.00040035995,0.000046870093,0.000011530251,0.00006173191,0.0003053587,0.0025110757,0.00084253604,0.98870635,0.00029216416,0.006768715],"study_design_scores_gemma":[0.000020746256,0.00015322349,0.00085551146,0.00005487031,0.000020707435,0.00035218033,0.00021988833,0.07177791,0.0020532089,0.9154535,0.008976141,0.000062058265],"about_ca_topic_score_codex":0.00089664786,"about_ca_topic_score_gemma":0.00058300974,"teacher_disagreement_score":0.0056677954,"about_ca_system_score_codex":0.0032186268,"about_ca_system_score_gemma":0.0015558181,"threshold_uncertainty_score":0.02997452},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0063334648,0.00011121949,0.9274827,0.00010048227,0.000044344855,0.00018355348,0.0007046988,0.06293221,0.0021072114],"genre_scores_gemma":[0.21911831,0.00035704667,0.7545589,0.00025798797,0.000036017675,0.0006855037,0.003179219,0.013963596,0.007843451],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9978193,0.000519266,0.0002479202,0.00033920945,0.0009351023,0.00013929508],"domain_scores_gemma":[0.99533737,0.0025466091,0.0005134421,0.00087089953,0.0006010095,0.00013068834],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034789168,0.0012636123,0.00058776786,0.0017677812,0.0004646137,0.0016003058,0.0020598166,0.0010694417,0.011510146],"category_scores_gemma":[0.011933848,0.0010641721,0.0010339549,0.00053131033,0.0009328426,0.0024240792,0.0023274922,0.0013556295,0.0023269695],"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.00091436016,0.00035244465,0.011439255,0.0022740513,0.00024108465,0.0030453163,0.0020845642,0.13886762,0.1201691,0.07009666,0.07386458,0.576651],"study_design_scores_gemma":[0.00025460788,0.00031497044,0.0018496303,0.00042628933,0.000105011386,0.0018444813,0.0002977346,0.6945041,0.13115975,0.030563787,0.13847221,0.0002073825],"about_ca_topic_score_codex":0.0023764523,"about_ca_topic_score_gemma":0.0032435593,"teacher_disagreement_score":0.011510146,"about_ca_system_score_codex":0.00086178293,"about_ca_system_score_gemma":0.0020429261,"threshold_uncertainty_score":0.038505256},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009355897,0.00017816748,0.9783261,0.00015416463,0.00009575697,0.00023109572,0.00017576561,0.004908902,0.006574198],"genre_scores_gemma":[0.10291031,0.00021632083,0.88875836,0.0001161709,0.000057464575,0.00040957626,0.00050624466,0.000539443,0.006486083],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977592,0.0003636445,0.00020261708,0.00038927916,0.0009845876,0.0003006714],"domain_scores_gemma":[0.99653035,0.0016425955,0.00018126481,0.00095933717,0.00056291796,0.00012348931],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015130067,0.0018460022,0.0016230791,0.001990977,0.0015020224,0.0027046623,0.0030963891,0.0015752218,0.025740145],"category_scores_gemma":[0.007701158,0.00094076415,0.0017146603,0.0021220238,0.0016015123,0.005152716,0.006002125,0.0026191606,0.0071398844],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00078439,0.00032127017,0.0011115366,0.0006862184,0.00007793461,0.00023353407,0.00046327896,0.109186254,0.009391277,0.20959605,0.0112630855,0.6568852],"study_design_scores_gemma":[0.00022720436,0.00021601998,0.00023456701,0.000108753215,0.0000805145,0.00025114694,0.00028297136,0.6644529,0.023966124,0.27316135,0.036945805,0.00007257028],"about_ca_topic_score_codex":0.0018330171,"about_ca_topic_score_gemma":0.003106801,"teacher_disagreement_score":0.025740145,"about_ca_system_score_codex":0.0011041148,"about_ca_system_score_gemma":0.0012727033,"threshold_uncertainty_score":0.08610934},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039024256,0.0017192907,0.5693787,0.003786002,0.0014687912,0.00013390207,0.0008768712,0.0013162851,0.3822959],"genre_scores_gemma":[0.830257,0.001635381,0.07624288,0.0021609257,0.0031444146,0.00050080207,0.0020112153,0.0017028138,0.08234455],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99754876,0.00050173025,0.00021221512,0.00075305026,0.00059451396,0.00038969325],"domain_scores_gemma":[0.99531,0.00255705,0.0002788018,0.00082846393,0.00076499477,0.00026078473],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018365566,0.0011506699,0.0011740648,0.001857593,0.0015675201,0.0030558521,0.0014364073,0.0017469648,0.0343099],"category_scores_gemma":[0.007901226,0.0007784557,0.002559059,0.0011909344,0.0040862723,0.009222336,0.0029183172,0.005820503,0.0065386114],"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.000028034696,0.00001609283,0.00003749636,0.000028152903,0.0000064330784,0.000038180853,0.000076219134,0.00019538765,0.00047330934,0.98988765,0.0035452445,0.0056677544],"study_design_scores_gemma":[0.000014250878,0.000014048361,0.00006562516,0.000009215329,0.000009131867,0.00009032749,0.000029331954,0.0014511601,0.0005869659,0.99193734,0.0057822117,0.000010286512],"about_ca_topic_score_codex":0.000375262,"about_ca_topic_score_gemma":0.0003186888,"teacher_disagreement_score":0.0343099,"about_ca_system_score_codex":0.0011819021,"about_ca_system_score_gemma":0.0007540862,"threshold_uncertainty_score":0.11477804},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042228,0.00031424226,0.9264488,0.000527602,0.00012461474,0.00036308373,0.0022971004,0.0034733047,0.024223296],"genre_scores_gemma":[0.5792196,0.00091425236,0.3656647,0.0001721595,0.00006311302,0.00080239127,0.0035986376,0.0006655956,0.04889954],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995036,0.00014371096,0.00003696488,0.00008873809,0.000166717,0.00006031011],"domain_scores_gemma":[0.99932766,0.00034623305,0.00008874303,0.00010019097,0.00009944503,0.000037704925],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00082298764,0.0006673838,0.00022604996,0.0005846429,0.00034992647,0.0018967116,0.0008914592,0.0012567258,0.013033672],"category_scores_gemma":[0.0017509527,0.00035285013,0.0009272798,0.0003346791,0.0005482098,0.0012604317,0.00094370195,0.0008150758,0.002375261],"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.0004954568,0.00018421581,0.004833594,0.0005419572,0.000055566397,0.0034642138,0.0014249458,0.4976938,0.023093985,0.416258,0.0074132355,0.044541154],"study_design_scores_gemma":[0.00015029938,0.00023975207,0.0016597754,0.00013218263,0.0000713201,0.0008779122,0.00027093315,0.7931364,0.011883477,0.069576286,0.12193854,0.000063085135],"about_ca_topic_score_codex":0.010017202,"about_ca_topic_score_gemma":0.0061496804,"teacher_disagreement_score":0.013033672,"about_ca_system_score_codex":0.00061538094,"about_ca_system_score_gemma":0.00089962897,"threshold_uncertainty_score":0.04360193},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009093974,0.00003346649,0.9880888,0.00006232207,0.000030291341,0.00008202682,0.00002992359,0.0011452505,0.0014340366],"genre_scores_gemma":[0.486854,0.00011309469,0.51062584,0.00017632564,0.00003437588,0.000291994,0.00026952696,0.0002329135,0.0014018685],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971207,0.00080985535,0.00019678341,0.0004597784,0.0011601108,0.00025271586],"domain_scores_gemma":[0.9937065,0.0041916315,0.00037406106,0.00067096256,0.00088268734,0.00017414095],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020397836,0.00071366405,0.000567154,0.0010317882,0.00039711408,0.0011861811,0.00166372,0.00073299673,0.0031304175],"category_scores_gemma":[0.008284363,0.00031166058,0.0010330619,0.00080384384,0.001602356,0.0015139312,0.00098458,0.0010895152,0.0004290109],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00077113026,0.00030484473,0.0023492926,0.00049770775,0.000118947224,0.0013759246,0.0004069539,0.26100877,0.053718843,0.45950317,0.0027707499,0.21717374],"study_design_scores_gemma":[0.00021002929,0.00023934476,0.00016644721,0.00005120619,0.00007271838,0.00036724718,0.000033024462,0.82425183,0.0489048,0.12185522,0.003809199,0.000038865444],"about_ca_topic_score_codex":0.0011155838,"about_ca_topic_score_gemma":0.0010039303,"teacher_disagreement_score":0.0031304175,"about_ca_system_score_codex":0.0008463996,"about_ca_system_score_gemma":0.0014472504,"threshold_uncertainty_score":0.010787547},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012922946,0.016367635,0.9024012,0.0019891276,0.00046631208,0.000101276484,0.0005543149,0.00044770376,0.06474945],"genre_scores_gemma":[0.4511088,0.012663182,0.5008286,0.00072795805,0.0009987712,0.0004117464,0.0012290409,0.00021787253,0.031813968],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99757993,0.0009728268,0.0002340958,0.00042456048,0.0006295921,0.00015892976],"domain_scores_gemma":[0.99757224,0.0014970069,0.00025850706,0.0003159002,0.0002446322,0.00011165822],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023514268,0.00094530336,0.0008788506,0.0015368148,0.0012593354,0.0048461244,0.0014378766,0.0011867338,0.0075230813],"category_scores_gemma":[0.0047445986,0.00073587155,0.0013151116,0.0024496978,0.0032680393,0.007179906,0.001495006,0.0029891643,0.00149286],"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.000013901173,0.000010842984,0.000049888713,0.000067793146,0.000007283454,0.000023278619,0.000087113156,0.0013670473,0.0002773683,0.98633957,0.0011007609,0.010655142],"study_design_scores_gemma":[0.0000034183122,0.0000049621776,0.000022876118,0.00002083085,0.0000042579413,0.000029278792,0.000017828448,0.0023408306,0.00018067968,0.9912941,0.006075542,0.000005421184],"about_ca_topic_score_codex":0.0012109119,"about_ca_topic_score_gemma":0.0015463769,"teacher_disagreement_score":0.0075230813,"about_ca_system_score_codex":0.0018288603,"about_ca_system_score_gemma":0.0010420767,"threshold_uncertainty_score":0.025167227},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031561308,0.002857725,0.749921,0.016226942,0.00447636,0.00023533539,0.00062761665,0.0046817274,0.18941198],"genre_scores_gemma":[0.45025223,0.0029601764,0.4441973,0.0054518846,0.0012242631,0.00016009902,0.0009050441,0.00518157,0.08966749],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961701,0.0012672298,0.00015682598,0.0006144518,0.0013749112,0.00041637814],"domain_scores_gemma":[0.9894176,0.0047508483,0.00020831023,0.0033769985,0.0019481707,0.00029807893],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026774602,0.000774303,0.0011317789,0.0021285303,0.0033856363,0.0049793557,0.0029887324,0.0025056587,0.03113894],"category_scores_gemma":[0.022767022,0.00063322496,0.0010865239,0.0033811165,0.0037409216,0.010394145,0.0045877774,0.0046947054,0.008947282],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036778784,0.00009357195,0.0006847859,0.00027397132,0.000026990134,0.00017336308,0.00060547463,0.009423686,0.0016654135,0.6866613,0.048173036,0.25185066],"study_design_scores_gemma":[0.00012992465,0.000045532917,0.00014457392,0.00016739103,0.000049041162,0.0002561558,0.00048905483,0.044430606,0.004243259,0.84236485,0.107627556,0.00005201024],"about_ca_topic_score_codex":0.0068390374,"about_ca_topic_score_gemma":0.009947862,"teacher_disagreement_score":0.03113894,"about_ca_system_score_codex":0.0025239345,"about_ca_system_score_gemma":0.004924767,"threshold_uncertainty_score":0.104170084},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011024589,0.018164484,0.9517465,0.0015900439,0.0012499838,0.00020650485,0.00041502516,0.0011462623,0.024378734],"genre_scores_gemma":[0.090795755,0.031489905,0.85387915,0.0014737415,0.0016398588,0.0014439293,0.0011428234,0.00067861413,0.017456185],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.995992,0.0013326858,0.00067704316,0.00072714867,0.001087415,0.00018369686],"domain_scores_gemma":[0.9957587,0.0026392022,0.00040177203,0.00060141616,0.00046532357,0.00013355394],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029698478,0.001972044,0.0010941171,0.0027414619,0.0010545457,0.003339396,0.0021417558,0.0020513018,0.009653408],"category_scores_gemma":[0.008957244,0.0009227985,0.0023051251,0.0035054034,0.003986776,0.005253302,0.0023695223,0.0062057455,0.004283794],"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.000026875483,0.000014492693,0.00014918862,0.0004395205,0.00002491274,0.0002393196,0.00032669463,0.005661498,0.0011129316,0.9564341,0.004354869,0.03121552],"study_design_scores_gemma":[0.000037798458,0.00004252365,0.00014867897,0.00047648104,0.000047418842,0.00050915556,0.00012895014,0.021824209,0.0018964931,0.6962141,0.27863103,0.000043275024],"about_ca_topic_score_codex":0.0018241727,"about_ca_topic_score_gemma":0.0015110364,"teacher_disagreement_score":0.009653408,"about_ca_system_score_codex":0.002445475,"about_ca_system_score_gemma":0.0020623372,"threshold_uncertainty_score":0.032293916},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006309747,0.00019650483,0.97833043,0.00007120335,0.00007933413,0.00015731154,0.0005298021,0.018030334,0.0019740972],"genre_scores_gemma":[0.054818984,0.0011795254,0.9103626,0.00040307594,0.00017014591,0.0011370467,0.0055479053,0.015172048,0.011208666],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99314225,0.0017897659,0.0007334912,0.0013254731,0.0025887568,0.0004202576],"domain_scores_gemma":[0.99019086,0.0040208804,0.0004983918,0.0036886449,0.001406486,0.00019473434],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005334082,0.0026674771,0.0018891797,0.0030372345,0.0013628587,0.0030529173,0.004954474,0.0025133947,0.0142431855],"category_scores_gemma":[0.015035431,0.0025700992,0.0027263619,0.0027786924,0.0023105808,0.0060121357,0.0051025604,0.0045859334,0.009742436],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006694554,0.0003587115,0.0017470769,0.0025262067,0.00027415348,0.0005497505,0.00096705725,0.042649638,0.03424316,0.24615192,0.06997936,0.5998835],"study_design_scores_gemma":[0.00023072673,0.00032871458,0.0005007994,0.00066750834,0.00034259347,0.0010364506,0.00017318416,0.20178445,0.107796796,0.42938596,0.2575178,0.00023505834],"about_ca_topic_score_codex":0.0018572146,"about_ca_topic_score_gemma":0.0023137927,"teacher_disagreement_score":0.0142431855,"about_ca_system_score_codex":0.0009810565,"about_ca_system_score_gemma":0.0032139474,"threshold_uncertainty_score":0.04764819},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009657682,0.00030780936,0.9802303,0.0007199018,0.00007185084,0.00007634825,0.0002241177,0.0057067554,0.0030051433],"genre_scores_gemma":[0.19015639,0.0004464523,0.8018631,0.00045729507,0.0001178833,0.00024835733,0.001039533,0.0020734929,0.003597522],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9873754,0.0039486857,0.0005989587,0.0021178464,0.004977376,0.0009817557],"domain_scores_gemma":[0.9656681,0.020334303,0.0011220156,0.009336124,0.0030504582,0.0004889545],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006262444,0.001581037,0.0018300758,0.002376235,0.0014884952,0.0059790094,0.0043821787,0.0021647855,0.009013816],"category_scores_gemma":[0.041640665,0.0015757948,0.0028401646,0.0018609123,0.0032131744,0.011227926,0.006992569,0.0057136007,0.0025799775],"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.00033555506,0.00021447992,0.0028728135,0.0010441734,0.00017939518,0.0003775572,0.0008385482,0.13839217,0.012262123,0.5447332,0.018085456,0.28066453],"study_design_scores_gemma":[0.000045169676,0.000041181076,0.0001569809,0.000096365846,0.00003984234,0.00015116658,0.00011737708,0.55662555,0.012491273,0.41705647,0.013143034,0.000035532077],"about_ca_topic_score_codex":0.0036408491,"about_ca_topic_score_gemma":0.005999494,"teacher_disagreement_score":0.009013816,"about_ca_system_score_codex":0.002987917,"about_ca_system_score_gemma":0.005320493,"threshold_uncertainty_score":0.03311932},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12597843,0.0015082071,0.6632838,0.0022283043,0.0006304937,0.00042198025,0.01944365,0.17784902,0.008656054],"genre_scores_gemma":[0.45278993,0.00036820685,0.49309957,0.00066929683,0.00020051473,0.0006496225,0.0337433,0.012823193,0.005656312],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99647576,0.0005314364,0.0003620114,0.00074861717,0.0015924704,0.0002896826],"domain_scores_gemma":[0.9874622,0.0075112623,0.001130845,0.0021761926,0.001554208,0.00016520909],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021125237,0.0019213723,0.0010255651,0.0032507742,0.0006550274,0.0026702948,0.002415265,0.0011926487,0.00923115],"category_scores_gemma":[0.024350822,0.0012286069,0.0021291452,0.0025753288,0.0007644544,0.003625356,0.0018565862,0.0025691912,0.0037901592],"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.0018141292,0.0006061014,0.036997452,0.0016895083,0.00037326015,0.00075099646,0.00045218223,0.15937021,0.03753245,0.02366691,0.09903133,0.63771546],"study_design_scores_gemma":[0.0002299995,0.00037362985,0.008921187,0.00023122868,0.00013107476,0.00048923015,0.000082072846,0.8578078,0.05742762,0.025223644,0.048962813,0.00011975926],"about_ca_topic_score_codex":0.004591553,"about_ca_topic_score_gemma":0.009366498,"teacher_disagreement_score":0.00923115,"about_ca_system_score_codex":0.0015852615,"about_ca_system_score_gemma":0.0023619372,"threshold_uncertainty_score":0.030881286},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013427716,0.036008645,0.8191637,0.02406695,0.03247132,0.0006978905,0.0012615417,0.0029303846,0.06997181],"genre_scores_gemma":[0.11751743,0.03349598,0.5799769,0.0057328194,0.014513307,0.0012005289,0.008297223,0.004524918,0.23474093],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9928893,0.00310589,0.0006192415,0.0009981385,0.0018659215,0.0005214802],"domain_scores_gemma":[0.9906076,0.0038884268,0.0002378484,0.0020558,0.0022158336,0.0009944366],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.014931052,0.002024207,0.0018286365,0.002483075,0.0010495855,0.007240694,0.003330158,0.0033692152,0.031629458],"category_scores_gemma":[0.014330704,0.00096194854,0.0031738605,0.0013130653,0.0023074546,0.0054683127,0.005205663,0.0074394806,0.01078383],"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.00076725526,0.0009773365,0.0013177521,0.0013364418,0.0003403694,0.0008523782,0.0027681645,0.008804654,0.010580204,0.11757336,0.28102455,0.5736575],"study_design_scores_gemma":[0.00012555691,0.00028703338,0.0012552537,0.0012755902,0.00012952264,0.0010158309,0.00049506937,0.016789552,0.0066397917,0.117465235,0.85443103,0.0000905908],"about_ca_topic_score_codex":0.001844646,"about_ca_topic_score_gemma":0.0022995719,"teacher_disagreement_score":0.031629458,"about_ca_system_score_codex":0.0026134318,"about_ca_system_score_gemma":0.0034504102,"threshold_uncertainty_score":0.10581112},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005620828,0.00061902235,0.9809456,0.00073124556,0.0001500548,0.00012054447,0.0000956748,0.00040703517,0.011310032],"genre_scores_gemma":[0.17006306,0.0019091392,0.809505,0.0013034703,0.0006787338,0.00092315493,0.0005332363,0.0008624756,0.014221656],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98847824,0.0032098899,0.0011479451,0.0026371432,0.003797472,0.00072924007],"domain_scores_gemma":[0.98317796,0.0056867735,0.0010402224,0.0070006233,0.0024628944,0.00063159503],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010461644,0.0015783012,0.0013093157,0.0033984354,0.002247258,0.004368672,0.003077477,0.0022438746,0.0053295274],"category_scores_gemma":[0.017771456,0.001484603,0.003576285,0.0031147744,0.011978461,0.014554716,0.007252666,0.0070799105,0.0016849915],"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.000034982553,0.000018574507,0.0002132981,0.00007487196,0.00002021704,0.00009057072,0.0006021314,0.0035113927,0.0017065379,0.9803105,0.0007291616,0.012687756],"study_design_scores_gemma":[0.000049289116,0.00012155344,0.00021904403,0.00012462768,0.0000697674,0.00032942827,0.00016849909,0.021996066,0.0034906548,0.91906637,0.05430436,0.00006037117],"about_ca_topic_score_codex":0.0022154946,"about_ca_topic_score_gemma":0.0018340148,"teacher_disagreement_score":0.010461644,"about_ca_system_score_codex":0.002019577,"about_ca_system_score_gemma":0.0023006697,"threshold_uncertainty_score":0.055327117},"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":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006479205,0.03671963,0.6853081,0.02551545,0.039149504,0.0006399291,0.003224736,0.005647672,0.19731578],"genre_scores_gemma":[0.08919389,0.037044704,0.35912353,0.007517108,0.0197704,0.0012640383,0.015565746,0.007645708,0.46287498],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99309146,0.0018841167,0.00058792013,0.0010650976,0.0028332116,0.00053823035],"domain_scores_gemma":[0.9940143,0.0021149488,0.00014356538,0.0013012952,0.0018656215,0.0005602948],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0077448986,0.0014779029,0.0020624746,0.0017656301,0.001392437,0.008090829,0.002579672,0.0016755675,0.062758155],"category_scores_gemma":[0.009156725,0.0010272425,0.0023240922,0.001606271,0.0028141378,0.0070336154,0.0052778157,0.007149887,0.017147552],"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.0003574248,0.000262704,0.0006454225,0.0008056348,0.00018671787,0.00031362192,0.0011095109,0.0042234473,0.0063822162,0.22071826,0.4654556,0.29953957],"study_design_scores_gemma":[0.00003719733,0.000061050145,0.0003961367,0.0003402682,0.000043473403,0.00026976355,0.00015533884,0.0047690882,0.0022058098,0.082828075,0.90884346,0.0000503132],"about_ca_topic_score_codex":0.004774583,"about_ca_topic_score_gemma":0.0056725997,"teacher_disagreement_score":0.062758155,"about_ca_system_score_codex":0.0035929435,"about_ca_system_score_gemma":0.0042749313,"threshold_uncertainty_score":0.20994693},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003581272,0.000063244195,0.00012631693,0.00002476362,0.000020805739,0.0000056809095,0.9986167,0.00042906604,0.00035528463],"genre_scores_gemma":[0.0014272633,0.000051952964,0.00044903526,0.00004470207,0.000011622959,0.00007103845,0.99690515,0.0002076421,0.00083165383],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986265,0.00022264787,0.0001130952,0.00060950563,0.00023912407,0.00018914665],"domain_scores_gemma":[0.99690634,0.0013864457,0.00030427953,0.0007748701,0.0004860697,0.00014210057],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017489127,0.002820076,0.0018903402,0.0034927193,0.0009385979,0.0024063794,0.0029037127,0.0020691513,0.08521647],"category_scores_gemma":[0.0075291297,0.0009929494,0.0021402144,0.0047156513,0.0004902859,0.0008716883,0.0016803313,0.0016456235,0.09031722],"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.00020670227,0.000053698022,0.0060033216,0.0013738811,0.0002820364,0.00007129855,0.00006711991,0.00080604636,0.0007717704,0.00083903933,0.9839295,0.0055955695],"study_design_scores_gemma":[0.0009939796,0.000067967485,0.03823226,0.000428741,0.00028477624,0.00025146687,0.00013491834,0.0011437907,0.0014247602,0.003170716,0.95376474,0.00010178734],"about_ca_topic_score_codex":0.01667603,"about_ca_topic_score_gemma":0.026669404,"teacher_disagreement_score":0.08521647,"about_ca_system_score_codex":0.0009143048,"about_ca_system_score_gemma":0.0014386813,"threshold_uncertainty_score":0.28507745},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003964963,0.00008859866,0.9943336,0.00004501053,0.00001530273,0.00005305408,0.000037517148,0.0009113398,0.00055059633],"genre_scores_gemma":[0.22083749,0.00046527732,0.77522427,0.000114324466,0.00003174046,0.00034763484,0.00038162596,0.00037309824,0.0022244523],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9930837,0.003112027,0.00064523815,0.00062702235,0.0022380538,0.00029400276],"domain_scores_gemma":[0.9892809,0.0065109534,0.00092252926,0.002365254,0.000814382,0.00010591238],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0054735346,0.0010622921,0.0007223451,0.0010152058,0.00051765644,0.001982544,0.0022389349,0.0010519335,0.0017953234],"category_scores_gemma":[0.012225142,0.000808258,0.0016657979,0.00079211255,0.001838997,0.0034939442,0.0018884265,0.0015782289,0.0004042504],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004080706,0.00020404202,0.0021521538,0.00092527765,0.00023841146,0.00071294926,0.0008732306,0.45745966,0.027844066,0.3405268,0.002031856,0.1666235],"study_design_scores_gemma":[0.0002311241,0.000093596645,0.0002220868,0.00012794865,0.00009152052,0.00028642293,0.000054501998,0.878087,0.03671909,0.06886498,0.01515814,0.00006362274],"about_ca_topic_score_codex":0.0020485919,"about_ca_topic_score_gemma":0.0022588808,"teacher_disagreement_score":0.0054735346,"about_ca_system_score_codex":0.0012042932,"about_ca_system_score_gemma":0.0022047302,"threshold_uncertainty_score":0.028947175},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002865621,0.000032090848,0.99801207,0.0000260945,0.000027619752,0.00003252286,0.000037390873,0.0010969497,0.00044869888],"genre_scores_gemma":[0.035926905,0.00020696194,0.95808333,0.00013808956,0.000044359043,0.00039748687,0.0004495911,0.0010296475,0.0037236547],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9960466,0.0012022447,0.0004246429,0.00056595,0.001527634,0.00023286471],"domain_scores_gemma":[0.9963607,0.0018460758,0.00021270351,0.000823513,0.0006734808,0.000083471474],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034861648,0.0013052281,0.0009967459,0.0013169968,0.0008068505,0.0020480168,0.003107178,0.0013432538,0.007633236],"category_scores_gemma":[0.0075188926,0.0010928327,0.0021756825,0.0011099438,0.0015366978,0.0032556574,0.002058921,0.0024969273,0.0021121728],"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.00022146445,0.00016898083,0.0007119602,0.00081806385,0.00015345552,0.0007220153,0.0005634559,0.0982627,0.027596876,0.5402519,0.013142827,0.3173862],"study_design_scores_gemma":[0.00022877654,0.00009009604,0.00013646678,0.00017698217,0.00012908087,0.0007137104,0.00005303721,0.74148464,0.035237573,0.12259698,0.099028125,0.00012454091],"about_ca_topic_score_codex":0.0022696056,"about_ca_topic_score_gemma":0.0023725969,"teacher_disagreement_score":0.007633236,"about_ca_system_score_codex":0.0011518773,"about_ca_system_score_gemma":0.0027760009,"threshold_uncertainty_score":0.025535703},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031211536,0.00017208354,0.9658567,0.0001273623,0.00002441122,0.000022896644,0.000053352072,0.0002587617,0.0022729386],"genre_scores_gemma":[0.93466604,0.00023582489,0.061031412,0.000056840632,0.000031549138,0.00008041494,0.0001241883,0.00009554083,0.0036781745],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989961,0.00025713004,0.000034854067,0.0001756499,0.00044315401,0.00009312287],"domain_scores_gemma":[0.9978284,0.0015685733,0.00018692586,0.00014161038,0.00022463665,0.000049967573],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001073898,0.000579404,0.0005370224,0.0005640862,0.0003836663,0.0010228022,0.0009115044,0.00052688475,0.0031504687],"category_scores_gemma":[0.0044783796,0.00032150245,0.0007899951,0.0003536233,0.0014252681,0.0012957463,0.0012492868,0.0009828334,0.00023487836],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007902657,0.000015904927,0.0010982263,0.000112294336,0.000051833067,0.00016623543,0.00014114825,0.81635374,0.0053803013,0.16565068,0.00023416406,0.010716371],"study_design_scores_gemma":[0.0000052355535,0.000009329894,0.00013217848,0.0000044435897,0.0000062111326,0.000014819072,0.000012091353,0.9580245,0.0011334644,0.040160805,0.0004927932,0.000004146054],"about_ca_topic_score_codex":0.0031633358,"about_ca_topic_score_gemma":0.0016425585,"teacher_disagreement_score":0.0031633358,"about_ca_system_score_codex":0.001137091,"about_ca_system_score_gemma":0.0008173255,"threshold_uncertainty_score":0.010539353},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20198873,0.00026170356,0.79353344,0.00023210364,0.00003850499,0.00006400662,0.00027684146,0.0005072306,0.0030973726],"genre_scores_gemma":[0.7994967,0.00015828748,0.19806913,0.00008675424,0.000029240728,0.00012186159,0.000444857,0.00009711067,0.0014960641],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99539363,0.0010761984,0.00051517575,0.0014559701,0.0012225062,0.00033639156],"domain_scores_gemma":[0.98637724,0.009217948,0.0012542112,0.0016566532,0.00092404266,0.0005700142],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026779976,0.0007608497,0.0007433822,0.0022115284,0.0009213853,0.0029885734,0.0018823562,0.0013417905,0.0022625346],"category_scores_gemma":[0.02175604,0.00073964486,0.0010916069,0.0012912552,0.0024082887,0.008322096,0.0050832024,0.0023410332,0.00033184222],"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.00043385982,0.00008341086,0.005297093,0.0002691406,0.00009523776,0.00018947912,0.0008750233,0.20673785,0.010211539,0.707152,0.00038341782,0.068271965],"study_design_scores_gemma":[0.000020140831,0.00013670408,0.0008130681,0.00004171188,0.000035188594,0.00012865097,0.00015866967,0.38050705,0.011633861,0.60354173,0.002930802,0.000052343523],"about_ca_topic_score_codex":0.001254426,"about_ca_topic_score_gemma":0.0011247022,"teacher_disagreement_score":0.0029885734,"about_ca_system_score_codex":0.0027181827,"about_ca_system_score_gemma":0.000984732,"threshold_uncertainty_score":0.019721866},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00008049725,0.00009930618,0.0000362008,0.000045915534,0.0000314054,0.000010745082,0.9987702,0.00036323705,0.00056241476],"genre_scores_gemma":[0.00022362346,0.00007795076,0.00023587269,0.0000584121,0.000008905588,0.000051723116,0.99846613,0.000084429994,0.00079290365],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9983065,0.00023458712,0.00016705814,0.00058535306,0.0003941764,0.00031223817],"domain_scores_gemma":[0.99688894,0.00083384896,0.00028556617,0.0007542057,0.00075485837,0.00048260234],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001278576,0.004536663,0.002514283,0.007207331,0.0017947645,0.0043808203,0.004048714,0.0043995804,0.16352962],"category_scores_gemma":[0.007838036,0.0012140786,0.0022922985,0.01071665,0.0009109908,0.0018687592,0.0030321663,0.0021071897,0.26218718],"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.0000839576,0.000025712288,0.0005458028,0.0010751893,0.000035037476,0.000019823075,0.000028927554,0.00022124249,0.00016529972,0.00030633865,0.99582505,0.001667584],"study_design_scores_gemma":[0.00060216803,0.000053265274,0.003279331,0.0005084285,0.000092605624,0.00007601522,0.00013627966,0.00051708694,0.00052103656,0.001390927,0.9927672,0.00005561891],"about_ca_topic_score_codex":0.035997443,"about_ca_topic_score_gemma":0.06210097,"teacher_disagreement_score":0.83647037,"about_ca_system_score_codex":0.0018814228,"about_ca_system_score_gemma":0.004909958,"threshold_uncertainty_score":0.5470611},"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":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004210906,0.000056924782,0.0392272,0.00038952054,0.00016856912,0.00043705452,0.923563,0.01673553,0.01900113],"genre_scores_gemma":[0.014951526,0.00025651217,0.052253272,0.00068961637,0.00019147783,0.0025140438,0.8424596,0.02238306,0.0643009],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99885094,0.0002860941,0.00013864654,0.00022147415,0.00037557093,0.0001273409],"domain_scores_gemma":[0.98852485,0.008352061,0.0004533714,0.001003092,0.0014046626,0.00026204827],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0021717264,0.0019478977,0.0009833659,0.001766701,0.0010045981,0.0022453035,0.0027702963,0.0017339744,0.8246438],"category_scores_gemma":[0.015895333,0.0013038204,0.0013265806,0.0019479211,0.0005655204,0.0032715688,0.00187216,0.0016039923,0.30818468],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002841825,0.00006280316,0.0007630341,0.0013235003,0.000022485388,0.00015445046,0.00012845501,0.0019328296,0.0005541839,0.011337705,0.96739334,0.016042948],"study_design_scores_gemma":[0.00051903055,0.00006313885,0.0012016585,0.00051910285,0.000034362292,0.00026492856,0.0001306806,0.0046933815,0.0023902357,0.021145146,0.96896744,0.00007093187],"about_ca_topic_score_codex":0.006945094,"about_ca_topic_score_gemma":0.007917357,"teacher_disagreement_score":0.8246438,"about_ca_system_score_codex":0.0016005726,"about_ca_system_score_gemma":0.0018800881,"threshold_uncertainty_score":0.25012434},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00247971,0.00007780795,0.000061553736,0.00004974317,0.000018287765,0.000009310309,0.9958835,0.00017875538,0.0012412511],"genre_scores_gemma":[0.0049701235,0.00006381811,0.00023947806,0.000035623256,0.000005220555,0.000026975244,0.9930982,0.00004777185,0.0015128336],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995092,0.000022427259,0.000028813103,0.0001274095,0.00016663226,0.00014556812],"domain_scores_gemma":[0.99834776,0.00006952541,0.00011076582,0.00018818465,0.0010342116,0.0002494654],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042374112,0.0011973497,0.00082930626,0.0023878454,0.0009870976,0.0012321132,0.0019909723,0.0006634997,0.0116908],"category_scores_gemma":[0.0020393343,0.00040699868,0.00058502395,0.006331162,0.00035776853,0.0005314618,0.0010762301,0.0008075994,0.010929511],"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.00015622914,0.00002789965,0.023012849,0.00045203816,0.00008071499,0.00009818186,0.00015167397,0.0013038573,0.00032648217,0.0005565559,0.96860325,0.00523012],"study_design_scores_gemma":[0.00022971915,0.000020238404,0.2422409,0.0005262159,0.00006205704,0.00010141182,0.0008897182,0.0023250363,0.0013053576,0.00051620015,0.75167996,0.000103188846],"about_ca_topic_score_codex":0.9392365,"about_ca_topic_score_gemma":0.9773217,"teacher_disagreement_score":0.06076348,"about_ca_system_score_codex":0.006734472,"about_ca_system_score_gemma":0.010146356,"threshold_uncertainty_score":0.12224263},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19209975,0.0018137725,0.29520494,0.0021250919,0.00024366043,0.011525315,0.0041246437,0.0025956202,0.49026725],"genre_scores_gemma":[0.7079566,0.00072194816,0.19290127,0.00041273612,0.000036110807,0.0036401455,0.0019248812,0.00043034513,0.09197603],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9934465,0.00070333853,0.00035580227,0.00036741816,0.003968519,0.0011583808],"domain_scores_gemma":[0.99242777,0.0010053013,0.0003884733,0.00019983642,0.0053759837,0.0006025716],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021549792,0.0010475358,0.0005964649,0.0028310013,0.0038612045,0.004050752,0.0021874115,0.0013443194,0.023021054],"category_scores_gemma":[0.009193959,0.0006117684,0.00068383565,0.0014044751,0.0015768606,0.0011413129,0.0016571262,0.0005485378,0.003858931],"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.0013581672,0.00040165475,0.019771302,0.0025790522,0.00009230613,0.003225864,0.005373049,0.16745406,0.06697751,0.28380787,0.07754477,0.3714144],"study_design_scores_gemma":[0.0005488543,0.0013052087,0.023105232,0.0014584505,0.0002746408,0.0016857587,0.00913362,0.14222746,0.052479986,0.027879674,0.7394562,0.0004449989],"about_ca_topic_score_codex":0.5960395,"about_ca_topic_score_gemma":0.6846788,"teacher_disagreement_score":0.40396053,"about_ca_system_score_codex":0.01519941,"about_ca_system_score_gemma":0.031601947,"threshold_uncertainty_score":0.81267905},"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":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011495657,0.00013469065,0.95899725,0.0001126726,0.00007102723,0.00009239522,0.00032581668,0.035662197,0.0034543935],"genre_scores_gemma":[0.07089718,0.0005220127,0.9045747,0.0006051239,0.00008464901,0.00091012125,0.0029681318,0.012829645,0.0066083972],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9965197,0.0009550757,0.0003904379,0.0007562545,0.0010923307,0.00028619965],"domain_scores_gemma":[0.9970739,0.0014230919,0.00019026916,0.0008678218,0.00030818008,0.00013667012],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034284357,0.0017070497,0.0009703005,0.001129924,0.0005010391,0.0029596877,0.004426575,0.001852741,0.020481091],"category_scores_gemma":[0.008633858,0.0014454239,0.0025432236,0.00087507407,0.0015098066,0.0046058497,0.0048940205,0.0054588607,0.0069858176],"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.0013326856,0.00046124557,0.0019057551,0.0019758192,0.0003274727,0.0005122114,0.0008864119,0.089128174,0.025797794,0.34035543,0.09637944,0.44093767],"study_design_scores_gemma":[0.0004924046,0.00022385402,0.00024378506,0.00025956874,0.00009525379,0.0005017725,0.00007554133,0.66344714,0.033057477,0.121191375,0.18028425,0.00012760644],"about_ca_topic_score_codex":0.0013586268,"about_ca_topic_score_gemma":0.0015453147,"teacher_disagreement_score":0.020481091,"about_ca_system_score_codex":0.0011473076,"about_ca_system_score_gemma":0.0022276817,"threshold_uncertainty_score":0.068516016},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24220052,0.0045817876,0.6242506,0.019643055,0.00070164714,0.00027350988,0.0024764787,0.0027887342,0.10308361],"genre_scores_gemma":[0.887867,0.0016141031,0.09019986,0.001660493,0.00086222216,0.0003344673,0.0016434477,0.0009404831,0.014877985],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99310607,0.00139602,0.00040161496,0.0018520205,0.0022527943,0.0009915732],"domain_scores_gemma":[0.95532984,0.03300066,0.0015272815,0.0071404804,0.0018930171,0.0011087023],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040147696,0.0011486685,0.001475105,0.0020869751,0.0015197231,0.007060629,0.0029739267,0.002020648,0.017274253],"category_scores_gemma":[0.029543335,0.0007470648,0.0032132692,0.002085729,0.004039414,0.020252675,0.0047978093,0.008665694,0.00199811],"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.00028697844,0.0001211623,0.0016408939,0.0003048926,0.000051409916,0.000103652805,0.00039994673,0.029016277,0.003168358,0.93851906,0.0057554506,0.020631975],"study_design_scores_gemma":[0.00003304281,0.00004817784,0.000402079,0.000044671244,0.00004294255,0.00006951848,0.000089089066,0.09640503,0.0021980957,0.89515084,0.0054851808,0.000031408632],"about_ca_topic_score_codex":0.0027158882,"about_ca_topic_score_gemma":0.0029555692,"teacher_disagreement_score":0.017274253,"about_ca_system_score_codex":0.0058956277,"about_ca_system_score_gemma":0.002471305,"threshold_uncertainty_score":0.057788134},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00039733134,0.0013111304,0.007537288,0.0007592243,0.00276001,0.00056094024,0.008925281,0.0053185998,0.9724302],"genre_scores_gemma":[0.002669105,0.002367713,0.0054868264,0.00077715836,0.0005532838,0.00033651263,0.014832223,0.003377769,0.96959937],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99502975,0.00026773286,0.00032703546,0.00027490684,0.0038113075,0.00028938695],"domain_scores_gemma":[0.992407,0.00034602248,0.00020633511,0.0006877503,0.0060739843,0.0002789524],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.002752466,0.002280911,0.0013316238,0.006261776,0.0016577439,0.008353657,0.004705714,0.0037321635,0.58422387],"category_scores_gemma":[0.007971828,0.0011498174,0.0014318717,0.0055259066,0.0012382853,0.006709044,0.002931793,0.0023638795,0.6788036],"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.000067177345,0.00007465292,0.00008191993,0.00055855827,0.00000662185,0.00008860216,0.0000587196,0.00034104002,0.001884516,0.007080771,0.83442116,0.15533625],"study_design_scores_gemma":[0.0000066950547,0.000016144357,0.00013360658,0.0000974997,0.0000032461367,0.000048395093,0.000025776426,0.00005865168,0.0006139701,0.00067533203,0.99831283,0.000007724186],"about_ca_topic_score_codex":0.008322691,"about_ca_topic_score_gemma":0.006554645,"teacher_disagreement_score":0.41577613,"about_ca_system_score_codex":0.002388402,"about_ca_system_score_gemma":0.0046579055,"threshold_uncertainty_score":0.5930542},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00035041742,0.000820226,0.0012890381,0.00092900137,0.0018833614,0.0001227833,0.005636232,0.004904068,0.9840649],"genre_scores_gemma":[0.0016944363,0.0009672181,0.0007366851,0.0005324291,0.00037339152,0.000051506926,0.0037616005,0.0023595334,0.98952323],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992061,0.000043966716,0.000039695322,0.00012588024,0.00048735066,0.00009714542],"domain_scores_gemma":[0.99826753,0.000208671,0.00006182844,0.00029436647,0.00083286624,0.00033466626],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00050920044,0.00132999,0.0009707952,0.0029838118,0.001653758,0.009166287,0.0021250562,0.0019336343,0.8855091],"category_scores_gemma":[0.003568447,0.00073183805,0.0010885803,0.002519071,0.000756395,0.007569521,0.0041260333,0.0027673512,0.8299591],"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.000053346892,0.000037499594,0.00007213499,0.00032346547,0.0000043564864,0.00012856633,0.00008162304,0.00010661033,0.00065790367,0.0043073324,0.91326964,0.08095743],"study_design_scores_gemma":[0.000005055109,0.000006498395,0.00011435235,0.000057488567,0.0000017322965,0.00007502115,0.00003456933,0.000033484914,0.00025075395,0.00060532935,0.9988098,0.000005990269],"about_ca_topic_score_codex":0.0032374386,"about_ca_topic_score_gemma":0.005810686,"teacher_disagreement_score":0.114490926,"about_ca_system_score_codex":0.0013368884,"about_ca_system_score_gemma":0.0016548337,"threshold_uncertainty_score":0.16330743},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000063890635,0.00004949178,0.000028646542,0.00015666599,0.000035150933,0.000018963718,0.9979394,0.00006900081,0.0016387224],"genre_scores_gemma":[0.0012442108,0.00040246054,0.00057526235,0.00022684048,0.000021297978,0.00017669657,0.9881023,0.00016873324,0.009082203],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9953497,0.00026042332,0.00049390213,0.0005408539,0.002227129,0.0011279266],"domain_scores_gemma":[0.9596931,0.00130168,0.0011355821,0.0010360142,0.03498346,0.0018501591],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020780792,0.0022446562,0.0024614832,0.008711713,0.003169439,0.0052249143,0.0047112987,0.0014971336,0.11026151],"category_scores_gemma":[0.018162513,0.0019388739,0.001964253,0.043402568,0.0006437764,0.0027584564,0.0022000116,0.0030034578,0.061051082],"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.000020151656,0.000006243222,0.0009577986,0.00020137585,0.000016238084,0.000005880063,0.000018460132,0.00011507308,0.000009269448,0.00044674735,0.99656737,0.0016354364],"study_design_scores_gemma":[0.00012282356,0.000011086966,0.022520578,0.0007290389,0.000053294127,0.000021570466,0.0004579392,0.000488846,0.00019304661,0.0006455835,0.97467345,0.00008281645],"about_ca_topic_score_codex":0.995557,"about_ca_topic_score_gemma":0.9938319,"teacher_disagreement_score":0.11026151,"about_ca_system_score_codex":0.06919034,"about_ca_system_score_gemma":0.17656408,"threshold_uncertainty_score":0.5020134},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033042777,0.0007110434,0.023320872,0.0031769036,0.001023491,0.00040152945,0.04124135,0.0042471793,0.8928348],"genre_scores_gemma":[0.21380976,0.0012553039,0.022944048,0.0004447967,0.000111298796,0.00022398311,0.023740035,0.0010661065,0.73640466],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99876,0.00007247915,0.000044967597,0.00022820951,0.00063808827,0.00025632823],"domain_scores_gemma":[0.99718046,0.0002298153,0.000104633626,0.0003270127,0.00184605,0.0003120011],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00087312853,0.0004453513,0.0003133182,0.0024250066,0.0063661668,0.004595746,0.0016494384,0.0007162941,0.11281497],"category_scores_gemma":[0.0031633826,0.0003820662,0.00037227126,0.004932604,0.0011200001,0.0023396192,0.0009594113,0.0012432857,0.014379348],"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.00040547724,0.00006835423,0.003561881,0.0003151695,0.000020783576,0.0002883928,0.0014192985,0.009746025,0.0015091255,0.18913043,0.6325208,0.16101433],"study_design_scores_gemma":[0.000027226719,0.000019604613,0.002635886,0.00009509732,0.000016092023,0.000037490907,0.0010318868,0.0026669381,0.001328836,0.0075719566,0.9845217,0.00004740755],"about_ca_topic_score_codex":0.94664407,"about_ca_topic_score_gemma":0.96885914,"teacher_disagreement_score":0.11281497,"about_ca_system_score_codex":0.024575979,"about_ca_system_score_gemma":0.04545091,"threshold_uncertainty_score":0.37740368},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016322669,0.00031913244,0.978456,0.00026262534,0.00008544651,0.00016110392,0.00015193476,0.0011122968,0.0031286676],"genre_scores_gemma":[0.35613292,0.0009921637,0.63661736,0.00024274987,0.00007976946,0.0006640638,0.0005763896,0.00030268746,0.0043919617],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9897641,0.0029649157,0.0009839584,0.0009293047,0.00478395,0.0005738142],"domain_scores_gemma":[0.9930098,0.0036405614,0.0005404079,0.0015104818,0.0011287811,0.00016993974],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005465699,0.0007344829,0.0006142181,0.0012155361,0.00095485087,0.0028424826,0.0020422623,0.0019007346,0.0014870734],"category_scores_gemma":[0.013680319,0.0010010474,0.001814772,0.001045613,0.0031778822,0.0026931355,0.0023082122,0.0021175384,0.0005387222],"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.00013088985,0.0001376157,0.0014436651,0.0004829423,0.00011143524,0.0011028271,0.0008979381,0.12695028,0.025565382,0.7916124,0.0016762601,0.04988839],"study_design_scores_gemma":[0.00015183164,0.000094804906,0.0004954634,0.00021237793,0.00010423281,0.00044002247,0.00021081223,0.63014483,0.05631941,0.27022877,0.041528586,0.000068850786],"about_ca_topic_score_codex":0.00571066,"about_ca_topic_score_gemma":0.004499659,"teacher_disagreement_score":0.00571066,"about_ca_system_score_codex":0.0015556545,"about_ca_system_score_gemma":0.0045264675,"threshold_uncertainty_score":0.02890575},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0212509,0.0016715247,0.9337317,0.004041799,0.0005231207,0.00030300947,0.0008122193,0.0021797237,0.03548602],"genre_scores_gemma":[0.57959974,0.0018989276,0.38969207,0.0019063726,0.00088153675,0.0016886013,0.0014381439,0.0015108957,0.021383638],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99190664,0.001732003,0.00073266384,0.0028535132,0.0019611684,0.0008140061],"domain_scores_gemma":[0.97822934,0.014285724,0.001446033,0.003649896,0.0017756511,0.000613383],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0043485896,0.0014713074,0.0012515219,0.0013518017,0.0019883646,0.005411238,0.0019368937,0.002198258,0.015211276],"category_scores_gemma":[0.029856665,0.0009998531,0.003589103,0.0011404929,0.0055004065,0.009838566,0.0045315367,0.006455126,0.002162638],"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.00012335904,0.000033454384,0.00041739288,0.00019492445,0.00003802247,0.00015807411,0.00037371315,0.010898614,0.0029248944,0.9709528,0.0017199988,0.012164749],"study_design_scores_gemma":[0.00006341181,0.00004217359,0.00010957666,0.000063773994,0.00004015625,0.00011927171,0.000050286548,0.03529978,0.0026918966,0.9502898,0.011204818,0.00002503726],"about_ca_topic_score_codex":0.0028963566,"about_ca_topic_score_gemma":0.0021424387,"teacher_disagreement_score":0.015211276,"about_ca_system_score_codex":0.003921365,"about_ca_system_score_gemma":0.0028531472,"threshold_uncertainty_score":0.05088681},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00017707513,0.0003665864,0.001150826,0.00026589577,0.00038490095,0.000026891734,0.0018411741,0.001419707,0.99436694],"genre_scores_gemma":[0.0007512231,0.00040381373,0.00041566815,0.00010886154,0.00006140187,0.000020146254,0.0012943994,0.00060812815,0.99633634],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99963164,0.000037390673,0.000020544296,0.000067264315,0.00020129525,0.000041864227],"domain_scores_gemma":[0.99888057,0.00030182395,0.000054739034,0.00022011792,0.00033021244,0.00021255194],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00047149672,0.00069648615,0.000449411,0.0016036448,0.0008536169,0.0058103246,0.0008971086,0.0011452303,0.9106743],"category_scores_gemma":[0.0027056243,0.00045783652,0.00044656324,0.002561413,0.0005406355,0.0029036065,0.002581038,0.0012047178,0.88810045],"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.000029064931,0.000026048245,0.00017013229,0.00016499162,0.0000029096861,0.00004207493,0.00007377229,0.0001206268,0.0004393238,0.007904625,0.733991,0.25703546],"study_design_scores_gemma":[0.0000027111328,0.0000055929495,0.00017603411,0.0000611301,7.126713e-7,0.000029103207,0.000028912656,0.000040281564,0.00008358722,0.0006082338,0.998961,0.000002662501],"about_ca_topic_score_codex":0.0015496608,"about_ca_topic_score_gemma":0.002492289,"teacher_disagreement_score":0.089325726,"about_ca_system_score_codex":0.00059378543,"about_ca_system_score_gemma":0.00063963933,"threshold_uncertainty_score":0.12741232},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0052617216,0.001168051,0.98582435,0.0004645703,0.00008370188,0.000041055308,0.000027556922,0.00019884533,0.006930222],"genre_scores_gemma":[0.450229,0.0067031644,0.52882653,0.0008320778,0.0004970189,0.00037924637,0.00016798505,0.00028703714,0.012078027],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99790263,0.0006876222,0.00018089317,0.00033851096,0.0006918893,0.00019843274],"domain_scores_gemma":[0.9941081,0.0042821136,0.00024677254,0.00058385526,0.0006522631,0.00012702301],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038063687,0.00084898557,0.00055546593,0.0014816603,0.00068685185,0.0013807939,0.0013589931,0.0008472278,0.0021203072],"category_scores_gemma":[0.0075325435,0.0005405673,0.0012069788,0.0017484848,0.0047003194,0.0034875101,0.0020417473,0.0028258143,0.0004323934],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032605036,0.000031966865,0.00031164935,0.00010444781,0.000011086906,0.00017307876,0.0004150918,0.035926357,0.0025898882,0.9100576,0.0008114298,0.049534764],"study_design_scores_gemma":[0.000026285601,0.00009449763,0.00025223024,0.0001260648,0.00002359599,0.00021706501,0.00006701799,0.18890247,0.0045945714,0.7853437,0.020298898,0.0000536325],"about_ca_topic_score_codex":0.0044105235,"about_ca_topic_score_gemma":0.0019489523,"teacher_disagreement_score":0.0044105235,"about_ca_system_score_codex":0.0023439964,"about_ca_system_score_gemma":0.0015786234,"threshold_uncertainty_score":0.020130217},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0041289846,0.00051971694,0.8746124,0.000327202,0.00050812674,0.00025320635,0.00030879767,0.008261081,0.111080505],"genre_scores_gemma":[0.18661378,0.0014397253,0.691324,0.00052122213,0.00020286687,0.0008708166,0.0012523775,0.003271588,0.1145037],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.998417,0.0003709151,0.000109921835,0.00029658157,0.0006707846,0.00013472568],"domain_scores_gemma":[0.9985934,0.00041949307,0.000037332567,0.0007142793,0.00020613553,0.000029317707],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00089050166,0.0009912635,0.0006955297,0.00091851037,0.0010797627,0.003061572,0.0021572104,0.0011002934,0.033537105],"category_scores_gemma":[0.0038662935,0.00092166365,0.0012563122,0.00077717635,0.0017192658,0.0038835763,0.0026842963,0.0023181944,0.013916016],"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.00012469283,0.000093085,0.00014546196,0.0003818775,0.000042660482,0.00016140947,0.00049346394,0.00350227,0.019813027,0.70277196,0.01691626,0.2555538],"study_design_scores_gemma":[0.000081829225,0.000087255416,0.00023844115,0.0002473503,0.00010733183,0.00048447802,0.00014815634,0.04516258,0.109954834,0.45235673,0.3910657,0.00006537659],"about_ca_topic_score_codex":0.00073947466,"about_ca_topic_score_gemma":0.0010314515,"teacher_disagreement_score":0.033537105,"about_ca_system_score_codex":0.00089166313,"about_ca_system_score_gemma":0.0012189867,"threshold_uncertainty_score":0.11219287},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.056825496,0.0003595527,0.91225314,0.0004237789,0.000107523294,0.00014917259,0.00016994859,0.0017098311,0.028001454],"genre_scores_gemma":[0.72223926,0.00041327573,0.2576906,0.00020261396,0.00007697674,0.00017062163,0.00035097776,0.00024983363,0.018605879],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99865746,0.00034661073,0.00009201799,0.00017579076,0.0005834966,0.00014461974],"domain_scores_gemma":[0.9984962,0.0010381984,0.000109328335,0.0001562136,0.00017844493,0.000021674019],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012834215,0.0003587024,0.00031873863,0.00090877194,0.0004304422,0.0015366194,0.0006420167,0.0004888204,0.008150083],"category_scores_gemma":[0.0040920186,0.00029510312,0.00051980925,0.00070120645,0.0014433387,0.0022711407,0.0008469421,0.00091176847,0.0011899201],"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.00077934185,0.000119885684,0.0012329208,0.0004620976,0.000035074943,0.0005076033,0.0005036271,0.063290365,0.04447933,0.57176685,0.0040555587,0.3127673],"study_design_scores_gemma":[0.0002282543,0.00039481104,0.0007817166,0.0001926987,0.00005895424,0.00049040955,0.00018200379,0.44271705,0.13014968,0.39454544,0.030214086,0.000044924465],"about_ca_topic_score_codex":0.0019411349,"about_ca_topic_score_gemma":0.0022359246,"teacher_disagreement_score":0.008150083,"about_ca_system_score_codex":0.0012794745,"about_ca_system_score_gemma":0.0011463582,"threshold_uncertainty_score":0.027264714},"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":"empirical","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94220346,0.0012592705,0.025203189,0.0069370368,0.00032743142,0.0001388945,0.001138907,0.00021241445,0.022579445],"genre_scores_gemma":[0.99035513,0.000368471,0.0033009017,0.0005570234,0.00008835094,0.00011856976,0.00049093895,0.000093555995,0.0046271333],"study_design_codex":"observational","study_design_gemma":"not_applicable","domain_scores_codex":[0.980589,0.011584247,0.0011469411,0.0010162697,0.004539321,0.0011242994],"domain_scores_gemma":[0.8322243,0.13064346,0.012839696,0.004109092,0.016123395,0.0040599713],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011790382,0.00034832853,0.0003686557,0.0019516244,0.0017248064,0.002434161,0.0004681145,0.0019511498,0.0057183867],"category_scores_gemma":[0.11230817,0.00021271124,0.00029659888,0.0018152084,0.0018742032,0.0028191817,0.0023052907,0.0019448911,0.0010058135],"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.00198287,0.00045939273,0.4431132,0.0011950752,0.00014251648,0.0015024395,0.19267552,0.0028076975,0.013546988,0.04690648,0.031119745,0.264548],"study_design_scores_gemma":[0.0000894625,0.0008205948,0.4196288,0.0011399427,0.000090876005,0.0028548946,0.21848747,0.009019345,0.012946942,0.018767817,0.31586677,0.00028700972],"about_ca_topic_score_codex":0.0104248,"about_ca_topic_score_gemma":0.0063644513,"teacher_disagreement_score":0.011790382,"about_ca_system_score_codex":0.0028277242,"about_ca_system_score_gemma":0.0020244392,"threshold_uncertainty_score":0.062354207},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0049138046,0.000126503,0.984643,0.00019497043,0.000038240858,0.00019972387,0.00030721605,0.0014290682,0.00814758],"genre_scores_gemma":[0.16221775,0.00053343974,0.82808715,0.00012771932,0.000022549475,0.00046609732,0.0006920724,0.00039516747,0.00745807],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961299,0.0016944922,0.0002352795,0.00040406207,0.0012547945,0.00028147752],"domain_scores_gemma":[0.98987293,0.0082357265,0.0005208655,0.0004705982,0.00077097066,0.0001288753],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033507308,0.0009453525,0.00074638275,0.0021056111,0.0009677555,0.0034560468,0.0013196868,0.0009951375,0.015292805],"category_scores_gemma":[0.013043981,0.0008518691,0.0017154907,0.0015856246,0.0012467181,0.0025369278,0.0014186017,0.0013126864,0.0016371828],"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.00041884067,0.00021736536,0.0019666168,0.00086098776,0.00013597611,0.00038129624,0.00030285722,0.4648756,0.009260619,0.27029324,0.00689286,0.24439374],"study_design_scores_gemma":[0.00016626883,0.00007582924,0.00027856688,0.00023130726,0.00005395226,0.00011532724,0.00006771106,0.89701056,0.011693483,0.069677584,0.02058741,0.00004199098],"about_ca_topic_score_codex":0.024013538,"about_ca_topic_score_gemma":0.024153102,"teacher_disagreement_score":0.024013538,"about_ca_system_score_codex":0.0025881736,"about_ca_system_score_gemma":0.0052440977,"threshold_uncertainty_score":0.0511595},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7748479,0.0039572446,0.0075982427,0.085232206,0.0014675778,0.00028846154,0.0006721387,0.0005092591,0.12542707],"genre_scores_gemma":[0.6997939,0.0011448953,0.0038036732,0.004942647,0.00009836473,0.000114551556,0.00023829147,0.00024121467,0.28962252],"study_design_codex":"qualitative","study_design_gemma":"not_applicable","domain_scores_codex":[0.99330115,0.0022483955,0.0002465266,0.0006771118,0.0021802185,0.0013465964],"domain_scores_gemma":[0.98147625,0.0052848747,0.0010553522,0.0013168561,0.007986759,0.0028798657],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006453949,0.00035356786,0.0004612159,0.0014130446,0.023371821,0.008541822,0.0013796922,0.0031657426,0.015360942],"category_scores_gemma":[0.022992749,0.00050024956,0.0002940306,0.0024645035,0.007057611,0.002552404,0.0027020152,0.003908388,0.0019477042],"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.0006530592,0.00040901164,0.08356461,0.00028123925,0.000077578225,0.008457687,0.40861875,0.0010939365,0.011327753,0.11590062,0.1741718,0.19544391],"study_design_scores_gemma":[0.000043440163,0.00011360713,0.06668198,0.0002655331,0.000038612572,0.00090862176,0.15793118,0.0010250427,0.003140986,0.003115583,0.76661944,0.000115961244],"about_ca_topic_score_codex":0.8827614,"about_ca_topic_score_gemma":0.9178731,"teacher_disagreement_score":0.11723858,"about_ca_system_score_codex":0.02929944,"about_ca_system_score_gemma":0.06172039,"threshold_uncertainty_score":0.23585802},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0106026875,0.000230079,0.968698,0.0011988586,0.0010660612,0.00042744377,0.00028876652,0.0028447388,0.014643357],"genre_scores_gemma":[0.085376404,0.0004437926,0.87273204,0.0005946706,0.0003029299,0.0009886819,0.0007100435,0.00139356,0.037457865],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99367404,0.0012428068,0.0006004479,0.0009371652,0.0031050132,0.0004404692],"domain_scores_gemma":[0.99090827,0.0016903282,0.000531357,0.0028633869,0.0037344217,0.0002722658],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036875147,0.0012252482,0.0006372405,0.0013257975,0.0012649948,0.0038671864,0.0017833513,0.001668551,0.00887107],"category_scores_gemma":[0.012626821,0.0007600735,0.001337931,0.0008284039,0.0022665455,0.0027351505,0.002499135,0.0048122797,0.004806323],"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.0004702493,0.00020583617,0.0019458788,0.00053006294,0.00007607061,0.000518854,0.001623706,0.009549804,0.05267457,0.53416616,0.014567058,0.38367182],"study_design_scores_gemma":[0.00031777666,0.0006730958,0.0027584822,0.00048519523,0.00020181033,0.0016155023,0.00051839737,0.071700834,0.15439515,0.14050406,0.62651217,0.0003175534],"about_ca_topic_score_codex":0.0037987153,"about_ca_topic_score_gemma":0.0038839988,"teacher_disagreement_score":0.00887107,"about_ca_system_score_codex":0.0018585392,"about_ca_system_score_gemma":0.0051614717,"threshold_uncertainty_score":0.029676735},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01471878,0.0003609294,0.96557915,0.0007209991,0.0001594587,0.00018259797,0.00044095825,0.0046512955,0.013185792],"genre_scores_gemma":[0.3416129,0.000335407,0.64416087,0.000704135,0.00008840653,0.00048335167,0.00082031236,0.0006685279,0.011125998],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994979,0.00013834037,0.000030228435,0.00010879761,0.00014536256,0.000079314035],"domain_scores_gemma":[0.99901974,0.0006475595,0.00008305251,0.00007540384,0.00011975688,0.00005452771],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081397954,0.000999744,0.0006740639,0.00041979976,0.00034730922,0.00096554833,0.0019030762,0.0015686869,0.008560228],"category_scores_gemma":[0.0035332749,0.00043618094,0.0009735145,0.0003511096,0.00083218416,0.00091012067,0.0015461699,0.0020237158,0.0014043094],"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.00023825765,0.00014523107,0.0013626942,0.00025549688,0.000088753586,0.0002531916,0.00010879212,0.7950922,0.0037416758,0.05759461,0.0124310525,0.12868795],"study_design_scores_gemma":[0.00004456461,0.000024168017,0.000034369703,0.000012151887,0.000006884824,0.000020035934,0.000006573211,0.9862721,0.0007393273,0.01055352,0.0022823054,0.0000039644883],"about_ca_topic_score_codex":0.0037724427,"about_ca_topic_score_gemma":0.0078558335,"teacher_disagreement_score":0.008560228,"about_ca_system_score_codex":0.00083286996,"about_ca_system_score_gemma":0.0025041741,"threshold_uncertainty_score":0.028636873},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000480181,0.00016432065,0.9778454,0.00011220698,0.00005521412,0.00016769378,0.0006298862,0.018245153,0.0022999295],"genre_scores_gemma":[0.012766906,0.00076894724,0.9728747,0.0001777047,0.00004779702,0.0013787411,0.0032543985,0.005765284,0.0029655015],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99762195,0.00062827446,0.00023561707,0.00022537136,0.001035801,0.00025300693],"domain_scores_gemma":[0.9979054,0.00097424176,0.00019259172,0.00041314948,0.00039326286,0.000121397505],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0050912946,0.0035298215,0.0016704927,0.0029071951,0.0010344421,0.003923183,0.008013939,0.0034647223,0.0149346],"category_scores_gemma":[0.0065147635,0.002711806,0.0044399025,0.0017746262,0.0014869141,0.003849157,0.0043452918,0.0054242676,0.0062760343],"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.00024944913,0.00027408806,0.0017814127,0.0022435568,0.00039325957,0.0011123377,0.0012374993,0.41839883,0.015273891,0.29689693,0.07201857,0.19012016],"study_design_scores_gemma":[0.000256339,0.00010920611,0.00036479256,0.00056281674,0.000116029216,0.00047906328,0.00008798865,0.6435854,0.007062546,0.07425057,0.2729806,0.00014473421],"about_ca_topic_score_codex":0.0071049277,"about_ca_topic_score_gemma":0.007680605,"teacher_disagreement_score":0.0149346,"about_ca_system_score_codex":0.0013378353,"about_ca_system_score_gemma":0.0044390154,"threshold_uncertainty_score":0.04996121},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0142974015,0.02590029,0.65276504,0.019913983,0.006943142,0.0022281657,0.010165931,0.0075547434,0.26023135],"genre_scores_gemma":[0.106664844,0.04956187,0.60492414,0.0023047775,0.0022407265,0.0023251667,0.033508994,0.0053120703,0.19315739],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.97186524,0.005210497,0.0014209735,0.0011924499,0.019274708,0.0010361312],"domain_scores_gemma":[0.9152123,0.011261919,0.0026165338,0.008403938,0.05814805,0.0043572523],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.045808736,0.0012584319,0.00069921423,0.009250739,0.0015053564,0.00679938,0.002377498,0.0018261455,0.018297885],"category_scores_gemma":[0.054877013,0.0009713248,0.0010261094,0.0056087254,0.0024094,0.007635299,0.0037704182,0.0031117895,0.011265378],"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.00016680574,0.00034044808,0.0025109483,0.0009108982,0.000032840733,0.000077696626,0.00062595867,0.0075254715,0.0014864029,0.22888184,0.18489435,0.57254624],"study_design_scores_gemma":[0.00003386642,0.00021806592,0.0015424013,0.0008993663,0.000025014342,0.00017475478,0.00032483856,0.007254474,0.005326918,0.0152582815,0.9688752,0.00006682538],"about_ca_topic_score_codex":0.02924752,"about_ca_topic_score_gemma":0.0097435955,"teacher_disagreement_score":0.045808736,"about_ca_system_score_codex":0.0065814364,"about_ca_system_score_gemma":0.026584052,"threshold_uncertainty_score":0.2422626},"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":"empirical","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9947978,0.00066570425,0.0013278947,0.00012876658,0.00003374901,0.00014669326,0.00017727759,0.00004634779,0.002675722],"genre_scores_gemma":[0.9774829,0.0010682944,0.007140063,0.00011462553,0.000007951544,0.00015643326,0.0004907921,0.000014655928,0.013524202],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.9998983,0.000012594695,0.000004452134,0.000027557813,0.000026029778,0.000031132568],"domain_scores_gemma":[0.999923,0.000005484747,0.000015391319,0.0000054676593,0.000026326536,0.000024284594],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019174075,0.00024427284,0.00021519898,0.00020375582,0.00030288185,0.000330324,0.0003013501,0.00016972166,0.0021128291],"category_scores_gemma":[0.000104816194,0.00008608024,0.00030721337,0.00014820571,0.00016207996,0.00014179091,0.000322269,0.00028132132,0.00026467658],"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.0008734104,0.0011193963,0.007594594,0.00042844316,0.000040825314,0.00015319926,0.00038802263,0.00032357385,0.93962866,0.00033152828,0.0004022259,0.04871632],"study_design_scores_gemma":[0.00023424276,0.020359276,0.22559662,0.00023884706,0.00035201854,0.00023699985,0.0027817509,0.0032544313,0.6961528,0.00030760898,0.050433643,0.000051750692],"about_ca_topic_score_codex":0.013232059,"about_ca_topic_score_gemma":0.03454323,"teacher_disagreement_score":0.013232059,"about_ca_system_score_codex":0.00060000864,"about_ca_system_score_gemma":0.00084577274,"threshold_uncertainty_score":0.026310086},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004637356,0.0025145188,0.04923778,0.0060429364,0.000592131,0.0002275294,0.0066246027,0.01095267,0.9191705],"genre_scores_gemma":[0.040008605,0.0021084314,0.028765807,0.000521688,0.00003697414,0.00007365117,0.004407679,0.0019251553,0.92215204],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99767333,0.00009054053,0.000033270124,0.00019847743,0.0017541256,0.00025024943],"domain_scores_gemma":[0.9971016,0.00030711244,0.00009098231,0.000305944,0.0018566524,0.000337714],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014381483,0.00087320874,0.0005007106,0.001836226,0.003187237,0.0043383283,0.0017781426,0.0014169214,0.19041882],"category_scores_gemma":[0.0031484268,0.0006290328,0.00047911133,0.0020272974,0.0015305184,0.0025208185,0.0018496519,0.0015718985,0.04351784],"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.0001939507,0.000100443125,0.0013188825,0.0004076063,0.000018847939,0.00020100019,0.0002710063,0.0030122339,0.0047293487,0.10546925,0.5164747,0.36780268],"study_design_scores_gemma":[0.000025783553,0.00001682464,0.0007072635,0.00013983273,0.000010974628,0.00008653875,0.00021368804,0.0055545284,0.0048482814,0.010395898,0.97797716,0.00002325572],"about_ca_topic_score_codex":0.5730384,"about_ca_topic_score_gemma":0.7735522,"teacher_disagreement_score":0.4269616,"about_ca_system_score_codex":0.013399366,"about_ca_system_score_gemma":0.028501634,"threshold_uncertainty_score":0.8589521},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06429276,0.010052494,0.8671902,0.020578329,0.00096696184,0.00025686985,0.0020216694,0.0012120199,0.033428755],"genre_scores_gemma":[0.69288117,0.007812964,0.26232618,0.0011121613,0.0010943081,0.00067347876,0.0063555967,0.0011283386,0.026615819],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99128354,0.0020819975,0.00071906805,0.0009946179,0.0043530012,0.0005677966],"domain_scores_gemma":[0.97764415,0.014853208,0.0005603586,0.0030348306,0.0032567487,0.0006507673],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006482487,0.000810363,0.0015092813,0.0020863246,0.0016294803,0.008452534,0.0023220752,0.001316176,0.010856931],"category_scores_gemma":[0.02266179,0.0013508861,0.0027630553,0.0013945777,0.0036267322,0.009010507,0.004524835,0.006034054,0.00087291136],"study_design_candidate":"not_applicable","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.00017363875,0.00015117566,0.002393553,0.00050133833,0.00014519466,0.0001477127,0.001026988,0.03530218,0.00257511,0.8357517,0.021793136,0.10003827],"study_design_scores_gemma":[0.000043987417,0.000025684367,0.00088179536,0.00013201921,0.00005920825,0.000119394484,0.00024753792,0.11096086,0.0029663802,0.8554382,0.029077541,0.000047405283],"about_ca_topic_score_codex":0.0124433525,"about_ca_topic_score_gemma":0.012991366,"teacher_disagreement_score":0.98755664,"about_ca_system_score_codex":0.011495496,"about_ca_system_score_gemma":0.006245788,"threshold_uncertainty_score":0.08340609},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0037182602,0.00013660282,0.98547125,0.00048689655,0.000096617805,0.00013277502,0.0002098118,0.0051932684,0.004554613],"genre_scores_gemma":[0.038457807,0.0002560688,0.95702094,0.00026996623,0.000043452328,0.00017781064,0.000665401,0.0007697432,0.002338996],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9949832,0.0014495408,0.0004530891,0.0005598902,0.0021799463,0.0003742812],"domain_scores_gemma":[0.9902384,0.0050892294,0.00046872644,0.0022415258,0.0017969407,0.00016517079],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003894164,0.0015961691,0.0010385247,0.0018073907,0.00076424755,0.003292942,0.0045221397,0.0013223705,0.010932434],"category_scores_gemma":[0.015253649,0.0009569775,0.0033378731,0.0021212718,0.0016585009,0.0076519004,0.0032254125,0.005526533,0.0030497888],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026805126,0.0005945721,0.001476325,0.00087577617,0.00016571452,0.00031734305,0.00047737997,0.16943413,0.016360661,0.35202718,0.013750957,0.44425187],"study_design_scores_gemma":[0.00013603581,0.00009324565,0.00013413117,0.00017646483,0.00008218086,0.00014385438,0.0001539042,0.7894436,0.027001232,0.13978633,0.04278786,0.00006118636],"about_ca_topic_score_codex":0.0053111673,"about_ca_topic_score_gemma":0.010811199,"teacher_disagreement_score":0.010932434,"about_ca_system_score_codex":0.0032055154,"about_ca_system_score_gemma":0.005100058,"threshold_uncertainty_score":0.036572695},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.260899,0.0053920057,0.038083695,0.04137183,0.00019597459,0.00010004363,0.0010118615,0.00009954722,0.6528461],"genre_scores_gemma":[0.9777035,0.0013764107,0.0015556882,0.0004208141,0.00011541549,0.000039588016,0.00007480742,0.000029157207,0.018684553],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985159,0.00071736565,0.000043689033,0.00013747056,0.00023069064,0.0003549342],"domain_scores_gemma":[0.99056715,0.0065721087,0.0007431506,0.0005745008,0.0006098645,0.00093322207],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024649492,0.00022752162,0.00076475093,0.0016629242,0.0019946604,0.005075968,0.0007921337,0.001823295,0.03596752],"category_scores_gemma":[0.014352428,0.00042148188,0.00039087486,0.0019370838,0.004718564,0.0049877996,0.0021358859,0.0018289072,0.0009918011],"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.00006361361,0.000030222875,0.0026844316,0.000039851453,0.000015469108,0.000065767636,0.00014260878,0.005116599,0.00008596159,0.9759546,0.0045199282,0.011280939],"study_design_scores_gemma":[0.000023119765,0.000016386302,0.0041269087,0.000050108098,0.000011976591,0.000056966495,0.000430969,0.0047051175,0.000084521496,0.9777999,0.012684231,0.000009771001],"about_ca_topic_score_codex":0.012644602,"about_ca_topic_score_gemma":0.018221445,"teacher_disagreement_score":0.03596752,"about_ca_system_score_codex":0.0058570756,"about_ca_system_score_gemma":0.0029146578,"threshold_uncertainty_score":0.12032336},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5511105,0.02209905,0.029472413,0.035001494,0.00081860035,0.00018107975,0.0003884208,0.00037783786,0.36055058],"genre_scores_gemma":[0.9762339,0.002567818,0.0037806728,0.00034046243,0.00005360074,0.000052537645,0.000107798194,0.000045320183,0.016817821],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"qualitative","domain_scores_codex":[0.99878114,0.00067704084,0.00003180378,0.00015537064,0.0001507381,0.000203893],"domain_scores_gemma":[0.9987031,0.0005310436,0.00029685278,0.00015458892,0.0001546774,0.00015979756],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029613373,0.00048267047,0.000282428,0.0010890472,0.0027981848,0.00532116,0.0007197198,0.0010935393,0.005302277],"category_scores_gemma":[0.003373424,0.00027769187,0.00045659803,0.0011507521,0.009800839,0.0033978797,0.0040407847,0.0017510033,0.00028804457],"study_design_candidate":"qualitative","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013681987,0.00013076303,0.025065303,0.0006938996,0.000058665064,0.002649145,0.08753996,0.0036680219,0.0014022558,0.79021734,0.012512935,0.07592498],"study_design_scores_gemma":[0.00006420133,0.00014171496,0.035535995,0.002075529,0.00019479918,0.0014210211,0.326202,0.004047703,0.0020897188,0.28190702,0.34619927,0.00012103435],"about_ca_topic_score_codex":0.028817525,"about_ca_topic_score_gemma":0.053254116,"teacher_disagreement_score":0.028817525,"about_ca_system_score_codex":0.0049903938,"about_ca_system_score_gemma":0.0031570091,"threshold_uncertainty_score":0.057299614},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0122866705,0.0005539185,0.971065,0.0004146599,0.00012737459,0.00016516731,0.00008985645,0.0019346927,0.013362696],"genre_scores_gemma":[0.45875993,0.0014426947,0.52842546,0.00032619672,0.00017814816,0.0006868951,0.00042394156,0.00049276743,0.009263949],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9925092,0.0024961978,0.0004148802,0.0006046491,0.0035345692,0.00044050848],"domain_scores_gemma":[0.9912451,0.004821608,0.00062384905,0.0015181712,0.0016832298,0.00010800965],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0050597726,0.00061348506,0.0005977494,0.0011175516,0.0010004534,0.0020746565,0.0010515627,0.00065931544,0.0035041128],"category_scores_gemma":[0.014623569,0.00083707285,0.0010171032,0.00070854556,0.0023278254,0.0021321124,0.0017347794,0.0012402583,0.0011078175],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019646861,0.00015187298,0.0035470477,0.0011336483,0.00011573825,0.00068864675,0.0016430978,0.13430573,0.033569325,0.51969993,0.0055578556,0.29939055],"study_design_scores_gemma":[0.00017284631,0.00028569062,0.0013405939,0.00060987426,0.00017018036,0.0005131602,0.00035263906,0.50641066,0.08684248,0.31755072,0.085654385,0.00009687332],"about_ca_topic_score_codex":0.0025100675,"about_ca_topic_score_gemma":0.0018639828,"teacher_disagreement_score":0.0050597726,"about_ca_system_score_codex":0.0018141615,"about_ca_system_score_gemma":0.0036924772,"threshold_uncertainty_score":0.026758969},"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":"commentary","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.103286974,0.0221701,0.01929441,0.45549494,0.0023463732,0.00044178087,0.00036968643,0.0002022513,0.39639345],"genre_scores_gemma":[0.8351639,0.015414212,0.022799082,0.05011432,0.00016425215,0.00017169474,0.00016019467,0.00017171308,0.07584073],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9929737,0.0017787778,0.00008822479,0.00054285885,0.0023902287,0.0022262307],"domain_scores_gemma":[0.9962999,0.0006600279,0.00014989772,0.00012558498,0.0017770375,0.0009876154],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0050804396,0.0007629007,0.00044312575,0.0017835847,0.037564944,0.017345648,0.0033112392,0.0049272147,0.0050707282],"category_scores_gemma":[0.005812372,0.0003844621,0.000776168,0.0029746324,0.030356066,0.0053117974,0.0063937684,0.0056823497,0.000509198],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":true,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007389288,0.00015836381,0.012159334,0.00064142025,0.000045711982,0.00158076,0.096674085,0.00181359,0.0014013435,0.65256846,0.13060185,0.10228122],"study_design_scores_gemma":[0.000021756658,0.00007293064,0.009949096,0.0012245015,0.00007082135,0.0004346529,0.16358638,0.0013799573,0.0013301355,0.040593293,0.7811523,0.00018421764],"about_ca_topic_score_codex":0.9841537,"about_ca_topic_score_gemma":0.99416083,"teacher_disagreement_score":0.16210504,"about_ca_system_score_codex":0.16210504,"about_ca_system_score_gemma":0.27067846,"threshold_uncertainty_score":0.97183937},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.88369375,0.09384158,0.0043050954,0.003492156,0.0003106996,0.000066634624,0.0052742194,0.0000530135,0.008962928],"genre_scores_gemma":[0.97493196,0.015257045,0.0026597076,0.0008496417,0.00014891049,0.00009430834,0.0018449796,0.000027223039,0.0041862447],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9982193,0.0006922323,0.00020925097,0.00037745794,0.00029184215,0.00020986972],"domain_scores_gemma":[0.99199235,0.0039286884,0.0026202833,0.00049543544,0.00059792644,0.0003653397],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002824773,0.000425317,0.00063916703,0.00096521137,0.00052320963,0.0016503824,0.00060159276,0.0007454065,0.0050034355],"category_scores_gemma":[0.008283776,0.0003027883,0.0018995083,0.0020492666,0.00054576906,0.00085286365,0.00078436284,0.0010057818,0.00039917068],"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.00038880223,0.000052998388,0.9717657,0.000958746,0.0018294953,0.00023302328,0.0005937984,0.00020183725,0.0006782448,0.0006730283,0.00085889903,0.021765443],"study_design_scores_gemma":[0.000011474149,0.0001357372,0.9912958,0.00047160152,0.00093833805,0.00033137857,0.00041931088,0.0002454709,0.00018833816,0.00049790676,0.0054500545,0.000014584455],"about_ca_topic_score_codex":0.018331805,"about_ca_topic_score_gemma":0.0329948,"teacher_disagreement_score":0.018331805,"about_ca_system_score_codex":0.00071854796,"about_ca_system_score_gemma":0.0013340558,"threshold_uncertainty_score":0.036450207},"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":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022376482,0.0008097265,0.04256418,0.0009248001,0.0003879327,0.00039029858,0.32753512,0.054595616,0.5705547],"genre_scores_gemma":[0.028172541,0.0018336313,0.048298053,0.00033077569,0.00013046786,0.00046746005,0.31402916,0.021152213,0.58558565],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.998059,0.000073779156,0.000082764396,0.00027799443,0.001243153,0.00026320887],"domain_scores_gemma":[0.9957683,0.00018317459,0.00011858195,0.0008284543,0.0028187423,0.0002827043],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00089244044,0.0017048052,0.001003565,0.005015838,0.0040899822,0.0075763306,0.0045748977,0.00094852777,0.3715926],"category_scores_gemma":[0.006176308,0.0012374505,0.0007722155,0.013669822,0.0011285363,0.0045405906,0.0025859922,0.0011813809,0.25429422],"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.00008356283,0.000011093997,0.00039379133,0.00013677112,0.0000069870807,0.000044841523,0.00015970963,0.00089483993,0.0004972316,0.016151559,0.92420954,0.05741003],"study_design_scores_gemma":[0.000014465242,0.000004370156,0.00052030745,0.000053800435,0.0000054599195,0.00003973288,0.000069706184,0.0011592082,0.0012891288,0.002815936,0.9939965,0.00003144896],"about_ca_topic_score_codex":0.84598315,"about_ca_topic_score_gemma":0.81591874,"teacher_disagreement_score":0.3715926,"about_ca_system_score_codex":0.018425304,"about_ca_system_score_gemma":0.03341166,"threshold_uncertainty_score":0.89634687},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9292437,0.0012404289,0.0035724833,0.006261346,0.00006682719,0.00011775957,0.000048545957,0.00003568181,0.05941334],"genre_scores_gemma":[0.99774456,0.00027524235,0.00066357164,0.00013170589,0.00001299401,0.000031641415,0.000012082814,0.000005848827,0.0011223202],"study_design_codex":"qualitative","study_design_gemma":"observational","domain_scores_codex":[0.9925539,0.0035333752,0.0003310794,0.0010082908,0.0014949293,0.0010784859],"domain_scores_gemma":[0.98234195,0.010494453,0.0024530387,0.0015492411,0.0015691633,0.0015921209],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010423801,0.00028518494,0.0004934067,0.0032505966,0.0073835086,0.010314714,0.0011010153,0.0017629006,0.0027096444],"category_scores_gemma":[0.01748467,0.00042922582,0.0005526993,0.0029266623,0.019830061,0.008871623,0.008730334,0.00260595,0.00014799926],"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.000050474162,0.00009765413,0.03773082,0.00020264415,0.00001326188,0.0014776436,0.8008678,0.00012829491,0.0015530763,0.12834479,0.00081816356,0.028715383],"study_design_scores_gemma":[0.000019136947,0.000104693194,0.057718102,0.0005072187,0.000041684492,0.001050499,0.82522404,0.0010651073,0.0008149213,0.023244789,0.09014705,0.00006272131],"about_ca_topic_score_codex":0.020718701,"about_ca_topic_score_gemma":0.028533727,"teacher_disagreement_score":0.020718701,"about_ca_system_score_codex":0.009072678,"about_ca_system_score_gemma":0.0088688275,"threshold_uncertainty_score":0.06582719},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9889543,0.002254886,0.0005707447,0.0026064105,0.000039167553,0.000033744003,0.0006369422,0.00001692361,0.004886855],"genre_scores_gemma":[0.9988298,0.0004195512,0.00024123858,0.00018899131,0.000025262365,0.000007905097,0.000099978446,0.0000022214697,0.00018505489],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.98876953,0.0069095558,0.00055238185,0.00085896224,0.002063316,0.0008463319],"domain_scores_gemma":[0.8839857,0.08621506,0.018341314,0.0036101313,0.005180072,0.002667789],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008657922,0.00028297352,0.0003910567,0.0008195923,0.0009197522,0.0016495821,0.00085293147,0.0007384138,0.002643704],"category_scores_gemma":[0.0759161,0.00030214438,0.000966246,0.0013367172,0.0009832339,0.0006387015,0.0009863724,0.0011575083,0.0002454907],"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.0001067434,0.00008303027,0.99262285,0.000033457065,0.00022742973,0.000058906367,0.00034403917,0.00074010005,0.000024233157,0.000144512,0.00036056456,0.0052541667],"study_design_scores_gemma":[0.000014857142,0.00009221459,0.99595636,0.00007014955,0.00017105986,0.00009594445,0.00031961512,0.002373569,0.000072303075,0.00020448561,0.00062039273,0.00000907353],"about_ca_topic_score_codex":0.1969988,"about_ca_topic_score_gemma":0.16120854,"teacher_disagreement_score":0.1969988,"about_ca_system_score_codex":0.0035868683,"about_ca_system_score_gemma":0.0058051487,"threshold_uncertainty_score":0.39170426},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.84211576,0.0037723458,0.019485677,0.011910787,0.0006637107,0.00020963403,0.00030144566,0.00015537757,0.12138538],"genre_scores_gemma":[0.9714111,0.0009867579,0.003064637,0.00051165355,0.00004291913,0.00016090153,0.00008177043,0.00006602264,0.02367416],"study_design_codex":"qualitative","study_design_gemma":"qualitative","domain_scores_codex":[0.9967474,0.0022266,0.000080554935,0.00027767438,0.00040433183,0.00026345075],"domain_scores_gemma":[0.99814236,0.0012090404,0.00014133632,0.00007590424,0.00019318385,0.00023808453],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030522298,0.00047571596,0.00037120332,0.0008042714,0.0067971135,0.0051562907,0.00076761236,0.0012565935,0.0070328093],"category_scores_gemma":[0.003961845,0.00024158564,0.00028793473,0.0007064483,0.005310044,0.0051079877,0.004074957,0.0017234571,0.0010352491],"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.000065881424,0.00007848131,0.003725952,0.0003065257,0.000009234241,0.0025282968,0.9316156,0.00019619927,0.0027923472,0.03265034,0.005757759,0.020273255],"study_design_scores_gemma":[0.0000056693098,0.00005777349,0.0034435529,0.0006519533,0.000012051661,0.0013576694,0.7524673,0.00043222777,0.0022725866,0.005181532,0.23408273,0.000034988498],"about_ca_topic_score_codex":0.0043402035,"about_ca_topic_score_gemma":0.0052379793,"teacher_disagreement_score":0.0070328093,"about_ca_system_score_codex":0.0028080589,"about_ca_system_score_gemma":0.0022904496,"threshold_uncertainty_score":0.023527086},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8781464,0.0056664143,0.0007605541,0.09780761,0.00034482838,0.0000318404,0.00016431203,0.000014049388,0.017064033],"genre_scores_gemma":[0.99597824,0.0009461543,0.00011550198,0.0018190691,0.00003984142,0.000010832762,0.000030576623,0.0000072921775,0.0010524335],"study_design_codex":"qualitative","study_design_gemma":"qualitative","domain_scores_codex":[0.989939,0.007809205,0.0003664449,0.00035695315,0.00079272926,0.00073577545],"domain_scores_gemma":[0.96433216,0.027515875,0.0040493114,0.0007218801,0.0010709171,0.0023098257],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01046915,0.0003972434,0.00053988135,0.0010348413,0.007681935,0.007026319,0.0011490575,0.0033142618,0.002981122],"category_scores_gemma":[0.046002846,0.0005650465,0.00032559937,0.00079824065,0.013870574,0.007827864,0.0077291434,0.0070293937,0.00027053643],"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.00006258567,0.000016645028,0.0045454865,0.000040069153,0.000007948783,0.00067381235,0.9859622,0.000027565613,0.000102857,0.0035644108,0.0027958483,0.0022006533],"study_design_scores_gemma":[0.000009111615,0.00002017094,0.0029367309,0.00011962468,0.000008922771,0.00057711964,0.98409605,0.00007553352,0.00006747595,0.0016272423,0.010441556,0.000020423098],"about_ca_topic_score_codex":0.011756218,"about_ca_topic_score_gemma":0.015523079,"teacher_disagreement_score":0.011756218,"about_ca_system_score_codex":0.004803959,"about_ca_system_score_gemma":0.0049834517,"threshold_uncertainty_score":0.055366814},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014142422,0.00078005873,0.0022899879,0.005674064,0.0011808663,0.00012620747,0.004188016,0.0008128314,0.9708055],"genre_scores_gemma":[0.026661424,0.00028939958,0.00052205584,0.0003941205,0.000039668976,0.000015047256,0.0011225311,0.00021642617,0.97073925],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99706995,0.000090146845,0.000028626197,0.00023950118,0.0013547124,0.0012169324],"domain_scores_gemma":[0.9949516,0.0001906922,0.000065609674,0.00025001747,0.0034061475,0.0011359706],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014444875,0.0007916062,0.0005764999,0.0020979173,0.00994952,0.0074169165,0.0013288321,0.00195691,0.15970482],"category_scores_gemma":[0.0040244847,0.00040036158,0.00061164773,0.0021638235,0.0011896907,0.0019838777,0.002534805,0.0025344905,0.032553885],"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.00023640938,0.00013716606,0.0059141563,0.00006658821,0.000027457818,0.0006890125,0.00095591793,0.0007346877,0.0009512781,0.10297557,0.7876426,0.09966911],"study_design_scores_gemma":[0.000019232008,0.00002197175,0.0041865376,0.00005911381,0.00001233069,0.000074780255,0.0007943913,0.0005940959,0.0010081539,0.0023954534,0.9908127,0.000021049033],"about_ca_topic_score_codex":0.92867756,"about_ca_topic_score_gemma":0.9544826,"teacher_disagreement_score":0.15970482,"about_ca_system_score_codex":0.025553372,"about_ca_system_score_gemma":0.064425394,"threshold_uncertainty_score":0.5342659},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009019186,0.000099294244,0.99076426,0.00044265192,0.00009323482,0.00024719862,0.0008658595,0.0029848705,0.0036007091],"genre_scores_gemma":[0.025815627,0.0003151627,0.9644555,0.0005051466,0.000070025635,0.00064255827,0.0021950274,0.0009813895,0.0050195153],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9956008,0.0014192938,0.0007924834,0.00052197615,0.0014300141,0.00023541886],"domain_scores_gemma":[0.99318635,0.0033406967,0.0004476613,0.000818938,0.0020702272,0.0001361279],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041604815,0.0013486505,0.000703736,0.0018567577,0.0011480362,0.0033892647,0.002396626,0.0011630091,0.009280285],"category_scores_gemma":[0.009044681,0.00092498603,0.0023874978,0.0018611938,0.0021615555,0.004174617,0.0019632855,0.004083892,0.002742851],"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.00009110921,0.00008980214,0.00041099815,0.0008716469,0.000059613252,0.0004903379,0.0010588873,0.045299415,0.008427527,0.8030062,0.030423697,0.10977081],"study_design_scores_gemma":[0.00012472506,0.000112225105,0.00017478557,0.0005166014,0.000091329945,0.0006835878,0.000310286,0.37912488,0.01931952,0.21318781,0.38621193,0.0001424477],"about_ca_topic_score_codex":0.009782962,"about_ca_topic_score_gemma":0.011805236,"teacher_disagreement_score":0.009782962,"about_ca_system_score_codex":0.002531027,"about_ca_system_score_gemma":0.004601194,"threshold_uncertainty_score":0.031045675},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020847112,0.00079713017,0.0029640712,0.016590226,0.0028574548,0.00009776143,0.0020653636,0.0015619566,0.95221895],"genre_scores_gemma":[0.21927689,0.0017801196,0.0018706777,0.004883714,0.00036258987,0.000068562505,0.0020589745,0.00039276903,0.76930565],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991598,0.00010956305,0.000024822071,0.00010796128,0.00038138538,0.00021651403],"domain_scores_gemma":[0.99860567,0.00021157844,0.00008886144,0.00011804921,0.00055184506,0.0004240507],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007485763,0.0004552645,0.00016432264,0.0014034102,0.0062099434,0.0026492178,0.00056290894,0.0010760829,0.08939376],"category_scores_gemma":[0.0039806627,0.00025574784,0.00029530717,0.00054984173,0.0010390908,0.0012812762,0.0019756379,0.001905789,0.01857855],"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.000051959527,0.00006133116,0.009060862,0.00011419007,0.000011635118,0.0014304721,0.0035488443,0.0004163636,0.0003975141,0.052872334,0.8676477,0.06438689],"study_design_scores_gemma":[0.000019891744,0.000046954814,0.0132823065,0.0005039247,0.000024951882,0.0009962552,0.008395061,0.0009817755,0.0007709907,0.011991819,0.9629544,0.0000317607],"about_ca_topic_score_codex":0.094673425,"about_ca_topic_score_gemma":0.23617934,"teacher_disagreement_score":0.094673425,"about_ca_system_score_codex":0.0027615237,"about_ca_system_score_gemma":0.0051204367,"threshold_uncertainty_score":0.29905194},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04525384,0.0003752516,0.9161083,0.0017017832,0.00041643027,0.00023676845,0.0003736748,0.015867652,0.019666228],"genre_scores_gemma":[0.85766125,0.00022531567,0.13001484,0.00035724294,0.00020136908,0.00023506986,0.00059606245,0.001261344,0.0094474675],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.993588,0.0019550906,0.00024999052,0.0010292607,0.0022715444,0.0009061424],"domain_scores_gemma":[0.97963434,0.00468418,0.0006860443,0.0117858285,0.0026635353,0.00054598635],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0046714502,0.0007176286,0.0011019349,0.00081888266,0.0012557463,0.002074998,0.002663051,0.0009388635,0.008907829],"category_scores_gemma":[0.018441487,0.0007432271,0.00093193864,0.00062499754,0.0017439472,0.0033093512,0.005174649,0.002629602,0.003148503],"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.0018943368,0.00038376934,0.0036822131,0.00060238567,0.00021950707,0.00066395034,0.0006808711,0.35457224,0.046930224,0.2808658,0.04507927,0.2644255],"study_design_scores_gemma":[0.00023038796,0.00017019315,0.00065728975,0.000074713964,0.000114876326,0.00019872411,0.0001178327,0.7408152,0.036923047,0.1994004,0.021245217,0.000052132396],"about_ca_topic_score_codex":0.0012866841,"about_ca_topic_score_gemma":0.0021009592,"teacher_disagreement_score":0.008907829,"about_ca_system_score_codex":0.0016056967,"about_ca_system_score_gemma":0.0037138243,"threshold_uncertainty_score":0.02979964},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044685815,0.0009391029,0.9192171,0.0019352139,0.00010372258,0.0001312192,0.00020746978,0.0017853301,0.030995043],"genre_scores_gemma":[0.76295745,0.0009542648,0.2140044,0.0004334162,0.00017545231,0.00040338832,0.00036805242,0.0005423296,0.020161374],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99310774,0.0023666369,0.00060498546,0.0008920558,0.002481337,0.00054740754],"domain_scores_gemma":[0.9904441,0.0069691185,0.00044827213,0.0013222516,0.00062269374,0.00019354555],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006406097,0.0009078515,0.0007097411,0.0011396734,0.0016754278,0.007656156,0.0020729445,0.0017211541,0.004397571],"category_scores_gemma":[0.016510328,0.0010604368,0.0014908946,0.001364499,0.0051916554,0.008447312,0.004921936,0.0036117227,0.0008455838],"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.000076419434,0.000029244191,0.00046257974,0.00017987612,0.000022283119,0.00029361548,0.0023407796,0.013498491,0.004139555,0.94978195,0.000777536,0.028397715],"study_design_scores_gemma":[0.00005418671,0.000044889985,0.00013352316,0.00013570592,0.0000457394,0.00028391075,0.00045939712,0.07974133,0.0057752547,0.88758606,0.025707724,0.00003231837],"about_ca_topic_score_codex":0.0027333496,"about_ca_topic_score_gemma":0.0033562642,"teacher_disagreement_score":0.007656156,"about_ca_system_score_codex":0.0019825255,"about_ca_system_score_gemma":0.001444334,"threshold_uncertainty_score":0.0338791},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005593175,0.00014886037,0.9854726,0.00014464124,0.000043318276,0.00007683318,0.000053104384,0.00035178085,0.008115639],"genre_scores_gemma":[0.44161618,0.0017708906,0.50480807,0.00030513783,0.0001435143,0.0010511789,0.00052845257,0.0006216722,0.04915489],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99885106,0.00036067003,0.00008847201,0.00019677237,0.00038421497,0.000118777214],"domain_scores_gemma":[0.9986314,0.0006399696,0.0001098333,0.00038156137,0.00019378125,0.000043306536],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013704853,0.0007132667,0.00050197414,0.00057272176,0.0005656729,0.0019652515,0.0020705026,0.0014009298,0.0058134],"category_scores_gemma":[0.00377527,0.00054744066,0.0012438128,0.0005488767,0.0011217362,0.004172659,0.0010550597,0.002250485,0.00158168],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005843823,0.000050707855,0.000120853896,0.00010334196,0.00001257121,0.00011745286,0.00028804905,0.13757746,0.007799374,0.83018214,0.0010769054,0.022612734],"study_design_scores_gemma":[0.00003556265,0.00004574032,0.000042284162,0.000038047492,0.000022441214,0.000073635754,0.000038547525,0.77020955,0.00804822,0.20722029,0.0142063685,0.000019338877],"about_ca_topic_score_codex":0.0022713211,"about_ca_topic_score_gemma":0.0017708426,"teacher_disagreement_score":0.0058134,"about_ca_system_score_codex":0.0013547803,"about_ca_system_score_gemma":0.0013572695,"threshold_uncertainty_score":0.019447744},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014658911,0.026506577,0.72265947,0.0169197,0.052251086,0.0006685454,0.006684208,0.038080804,0.12157075],"genre_scores_gemma":[0.07400983,0.016251218,0.21826355,0.001647906,0.0048486046,0.0002160692,0.019737152,0.013486082,0.65153956],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9958547,0.0007681931,0.0002738693,0.00069450913,0.0018887303,0.0005199326],"domain_scores_gemma":[0.9919437,0.0009257502,0.00013399994,0.0015620032,0.0050068307,0.00042774892],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0050185514,0.0019094932,0.002063682,0.0020098886,0.0021939415,0.007827453,0.0027285004,0.0012986455,0.056163702],"category_scores_gemma":[0.009770072,0.001202343,0.0014841224,0.0017216196,0.0017501126,0.0032182934,0.0020101212,0.002995687,0.023675116],"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.00047503388,0.00014084516,0.00068044936,0.00062527356,0.00008400759,0.00027266363,0.0003316135,0.0041922377,0.0055640647,0.015742607,0.684873,0.2870183],"study_design_scores_gemma":[0.00018183734,0.00014189382,0.0015794083,0.0006220734,0.00020218054,0.00056968746,0.000358484,0.02192999,0.025203848,0.01900799,0.93010294,0.0000996052],"about_ca_topic_score_codex":0.073499426,"about_ca_topic_score_gemma":0.16368985,"teacher_disagreement_score":0.073499426,"about_ca_system_score_codex":0.00606318,"about_ca_system_score_gemma":0.009610764,"threshold_uncertainty_score":0.1878863},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027492906,0.00002821529,0.9939697,0.00008086172,0.000014854256,0.000068829904,0.000045459525,0.0012659153,0.001776847],"genre_scores_gemma":[0.15292814,0.00014845945,0.84209037,0.0000881803,0.000021544034,0.00022784622,0.00036948334,0.0007493035,0.003376601],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99670106,0.00096240384,0.0001796073,0.00038702093,0.0015627651,0.00020705051],"domain_scores_gemma":[0.9947674,0.0032130042,0.00020511031,0.0010596834,0.00066954416,0.00008524866],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019518296,0.0010047155,0.00091901276,0.0013796628,0.00089409115,0.001764578,0.002441247,0.0010797991,0.010700686],"category_scores_gemma":[0.0074116597,0.0007536687,0.0014964945,0.0012689552,0.0023349703,0.0025860008,0.0025706554,0.0024264373,0.0018019102],"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.00036501908,0.00037913365,0.0011071153,0.00048432444,0.00014572419,0.00046501978,0.0005757002,0.38631308,0.036830798,0.27002314,0.0039658365,0.29934514],"study_design_scores_gemma":[0.00005386395,0.00004983692,0.00011671521,0.00004321289,0.000049101247,0.0000753455,0.00004774093,0.90813863,0.019953318,0.06577117,0.0056814,0.000019700876],"about_ca_topic_score_codex":0.0053017517,"about_ca_topic_score_gemma":0.0068388497,"teacher_disagreement_score":0.010700686,"about_ca_system_score_codex":0.0011916294,"about_ca_system_score_gemma":0.0033918316,"threshold_uncertainty_score":0.035797298},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00045527858,0.00060166797,0.0012221568,0.0024522042,0.00090711494,0.00006549453,0.0031869558,0.0022862116,0.98882306],"genre_scores_gemma":[0.0006519055,0.00013692997,0.00026384502,0.00014239915,0.000014404384,0.000007797998,0.0005624516,0.00034957787,0.9978708],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987814,0.000049255756,0.000021886228,0.0002496642,0.0006786292,0.0002190735],"domain_scores_gemma":[0.9972377,0.00017827595,0.000079339916,0.00018489987,0.0013942162,0.00092561275],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00078366464,0.0011666201,0.0008995493,0.0010663936,0.0039300537,0.0045172013,0.0013173341,0.0035396216,0.8355277],"category_scores_gemma":[0.0021070403,0.0006752634,0.0005985507,0.001645119,0.0009561304,0.0018598294,0.0016671354,0.0016435534,0.7441039],"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.00007603264,0.000014937029,0.00013648231,0.00010507122,0.0000035322646,0.00004230461,0.0000776111,0.000098113465,0.0005648442,0.003721198,0.94713724,0.04802269],"study_design_scores_gemma":[0.0000074507393,0.0000091387665,0.00025069612,0.000038320526,0.000002600748,0.000021375645,0.000065596,0.00010590591,0.00022822963,0.00035812132,0.99890614,0.000006484455],"about_ca_topic_score_codex":0.28904694,"about_ca_topic_score_gemma":0.47332937,"teacher_disagreement_score":0.28904694,"about_ca_system_score_codex":0.006504013,"about_ca_system_score_gemma":0.010342984,"threshold_uncertainty_score":0.57472897},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.58316237,0.0023842922,0.37343204,0.0045586308,0.0001522539,0.0006325643,0.00031081276,0.0034550563,0.03191199],"genre_scores_gemma":[0.8654932,0.0006618266,0.12896995,0.00020138327,0.000046725658,0.00011131139,0.00017583868,0.00024793964,0.0040918686],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99018013,0.005882309,0.00029832855,0.00051881024,0.002540159,0.00058029423],"domain_scores_gemma":[0.97529685,0.019245677,0.0005777323,0.0033750257,0.0012271759,0.00027752365],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0067478116,0.00057328073,0.0007264297,0.00085553696,0.0013540798,0.0017019097,0.0015116027,0.0035065163,0.0019943377],"category_scores_gemma":[0.021858424,0.00039903028,0.0009927748,0.0015825394,0.002138479,0.002671354,0.0016098155,0.0017443872,0.00026909867],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0026684613,0.0012291509,0.021132668,0.0014584248,0.00018885563,0.026889652,0.010607864,0.29476956,0.040295817,0.29761347,0.012945189,0.29020083],"study_design_scores_gemma":[0.00049965456,0.0013167534,0.006059718,0.0003384558,0.00023054543,0.007956303,0.0025968044,0.75428873,0.06597542,0.09545005,0.06514733,0.00014027752],"about_ca_topic_score_codex":0.007886502,"about_ca_topic_score_gemma":0.009256615,"teacher_disagreement_score":0.007886502,"about_ca_system_score_codex":0.0011893864,"about_ca_system_score_gemma":0.0011297652,"threshold_uncertainty_score":0.035686255},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004344603,0.0003064808,0.7988896,0.0001914978,0.00012351913,0.00012575537,0.0011722599,0.19220385,0.0026425212],"genre_scores_gemma":[0.19684838,0.00035700275,0.7638963,0.0005602541,0.00011788363,0.00054703944,0.0057460004,0.02641937,0.0055077868],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99444026,0.0019790658,0.00057877117,0.00090805395,0.0017152692,0.00037864747],"domain_scores_gemma":[0.9863858,0.008493734,0.0007010442,0.00272033,0.0014211087,0.00027794056],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0053452407,0.0020227346,0.0017527305,0.0040870314,0.0012511511,0.0034654073,0.0062088016,0.0023325135,0.021668315],"category_scores_gemma":[0.020475382,0.0025314663,0.0029344454,0.0013919371,0.002027808,0.005959707,0.006842776,0.0023366972,0.005791962],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0022931937,0.00034883094,0.011940165,0.0031522214,0.00067481044,0.0019837301,0.0015922778,0.045173887,0.032279998,0.2445313,0.15543334,0.5005962],"study_design_scores_gemma":[0.00054567616,0.00024854203,0.0014828928,0.0006154975,0.00019433355,0.0013007137,0.00023737895,0.63373697,0.053322993,0.15513718,0.15284075,0.00033699485],"about_ca_topic_score_codex":0.0052952827,"about_ca_topic_score_gemma":0.006118117,"teacher_disagreement_score":0.021668315,"about_ca_system_score_codex":0.002039439,"about_ca_system_score_gemma":0.0023261895,"threshold_uncertainty_score":0.07248771},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012117294,0.019962328,0.021529183,0.04573682,0.0031634893,0.00013996198,0.0019618513,0.0012111736,0.89417785],"genre_scores_gemma":[0.15870678,0.007837399,0.016173456,0.0034332185,0.0006055357,0.00019734715,0.0010178776,0.00043621755,0.8115922],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990939,0.00028761866,0.000027687423,0.00021295955,0.00024389147,0.00013401378],"domain_scores_gemma":[0.9988223,0.0003403202,0.00006232011,0.00011478953,0.00018670491,0.00047360457],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011936863,0.0007188284,0.00034798982,0.0013432845,0.0023558417,0.0035136514,0.00095142,0.0011732074,0.1310366],"category_scores_gemma":[0.0029912358,0.00028138518,0.00044249446,0.0010718313,0.0014992508,0.0025054966,0.001993704,0.0013476176,0.0121811405],"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.00013133878,0.000052915166,0.0011329007,0.00020029121,0.000017321605,0.00026862623,0.0012171668,0.0011872742,0.0012239569,0.51351655,0.30453482,0.17651688],"study_design_scores_gemma":[0.000012192606,0.000029609742,0.0007830329,0.00013289302,0.0000048636075,0.00009272793,0.00031888182,0.001000104,0.0004398855,0.047091167,0.950079,0.000015438982],"about_ca_topic_score_codex":0.06027591,"about_ca_topic_score_gemma":0.11969845,"teacher_disagreement_score":0.1310366,"about_ca_system_score_codex":0.0076489495,"about_ca_system_score_gemma":0.0039515146,"threshold_uncertainty_score":0.4383611},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027659873,0.04214901,0.74531186,0.018985476,0.03713351,0.0005411381,0.002353156,0.005254456,0.14550546],"genre_scores_gemma":[0.063436165,0.03761184,0.53099173,0.007781074,0.014462599,0.0013766894,0.012640346,0.005884648,0.32581496],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9931039,0.0023167168,0.0007725575,0.001022724,0.0023908843,0.0003932271],"domain_scores_gemma":[0.9938099,0.0026837355,0.00016397469,0.0014511817,0.0015166663,0.000374608],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009613955,0.001643404,0.001482815,0.001796321,0.0010573152,0.006378881,0.0032953264,0.0025198967,0.06325261],"category_scores_gemma":[0.011924097,0.0009266898,0.0030604373,0.0011053539,0.0024739467,0.0054028654,0.0040837564,0.0069421544,0.021653414],"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.00018501515,0.0001692535,0.0005382636,0.0011554365,0.00019220982,0.0002850179,0.0010179383,0.0037783228,0.0032780948,0.3277641,0.33644563,0.3251907],"study_design_scores_gemma":[0.000026480198,0.000043417687,0.00023638172,0.00046457333,0.00003367214,0.00027251904,0.00009144652,0.0032619277,0.0008993537,0.08806262,0.90658516,0.000022535285],"about_ca_topic_score_codex":0.0024860129,"about_ca_topic_score_gemma":0.0020074742,"teacher_disagreement_score":0.06325261,"about_ca_system_score_codex":0.0027920604,"about_ca_system_score_gemma":0.0036497996,"threshold_uncertainty_score":0.21160108},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01799921,0.0017629577,0.9395356,0.0037962112,0.0005180032,0.00028730324,0.0006909812,0.0019067081,0.03350311],"genre_scores_gemma":[0.5561797,0.00221988,0.4116675,0.0019301749,0.00094871665,0.0017865335,0.0013755808,0.0014807452,0.022411276],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99170494,0.0017329882,0.00076928677,0.0029613343,0.002035401,0.0007960486],"domain_scores_gemma":[0.9791845,0.013797248,0.0014071487,0.0033682552,0.0016633914,0.00057942735],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0044239406,0.0014639853,0.0012446074,0.0013702889,0.0019303702,0.0054505616,0.0018637283,0.0021960386,0.015518444],"category_scores_gemma":[0.028828284,0.00096104667,0.0035807467,0.0011875067,0.005685411,0.009696546,0.004496038,0.006254143,0.0022848882],"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.000112454734,0.000029702462,0.00035608248,0.00018991012,0.00003462497,0.0001543106,0.00035472878,0.0090084495,0.0027870198,0.9731767,0.001581554,0.012214467],"study_design_scores_gemma":[0.000062364226,0.000043261145,0.000104806415,0.00006935458,0.000039188515,0.00012519759,0.000048058984,0.030779766,0.0027057063,0.954016,0.011981146,0.000025190171],"about_ca_topic_score_codex":0.0025413458,"about_ca_topic_score_gemma":0.001814253,"teacher_disagreement_score":0.015518444,"about_ca_system_score_codex":0.0038376332,"about_ca_system_score_gemma":0.0027881109,"threshold_uncertainty_score":0.051914394},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009514119,0.0013886342,0.9772329,0.0021325303,0.000060377246,0.000096282376,0.00016570168,0.0015558405,0.0078537045],"genre_scores_gemma":[0.38377565,0.0039163497,0.6046246,0.0012884043,0.00027689582,0.00046708618,0.0006845298,0.00090152177,0.004064973],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9870936,0.0050203833,0.00074959773,0.0019751869,0.004535852,0.00062535383],"domain_scores_gemma":[0.93410265,0.051769204,0.0013076721,0.010778922,0.0017330864,0.00030844833],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011708217,0.0013628704,0.0015460706,0.0013145405,0.0010673983,0.0035448894,0.004977681,0.0021231116,0.0075996667],"category_scores_gemma":[0.04271329,0.0013735527,0.0025432692,0.0016154181,0.0061328346,0.014325822,0.0042716363,0.0073413905,0.0021834092],"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.00038545355,0.00019901448,0.0012126782,0.0013957361,0.0001359503,0.00018868547,0.00043702777,0.1311903,0.0086807655,0.65934163,0.0038474202,0.1929853],"study_design_scores_gemma":[0.000075446114,0.00016276434,0.00018386293,0.0002537583,0.00005892697,0.0002243337,0.00011054909,0.3417013,0.010365594,0.63522077,0.011590966,0.000051668096],"about_ca_topic_score_codex":0.001363136,"about_ca_topic_score_gemma":0.0015881358,"teacher_disagreement_score":0.011708217,"about_ca_system_score_codex":0.0025269708,"about_ca_system_score_gemma":0.0030087351,"threshold_uncertainty_score":0.06191969},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010309657,0.00007463175,0.98790634,0.00017251831,0.000020021971,0.000028862065,0.000036252895,0.00029853612,0.0011531127],"genre_scores_gemma":[0.53769946,0.00036770743,0.46019864,0.00013390147,0.000033516095,0.00021768831,0.00013381976,0.00022994167,0.0009853682],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971595,0.00083432934,0.00020177798,0.0003548467,0.0011760938,0.00027355706],"domain_scores_gemma":[0.99314547,0.0036631057,0.00058357365,0.0017686443,0.00068872987,0.00015055141],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039441832,0.00089318777,0.0008618392,0.0008271084,0.0008615169,0.0017092451,0.0008373855,0.0009777439,0.0022691295],"category_scores_gemma":[0.014234283,0.0008037362,0.0011765256,0.0007066696,0.0035062714,0.0037154371,0.0025632214,0.0026140073,0.00045390855],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000078466044,0.000042464908,0.0006019675,0.00016797424,0.000020660013,0.00013837466,0.00018549281,0.53043145,0.007855747,0.42025918,0.00056857854,0.039649654],"study_design_scores_gemma":[0.00001373986,0.00003591146,0.000056304583,0.000027760154,0.000012558471,0.000027937163,0.000022270115,0.764844,0.0045327973,0.22863734,0.0017772852,0.000011971909],"about_ca_topic_score_codex":0.0023075214,"about_ca_topic_score_gemma":0.0031415995,"teacher_disagreement_score":0.0039441832,"about_ca_system_score_codex":0.0013300958,"about_ca_system_score_gemma":0.0034142227,"threshold_uncertainty_score":0.020859122},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0048323283,0.0001468968,0.9905811,0.00019715015,0.000025995281,0.00003478311,0.00005458875,0.00010960057,0.004017676],"genre_scores_gemma":[0.40558642,0.0009762049,0.5867064,0.00031413324,0.000105927786,0.00029268544,0.0002656222,0.00018145636,0.005571249],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99861,0.0005395551,0.00008678928,0.00023851614,0.00041095447,0.00011417105],"domain_scores_gemma":[0.99810684,0.001459553,0.00013501702,0.000120226665,0.00014157653,0.000036745547],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019515008,0.0009790284,0.00063497544,0.0006136429,0.0005472453,0.001894567,0.00095172005,0.0007628778,0.0037672261],"category_scores_gemma":[0.0048606824,0.00051512156,0.00090323976,0.0009529083,0.0026104194,0.0027357491,0.0016746864,0.0024104053,0.00047110725],"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.00007529349,0.000040548086,0.00021688982,0.00021008454,0.000025659348,0.00014394216,0.00011758338,0.28689876,0.0031286045,0.66451544,0.00092887663,0.043698404],"study_design_scores_gemma":[0.000039503637,0.000045179757,0.000088002205,0.000050884093,0.000018305385,0.00004168172,0.000044901117,0.5591079,0.0031765718,0.43149868,0.0058673564,0.00002110754],"about_ca_topic_score_codex":0.002812677,"about_ca_topic_score_gemma":0.003153915,"teacher_disagreement_score":0.0037672261,"about_ca_system_score_codex":0.0012921182,"about_ca_system_score_gemma":0.0016246097,"threshold_uncertainty_score":0.012602627},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027883183,0.00021495872,0.96435314,0.00094192714,0.0000759981,0.00022146583,0.0002228812,0.0011858866,0.004900526],"genre_scores_gemma":[0.5254955,0.00044218372,0.4676906,0.0003589954,0.00009185803,0.00059141754,0.0005758043,0.00040178534,0.0043518967],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9875436,0.0047423425,0.0006787011,0.002009377,0.0040938803,0.0009321214],"domain_scores_gemma":[0.9577497,0.033026036,0.0026864733,0.0037866747,0.0022188986,0.0005321569],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008356177,0.0014713045,0.0014194829,0.0017762926,0.002585942,0.00410213,0.0030156102,0.0018644814,0.0054255486],"category_scores_gemma":[0.04574325,0.0010046933,0.0032507512,0.0021604183,0.007330824,0.00992326,0.0058515696,0.0037597031,0.0008187863],"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.00053429214,0.00018177777,0.001649476,0.00041511882,0.0001437883,0.0006616918,0.001023931,0.19042265,0.0083909705,0.73005694,0.0018250323,0.06469435],"study_design_scores_gemma":[0.00016690687,0.00011875573,0.00028611152,0.00009037743,0.000072015595,0.00019480387,0.00016212011,0.6382883,0.014667366,0.34019843,0.005692982,0.000061777406],"about_ca_topic_score_codex":0.010499525,"about_ca_topic_score_gemma":0.008940139,"teacher_disagreement_score":0.010499525,"about_ca_system_score_codex":0.004059197,"about_ca_system_score_gemma":0.006837069,"threshold_uncertainty_score":0.044192255},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01795805,0.000055072003,0.97681785,0.000103606544,0.00002443507,0.00013694752,0.000075242926,0.0024056071,0.0024232874],"genre_scores_gemma":[0.49508074,0.00013115424,0.50045586,0.00012278245,0.000016626213,0.0005461207,0.00028594176,0.00042743876,0.0029333092],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985607,0.0004102673,0.00015921777,0.00029121706,0.00043831952,0.00014024036],"domain_scores_gemma":[0.9951841,0.0026664855,0.00043110165,0.0010836045,0.0004941219,0.00014050816],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018912634,0.0008670915,0.0004622529,0.00053730863,0.00063332124,0.0017418666,0.0016787315,0.0010726337,0.0028511283],"category_scores_gemma":[0.006617743,0.00050635374,0.000877294,0.00031178838,0.001884711,0.001999689,0.0017851271,0.001354959,0.0006307488],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00053576904,0.0003745057,0.0043342244,0.00049713266,0.00012469299,0.0010064561,0.0019712043,0.59129876,0.07122766,0.14417511,0.002095885,0.18235858],"study_design_scores_gemma":[0.00005778016,0.00009469887,0.00013957891,0.000044360684,0.00004301029,0.00009024749,0.00010366571,0.9154928,0.034515265,0.044130124,0.0052589043,0.00002961553],"about_ca_topic_score_codex":0.0034315474,"about_ca_topic_score_gemma":0.0044774613,"teacher_disagreement_score":0.0034315474,"about_ca_system_score_codex":0.0009903602,"about_ca_system_score_gemma":0.0018996513,"threshold_uncertainty_score":0.010002136},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.059749085,0.00035108105,0.84468085,0.002828433,0.00028746048,0.00025299357,0.0036477332,0.0047018155,0.083500534],"genre_scores_gemma":[0.6481201,0.00036481392,0.32059288,0.00056106964,0.00007727719,0.00026755137,0.0038350765,0.0011582347,0.025022976],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99922884,0.00014014081,0.00004893847,0.00012515816,0.000292314,0.00016458335],"domain_scores_gemma":[0.9991347,0.00047139387,0.000052488154,0.00015598322,0.00013978191,0.000045581975],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053943106,0.0004279848,0.00035305484,0.0007003963,0.00068600243,0.00207532,0.00075740984,0.0010794994,0.017125797],"category_scores_gemma":[0.0036564192,0.00028381572,0.00074959715,0.00075519184,0.00091610727,0.002763109,0.0010812717,0.0014626002,0.0018415625],"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.0002682274,0.00012517323,0.0005576462,0.00024082276,0.000022520064,0.00053438294,0.0004288322,0.046735622,0.0066033984,0.8417338,0.015825506,0.08692414],"study_design_scores_gemma":[0.000073839976,0.000053800522,0.00031545718,0.00010636323,0.000030294736,0.0002508063,0.00020027961,0.25182882,0.0106510585,0.67936546,0.05708713,0.000036716563],"about_ca_topic_score_codex":0.0059961933,"about_ca_topic_score_gemma":0.010560653,"teacher_disagreement_score":0.017125797,"about_ca_system_score_codex":0.0015503729,"about_ca_system_score_gemma":0.001395608,"threshold_uncertainty_score":0.057291448},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009290351,0.00007630691,0.9467198,0.00023714796,0.000076431446,0.0003328726,0.0019591965,0.03331327,0.007994597],"genre_scores_gemma":[0.1817103,0.00026058118,0.780997,0.00037721058,0.00004172122,0.0013416556,0.008865371,0.010991885,0.015414296],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985933,0.00044170892,0.000097684584,0.00019755952,0.000576974,0.000092738424],"domain_scores_gemma":[0.9962644,0.001988525,0.00021772948,0.0008151167,0.00065004744,0.00006422673],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022040557,0.00062743406,0.0002758629,0.0009782667,0.00031664906,0.00093939505,0.0010168735,0.0006669807,0.0195896],"category_scores_gemma":[0.00902334,0.00051041506,0.0006404943,0.00039390835,0.0006493048,0.0010015182,0.0014127318,0.0009885484,0.005143194],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006455463,0.00036826235,0.0056408313,0.0015237435,0.00012297001,0.0014199005,0.0014034077,0.09811725,0.06614171,0.26720223,0.087730385,0.46968374],"study_design_scores_gemma":[0.00031791208,0.00022315283,0.0008511972,0.0002573929,0.000053730204,0.00080199563,0.0002065488,0.61892956,0.09948589,0.063886285,0.21491587,0.000070518254],"about_ca_topic_score_codex":0.0009538629,"about_ca_topic_score_gemma":0.0015038162,"teacher_disagreement_score":0.0195896,"about_ca_system_score_codex":0.00066473073,"about_ca_system_score_gemma":0.0015941702,"threshold_uncertainty_score":0.06553376},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04178803,0.00020454403,0.9553293,0.00019076368,0.00001957222,0.00008061973,0.00007171152,0.000852327,0.0014631373],"genre_scores_gemma":[0.9161391,0.00011285059,0.08176535,0.00014188462,0.00001655322,0.00015230493,0.00018376826,0.00010925917,0.0013789615],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986779,0.00044828843,0.000079234,0.0002521307,0.0003714326,0.00017087342],"domain_scores_gemma":[0.99091804,0.0071254866,0.0008244842,0.00036783091,0.0005226905,0.00024132167],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027019728,0.0008589878,0.0008005259,0.00055728055,0.0003567832,0.0008822213,0.0011146532,0.0008006414,0.0017545461],"category_scores_gemma":[0.013441628,0.0004066987,0.000649337,0.0003131892,0.0012816685,0.0011782146,0.0011691354,0.0016059644,0.00023986747],"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.00012210138,0.000051240506,0.0009731718,0.000091026406,0.00002760635,0.0000945711,0.000075946395,0.95608723,0.0016664948,0.015836455,0.00034893956,0.024625134],"study_design_scores_gemma":[0.00001176178,0.000025271887,0.000045761168,0.0000064653436,0.000003415188,0.000007726147,0.0000056304243,0.99281466,0.00050023856,0.006470411,0.00010576148,0.0000028879474],"about_ca_topic_score_codex":0.005258884,"about_ca_topic_score_gemma":0.006117714,"teacher_disagreement_score":0.005258884,"about_ca_system_score_codex":0.0014461502,"about_ca_system_score_gemma":0.0021730608,"threshold_uncertainty_score":0.014289558},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00819629,0.011035416,0.8683638,0.10098492,0.0012760735,0.00011097211,0.00015384798,0.0011066464,0.008772082],"genre_scores_gemma":[0.39970133,0.017948803,0.558741,0.010030736,0.0031572143,0.0005631392,0.00065578,0.0010446486,0.008157358],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.97666115,0.011175449,0.0011738528,0.0021895703,0.007696043,0.0011039301],"domain_scores_gemma":[0.88422227,0.08593781,0.0019579374,0.01484391,0.010958216,0.0020799285],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.040128455,0.00074813666,0.0015380087,0.0012619621,0.0028495966,0.007526376,0.0045183036,0.0043191332,0.0034699994],"category_scores_gemma":[0.07062711,0.0010036032,0.0016916526,0.0011038554,0.014384573,0.024916591,0.007445113,0.010868059,0.0012875526],"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.00005904614,0.000055723212,0.00065180624,0.00036237403,0.000048220143,0.00014591277,0.00076970237,0.0073412107,0.0007392317,0.8994572,0.011206485,0.07916304],"study_design_scores_gemma":[0.00002391801,0.000030325498,0.000120408404,0.00021218079,0.000014842323,0.000115568255,0.00033797888,0.016913544,0.0007479199,0.93675685,0.044689983,0.00003641511],"about_ca_topic_score_codex":0.0032460035,"about_ca_topic_score_gemma":0.0021517242,"teacher_disagreement_score":0.040128455,"about_ca_system_score_codex":0.0031780226,"about_ca_system_score_gemma":0.008793524,"threshold_uncertainty_score":0.2122221},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0121913,0.00011069109,0.9847607,0.0005013631,0.000023272407,0.00005840776,0.0001612304,0.00055577006,0.001637324],"genre_scores_gemma":[0.4835097,0.00047637644,0.5106219,0.00036960442,0.0001579203,0.00034999184,0.0008200365,0.0002845894,0.0034098541],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9943341,0.0025592365,0.00035960943,0.0008807299,0.0014151223,0.0004511143],"domain_scores_gemma":[0.9785734,0.01813768,0.000905163,0.0011880569,0.00090633694,0.00028948355],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006034563,0.0010504328,0.0010724881,0.0012068828,0.0012411021,0.0030784502,0.0017730228,0.0013261327,0.005081018],"category_scores_gemma":[0.026634937,0.0009864216,0.0035930392,0.0010127501,0.0031071731,0.0046630353,0.0041070106,0.0041566542,0.000573257],"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.00008774478,0.00005246375,0.00079374405,0.00016759973,0.000067368586,0.0002095756,0.00032773401,0.35271206,0.0014893933,0.6234351,0.0011942454,0.019462876],"study_design_scores_gemma":[0.000019131725,0.000008026557,0.000052715935,0.000016474845,0.000012155658,0.000021962594,0.000025250818,0.7229155,0.00083824305,0.27478525,0.0012967241,0.00000853377],"about_ca_topic_score_codex":0.0056805476,"about_ca_topic_score_gemma":0.006433879,"teacher_disagreement_score":0.006034563,"about_ca_system_score_codex":0.002991634,"about_ca_system_score_gemma":0.0028826771,"threshold_uncertainty_score":0.031914234},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006767005,0.00013154562,0.9903494,0.0001426749,0.00002647678,0.00006169866,0.000036761194,0.00074644457,0.0017380258],"genre_scores_gemma":[0.49283093,0.0004596539,0.5009742,0.0004401636,0.000052320243,0.00035954086,0.00020777476,0.0007249106,0.0039505465],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.992743,0.0029217107,0.00032703218,0.0007049305,0.002660418,0.00064302224],"domain_scores_gemma":[0.98087764,0.013486944,0.0010476701,0.0031686204,0.0012727408,0.00014630175],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0058235396,0.0011959769,0.0010266105,0.0011638536,0.00094415975,0.001866648,0.0019497251,0.0013968758,0.0040258877],"category_scores_gemma":[0.021382034,0.0009477508,0.0014480664,0.0007570349,0.0030385356,0.005877069,0.0029186793,0.002574839,0.00086393463],"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.00044412896,0.0001227289,0.0024870553,0.0008979308,0.00006399355,0.0009246336,0.00093354285,0.42687166,0.036399864,0.39105952,0.0029267082,0.13686812],"study_design_scores_gemma":[0.00010706339,0.00019373774,0.00024108455,0.0001878885,0.000050504346,0.0003473949,0.000101385886,0.6496599,0.08132499,0.25337502,0.014342376,0.0000686952],"about_ca_topic_score_codex":0.0022857469,"about_ca_topic_score_gemma":0.002212024,"teacher_disagreement_score":0.0058235396,"about_ca_system_score_codex":0.0019955803,"about_ca_system_score_gemma":0.0024646488,"threshold_uncertainty_score":0.030798197},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021744572,0.000038229617,0.9742131,0.000098608594,0.00001966286,0.00014791019,0.0001291903,0.0014574802,0.0021513207],"genre_scores_gemma":[0.28618565,0.00014561151,0.7089464,0.000067181114,0.000016171667,0.000468317,0.00060817564,0.00057395606,0.0029884912],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979755,0.0006115818,0.00018314064,0.00035266828,0.00070769375,0.000169401],"domain_scores_gemma":[0.99555796,0.0027985156,0.00035301206,0.0008813221,0.00033909528,0.00007021397],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002297352,0.0006452337,0.0004324325,0.0005204242,0.00057725975,0.0013339688,0.0013400192,0.00083329977,0.0033014556],"category_scores_gemma":[0.0070095384,0.0006542036,0.0014113346,0.0005386475,0.0020424393,0.0022261834,0.0014940383,0.001600155,0.0006193051],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015140015,0.00018202355,0.0013156469,0.0005272863,0.00008824319,0.00065187254,0.0008688468,0.42095476,0.05909227,0.4337371,0.0015062662,0.08092442],"study_design_scores_gemma":[0.00008698166,0.0001322302,0.00018281123,0.00007195487,0.00007437098,0.00014534658,0.00017533616,0.75501114,0.093747064,0.13440995,0.015924793,0.000038042297],"about_ca_topic_score_codex":0.0024209379,"about_ca_topic_score_gemma":0.004619551,"teacher_disagreement_score":0.0033014556,"about_ca_system_score_codex":0.0014880755,"about_ca_system_score_gemma":0.0027645496,"threshold_uncertainty_score":0.012149751},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7547269,0.0005933092,0.20906878,0.001417607,0.00007236261,0.0008460361,0.00048088437,0.0015695668,0.031224634],"genre_scores_gemma":[0.92001957,0.00024885547,0.075759,0.00008302785,0.0000115272915,0.00016344283,0.0002381154,0.00021468221,0.0032617722],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9886417,0.0045877052,0.0006164034,0.00073687336,0.004528097,0.0008891725],"domain_scores_gemma":[0.90930367,0.07317016,0.0021515465,0.010332709,0.004495823,0.000546099],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009513563,0.00073922484,0.00064420816,0.001372059,0.0015706164,0.0023339463,0.002143337,0.0038814628,0.004107274],"category_scores_gemma":[0.06355486,0.0006018503,0.0012133776,0.0012957773,0.0039385976,0.0035686519,0.0024017307,0.0021991576,0.0008135654],"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.0047866977,0.003963257,0.02168553,0.0018433555,0.0002664436,0.019270949,0.009401889,0.33608717,0.038025286,0.23480044,0.009513641,0.3203554],"study_design_scores_gemma":[0.0011068019,0.0020139115,0.003257738,0.00035990524,0.00026050696,0.008595034,0.002979876,0.6180474,0.15385109,0.19319916,0.016175002,0.00015356744],"about_ca_topic_score_codex":0.0026427624,"about_ca_topic_score_gemma":0.0031299312,"teacher_disagreement_score":0.009513563,"about_ca_system_score_codex":0.0015509386,"about_ca_system_score_gemma":0.0016527623,"threshold_uncertainty_score":0.050313115},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006371021,0.0001265807,0.9567115,0.00027199485,0.000268357,0.00010182429,0.000549183,0.031514727,0.004084824],"genre_scores_gemma":[0.3047711,0.0003997994,0.6680575,0.0010222744,0.000112768925,0.00034419604,0.0022026466,0.0086518,0.014437824],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99685574,0.00089435215,0.00028850746,0.0005922347,0.0010474615,0.00032176432],"domain_scores_gemma":[0.9953929,0.0022761528,0.00023301411,0.0014184406,0.00055191346,0.00012760026],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032044475,0.0013987329,0.0011445971,0.0013958858,0.00072696886,0.0031923358,0.0036922076,0.0018429533,0.011308485],"category_scores_gemma":[0.008934779,0.0014916572,0.0019068633,0.0008240835,0.0014024476,0.0065701725,0.0038902652,0.0033110974,0.003062242],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016300012,0.00056242145,0.0034872124,0.0019263973,0.0005574909,0.0009349296,0.0004425486,0.13328648,0.05851223,0.3459147,0.056891263,0.39585435],"study_design_scores_gemma":[0.0003486682,0.00015810753,0.0004470028,0.0002159375,0.00027398186,0.00044192022,0.000072420946,0.6307723,0.10131561,0.21543957,0.05037092,0.00014366381],"about_ca_topic_score_codex":0.0011888954,"about_ca_topic_score_gemma":0.0019569872,"teacher_disagreement_score":0.011308485,"about_ca_system_score_codex":0.00089708297,"about_ca_system_score_gemma":0.0020745094,"threshold_uncertainty_score":0.03783065},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017406598,0.00023546106,0.9665599,0.000043525146,0.000068319554,0.00011842808,0.00019703229,0.0025147866,0.012856068],"genre_scores_gemma":[0.5033214,0.00070269353,0.46983853,0.00006320588,0.00003403045,0.00047057358,0.0011590805,0.0013094484,0.023101015],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996809,0.000049007605,0.000026675176,0.000044257875,0.000165398,0.000033826807],"domain_scores_gemma":[0.9995534,0.0002488418,0.00004052666,0.00005788502,0.00008930932,0.0000099722565],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002843395,0.0008443241,0.00045421242,0.00056022627,0.00025252116,0.0006799942,0.00073757156,0.00052607775,0.0057682944],"category_scores_gemma":[0.0009734092,0.0005675674,0.0006752522,0.0004569934,0.00032229576,0.0005865054,0.00038642134,0.0005844168,0.0014596796],"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.00033026017,0.00010197944,0.0004830475,0.0015045184,0.00007121303,0.0012139257,0.00054666575,0.34919444,0.2156475,0.14141086,0.004959528,0.28453606],"study_design_scores_gemma":[0.00008611427,0.0004899758,0.00032312277,0.00022005741,0.000117104115,0.0006210726,0.00010645219,0.6494968,0.2614652,0.042251185,0.04477905,0.000044003336],"about_ca_topic_score_codex":0.0007023802,"about_ca_topic_score_gemma":0.0012326604,"teacher_disagreement_score":0.0057682944,"about_ca_system_score_codex":0.0002877344,"about_ca_system_score_gemma":0.000620516,"threshold_uncertainty_score":0.019296885},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012257941,0.00025598728,0.97727776,0.00021168524,0.00010915073,0.00017227574,0.00025987867,0.005667939,0.0037873406],"genre_scores_gemma":[0.36417636,0.00024487096,0.6245017,0.0003590456,0.000069989364,0.0002718528,0.00090211985,0.001612848,0.007861233],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9932876,0.0019309444,0.00065065356,0.0008808793,0.0026442271,0.0006057437],"domain_scores_gemma":[0.98629606,0.0049209986,0.00034757899,0.0058742575,0.0023642809,0.00019680471],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004141124,0.00096190505,0.0010341638,0.001833539,0.0010737083,0.0021469644,0.0035239004,0.0012451842,0.007613183],"category_scores_gemma":[0.013701703,0.0009804434,0.0019075548,0.0015464571,0.0018171871,0.005927073,0.004731,0.0024356146,0.0020519677],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011671243,0.00032865652,0.0031049391,0.0008534503,0.0002500741,0.00092179014,0.0006864897,0.11306664,0.045037284,0.31945828,0.011608377,0.50351685],"study_design_scores_gemma":[0.0001494865,0.00020449908,0.00061056076,0.000132098,0.00025806212,0.00038802595,0.00012145786,0.6425174,0.06413682,0.26763204,0.023752812,0.00009674031],"about_ca_topic_score_codex":0.007394897,"about_ca_topic_score_gemma":0.010834765,"teacher_disagreement_score":0.007613183,"about_ca_system_score_codex":0.001813805,"about_ca_system_score_gemma":0.0024793302,"threshold_uncertainty_score":0.025468647},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10320269,0.00094957784,0.88422704,0.00040990967,0.00010746236,0.00008114454,0.00006582638,0.0033918242,0.007564636],"genre_scores_gemma":[0.7873231,0.00041739803,0.20675595,0.00010615788,0.00008079185,0.00007397315,0.00012014312,0.000865,0.0042574434],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968375,0.0008718645,0.00011975493,0.00029097052,0.0014414302,0.00043847857],"domain_scores_gemma":[0.99438757,0.0044099507,0.00021024577,0.00040617923,0.00051611976,0.00006991027],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033612538,0.0012085123,0.0013706328,0.0011229459,0.000597638,0.0017738305,0.0018000896,0.0010813912,0.004462375],"category_scores_gemma":[0.010879628,0.0006764405,0.0011481761,0.0011593472,0.0019072444,0.0022545347,0.0018137358,0.0017328878,0.00043027953],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000847222,0.00013425111,0.0013808492,0.00044707223,0.00016122153,0.0002701396,0.00030311194,0.53853106,0.019244574,0.16235706,0.0033857776,0.2729377],"study_design_scores_gemma":[0.0000747352,0.00011838011,0.00023911297,0.00005326815,0.00008415937,0.000056468965,0.00004303231,0.8342168,0.020995578,0.14229581,0.0017942677,0.000028413337],"about_ca_topic_score_codex":0.002568877,"about_ca_topic_score_gemma":0.0033578533,"teacher_disagreement_score":0.004462375,"about_ca_system_score_codex":0.0021733711,"about_ca_system_score_gemma":0.0014129524,"threshold_uncertainty_score":0.01777625},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02327748,0.0001088261,0.9745087,0.000086347696,0.00002877388,0.000039274284,0.000054631306,0.0011305176,0.000765416],"genre_scores_gemma":[0.6743467,0.00019712604,0.32356676,0.00008868024,0.000026997526,0.00014860723,0.00019073104,0.00018341657,0.001250951],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9964709,0.0009825337,0.00023567023,0.00076357665,0.001231465,0.00031580613],"domain_scores_gemma":[0.99020326,0.0064718756,0.0010436585,0.0015156234,0.00060512207,0.00016054841],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00219445,0.0007518428,0.0007725054,0.0011453768,0.00053500663,0.0017111297,0.0016037067,0.0010475527,0.0018577097],"category_scores_gemma":[0.011949596,0.0005141091,0.0019054209,0.0008135112,0.0026926412,0.0037085812,0.0015778082,0.0015685307,0.00019341668],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007415223,0.00018601264,0.0067328946,0.00054567476,0.00025793025,0.001003592,0.00071435724,0.6052254,0.03190019,0.26380733,0.0011956247,0.0876895],"study_design_scores_gemma":[0.00004553994,0.00005233004,0.00022959217,0.00003528547,0.000042384825,0.00012132441,0.000030921517,0.91211367,0.016354358,0.069931656,0.0010166196,0.000026385314],"about_ca_topic_score_codex":0.0067881825,"about_ca_topic_score_gemma":0.005360313,"teacher_disagreement_score":0.0067881825,"about_ca_system_score_codex":0.0013125452,"about_ca_system_score_gemma":0.0018489908,"threshold_uncertainty_score":0.013497353},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009474533,0.00023974714,0.97452974,0.00036688574,0.000100968275,0.0000813667,0.00021466402,0.00068383967,0.014308178],"genre_scores_gemma":[0.7067444,0.0008526345,0.27544197,0.00029877882,0.00026707677,0.00033232223,0.00072213204,0.0005199819,0.014820789],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99911183,0.00023775166,0.000077981895,0.00013289732,0.00030762365,0.00013188903],"domain_scores_gemma":[0.9975165,0.0015795423,0.00016822616,0.00037572312,0.00025910916,0.00010086666],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013682813,0.0005556894,0.00052791473,0.00077744114,0.0007968776,0.002285482,0.001449745,0.00068131427,0.007304102],"category_scores_gemma":[0.0033251261,0.00051319523,0.0014944394,0.0006392191,0.0024561465,0.003212147,0.0015788196,0.0029256428,0.0008628527],"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.00003324185,0.000042141382,0.00015316877,0.000090912086,0.00001198583,0.00012833015,0.00024422907,0.022618862,0.0013967267,0.964067,0.00069975137,0.010513662],"study_design_scores_gemma":[0.00003399875,0.000023859953,0.0001278637,0.00006127115,0.000022188466,0.00008038969,0.0000671263,0.1508971,0.0032854548,0.8364112,0.008972106,0.000017441389],"about_ca_topic_score_codex":0.0017969598,"about_ca_topic_score_gemma":0.002310371,"teacher_disagreement_score":0.007304102,"about_ca_system_score_codex":0.0016249786,"about_ca_system_score_gemma":0.0015995274,"threshold_uncertainty_score":0.024434686},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01370769,0.006226832,0.35522684,0.0025516292,0.0010289364,0.00004947731,0.0005518854,0.0016738287,0.61898285],"genre_scores_gemma":[0.7306577,0.007021909,0.08123491,0.0026114848,0.0022590442,0.00042112733,0.0013389527,0.0033504574,0.17110443],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99852365,0.00018677766,0.00006714339,0.0003222763,0.00066607725,0.00023407448],"domain_scores_gemma":[0.99790037,0.0011349171,0.00012545308,0.0004649059,0.00030005132,0.000074274205],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011145911,0.0007304341,0.000779723,0.0018174717,0.0010961592,0.003002263,0.0013148335,0.0011106229,0.029215012],"category_scores_gemma":[0.005958199,0.0004125682,0.001272041,0.0014486712,0.003694445,0.005203828,0.0019944876,0.0045114285,0.0062021385],"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.000025017556,0.000010804409,0.000051395287,0.00006896918,0.0000044312496,0.000031007374,0.000080523096,0.0014100869,0.00047192918,0.96563804,0.0072510093,0.024956774],"study_design_scores_gemma":[0.0000074608797,0.000015073606,0.00010077185,0.000055740686,0.000008763517,0.000043872198,0.000014217811,0.0044449246,0.0012309938,0.9688761,0.025191782,0.0000101627365],"about_ca_topic_score_codex":0.0014100999,"about_ca_topic_score_gemma":0.0007806687,"teacher_disagreement_score":0.029215012,"about_ca_system_score_codex":0.0020780268,"about_ca_system_score_gemma":0.0008963964,"threshold_uncertainty_score":0.097733915},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005125917,0.00033135878,0.956992,0.00061280216,0.00027496266,0.0004635329,0.0017560351,0.018808087,0.015635371],"genre_scores_gemma":[0.248539,0.00095121533,0.7191345,0.0015170674,0.00031498418,0.001260019,0.008169321,0.0037956228,0.016318245],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98964953,0.002634374,0.0007952643,0.0017887614,0.0038136467,0.0013183476],"domain_scores_gemma":[0.97441,0.013465033,0.0013673882,0.006473721,0.0037691675,0.0005147485],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0064651524,0.0025084205,0.0017066752,0.0027618574,0.0015976873,0.004124068,0.005471433,0.0017350676,0.02685042],"category_scores_gemma":[0.024831628,0.0013025693,0.0053604427,0.001979272,0.0031066933,0.0064260927,0.005366823,0.0046224287,0.006062884],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007798038,0.00045609,0.003496638,0.0019199029,0.00036417478,0.001016986,0.0007237336,0.11228304,0.012453061,0.68111545,0.046724908,0.1386663],"study_design_scores_gemma":[0.00035890075,0.00023516577,0.0004887049,0.00036567418,0.00034172166,0.0006603119,0.00010296938,0.41195142,0.028853308,0.47780526,0.07869014,0.00014635765],"about_ca_topic_score_codex":0.008527801,"about_ca_topic_score_gemma":0.009780019,"teacher_disagreement_score":0.02685042,"about_ca_system_score_codex":0.0028631398,"about_ca_system_score_gemma":0.005993491,"threshold_uncertainty_score":0.08982366},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0045395405,0.0009710131,0.9175899,0.0013270815,0.00070395216,0.00016835616,0.0002674073,0.0019915176,0.07244113],"genre_scores_gemma":[0.20348302,0.0019133474,0.71938103,0.0014972546,0.000756509,0.0007640969,0.0017276885,0.003273289,0.067203805],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9956275,0.0011490006,0.00035243528,0.0010293752,0.0014926017,0.0003490286],"domain_scores_gemma":[0.99310815,0.0037051686,0.00012391778,0.0017952044,0.001190383,0.00007710516],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032706857,0.001194354,0.0016093634,0.0015695406,0.0019141784,0.005508715,0.0023119221,0.0027193504,0.020321017],"category_scores_gemma":[0.012905776,0.0011888931,0.0022984233,0.0015406001,0.005371401,0.0078318985,0.0028933135,0.0057159606,0.013288173],"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.00014699182,0.00006139961,0.00014080027,0.00030254925,0.000039367245,0.00011109767,0.00030841606,0.003247394,0.0037040734,0.85256404,0.011765426,0.1276085],"study_design_scores_gemma":[0.00006273072,0.000028512753,0.00008847083,0.00011162609,0.00003663366,0.00017499641,0.00006969425,0.012930121,0.006319922,0.9540078,0.026142783,0.000026580536],"about_ca_topic_score_codex":0.0012563786,"about_ca_topic_score_gemma":0.0008187262,"teacher_disagreement_score":0.020321017,"about_ca_system_score_codex":0.0014191536,"about_ca_system_score_gemma":0.0029395055,"threshold_uncertainty_score":0.06798053},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008794121,0.0004444888,0.99401265,0.00024699158,0.00008379625,0.00010624931,0.000102796286,0.0009137714,0.003209766],"genre_scores_gemma":[0.029428324,0.00048252568,0.96443975,0.0002911847,0.000111109046,0.0005103228,0.00059348164,0.00058372505,0.0035595659],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973853,0.00065043196,0.00014691165,0.00046313764,0.0011372712,0.00021688335],"domain_scores_gemma":[0.9964133,0.0024559621,0.00016247772,0.0004290932,0.00041227887,0.00012691315],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023594531,0.001414686,0.0014446946,0.002543191,0.0012299423,0.0024270918,0.0033156814,0.0016376551,0.0116171],"category_scores_gemma":[0.008544403,0.0009855852,0.0017145306,0.0026459517,0.0015617239,0.004513125,0.0028429395,0.0047221417,0.0030476856],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027401157,0.0002380269,0.00073254644,0.0009553989,0.0002174004,0.00026972688,0.00035196316,0.10683977,0.009305414,0.22343251,0.03591253,0.6214707],"study_design_scores_gemma":[0.00019755491,0.00012801046,0.00027694277,0.00017427378,0.00016062954,0.000394352,0.00007792749,0.72936225,0.008364447,0.1955619,0.06522321,0.00007845379],"about_ca_topic_score_codex":0.0039039184,"about_ca_topic_score_gemma":0.004611555,"teacher_disagreement_score":0.0116171,"about_ca_system_score_codex":0.0017278222,"about_ca_system_score_gemma":0.0027819301,"threshold_uncertainty_score":0.038863063},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001940092,0.00015630976,0.97260654,0.00012690549,0.000062442945,0.00024289261,0.00072772295,0.021264898,0.0028721348],"genre_scores_gemma":[0.032044828,0.00053326855,0.9467506,0.00015052521,0.000060065417,0.0006187407,0.0050543677,0.007468938,0.0073186033],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99319285,0.0019635055,0.0009480604,0.00096464745,0.0025229012,0.00040803812],"domain_scores_gemma":[0.98012483,0.00981869,0.0009007602,0.006163253,0.0026835562,0.0003089797],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0068903393,0.0015614354,0.0010469401,0.0024064118,0.0006516035,0.0029689993,0.0036281885,0.001558438,0.032896563],"category_scores_gemma":[0.023996038,0.0019440554,0.0028897375,0.0020364162,0.00078108016,0.0049152705,0.0025836478,0.002423232,0.015127708],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004095612,0.000757774,0.004894766,0.0023543583,0.00027421364,0.0011033847,0.0011553782,0.029618198,0.07158168,0.04519949,0.04405754,0.79859364],"study_design_scores_gemma":[0.00029575423,0.0006712844,0.0033450364,0.00097641593,0.00028942595,0.003994473,0.00028533177,0.19886547,0.19582847,0.036507078,0.55863154,0.0003096432],"about_ca_topic_score_codex":0.0014869926,"about_ca_topic_score_gemma":0.0014097502,"teacher_disagreement_score":0.032896563,"about_ca_system_score_codex":0.000888534,"about_ca_system_score_gemma":0.0018398227,"threshold_uncertainty_score":0.1100499},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.053094555,0.000137323,0.92964655,0.00038626243,0.00007944334,0.00034101438,0.00046154228,0.008142666,0.007710579],"genre_scores_gemma":[0.3535027,0.00012427289,0.63160634,0.00016501962,0.000036583995,0.00019409752,0.0011255835,0.0024390437,0.010806302],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99452704,0.0015199479,0.00032611517,0.00076249026,0.002381628,0.0004827826],"domain_scores_gemma":[0.9911897,0.005116532,0.0002595764,0.002284378,0.0009678127,0.0001819075],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0048978743,0.00085349614,0.0011931652,0.0010461102,0.0007762401,0.0027848447,0.0027501907,0.001356234,0.016129421],"category_scores_gemma":[0.016672598,0.00094483956,0.0023520445,0.0007090107,0.0017494522,0.0062958626,0.0047943774,0.0016318603,0.0022544735],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017853186,0.0005230762,0.0036443651,0.0011538651,0.00036288626,0.0012939682,0.001762958,0.12442533,0.07259626,0.3787912,0.012670561,0.4009902],"study_design_scores_gemma":[0.00012860638,0.0003045392,0.00066541246,0.00016621331,0.00023755306,0.00031777186,0.0003875714,0.6877427,0.07978642,0.21286152,0.017300816,0.00010086232],"about_ca_topic_score_codex":0.00222186,"about_ca_topic_score_gemma":0.004879331,"teacher_disagreement_score":0.016129421,"about_ca_system_score_codex":0.0014496497,"about_ca_system_score_gemma":0.0017909971,"threshold_uncertainty_score":0.053958356},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005110545,0.00016801941,0.97789395,0.00008118831,0.000074562144,0.000097627984,0.00029582318,0.010273431,0.0060048797],"genre_scores_gemma":[0.15333135,0.00038971726,0.828077,0.00023045565,0.00005732147,0.00037180237,0.0009896657,0.0032597035,0.013292964],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99844724,0.00026602944,0.00015664333,0.0003689123,0.0005947527,0.00016650095],"domain_scores_gemma":[0.99714124,0.0016894016,0.00017567088,0.0006144236,0.00027330045,0.00010594467],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013374182,0.0015414174,0.0010121535,0.001941852,0.0013531296,0.0023992006,0.0018306545,0.0015156412,0.009297012],"category_scores_gemma":[0.004817412,0.0013276656,0.0012724961,0.0013571635,0.0018219105,0.0042232233,0.0036420552,0.0019186492,0.005715278],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008281764,0.00023986574,0.0019451996,0.0012514472,0.00010883961,0.0015137654,0.0010680489,0.023117315,0.10450403,0.3627881,0.023977023,0.4786581],"study_design_scores_gemma":[0.00022859045,0.0004031611,0.0010320387,0.000489919,0.00015036888,0.0021435386,0.00030863698,0.1884933,0.21327297,0.39244226,0.20083635,0.00019890667],"about_ca_topic_score_codex":0.0017139325,"about_ca_topic_score_gemma":0.0010525294,"teacher_disagreement_score":0.009297012,"about_ca_system_score_codex":0.000531516,"about_ca_system_score_gemma":0.0012041997,"threshold_uncertainty_score":0.031101584},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008684778,0.00003398527,0.9902158,0.000022317608,0.000007284445,0.000012616798,0.000019378394,0.00038033162,0.00062355906],"genre_scores_gemma":[0.5669195,0.000120814264,0.43105686,0.00005539177,0.00001917645,0.00014712891,0.00017150384,0.0003062667,0.001203394],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988827,0.00029892195,0.000069151254,0.00020098701,0.00043802246,0.00011007551],"domain_scores_gemma":[0.9965044,0.002135497,0.0003906781,0.0006590217,0.00021830345,0.00009200421],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018959768,0.00137318,0.0011429916,0.0011089626,0.0005458975,0.0012786551,0.0014126288,0.0008650717,0.001990707],"category_scores_gemma":[0.0076135723,0.0006997375,0.00169764,0.00045292248,0.0018590346,0.0019346939,0.0028606483,0.0025281613,0.00043349966],"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.000059977792,0.000016822383,0.00039176358,0.000059784936,0.000025928275,0.00006704081,0.00010844802,0.94686633,0.0038664646,0.035333708,0.00014089495,0.0130628655],"study_design_scores_gemma":[0.0000071679647,0.000024047751,0.00004168943,0.000014357335,0.000009090958,0.000013050207,0.0000128229585,0.96835315,0.0031535919,0.027849836,0.0005134357,0.000007662059],"about_ca_topic_score_codex":0.0019085966,"about_ca_topic_score_gemma":0.0018565755,"teacher_disagreement_score":0.001990707,"about_ca_system_score_codex":0.0012678227,"about_ca_system_score_gemma":0.0012103152,"threshold_uncertainty_score":0.010026991},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0061702873,0.0010390339,0.9728291,0.00071251474,0.00042540644,0.000055704837,0.00037722415,0.002245131,0.01614559],"genre_scores_gemma":[0.30123425,0.0024908998,0.64464337,0.001134213,0.0013711437,0.0003818214,0.0015448069,0.0020726353,0.045126922],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998334,0.00038255996,0.00013031882,0.0004134728,0.000603582,0.00013611474],"domain_scores_gemma":[0.9983991,0.0007156862,0.00012167739,0.00041807204,0.00030025194,0.00004524622],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012477855,0.0010128635,0.0006431466,0.0010902928,0.00046923428,0.0020105154,0.0010840797,0.00057016214,0.02344269],"category_scores_gemma":[0.0040640538,0.0004652601,0.0014896953,0.0015662734,0.002140799,0.0037600694,0.00220475,0.0028738163,0.0060749245],"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.00012829232,0.000039661023,0.00036748606,0.0005274593,0.00003755768,0.00023327445,0.00060626474,0.01713065,0.0059190667,0.8070521,0.014265392,0.15369289],"study_design_scores_gemma":[0.000036802747,0.00009131616,0.00033142348,0.00013828823,0.00004140702,0.00023987607,0.000071142735,0.06559946,0.007928274,0.8077799,0.11769769,0.000044461478],"about_ca_topic_score_codex":0.001380446,"about_ca_topic_score_gemma":0.0010450025,"teacher_disagreement_score":0.02344269,"about_ca_system_score_codex":0.0010448169,"about_ca_system_score_gemma":0.0008094123,"threshold_uncertainty_score":0.07842362},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036808208,0.00020046555,0.94272,0.00052350474,0.000303343,0.00032042796,0.00041423854,0.007259367,0.011450497],"genre_scores_gemma":[0.23747265,0.00015147166,0.74896157,0.00037400814,0.0000957076,0.00022047236,0.0017752261,0.0023099664,0.008638928],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976413,0.00038971903,0.00016504558,0.00039637578,0.001127912,0.00027960865],"domain_scores_gemma":[0.9927192,0.003933344,0.00025320682,0.0017543081,0.0012148788,0.00012499004],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016428839,0.0015035878,0.0011826415,0.0022121652,0.0013295239,0.002343498,0.0027787585,0.0010861782,0.016941497],"category_scores_gemma":[0.011798274,0.0010064845,0.002582632,0.0017740839,0.0013698407,0.00472528,0.003468867,0.0038322192,0.0022017611],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006958877,0.00039063097,0.0020898245,0.0009292445,0.00016752607,0.0003012741,0.00055697566,0.12651838,0.029045224,0.2284362,0.020503728,0.5903651],"study_design_scores_gemma":[0.00012569425,0.0001511071,0.00049939135,0.00016910028,0.00016075099,0.00019800168,0.00023948823,0.4845383,0.055940066,0.439269,0.018625539,0.00008357263],"about_ca_topic_score_codex":0.003924786,"about_ca_topic_score_gemma":0.010342156,"teacher_disagreement_score":0.016941497,"about_ca_system_score_codex":0.0023971503,"about_ca_system_score_gemma":0.002830961,"threshold_uncertainty_score":0.056674898},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016765149,0.014186084,0.46748912,0.0012835544,0.002335934,0.0001734867,0.00061286305,0.0051480825,0.5070944],"genre_scores_gemma":[0.071537614,0.027117318,0.20364343,0.0011145486,0.0012608953,0.0006702954,0.0022542516,0.0031397857,0.68926185],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99960107,0.0000543934,0.000028162465,0.000070260045,0.00021226837,0.000033924734],"domain_scores_gemma":[0.9997236,0.00011201551,0.000016270229,0.000063330546,0.00006738339,0.000017326625],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035967559,0.0015899363,0.00068725355,0.0011484463,0.00068384863,0.002808944,0.0012929868,0.00094211946,0.028933495],"category_scores_gemma":[0.0012816655,0.0009580006,0.0004906509,0.002037591,0.001216173,0.0043691164,0.0010161463,0.0026094923,0.020963943],"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.000044457236,0.0000447946,0.00002951971,0.00053336757,0.000011630503,0.00007050198,0.00020523618,0.00352462,0.0024917452,0.59834266,0.09685473,0.29784676],"study_design_scores_gemma":[0.000017979153,0.000025780195,0.0000380858,0.00016601564,0.000014152324,0.0001938877,0.000026208685,0.0049466616,0.0031175406,0.1929215,0.79851496,0.000017261553],"about_ca_topic_score_codex":0.0010716333,"about_ca_topic_score_gemma":0.0010938758,"teacher_disagreement_score":0.028933495,"about_ca_system_score_codex":0.001037774,"about_ca_system_score_gemma":0.0010152285,"threshold_uncertainty_score":0.09679216},"labels":[],"label_agreement":null}]}