{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":1244,"total_is_capped":false,"direct_labels_cover":3,"predictions_cover":1244,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"query_hash":"79eed8a55750","filters":{"topic":"Formal Methods in Verification"}},"results":[{"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02170910406121952,"gpt":0.2778863502023117,"spread":0.2561772461410922,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.002118374,0.0004294483,0.0003325042,0.0004658281,0.0005627992,0.0009085581,0.005991729,0.0002637662,0.00001725994],"category_scores_gemma":[0.0002115775,0.0003083553,0.0001361201,0.0007063766,0.001006748,0.000735786,0.001337664,0.0008999537,0.000134927],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003527882,"about_ca_system_score_gemma":0.0004357259,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007494677,"about_ca_topic_score_gemma":0.00005478779,"domain_scores_codex":[0.9963566,0.00006604697,0.0005512753,0.001226811,0.001112367,0.0006869154],"domain_scores_gemma":[0.9963131,0.0005935624,0.0003428851,0.002359983,0.0002486473,0.0001418394],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000001939082,0.000006467779,0.000009969367,0.000004242532,0.000005077837,0.000007422012,0.0001595332,0.005541658,0.00001952085,0.1172775,0.00003171916,0.8769349],"study_design_scores_gemma":[0.0001306784,0.00009873121,0.0002458997,0.0001207005,0.000006756848,0.00006094652,1.037345e-7,0.7784787,0.001203026,0.1566699,0.06240315,0.0005814215],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00001044008,0.0006916474,0.9840439,0.00134867,0.002213926,0.0002744714,0.00000161361,0.0001568073,0.0112585],"genre_scores_gemma":[0.006581463,0.0001237531,0.9901561,0.0009903105,0.0007270952,0.00001069536,0.0000015024,0.00002630843,0.001382756],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8763535,"threshold_uncertainty_score":0.9999369,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.1885125475786514,"gpt":0.4559106252343577,"spread":0.2673980776557062,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01002582,0.0001077385,0.0002007795,0.0007342934,0.0003790341,0.0003490532,0.001350514,0.00009502768,0.00003873184],"category_scores_gemma":[0.001364051,0.00009495563,0.0001697311,0.001215188,0.00009486289,0.0008794061,0.0001009776,0.0004656592,0.00007607314],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001869153,"about_ca_system_score_gemma":0.000454759,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001886661,"about_ca_topic_score_gemma":0.00001040818,"domain_scores_codex":[0.9969518,0.0003988706,0.0008784746,0.0002300099,0.0009783874,0.000562512],"domain_scores_gemma":[0.9962772,0.0008265962,0.000317549,0.0004579487,0.001995092,0.0001256417],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00006903701,0.0005824431,0.00003091204,0.00003993775,0.00001138545,0.000008223577,0.0002933925,0.001553824,0.01067532,0.9419853,0.001503923,0.04324627],"study_design_scores_gemma":[0.00006332541,0.0004450305,0.00007544181,0.00003362273,0.000004188712,0.00001913693,0.000220257,0.564523,0.22436,0.2039846,0.00616063,0.0001107465],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.003346506,0.00009638862,0.9930723,0.002006206,0.0003674389,0.0003481602,0.000005798602,0.00003976374,0.0007173977],"genre_scores_gemma":[0.2395005,0.00000727614,0.759962,0.00003922695,0.0003753645,0.0000215573,0.000001557891,0.00001088665,0.00008159452],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7380007,"threshold_uncertainty_score":0.3872178,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02381291476889642,"gpt":0.3019455865412595,"spread":0.2781326717723631,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004033705,0.0001605479,0.0001822042,0.0002687996,0.0004624582,0.0004264944,0.002446124,0.00005429101,0.00001749044],"category_scores_gemma":[0.002997492,0.0001325775,0.00004841767,0.003551433,0.001318659,0.0008635943,0.0003330304,0.0001172999,0.00003275146],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006370371,"about_ca_system_score_gemma":0.0003144554,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":3.305225e-7,"about_ca_topic_score_gemma":8.989627e-8,"domain_scores_codex":[0.9976954,0.0001466876,0.000279811,0.0006942222,0.0006094947,0.0005743473],"domain_scores_gemma":[0.9975671,0.0006911971,0.00008922842,0.0008407607,0.0005995613,0.0002121928],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000004359048,0.00004504735,0.00001851154,0.00002504788,0.000001877729,7.14584e-7,0.0001404547,0.00002751038,0.0002339752,0.9713329,0.0000499849,0.02811963],"study_design_scores_gemma":[0.0003401676,0.0002914986,0.00007909861,0.00001682102,0.000005758255,0.00003099864,0.000005680049,0.5219951,0.05965174,0.4143169,0.002966454,0.0002998085],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001970163,0.00005940374,0.9900077,0.0002286696,0.0008492059,0.0003478723,0.000001185143,0.0002044831,0.006331311],"genre_scores_gemma":[0.357307,0.000004704293,0.6423322,0.0002755272,0.00003433552,0.0000245982,2.40925e-7,0.000005557657,0.00001575917],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.557016,"threshold_uncertainty_score":0.5406353,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.03763854844124866,"gpt":0.2940433828801528,"spread":0.2564048344389042,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002395702,0.00007302651,0.00006906344,0.0001394484,0.0001536827,0.0002310217,0.0001242073,0.0000439685,0.000005918521],"category_scores_gemma":[0.0001842657,0.00007182327,0.00001556719,0.0003228054,0.00001495916,0.003099735,0.00002827475,0.00003424335,0.00003602219],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002039006,"about_ca_system_score_gemma":0.00001345739,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000226559,"about_ca_topic_score_gemma":5.194583e-7,"domain_scores_codex":[0.9993668,0.00002511612,0.0002712274,0.00009555624,0.0001412353,0.0001001056],"domain_scores_gemma":[0.9993184,0.0001010114,0.0001632115,0.0001005072,0.0002813963,0.00003553987],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000009714227,0.00002088111,0.0000926215,0.00015248,0.000005608,4.54798e-8,0.002568832,0.004831388,0.00002197416,0.04762426,0.0008134797,0.9438587],"study_design_scores_gemma":[0.0004476286,0.00005778566,0.0009022747,0.00000952351,0.000002684489,0.000004247879,0.00003039938,0.9840585,0.0002718402,0.003631752,0.01048965,0.00009371329],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.007189399,0.00005280951,0.9899232,0.0004238538,0.0001662245,0.0003382115,0.00000231456,0.0001720774,0.001731901],"genre_scores_gemma":[0.5102012,0.00002878043,0.4892802,0.0003615386,0.00002140135,0.00004380115,0.00002611825,0.000002719096,0.00003431451],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9792271,"threshold_uncertainty_score":0.2928868,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01884987414813196,"gpt":0.27851848124175,"spread":0.2596686070936181,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002381606,0.0001610219,0.000235124,0.0003708929,0.0001525104,0.0002832629,0.00179956,0.00005001948,0.000001222583],"category_scores_gemma":[0.00004237879,0.0001590007,0.00005153759,0.001523609,0.000571706,0.001138471,0.0004438938,0.0001519073,0.000004145785],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001258055,"about_ca_system_score_gemma":0.0001641105,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003035242,"about_ca_topic_score_gemma":0.000006924419,"domain_scores_codex":[0.9974989,0.00008863413,0.0005915411,0.0005949641,0.0006822462,0.0005436781],"domain_scores_gemma":[0.9988779,0.00005538526,0.0001741891,0.0006332677,0.0001705079,0.00008872696],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000005901423,0.0003864008,0.001128077,0.00005527677,0.000004578431,0.00000660684,0.0007394445,0.07051924,0.01799889,0.3753293,0.00005443497,0.5337719],"study_design_scores_gemma":[0.0002549192,0.00007806559,0.0007444192,0.00006216513,0.000001023279,0.00001181095,0.00002585842,0.9869015,0.009056765,0.002468707,0.0002122723,0.0001825062],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2858575,0.00004402786,0.7131042,0.000099584,0.0003620699,0.0002185343,6.765274e-7,0.00014632,0.0001671026],"genre_scores_gemma":[0.5132179,9.278012e-7,0.4867338,0.00001440269,0.00001839849,0.000007925004,0.000001381267,0.00000353629,0.000001697116],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9163823,"threshold_uncertainty_score":0.6483861,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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)","retraction":null,"screen_n_in":null,"score":{"opus":0.01268499167098903,"gpt":0.2563641487441835,"spread":0.2436791570731945,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009881629,0.00008346459,0.0002198638,0.00004753195,0.0000732315,0.00002815439,0.000865311,0.00004739713,9.531767e-7],"category_scores_gemma":[0.0004727616,0.00005821463,0.0001056634,0.0002156832,0.000038227,0.0003130141,0.00003346766,0.00006417796,0.000001934839],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003021102,"about_ca_system_score_gemma":0.00001447702,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001992332,"about_ca_topic_score_gemma":8.541112e-8,"domain_scores_codex":[0.9992299,0.00001574745,0.0002574257,0.0001675096,0.0001945855,0.0001348142],"domain_scores_gemma":[0.9990373,0.0002896539,0.0002789532,0.0001525249,0.0002184186,0.0000231947],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0005906259,0.0002203708,0.001084928,0.002250885,0.0002878192,1.107494e-7,0.004399281,0.004233568,0.558714,0.1509271,0.0009501557,0.2763412],"study_design_scores_gemma":[0.0003251666,0.00009722418,0.0005420851,0.0002386569,0.00003008488,0.000004140137,0.00006797057,0.3126854,0.6840001,0.001503974,0.0004082038,0.00009694461],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.836595,0.0001189936,0.1528813,0.000271754,0.0009447799,0.002116658,0.000007399591,0.0001059937,0.006958098],"genre_scores_gemma":[0.8971245,0.000005314412,0.1025565,0.0000155975,0.00005873867,0.0001393576,1.773654e-8,0.000007383096,0.00009262168],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3084518,"threshold_uncertainty_score":0.2373924,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Markov chain; Computer science; Machine learning","retraction":null,"screen_n_in":null,"score":{"opus":0.03202670239291956,"gpt":0.2804898023067568,"spread":0.2484630999138372,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006001206,0.0005896144,0.0006904303,0.0001974383,0.0002563689,0.0003826283,0.002797239,0.0006512194,0.00002223994],"category_scores_gemma":[0.0003326686,0.0005830807,0.0001566353,0.00007450342,0.0001429138,0.0003598972,0.0006112544,0.0005262003,0.00004171688],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002379748,"about_ca_system_score_gemma":0.00176269,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001509868,"about_ca_topic_score_gemma":0.000007613568,"domain_scores_codex":[0.9968214,0.0002385243,0.0007054061,0.0009596075,0.0007200139,0.0005550541],"domain_scores_gemma":[0.9970579,0.0001998913,0.0005148534,0.001587389,0.0004456813,0.0001942624],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0002001049,0.00005757955,8.638487e-8,0.0005413222,0.00009186444,0.00007790905,0.0008766385,0.000005306413,0.0004474083,0.7969109,0.1570875,0.0437034],"study_design_scores_gemma":[0.0007529982,0.0002520926,0.000001315817,0.0002137082,0.00004672477,0.00004612519,0.000001936456,0.0009048044,0.008014912,0.02537311,0.963615,0.0007772888],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"other","genre_gemma":"other","genre_scores_codex":[0.00001082922,0.0008070538,0.02187117,0.00003038065,0.001839479,0.001360595,0.00008942215,0.0006336717,0.9733574],"genre_scores_gemma":[0.00007384783,0.0000762039,0.1897082,0.0002185855,0.00103249,0.0001932123,0.00001984815,0.0000622532,0.8086154],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.8065275,"threshold_uncertainty_score":0.999662,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02187225969365655,"gpt":0.2734728750933508,"spread":0.2516006153996942,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001976541,0.0005945168,0.0006142444,0.001460244,0.0001692626,0.0004788139,0.005227826,0.0004935372,0.00004496359],"category_scores_gemma":[0.0001706757,0.0005707547,0.0001161526,0.001454975,0.0006410733,0.001115479,0.001592247,0.001126004,0.0001395315],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005764439,"about_ca_system_score_gemma":0.0005732077,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003096274,"about_ca_topic_score_gemma":0.00003375824,"domain_scores_codex":[0.9951782,0.00009984905,0.0007986446,0.001839983,0.001193987,0.0008892932],"domain_scores_gemma":[0.9966736,0.0003258612,0.000370009,0.002245861,0.0001963815,0.0001882331],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001020986,0.00005732816,0.00005847734,0.0000294507,0.000006057167,0.0002167563,0.0007320818,0.01618043,0.0001039376,0.04747519,0.00003138443,0.9350987],"study_design_scores_gemma":[0.0003497707,0.0001424148,0.0003822515,0.0002996632,0.000003654377,0.0001211834,1.08937e-7,0.9350987,0.001103642,0.05814045,0.00369272,0.0006654087],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0002141577,0.0002284741,0.9847003,0.0004152068,0.002219028,0.0004962049,0.000003823342,0.0003146473,0.01140812],"genre_scores_gemma":[0.009403779,0.00007311949,0.989088,0.0006357495,0.0002691974,0.00001846512,0.000007266407,0.00003834569,0.0004660875],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9344333,"threshold_uncertainty_score":0.9996744,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.153068929282084,"gpt":0.3447623535611903,"spread":0.1916934242791064,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001316452,0.0001790579,0.0002298088,0.000228364,0.0001400959,0.00003445274,0.0003947239,0.000154571,0.000004989477],"category_scores_gemma":[0.001950203,0.0001850856,0.00006556287,0.0003027846,0.00003417202,0.0002263568,0.00001207385,0.0003251522,0.000006762788],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003837651,"about_ca_system_score_gemma":0.00003436451,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005670566,"about_ca_topic_score_gemma":6.726991e-7,"domain_scores_codex":[0.9986447,0.0003329915,0.000219102,0.0003929144,0.0001105311,0.0002997348],"domain_scores_gemma":[0.9985283,0.0005466364,0.00004462479,0.0007282803,0.00004583099,0.0001063085],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001356667,0.0001161428,0.00006414621,0.00008457895,0.00008624662,0.000006141932,0.002275815,0.7082453,0.008840775,0.1436457,0.000007039942,0.1366145],"study_design_scores_gemma":[0.0004840729,0.0000849484,0.0005041356,0.00002652259,0.00002745806,0.0001246193,0.00002826509,0.9607433,0.0340954,0.002702753,0.0008280523,0.0003504782],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.004821017,0.0001561692,0.9936835,0.00002947706,0.0006603024,0.0001100364,0.000001991946,0.0005229053,0.00001459115],"genre_scores_gemma":[0.02937076,0.00007314811,0.9702734,0.0001152731,0.0000106833,0.00005001451,5.15514e-7,0.00002132489,0.00008491892],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2524979,"threshold_uncertainty_score":0.7547572,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.06622918099250913,"gpt":0.3433915543306719,"spread":0.2771623733381628,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008283228,0.0001092747,0.000165473,0.0003012512,0.0001173514,0.0001652101,0.001224951,0.00004885476,0.00004708087],"category_scores_gemma":[0.001208546,0.0001034982,0.00006770328,0.001752858,0.00002183022,0.0005219423,0.0001629124,0.00007826877,0.0001376313],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004138868,"about_ca_system_score_gemma":0.00003346005,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004362945,"about_ca_topic_score_gemma":0.00001851834,"domain_scores_codex":[0.9987395,0.0002006686,0.0002075138,0.0003447376,0.0002605015,0.0002471062],"domain_scores_gemma":[0.9983224,0.0001944949,0.0001057287,0.001199745,0.00006801157,0.0001096736],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003279378,0.0002756882,0.08883579,0.00008034414,0.0009629363,0.00005314311,0.008501492,0.05759178,0.01358148,0.7786648,0.00093464,0.05048516],"study_design_scores_gemma":[0.0006271422,0.0003073334,0.08120882,0.00005066688,0.0008079,0.00002754931,0.0005558912,0.778128,0.08902867,0.01753822,0.03009633,0.001623427],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.199494,0.0000357055,0.7971858,0.0001717979,0.0003116712,0.00008122967,0.000001634325,0.00009313916,0.002625059],"genre_scores_gemma":[0.4034988,7.982972e-7,0.5961462,0.000292726,0.00001784247,0.000002519672,8.894544e-7,0.000003896265,0.00003632284],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7611265,"threshold_uncertainty_score":0.4220535,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.08962250952427965,"gpt":0.3285199342965478,"spread":0.2388974247722682,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001944597,0.00004475884,0.00009103249,0.00005368803,0.00003208024,0.00002818542,0.004596884,0.00002985252,0.00001759851],"category_scores_gemma":[0.005101413,0.0000215072,0.00006532824,0.0002737001,0.0001209845,0.0002321239,0.0002467249,0.0004226002,0.000005186038],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002596719,"about_ca_system_score_gemma":0.00002130063,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003563799,"about_ca_topic_score_gemma":9.309171e-7,"domain_scores_codex":[0.9988618,0.0003751857,0.000272679,0.00005667276,0.0003511818,0.0000824231],"domain_scores_gemma":[0.9980668,0.0004692958,0.0003394675,0.001028378,0.00007883684,0.00001726326],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00008281986,0.0009917468,0.008569544,0.00005538754,0.0000576274,0.0000432181,0.0224118,0.001562212,0.009045254,0.5677987,0.03303506,0.3563466],"study_design_scores_gemma":[0.001678417,0.001351753,0.2693858,0.0008942097,0.00003184122,0.001359199,0.0009726658,0.1067434,0.05432896,0.5590951,0.003805481,0.000353253],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8698221,0.0001964267,0.09969229,0.02065505,0.001766223,0.0002236525,0.000001575851,0.000009255079,0.00763342],"genre_scores_gemma":[0.8750719,0.00001566047,0.1245793,0.0002756118,0.00002990922,5.255905e-7,5.192045e-9,0.000001229455,0.0000257694],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3559933,"threshold_uncertainty_score":0.8542232,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02385397396974076,"gpt":0.2756599481661304,"spread":0.2518059741963897,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002879259,0.0005003348,0.000483086,0.000749945,0.0004809752,0.0005222857,0.003055125,0.0002994893,0.00001660137],"category_scores_gemma":[0.0008630684,0.0004262063,0.0001786418,0.0003923381,0.00054319,0.000789654,0.0005853964,0.0007142372,0.00004994408],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003944221,"about_ca_system_score_gemma":0.0005621945,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003286552,"about_ca_topic_score_gemma":0.0000060855,"domain_scores_codex":[0.9963744,0.0001115876,0.0005432792,0.001550584,0.0006619251,0.0007582054],"domain_scores_gemma":[0.9960989,0.001774662,0.0004546731,0.001224847,0.0002860925,0.0001608345],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001572494,0.00001027018,0.00002084192,0.00007850462,0.00000820318,0.00001134513,0.0003981867,0.04977031,0.0005361092,0.04488117,0.000009485648,0.9042599],"study_design_scores_gemma":[0.0004002025,0.000239532,0.00007520065,0.000393886,0.000009086832,0.00001192717,8.637917e-8,0.8792271,0.002935028,0.1131229,0.002981469,0.0006035533],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00002688859,0.0001150717,0.9937167,0.0004780106,0.002751699,0.0005612113,0.00000548527,0.0002612927,0.002083702],"genre_scores_gemma":[0.04797611,0.00001016328,0.9500322,0.001010619,0.0004340429,0.00002497855,0.000004912095,0.00004608005,0.0004609436],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9036563,"threshold_uncertainty_score":0.999819,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.1124068297188023,"gpt":0.3928930492158512,"spread":0.2804862194970489,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000735806,0.0001063199,0.0001305228,0.00006278857,0.0001195703,0.0001009927,0.0005477128,0.00008873472,0.00003897421],"category_scores_gemma":[0.0008251581,0.00009317263,0.00008029651,0.0003022746,0.00002803099,0.0004089926,0.0001445,0.000109544,0.00005735492],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005869585,"about_ca_system_score_gemma":0.00003112676,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000161738,"about_ca_topic_score_gemma":0.000004093443,"domain_scores_codex":[0.9989449,0.00007697372,0.0002297941,0.0003243172,0.0001707113,0.000253285],"domain_scores_gemma":[0.9990434,0.00007921763,0.00009814241,0.0006151167,0.00008557968,0.00007856292],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000007924969,0.00004181903,0.0005599377,0.000007527428,0.000007424175,0.000001238473,0.0002088421,0.00001411568,0.00007056676,0.9738519,0.0001580404,0.02507068],"study_design_scores_gemma":[0.0003901149,0.00006085826,0.009297101,0.00005827056,0.000005763049,0.00002024755,0.00002751356,0.9567671,0.001730074,0.02461546,0.006836105,0.0001914416],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.003776631,0.00006032187,0.9931139,0.0001515101,0.0005052241,0.0003171718,6.311915e-7,0.000217489,0.001857157],"genre_scores_gemma":[0.008770826,0.00001912709,0.9895605,0.0010512,0.00005716122,0.00007457795,8.768789e-7,0.000009471579,0.0004562474],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.956753,"threshold_uncertainty_score":0.379947,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01755740490172809,"gpt":0.2801044758634209,"spread":0.2625470709616928,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007327448,0.00006572113,0.00007690958,0.0001081638,0.00004964247,0.00006256942,0.0001557391,0.00004365216,0.00002853995],"category_scores_gemma":[0.00005488573,0.00006082184,0.0000154572,0.0001461694,0.000009485861,0.0009636391,0.00006949441,0.00007758154,0.00003521792],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004276213,"about_ca_system_score_gemma":0.00001198272,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001226521,"about_ca_topic_score_gemma":0.000003569796,"domain_scores_codex":[0.9992936,0.00003410135,0.0001826271,0.0002084731,0.0001167284,0.0001645227],"domain_scores_gemma":[0.9995766,0.00005334714,0.00007810973,0.000228641,0.00003806865,0.00002522995],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00004970622,0.00001400967,0.003044641,0.00004578396,0.000004732171,1.527048e-7,0.001015369,0.002764466,0.006632528,0.7852069,0.0001112647,0.2011105],"study_design_scores_gemma":[0.001217251,0.0008740746,0.06276667,0.00002303815,0.000005844409,0.000006478745,0.001234811,0.8895011,0.01264856,0.003642057,0.02775849,0.0003216576],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03989252,0.0000320214,0.9404048,0.0001606019,0.0001958405,0.0003731361,1.207658e-7,0.00008197486,0.01885893],"genre_scores_gemma":[0.6900669,0.00001536424,0.3074144,0.0001281405,0.00002739558,0.00003855718,0.000007526254,0.000004617745,0.002297051],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8867366,"threshold_uncertainty_score":0.2480243,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.0189341741581855,"gpt":0.3102065770582431,"spread":0.2912724029000576,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000756337,0.00008995329,0.0001365634,0.0003909602,0.0000345992,0.000179893,0.001176198,0.00004503285,0.000006808143],"category_scores_gemma":[0.0003417688,0.00008429087,0.00007590682,0.000333177,0.00001736057,0.00129497,0.0001287329,0.000228547,0.00001198532],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003257013,"about_ca_system_score_gemma":0.0002446866,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007791365,"about_ca_topic_score_gemma":0.000006085068,"domain_scores_codex":[0.9986999,0.00004603275,0.0004540527,0.0001385216,0.0005106129,0.0001508717],"domain_scores_gemma":[0.9990925,0.00004210324,0.000375515,0.0001711029,0.0002322513,0.00008651624],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00004041953,0.0001396709,0.0008528021,0.000005549096,0.00006244746,0.0001321671,0.001429915,0.005787529,0.00199895,0.7767299,0.0001110068,0.2127097],"study_design_scores_gemma":[0.01252511,0.0006789044,0.08631638,0.00314878,0.00004754145,0.01157541,0.000635827,0.186233,0.1002099,0.5764433,0.02083101,0.001354814],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02728561,0.0001536855,0.9640554,0.001347907,0.001703278,0.00005252413,7.437009e-7,0.00005716946,0.005343702],"genre_scores_gemma":[0.1717883,0.00009951457,0.8278236,0.00005478263,0.0001937604,0.000001654476,6.448531e-7,0.000006754857,0.00003092406],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2113549,"threshold_uncertainty_score":0.3437282,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.03604302314982662,"gpt":0.3023138911467048,"spread":0.2662708679968782,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004903389,0.0000927791,0.00009109498,0.00007000261,0.0001316236,0.0000922222,0.0006743178,0.00005492045,0.000007777353],"category_scores_gemma":[0.00009236399,0.00008595629,0.00004143836,0.0002646169,0.000008277245,0.0007304054,0.0001044971,0.0001075471,0.00004953407],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004260904,"about_ca_system_score_gemma":0.00002240063,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002024669,"about_ca_topic_score_gemma":6.15148e-7,"domain_scores_codex":[0.999056,0.00003060455,0.000171436,0.0002691979,0.000204844,0.0002678547],"domain_scores_gemma":[0.9993073,0.0000220187,0.00005722792,0.0004976683,0.00005560896,0.00006015871],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000004128419,0.0001033599,0.0002329878,0.00001102331,0.000005940307,0.000004558737,0.001603128,0.01208183,0.01052291,0.648937,0.0006005156,0.3258926],"study_design_scores_gemma":[0.0000926022,0.00002367038,0.0005389023,0.000007218066,0.000001384423,0.00000886863,0.000005718482,0.9622668,0.01602212,0.02051542,0.0003928905,0.0001244146],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002201706,0.00002515078,0.9872445,0.000258868,0.0001436584,0.00007361656,2.710637e-7,0.0004714243,0.009580748],"genre_scores_gemma":[0.3337901,0.000002407972,0.6652491,0.000636921,0.00002432589,0.000002248739,3.847703e-7,0.000002931384,0.0002916195],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9501849,"threshold_uncertainty_score":0.3505196,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.05826976372535029,"gpt":0.3475587982911371,"spread":0.2892890345657868,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006187658,0.00005097017,0.00008198614,0.0002096799,0.0000537227,0.00006998274,0.0003482159,0.00002224282,0.00008178167],"category_scores_gemma":[0.0001517616,0.00004585827,0.00005069692,0.001972553,0.000008229325,0.0002685399,0.00005097643,0.00003269811,0.00009821397],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003705944,"about_ca_system_score_gemma":0.00002070607,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001780225,"about_ca_topic_score_gemma":0.000003928943,"domain_scores_codex":[0.9993017,0.0001013576,0.0001197876,0.0001995215,0.0001435188,0.0001340635],"domain_scores_gemma":[0.9993156,0.00002093804,0.00002870653,0.0005180162,0.00005018681,0.00006650394],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[5.97768e-7,0.00001722621,0.001940734,0.000001386879,0.00004347734,8.975338e-7,0.0002300787,0.002639726,0.0014605,0.9868561,0.00009396322,0.006715335],"study_design_scores_gemma":[0.00008956758,0.00003355685,0.006726637,0.000002417307,0.00005960908,0.000005599758,0.00005271453,0.9250308,0.05322231,0.006411714,0.008116455,0.0002486399],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01980492,0.000005172661,0.9612494,0.00007576765,0.0001350673,0.00004344947,1.133203e-7,0.00007359398,0.01861253],"genre_scores_gemma":[0.1599211,3.119886e-7,0.8394257,0.0003994074,0.0000057309,0.00000167251,1.08279e-7,0.000001975024,0.0002440441],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9804444,"threshold_uncertainty_score":0.1870046,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Epistemology; Philosophy","retraction":null,"screen_n_in":null,"score":{"opus":0.04580731866763565,"gpt":0.3125782211352746,"spread":0.266770902467639,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006556797,0.0001529444,0.000204079,0.0001261528,0.0001812566,0.0006849297,0.0002686944,0.00008856968,0.000001584087],"category_scores_gemma":[0.001302108,0.000121644,0.00003826972,0.0001911233,0.000103322,0.0005282338,0.00006117662,0.00009283998,0.00001040315],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002878244,"about_ca_system_score_gemma":0.00001524207,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002707697,"about_ca_topic_score_gemma":0.000003823847,"domain_scores_codex":[0.9986507,0.00009921002,0.0002940173,0.0004299688,0.0002710892,0.000254956],"domain_scores_gemma":[0.9982613,0.001013688,0.0001231845,0.0004077639,0.0000663786,0.0001276404],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"observational","study_design_scores_codex":[0.00002409022,0.0001087623,0.007494792,0.0001188916,0.00007171315,0.00002639124,0.002028891,0.0002688194,0.003261712,0.4771645,0.0003151572,0.5091163],"study_design_scores_gemma":[0.003760937,0.001854989,0.5568769,0.001239975,0.0001346578,0.001761345,0.004725691,0.2362912,0.1060162,0.04667335,0.03574336,0.00492147],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09340715,0.0009792208,0.8700375,0.0001011343,0.0005817263,0.0005393521,0.00002225131,0.0002340852,0.03409758],"genre_scores_gemma":[0.997175,0.000009920574,0.002484066,0.00009341085,0.00006912043,0.0000243073,0.000001839915,0.000009978236,0.0001323828],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9037678,"threshold_uncertainty_score":0.6604793,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.1335533269288322,"gpt":0.3329722697939045,"spread":0.1994189428650723,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000545201,0.00005056536,0.00004946099,0.00005036499,0.00003097782,0.00008008419,0.0004758347,0.00002840241,0.0000122412],"category_scores_gemma":[0.0000944138,0.00004530857,0.00001532862,0.0002290788,0.00001579508,0.0005337953,0.00007960351,0.00003542585,0.0002279939],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004674317,"about_ca_system_score_gemma":0.00003846888,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008649695,"about_ca_topic_score_gemma":8.056303e-7,"domain_scores_codex":[0.9993415,0.00005587158,0.0001288731,0.0001780313,0.0001803613,0.0001153409],"domain_scores_gemma":[0.9993268,0.00001400446,0.00004742291,0.0004467397,0.00008426376,0.00008072001],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00000183396,0.00001571053,0.0003993488,0.000001164798,0.000001783199,7.658997e-7,0.0006886503,0.00009765005,0.001054915,0.9088497,0.007099266,0.08178918],"study_design_scores_gemma":[0.000363912,0.00009954662,0.01125912,0.000004556508,0.000002464343,0.00002915581,0.0001861877,0.8235795,0.04141846,0.01345642,0.1093141,0.0002865365],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01697363,0.00002046298,0.8991391,0.0003416298,0.0004848393,0.00004961397,9.038308e-8,0.0001790819,0.08281152],"genre_scores_gemma":[0.06274851,0.00000170262,0.9348308,0.000179979,0.0001101516,0.000006745395,0.000001150898,0.000003294039,0.002117617],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8953933,"threshold_uncertainty_score":0.2930477,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"Engineering and Physical Sciences Research Council","keywords":"Divide and conquer algorithms; Computer science; Component (thermodynamics); Counterexample; Property (philosophy); Process (computing); Scalability; Alphabet; Model checking; Theoretical computer science; Process calculus; Algorithm; Artificial intelligence; Programming language; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.05480365477555006,"gpt":0.3464262572074728,"spread":0.2916226024319228,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0159764,0.0003080119,0.0004860779,0.0003660128,0.0007644472,0.0002333344,0.001205145,0.0001349802,0.000001366455],"category_scores_gemma":[0.001256223,0.0002443583,0.00006401383,0.001247642,0.00007081025,0.001033902,0.0006248779,0.0004363826,0.00005416918],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002235905,"about_ca_system_score_gemma":0.00008081951,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008681829,"about_ca_topic_score_gemma":0.000001118544,"domain_scores_codex":[0.9934384,0.00387691,0.0007575558,0.0006502997,0.0004940941,0.0007827529],"domain_scores_gemma":[0.9974024,0.001260607,0.0002510496,0.0007795346,0.0001245815,0.0001818091],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003105787,0.00001366324,0.0003961466,0.00006854357,0.00002038953,0.00003931841,0.01081312,0.01066902,0.001873548,0.01825849,0.00006752014,0.9577492],"study_design_scores_gemma":[0.0003202763,0.000316875,0.003215879,0.0003300456,0.00001000905,0.0007023811,0.0009827868,0.9779471,0.01090718,0.0002611547,0.004578099,0.0004282068],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00347946,0.0001887675,0.9924743,0.00007961396,0.0007272256,0.001882008,0.000001263258,0.0004819483,0.0006853954],"genre_scores_gemma":[0.05184459,0.00001426044,0.9466135,0.0001760574,0.0001147043,0.001095927,4.808347e-7,0.00003071799,0.0001097506],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9672781,"threshold_uncertainty_score":0.9964642,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.03039523163578827,"gpt":0.3178480168016136,"spread":0.2874527851658253,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003427852,0.00009678441,0.00009808277,0.0001339913,0.0001354467,0.0001516167,0.0004689442,0.00006229098,0.0001217851],"category_scores_gemma":[0.0000691469,0.00008445826,0.00003981949,0.0007321056,0.00005894544,0.0007929484,0.00007311728,0.0000754566,0.0001307285],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000850658,"about_ca_system_score_gemma":0.00005132369,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007921926,"about_ca_topic_score_gemma":9.628978e-7,"domain_scores_codex":[0.9989939,0.00006620202,0.0002206485,0.0002773838,0.0002218023,0.0002200792],"domain_scores_gemma":[0.9992547,0.00004321692,0.00005577175,0.0005324665,0.00004259014,0.00007127815],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000003322479,0.00001352641,0.0001057468,0.000002125585,0.000001653257,4.797137e-7,0.00006586669,0.0003954207,0.0004890896,0.2212823,0.00001771498,0.7776228],"study_design_scores_gemma":[0.0002139439,0.00003272556,0.001544864,0.00001367078,0.000002897644,0.0001171588,0.0000157329,0.9340019,0.009721531,0.0507961,0.003345127,0.0001943749],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.09710269,0.00001352083,0.8894272,0.00007948111,0.0002237774,0.0001054673,3.778136e-7,0.0002262685,0.01282119],"genre_scores_gemma":[0.06013554,0.00002537761,0.9394351,0.0001565595,0.00008862793,0.000004433559,6.792343e-7,0.000006025342,0.0001477192],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9336064,"threshold_uncertainty_score":0.3444108,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.2078896805235524,"gpt":0.3593631138283615,"spread":0.1514734333048091,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002119896,0.0002289693,0.000272743,0.0001315885,0.0002811775,0.0002102355,0.00219477,0.0001284212,0.000034017],"category_scores_gemma":[0.001806689,0.0001827822,0.0001163435,0.0007912588,0.0004018946,0.0006386976,0.0004651621,0.0003025349,0.00005514144],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001289524,"about_ca_system_score_gemma":0.00008551262,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007802583,"about_ca_topic_score_gemma":0.000004794153,"domain_scores_codex":[0.9976969,0.00006792978,0.000647489,0.0005929951,0.0006106527,0.000384074],"domain_scores_gemma":[0.9978423,0.000113886,0.0005798216,0.0006407119,0.0007281376,0.00009516995],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002528375,0.00005591902,0.0004470625,0.00003442153,0.000004543465,4.622149e-8,0.0003776648,0.0002262602,0.06215836,0.8781496,0.00005145032,0.05846933],"study_design_scores_gemma":[0.00001456982,0.00008282631,0.000655039,0.00007613478,0.000006152618,0.00000441166,0.000056325,0.4379148,0.2584613,0.302513,0.00008116032,0.0001343113],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2870281,0.000007614851,0.6999476,0.0009941091,0.0008353591,0.000475969,0.000002495863,0.0001464716,0.01056232],"genre_scores_gemma":[0.7929964,0.000006068021,0.2067365,0.0001338835,0.00006386071,0.00001298248,2.536748e-7,0.000009912519,0.00004013934],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5756366,"threshold_uncertainty_score":0.7453644,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01685507846674616,"gpt":0.2625197398130171,"spread":0.2456646613462709,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004031386,0.000070406,0.0000574023,0.00005985032,0.00009099663,0.00009739692,0.0004421106,0.00005317573,0.00004376763],"category_scores_gemma":[0.00004619291,0.00005318077,0.0000138831,0.0002235944,0.0000334062,0.0009238994,0.00005550018,0.0002244469,0.00008454822],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001362395,"about_ca_system_score_gemma":0.00004027384,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002782317,"about_ca_topic_score_gemma":0.00001881271,"domain_scores_codex":[0.999279,0.00001903925,0.0001207628,0.0002208033,0.0001988953,0.0001615177],"domain_scores_gemma":[0.999287,0.00003329415,0.00007412204,0.0004744314,0.00006536106,0.00006575922],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00001977649,0.00008946084,0.001748791,0.00002398496,0.0000147863,0.000006077711,0.0004465778,0.0002339605,0.1262627,0.7700104,0.0008318833,0.1003116],"study_design_scores_gemma":[0.000863905,0.0003124283,0.0758925,0.00003110773,0.0000189479,0.0003885116,0.0001203726,0.3021148,0.5747745,0.005220469,0.03957538,0.0006870464],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.04779407,0.000002874334,0.8906236,0.0002643889,0.0005591201,0.0001023,2.376513e-7,0.0003094951,0.06034394],"genre_scores_gemma":[0.4819978,0.000001468304,0.5174755,0.00004655015,0.00004153065,0.000008383602,3.503965e-7,0.000003153252,0.0004253073],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7647899,"threshold_uncertainty_score":0.2168649,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.04707438216720248,"gpt":0.3155200354914582,"spread":0.2684456533242557,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.004812952,0.0003615644,0.0005823124,0.00137031,0.0002443241,0.0002726844,0.002761588,0.0002667376,0.00000706478],"category_scores_gemma":[0.0001568458,0.0002673914,0.000161433,0.001462062,0.0009102796,0.0005309247,0.0005376476,0.0003524109,0.000002002741],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001239135,"about_ca_system_score_gemma":0.0002492442,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001749605,"about_ca_topic_score_gemma":0.00001767722,"domain_scores_codex":[0.9969311,0.00008901036,0.0006065155,0.001128979,0.0007845017,0.0004598385],"domain_scores_gemma":[0.9962464,0.001169922,0.0004848117,0.001599787,0.0003709425,0.0001281464],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000007070229,0.00001290062,0.00001315434,0.00001200362,0.00005431004,0.000004641297,0.0004921872,0.02332349,0.0000435738,0.01954731,0.000002833742,0.9564865],"study_design_scores_gemma":[0.0001148211,0.0002315273,0.0006317621,0.00003688144,0.00009742341,0.00002245531,2.938281e-7,0.9380919,0.001773199,0.05826912,0.0004316292,0.0002990167],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00005328301,0.0003517749,0.9978326,0.00008424518,0.0006588779,0.0006566851,0.00001057376,0.00005875624,0.0002931962],"genre_scores_gemma":[0.002724779,0.00003610989,0.9964982,0.0005130302,0.0001389493,0.0000112888,0.000008110941,0.00001812769,0.00005142063],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9561875,"threshold_uncertainty_score":0.9999778,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Concordia University","funders":"","keywords":"Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.04842339022231228,"gpt":0.3855151116572161,"spread":0.3370917214349038,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.003449301,0.0002382467,0.0002888177,0.0003894425,0.0001166431,0.0001552926,0.0005856566,0.0001645958,0.00001534446],"category_scores_gemma":[0.00006652797,0.0002480632,0.00005534959,0.00009702706,0.00008095516,0.005530606,0.0003665115,0.0002214375,0.00008817088],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001124469,"about_ca_system_score_gemma":0.00001285372,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003472156,"about_ca_topic_score_gemma":0.000003617442,"domain_scores_codex":[0.9980271,0.000127836,0.0009811409,0.0002828747,0.0003541605,0.0002269222],"domain_scores_gemma":[0.9983274,0.00008071851,0.0007033402,0.000748205,0.00008393191,0.00005641732],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.000005023523,0.000002074658,0.000001008814,0.0002864,0.000004050484,1.087293e-7,0.0001682976,0.0000705921,1.645396e-7,0.5303462,0.00003455047,0.4690816],"study_design_scores_gemma":[0.0002416762,0.00003197256,0.0004200324,0.00009175021,0.000008389917,0.000001916847,0.00003378213,0.007945515,0.00002080617,0.1361944,0.8547319,0.000277939],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[5.756298e-7,0.0003500667,0.5928633,0.0001069,0.0003478736,0.0003136728,0.000002550176,0.00007345249,0.4059416],"genre_scores_gemma":[0.0001193353,0.009699397,0.9775974,0.001034772,0.00003433647,0.0001027857,0.00007079319,0.000009336582,0.01133183],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8546973,"threshold_uncertainty_score":0.9999971,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2065086898","doi":"10.1007/s10703-011-0132-2","title":"Explaining counterexamples using causality","year":2011,"lang":"en","type":"article","venue":"Formal Methods in System Design","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":104,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"Novo Nordisk Fonden; Azrieli Foundation","keywords":"Counterexample; TRACE (psycholinguistics); Computer science; Causality (physics); Set (abstract data type); Theoretical computer science; Algorithm; Feature (linguistics); Programming language; Discrete mathematics; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.3656074904811601,"gpt":0.4137656834194675,"spread":0.04815819293830742,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.01659085,0.0002644504,0.0004334071,0.0003235867,0.0001976653,0.0001113901,0.001313463,0.0001773294,0.00001101123],"category_scores_gemma":[0.0003977921,0.000250962,0.00008179089,0.0007688842,0.00007140906,0.002223442,0.0003192349,0.0002532228,0.00002345166],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003639634,"about_ca_system_score_gemma":0.0001159976,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002515181,"about_ca_topic_score_gemma":0.000002437163,"domain_scores_codex":[0.9937977,0.003759679,0.0009008164,0.0005370963,0.0003328824,0.0006718166],"domain_scores_gemma":[0.9978646,0.000479761,0.0003933013,0.001029366,0.0001215925,0.000111361],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001287259,0.0001084563,0.002526986,0.000392714,0.00004696169,0.00006534118,0.01804186,0.0008135072,0.01155639,0.8729808,0.00002273263,0.0933155],"study_design_scores_gemma":[0.0004563596,0.0001891259,0.004041265,0.000315186,0.00001579318,0.0002861751,0.001727207,0.9004336,0.08848288,0.00332762,0.0001743502,0.000550441],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.003656374,0.0001053148,0.9886725,0.00000205651,0.001324618,0.0004901151,0.000001623514,0.0003357973,0.005411616],"genre_scores_gemma":[0.1806331,0.000002129358,0.81919,0.00002842301,0.00004740799,0.00006816191,4.273551e-7,0.0000193213,0.00001097721],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8996201,"threshold_uncertainty_score":0.9999943,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01729907821748301,"gpt":0.29185562870249,"spread":0.274556550485007,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002807367,0.00005700334,0.0001019504,0.0002005001,0.00003626422,0.00007897585,0.0005195445,0.00002620706,0.00006197458],"category_scores_gemma":[0.00004431089,0.00004680188,0.0000851497,0.001506843,0.00001452498,0.0003587187,0.00008921533,0.00004880353,0.0002451524],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003843935,"about_ca_system_score_gemma":0.00001325953,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002534955,"about_ca_topic_score_gemma":0.000002909366,"domain_scores_codex":[0.9993635,0.00003710993,0.0001429587,0.0002044154,0.0001308989,0.0001211606],"domain_scores_gemma":[0.9992486,0.00001185676,0.0000398416,0.0006061339,0.00004892992,0.00004467076],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[9.909043e-7,0.00002078083,0.000432237,0.000002698592,0.00006429192,0.000001729482,0.0002393313,0.0003583954,0.0002972752,0.991504,0.0001123927,0.006965952],"study_design_scores_gemma":[0.002298606,0.0003025889,0.2481986,0.00005902922,0.0004917039,0.00007112871,0.0001071582,0.4444982,0.1285365,0.1519825,0.02199456,0.001459384],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.007578147,0.0000207142,0.9744666,0.0004839874,0.00006179766,0.00004455259,2.98605e-7,0.0002076006,0.01713632],"genre_scores_gemma":[0.3187169,0.000003310827,0.680459,0.0005134984,0.00001386095,0.000002783468,0.000001337731,0.000002015225,0.0002872396],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8395215,"threshold_uncertainty_score":0.315102,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.04777020344084489,"gpt":0.2804378409214108,"spread":0.232667637480566,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001682772,0.0000472085,0.00007416976,0.00005166595,0.00003035947,0.00001527458,0.0004652237,0.0000311058,0.0001119663],"category_scores_gemma":[0.00004736754,0.00003840641,0.00002415976,0.0002660922,0.00001735723,0.0002556448,0.00009662435,0.0000432801,0.00006929487],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001092211,"about_ca_system_score_gemma":0.000003336264,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001051133,"about_ca_topic_score_gemma":1.303321e-7,"domain_scores_codex":[0.9993846,0.00008269708,0.00014738,0.0001315507,0.0001628852,0.00009092475],"domain_scores_gemma":[0.9993905,0.0000439426,0.00006357986,0.0004197961,0.00005105402,0.00003109476],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000003324649,0.0003058708,0.0003780668,0.00003214803,0.00001389444,0.000001648483,0.001651295,0.0001469586,0.03249415,0.8018678,0.008839662,0.1542652],"study_design_scores_gemma":[0.0001065589,0.00003583786,0.003120525,0.00000935004,0.000001377011,0.000003521936,0.000004132623,0.9118719,0.08063281,0.001019814,0.003132294,0.00006194304],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.009635874,0.00008571764,0.9078125,0.000146612,0.0002828867,0.00008392399,2.752041e-7,0.0005824499,0.08136976],"genre_scores_gemma":[0.2223004,0.000009560793,0.7772197,0.00005618359,0.00000912325,0.000001999868,1.575371e-7,0.000002135053,0.0004008464],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9117249,"threshold_uncertainty_score":0.1566168,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.0666572969321753,"gpt":0.325424812103734,"spread":0.2587675151715587,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002403897,0.00005836511,0.0001436343,0.0001657139,0.00004658923,0.00001838748,0.0002055985,0.00002874512,0.000007825754],"category_scores_gemma":[0.0003771106,0.00004593058,0.0000238204,0.001292682,0.00007572103,0.0003566559,0.00006037726,0.00002603114,0.000001298592],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001037075,"about_ca_system_score_gemma":0.00002935515,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008367701,"about_ca_topic_score_gemma":0.000002605482,"domain_scores_codex":[0.999339,0.00004140358,0.0001911406,0.0002027438,0.0001437495,0.00008192848],"domain_scores_gemma":[0.9992904,0.0001268959,0.0001056228,0.0002806238,0.0001704058,0.00002606991],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002065828,0.0002359642,0.01672157,0.0004469799,0.0002490549,0.000002624039,0.005248501,0.4821842,0.0005716569,0.4690492,0.00001885053,0.02525071],"study_design_scores_gemma":[0.00004889701,0.0000317644,0.01845172,0.000002838014,0.00003768036,0.000001844275,0.0000130363,0.9764237,0.0008681075,0.004036195,0.00002570664,0.00005850874],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07500507,0.00004338793,0.9234676,0.0000246086,0.00001615913,0.000114189,6.45832e-7,0.00006787876,0.001260487],"genre_scores_gemma":[0.5866612,0.00001005095,0.4132592,0.00001951964,0.00000242267,0.000005807846,0.00000108388,0.00000118036,0.00003954521],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5116561,"threshold_uncertainty_score":0.1872994,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.06655507728057433,"gpt":0.2663195237633659,"spread":0.1997644464827915,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001201593,0.000208965,0.0003798268,0.0004504342,0.0001985857,0.00003170403,0.0009871849,0.0001463973,0.00001778281],"category_scores_gemma":[0.0002908677,0.0001921071,0.0001421392,0.0008098874,0.000110787,0.0006706444,0.000006102125,0.0001680835,0.00003931637],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002489648,"about_ca_system_score_gemma":0.000509897,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005735584,"about_ca_topic_score_gemma":0.000001172828,"domain_scores_codex":[0.997209,0.0006566201,0.0008199369,0.0003447257,0.0006369159,0.0003328443],"domain_scores_gemma":[0.9973876,0.0004104616,0.0005206737,0.001301785,0.000323852,0.00005559448],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003814278,0.002042847,0.000092067,0.001143459,0.0005327975,0.000004433131,0.002223308,0.7452021,0.1290819,0.04945309,0.0003867944,0.06945579],"study_design_scores_gemma":[0.0002383792,0.0002936248,0.0003829256,0.0001255369,0.00002171121,0.00002713541,0.00002539135,0.5953087,0.403247,0.0001361463,0.00005784726,0.0001355756],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0149637,0.000163944,0.9832833,0.0001361464,0.0002542188,0.0006619225,0.000003752026,0.0004042228,0.0001288159],"genre_scores_gemma":[0.755522,0.00002820885,0.2440411,0.00001328652,0.000009294362,0.0002778798,0.000001145482,0.00001568698,0.00009137563],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7405583,"threshold_uncertainty_score":0.7833902,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01916878961442004,"gpt":0.3105799987214886,"spread":0.2914112091070686,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00151037,0.00006871639,0.00008810533,0.0001014965,0.00006748946,0.00003688416,0.0004978108,0.00004611707,0.00001172234],"category_scores_gemma":[0.0008913386,0.00006158894,0.00002275058,0.0004185949,0.00002705856,0.0004902052,0.00007164748,0.00005659946,0.00001676193],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000341278,"about_ca_system_score_gemma":0.00003497683,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001056957,"about_ca_topic_score_gemma":0.000001872934,"domain_scores_codex":[0.9989938,0.0000298771,0.0003593673,0.0001916138,0.0002685775,0.0001567779],"domain_scores_gemma":[0.999052,0.0002297191,0.0001851648,0.0003911361,0.0000984324,0.00004358622],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000005834587,0.00004965373,0.0006315901,0.00005682581,0.000004249799,6.546348e-7,0.0007847808,0.00003590381,0.1312681,0.08631192,0.0008294212,0.7800211],"study_design_scores_gemma":[0.0001854042,0.00007643479,0.01433422,0.0001011352,0.000003715837,0.00001627665,0.000137449,0.5515079,0.42925,0.003574937,0.0006446911,0.0001677922],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.09874144,0.0000546134,0.8965703,0.00002945524,0.0001206123,0.000106249,1.958015e-7,0.0001466515,0.004230456],"genre_scores_gemma":[0.4559616,0.000002143816,0.5439461,0.00003168405,0.000006660886,0.000002063469,5.390027e-7,0.000002794632,0.00004648973],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7798533,"threshold_uncertainty_score":0.2511524,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.03041052690250826,"gpt":0.2665463862713043,"spread":0.236135859368796,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002009514,0.0003619892,0.0004176127,0.0006709477,0.00013401,0.0002536372,0.004426727,0.0002451774,0.00003866777],"category_scores_gemma":[0.0002571088,0.0002722582,0.0001089701,0.0007612065,0.0008803973,0.0008485843,0.001231843,0.0007965079,0.00004612083],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000237285,"about_ca_system_score_gemma":0.0002814939,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005824474,"about_ca_topic_score_gemma":0.00002531467,"domain_scores_codex":[0.9968287,0.00008321796,0.0006680695,0.0009671096,0.0009080599,0.0005448365],"domain_scores_gemma":[0.9969543,0.0006240244,0.0004507588,0.00168298,0.0002105996,0.00007737563],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000005857939,0.00003437193,0.0001738702,0.00005749922,0.000009378719,0.00002167703,0.00638097,0.01829785,0.0006962518,0.1707705,0.00003714197,0.8035146],"study_design_scores_gemma":[0.0003524352,0.0002271747,0.001516557,0.0008171918,0.000006233485,0.00005981468,0.000004624903,0.7493103,0.009798853,0.2355156,0.001513166,0.0008780411],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0008010339,0.0002209006,0.990145,0.0004737887,0.001495869,0.0004401231,0.000001289974,0.00005885881,0.006363158],"genre_scores_gemma":[0.1727032,0.00002551146,0.8263095,0.0006835904,0.0001021205,0.00001511136,7.907879e-7,0.00002155596,0.0001386188],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8026366,"threshold_uncertainty_score":0.9999729,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.0201040403771851,"gpt":0.2657216902340813,"spread":0.2456176498568962,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002505344,0.0001454865,0.0003399291,0.0001101268,0.0001291939,0.00009132849,0.0005061109,0.0000549495,0.000008008596],"category_scores_gemma":[0.001261117,0.00008950767,0.00005729601,0.0003611425,0.0001707897,0.0005046295,0.0000661115,0.0001869523,0.000002525443],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001735776,"about_ca_system_score_gemma":0.00008303843,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001827809,"about_ca_topic_score_gemma":1.884504e-7,"domain_scores_codex":[0.9984236,0.0003372275,0.0005834204,0.0001336572,0.0002912607,0.0002308874],"domain_scores_gemma":[0.9978957,0.0004516151,0.001001918,0.0002202339,0.0003641271,0.00006644153],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0003391576,0.0005675461,0.001774145,0.0004426092,0.0002325186,0.00002770886,0.006136236,0.0006174155,0.02853489,0.1323945,0.00006089901,0.8288724],"study_design_scores_gemma":[0.01360186,0.02061644,0.0486628,0.003584585,0.001545939,0.01197898,0.007449951,0.07452143,0.0658498,0.7367281,0.0112092,0.004250919],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2245869,0.001335641,0.7732167,0.0002346575,0.000166621,0.0002602065,5.700117e-7,0.00003258903,0.0001660741],"genre_scores_gemma":[0.8257985,0.00006187192,0.1739498,0.0001001115,0.00003815258,0.000003242971,4.424555e-7,0.000006429198,0.00004140855],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8246215,"threshold_uncertainty_score":0.3650017,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.1557889296470551,"gpt":0.294810634822528,"spread":0.1390217051754729,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001730681,0.0001507917,0.0002160867,0.0002126022,0.0005057171,0.0001466122,0.003850273,0.0001117199,0.00003648196],"category_scores_gemma":[0.001137315,0.0002034374,0.0000576573,0.0009111727,0.0001145546,0.0051438,0.001190891,0.0004304664,0.0001147081],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007131894,"about_ca_system_score_gemma":0.000231376,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00009646598,"about_ca_topic_score_gemma":0.00004707202,"domain_scores_codex":[0.9982786,0.0002583585,0.0001757117,0.000574807,0.0003998183,0.0003127494],"domain_scores_gemma":[0.9969517,0.0001346619,0.0002217445,0.002317434,0.0002293582,0.0001451026],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003872223,0.0004311936,0.005823558,0.0001034207,0.0001135254,0.00009707484,0.003886997,0.01012098,0.02967411,0.8052521,0.001578714,0.1428796],"study_design_scores_gemma":[0.0003966645,0.00005500123,0.002043644,0.00003840483,0.00002483255,0.00003908762,0.0003829595,0.9803958,0.0006859524,0.01017486,0.005486843,0.0002759309],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.04505778,0.00006872429,0.9258991,0.0001765163,0.0001613574,0.0001409507,0.00002759134,0.0001800049,0.02828793],"genre_scores_gemma":[0.2443137,0.000007688559,0.7553065,0.00003920233,0.000007753059,1.516337e-7,0.000008778516,0.000008809129,0.0003074688],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9702748,"threshold_uncertainty_score":0.8295937,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.02059891819269703,"gpt":0.3042032797844661,"spread":0.283604361591769,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001176792,0.0000368237,0.0000362579,0.00003306257,0.0001072049,0.0001321912,0.0001631591,0.00001312203,0.00008165587],"category_scores_gemma":[0.00001513562,0.00003238579,0.000009604211,0.000103065,0.00001861199,0.0005292605,0.0000385563,0.00006704171,0.00002603813],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001081618,"about_ca_system_score_gemma":0.000004352825,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002440206,"about_ca_topic_score_gemma":0.000004575698,"domain_scores_codex":[0.9996461,0.00003548284,0.00006678277,0.0001208417,0.00005601722,0.00007478215],"domain_scores_gemma":[0.9997141,0.00004318556,0.00001351273,0.0001890429,0.00001292212,0.0000272585],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000003401004,0.00001407388,0.0001345753,0.000003444553,0.000003404828,0.000001150641,0.0006910239,0.00005234586,0.003667004,0.1871149,0.001539839,0.8067748],"study_design_scores_gemma":[0.0003863205,0.0001059148,0.1118144,0.00008291712,0.000008480196,0.0006547899,0.0001350041,0.6589756,0.04271479,0.01216341,0.1724497,0.0005085903],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03478741,0.0001077125,0.8064775,0.0007914803,0.0002022321,0.0000591128,1.76771e-7,0.0002168454,0.1573575],"genre_scores_gemma":[0.1841413,0.00001352429,0.813469,0.0002261438,0.00001980507,0.000001791727,2.141472e-7,0.000001831797,0.002126444],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8062662,"threshold_uncertainty_score":0.1320654,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.0165494217330425,"gpt":0.2819093452471662,"spread":0.2653599235141237,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001047604,0.0001443082,0.0001386345,0.000182394,0.0003108767,0.0003893247,0.0007563296,0.00005320992,0.00001040633],"category_scores_gemma":[0.0002947444,0.00007042092,0.00005527244,0.0003634028,0.00004027079,0.001774279,0.0001398969,0.0002046381,0.00004913476],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001266104,"about_ca_system_score_gemma":0.00007632594,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":6.757679e-7,"about_ca_topic_score_gemma":3.225663e-7,"domain_scores_codex":[0.9985235,0.00004700842,0.0004241712,0.0001859207,0.0005206966,0.000298719],"domain_scores_gemma":[0.9986022,0.0002817318,0.0004047001,0.0003755321,0.0001917976,0.0001440687],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003911238,0.00001315505,0.0005634181,0.000002158552,0.000009497769,0.00001044432,0.0001787326,0.09941865,0.00003825373,0.02848158,0.00005604188,0.8711889],"study_design_scores_gemma":[0.001372307,0.0008635569,0.005277615,0.0007296317,0.000005459642,0.0007355773,0.00002597849,0.9810538,0.0021084,0.004781275,0.002657929,0.000388458],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02179819,0.000009572546,0.9755394,0.0003783483,0.0006338308,0.00008595092,2.849352e-7,0.0001099373,0.00144443],"genre_scores_gemma":[0.2964525,0.00001636076,0.7031692,0.0001952729,0.0001326934,8.072603e-7,2.456441e-7,0.000008005213,0.00002488132],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8816352,"threshold_uncertainty_score":0.3754267,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.05466461180288122,"gpt":0.3211580869827185,"spread":0.2664934751798373,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000809198,0.00009704278,0.00009367058,0.00008489376,0.0001730357,0.0001601588,0.0007013653,0.00004004695,0.0002387513],"category_scores_gemma":[0.0005215758,0.00008213142,0.0000535804,0.0003689159,0.00001792044,0.0006211589,0.0003497495,0.00008269445,0.000440497],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003167109,"about_ca_system_score_gemma":0.000004365185,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001753059,"about_ca_topic_score_gemma":0.00001031357,"domain_scores_codex":[0.9987054,0.00008077471,0.000260085,0.0003040563,0.0002794041,0.0003702681],"domain_scores_gemma":[0.9989313,0.0001686985,0.00007843054,0.0006954118,0.00005283879,0.00007327325],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000001174329,0.00004339182,0.001313548,0.000003173154,0.000003753576,0.000002539611,0.0003737064,0.000007090495,0.001173977,0.09824816,0.001470496,0.897359],"study_design_scores_gemma":[0.0003292467,0.00004320105,0.005103159,0.000007789118,0.000002026134,0.00000813532,0.0000245452,0.9694668,0.01078806,0.002270499,0.01180022,0.0001562965],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01593423,0.00004016575,0.9719456,0.00009310425,0.0002818765,0.000153139,5.858523e-7,0.0002876626,0.01126368],"genre_scores_gemma":[0.3691977,0.000007186399,0.6303524,0.000136092,0.00002605963,0.00001177989,4.996804e-7,0.000004526133,0.0002637086],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9694597,"threshold_uncertainty_score":0.5661845,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; University of Toronto","keywords":"Viewpoints; Computer science; Negotiation; Theoretical computer science; Artificial intelligence; Model checking; Machine learning","retraction":null,"screen_n_in":null,"score":{"opus":0.0757266652675412,"gpt":0.3400484879013286,"spread":0.2643218226337875,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005911962,0.0002189613,0.0002115293,0.0001610612,0.00007860512,0.0001472888,0.001725936,0.0001254606,0.00003623842],"category_scores_gemma":[0.003769479,0.0001850442,0.0001553014,0.0002629753,0.00004578095,0.0005947479,0.0003027144,0.0003094081,0.00001337644],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001951256,"about_ca_system_score_gemma":0.00005758389,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004514842,"about_ca_topic_score_gemma":6.830566e-7,"domain_scores_codex":[0.9984245,0.000007513284,0.0004052667,0.0003746586,0.0004968966,0.0002911683],"domain_scores_gemma":[0.9985446,0.00006928633,0.0003311924,0.0002647765,0.0007045876,0.00008553723],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002670892,0.00008794814,0.000847645,0.00004409665,0.0000427697,1.132229e-7,0.0002868095,0.0005416127,0.0007340332,0.992766,0.0004713198,0.004150975],"study_design_scores_gemma":[0.0004568727,0.00007608002,0.004678819,0.0005518625,0.00001214664,0.00001081133,0.00002370876,0.9739257,0.01262487,0.004148968,0.003219393,0.0002707809],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01928774,0.00003056961,0.9781004,0.0004912319,0.0009943052,0.0003877852,0.00001677341,0.0002205852,0.0004705657],"genre_scores_gemma":[0.09778228,0.00003049452,0.9013739,0.0002984453,0.0001602111,0.00009830732,0.000001955991,0.00002200725,0.0002324514],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.988617,"threshold_uncertainty_score":0.7545883,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.08904423961801068,"gpt":0.312742786337601,"spread":0.2236985467195903,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.003868533,0.0004467431,0.0006191982,0.0003314841,0.000299215,0.0004201696,0.001485308,0.000371457,0.000003947801],"category_scores_gemma":[0.0004099351,0.0004333524,0.0001669287,0.0005710316,0.00006507021,0.001668781,0.0003925477,0.0005581038,0.00008791339],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004249575,"about_ca_system_score_gemma":0.0001478751,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003350588,"about_ca_topic_score_gemma":0.00001643211,"domain_scores_codex":[0.995173,0.000306826,0.001250854,0.001052493,0.001081378,0.001135473],"domain_scores_gemma":[0.9969417,0.0002548475,0.000461187,0.001420808,0.0005214407,0.0003999571],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001912783,0.0001774685,0.0003415604,0.0003109036,0.00009388488,0.00009334557,0.002736366,0.8995273,0.001036783,0.08100331,0.0007567747,0.013731],"study_design_scores_gemma":[0.0004118725,0.0001326263,0.00002406963,0.0002484483,0.00001923936,0.00005057993,0.0001853046,0.9945763,0.000560638,0.002514534,0.0007613517,0.0005150505],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01808459,0.00027949,0.9772791,0.0001704209,0.001614254,0.0006273557,0.0000236902,0.001666139,0.0002549845],"genre_scores_gemma":[0.6429417,0.00001701625,0.3562703,0.0003118322,0.0002025142,0.00005041026,0.00001772455,0.00004984014,0.0001386914],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6248571,"threshold_uncertainty_score":0.9998118,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02617571674413412,"gpt":0.2763478119893099,"spread":0.2501720952451758,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.001158637,0.0005270415,0.0004909858,0.0008975912,0.0001977033,0.0007157266,0.005406405,0.0003834034,0.00009056721],"category_scores_gemma":[0.0001729821,0.0004780617,0.0001239226,0.0005659397,0.0007129315,0.001241524,0.001849136,0.0009386012,0.0006580728],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000384201,"about_ca_system_score_gemma":0.0003793831,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002784809,"about_ca_topic_score_gemma":0.0000139006,"domain_scores_codex":[0.9960776,0.00005388301,0.0006047025,0.00155253,0.0009986298,0.0007126522],"domain_scores_gemma":[0.9967377,0.0002712199,0.0003604993,0.002157909,0.00026965,0.0002030044],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000001913829,0.00001457909,0.00001440044,0.00002256199,0.000006115921,0.0000194053,0.0004332185,0.001010155,0.0001630201,0.1172675,0.00005294991,0.8809942],"study_design_scores_gemma":[0.0001591021,0.0001570983,0.0002461681,0.000347429,0.000004951295,0.00009993184,8.961969e-8,0.7209805,0.00315454,0.2691508,0.004926713,0.0007727144],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00004777528,0.0002607131,0.9778093,0.0003416179,0.003451917,0.0004278744,0.000002833044,0.0002492358,0.01740871],"genre_scores_gemma":[0.02003084,0.00003504906,0.9773517,0.00117839,0.000359688,0.00001630969,0.000003206747,0.00003444482,0.0009904095],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8802215,"threshold_uncertainty_score":0.9999748,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"Strong","keywords":"Formal methods; Formal verification; Computer science; Programming language","retraction":null,"screen_n_in":null,"score":{"opus":0.08181267425518404,"gpt":0.3148733832200596,"spread":0.2330607089648755,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008877631,0.0001508619,0.0001667707,0.0001403325,0.0007175994,0.0001944911,0.0002054593,0.00006314079,0.000002297846],"category_scores_gemma":[0.0001735859,0.0001408248,0.00004621952,0.0001803279,0.0001406128,0.001170504,0.00004958882,0.0002750095,0.000002768543],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009449816,"about_ca_system_score_gemma":0.00008903855,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008896621,"about_ca_topic_score_gemma":4.028245e-7,"domain_scores_codex":[0.9984233,0.0002144102,0.0003973008,0.0003891244,0.0003712502,0.0002046417],"domain_scores_gemma":[0.9990609,0.0001047021,0.0001778727,0.000259178,0.0002535041,0.0001438333],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001534353,0.0002331565,0.00492361,0.00004849779,0.00001993852,0.00001308487,0.02499457,0.5683134,0.0003528818,0.05531229,0.00002847254,0.3456067],"study_design_scores_gemma":[0.0003744246,0.000214088,0.01743213,0.00002498206,0.000003628248,0.0001670556,0.0004571716,0.9750964,0.0001318192,0.005910355,0.00003150077,0.0001564301],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4515346,0.00008968512,0.5478141,0.0002666392,0.00008484986,0.0000904674,4.420567e-7,0.00004955151,0.00006967276],"genre_scores_gemma":[0.694872,0.00006282615,0.3048845,0.0001124793,0.000047827,0.00001006398,8.253608e-7,0.000005398438,0.000004129336],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.406783,"threshold_uncertainty_score":0.5742668,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.07332092788385225,"gpt":0.3206703728948022,"spread":0.2473494450109499,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002270152,0.0005485179,0.0005581384,0.0007725433,0.0003562018,0.0007023368,0.00375264,0.0003611542,0.00001281458],"category_scores_gemma":[0.0002091465,0.0005390311,0.0001191447,0.0006477861,0.0006291388,0.001226549,0.000999096,0.0008464418,0.00002444781],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006487844,"about_ca_system_score_gemma":0.0005927408,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004317655,"about_ca_topic_score_gemma":0.00002764898,"domain_scores_codex":[0.9957323,0.00008598102,0.0006873439,0.001624375,0.0011333,0.000736666],"domain_scores_gemma":[0.9968134,0.0003513693,0.0004663582,0.001929659,0.0002847146,0.0001545686],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000004829381,0.00001958068,0.0000391315,0.00002990034,0.000007220538,0.00004970359,0.00088066,0.02101876,0.0004910159,0.1026043,0.00000551085,0.8748494],"study_design_scores_gemma":[0.0001485944,0.0001214988,0.0002242851,0.0004049726,0.000007480979,0.0001337056,2.35898e-7,0.8431484,0.002544655,0.1512694,0.001283976,0.0007128261],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0002260769,0.0002755954,0.9933297,0.0001453848,0.001801295,0.0003084641,0.000003881997,0.000230898,0.003678702],"genre_scores_gemma":[0.03612697,0.00002414967,0.9622974,0.0010286,0.0003924524,0.000003297581,0.000003242805,0.00002688014,0.00009705273],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8741366,"threshold_uncertainty_score":0.9997061,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Concordia University","funders":"","keywords":"Algorithm; Computer science; Representation (politics); Mathematics; Theoretical computer science; Mathematical optimization","retraction":null,"screen_n_in":null,"score":{"opus":0.06615708801716053,"gpt":0.3386980545469639,"spread":0.2725409665298034,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005950177,0.0001821917,0.0004128286,0.0004743277,0.0005176216,0.0001019219,0.001229382,0.0001724777,0.00002209987],"category_scores_gemma":[0.0006990689,0.0001803006,0.0001816258,0.000376331,0.00006872023,0.0003166658,0.00003324885,0.0001860395,0.00001154299],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007158288,"about_ca_system_score_gemma":0.00006084062,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002456519,"about_ca_topic_score_gemma":0.000007341487,"domain_scores_codex":[0.998256,0.0001116126,0.0005287434,0.0005131028,0.0002159846,0.0003745028],"domain_scores_gemma":[0.9975661,0.0003242827,0.0002703394,0.001417253,0.0003052441,0.0001167616],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000478148,0.001402051,0.0003474547,0.000205048,0.0001473345,0.000001970727,0.000929179,0.008779522,0.002950306,0.6518201,0.00003297447,0.3329059],"study_design_scores_gemma":[0.001067994,0.0005553002,0.005126779,0.00002809991,0.0000570118,0.00001273253,0.00002672856,0.9678234,0.01115844,0.01344576,0.0003668164,0.0003309131],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04908827,0.00001029936,0.9481249,0.0004070202,0.001431534,0.0006338062,0.00007369711,0.00007803646,0.0001524776],"genre_scores_gemma":[0.5172084,0.000009099705,0.4826042,0.00002922909,0.0000257392,0.0001037327,0.0000021072,0.000007972454,0.000009513285],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9590439,"threshold_uncertainty_score":0.7352447,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.08175201863392131,"gpt":0.3215951428315679,"spread":0.2398431241976466,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00182308,0.0006521179,0.0005770804,0.0008729713,0.0003232891,0.0006158565,0.004839069,0.0005458106,0.00002103245],"category_scores_gemma":[0.0002334869,0.0006110689,0.0001756201,0.0008316702,0.0007118441,0.001129823,0.001813667,0.00116163,0.00005473681],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005640966,"about_ca_system_score_gemma":0.0004981783,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001637934,"about_ca_topic_score_gemma":0.00002687906,"domain_scores_codex":[0.99517,0.0000643282,0.0007018183,0.001910667,0.001289102,0.0008641054],"domain_scores_gemma":[0.9966194,0.000169673,0.0004610004,0.002251893,0.0002934775,0.0002045431],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000005242888,0.0000420483,0.00004639629,0.000030702,0.000008828387,0.0000578661,0.0007355027,0.3093268,0.0002187022,0.252717,0.00001357284,0.4367974],"study_design_scores_gemma":[0.000218952,0.0000618938,0.00008432481,0.0001671429,0.000005901488,0.00005012963,5.781222e-8,0.8574085,0.0007657878,0.1400764,0.0005508122,0.0006100751],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00005357773,0.0002739055,0.9900249,0.0001188421,0.001911048,0.0004310666,0.000003474943,0.0003170299,0.006866207],"genre_scores_gemma":[0.01229423,0.00008614958,0.9853027,0.001478233,0.0002831933,0.00001076492,0.000003608322,0.00004436,0.0004967492],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.5480817,"threshold_uncertainty_score":0.9996341,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.08381016544744409,"gpt":0.3122846525582125,"spread":0.2284744871107685,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009563089,0.0002378123,0.0002589177,0.0001461769,0.0002830593,0.0001918324,0.002274982,0.0001091776,0.00005427155],"category_scores_gemma":[0.001245058,0.0001525637,0.000162109,0.0004583869,0.0002553274,0.0008173132,0.0002948516,0.0001749576,0.00008817422],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008354054,"about_ca_system_score_gemma":0.0000905465,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001147991,"about_ca_topic_score_gemma":0.00000269362,"domain_scores_codex":[0.9978335,0.00003451068,0.0006399674,0.0005907674,0.0004721528,0.000429119],"domain_scores_gemma":[0.9980645,0.0002499088,0.0005101282,0.0004269795,0.0006523883,0.00009615949],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0001154747,0.00006260182,0.00004949736,0.0000328668,0.00001004233,1.159212e-7,0.0007277313,0.000004106739,0.1185979,0.7277162,0.00009584659,0.1525876],"study_design_scores_gemma":[0.00005851987,0.0002171072,0.0001055122,0.0002576196,0.000009952299,0.000002970658,0.00007432081,0.04150585,0.6860037,0.2712723,0.0002717535,0.0002204819],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07726159,0.00001192297,0.9155826,0.002249192,0.001352816,0.0006403895,0.00001050474,0.0001362975,0.002754708],"genre_scores_gemma":[0.90244,0.00003470236,0.09699401,0.0001024038,0.0001094771,0.00006101025,4.53861e-7,0.00001552081,0.0002424225],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8251784,"threshold_uncertainty_score":0.6221369,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.05622366089218801,"gpt":0.2785760117045132,"spread":0.2223523508123252,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003882326,0.0001713351,0.0001393492,0.0001774914,0.0001390742,0.00008302315,0.00025991,0.00009933687,0.000003665897],"category_scores_gemma":[0.0001086109,0.0001865779,0.0001047273,0.0003299566,0.00001094128,0.001033037,0.000001102925,0.0001746276,0.00001123838],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001117557,"about_ca_system_score_gemma":0.00005803399,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001413983,"about_ca_topic_score_gemma":5.765879e-7,"domain_scores_codex":[0.9989728,0.0000290533,0.0002520865,0.0003157709,0.0001779108,0.0002523824],"domain_scores_gemma":[0.9992771,0.0001064769,0.00005316676,0.0004250885,0.00008056447,0.00005766384],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000005544655,0.0000451715,0.000003311314,0.0000337616,0.00001022009,5.704845e-7,0.000228378,0.9652297,0.0009111373,0.02635517,0.00001965651,0.007157341],"study_design_scores_gemma":[0.000226273,0.00006420879,0.000007647496,0.00002337023,0.000007775653,0.000007105452,0.000008358098,0.9439422,0.05362055,0.001267581,0.0005931261,0.0002318121],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001168264,0.00001810847,0.9967959,0.00002619429,0.0008999251,0.0003312548,0.000006387062,0.0007340842,0.00001989177],"genre_scores_gemma":[0.2911915,0.000005216846,0.7083837,0.00004905716,0.00001593222,0.0002480019,0.000001289689,0.00001948356,0.00008585965],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2900232,"threshold_uncertainty_score":0.7608427,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.0640061665801301,"gpt":0.3078150874879148,"spread":0.2438089209077847,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002474148,0.0008840915,0.0008168833,0.000961314,0.0004869761,0.0007015474,0.005154382,0.0007494215,0.00000617875],"category_scores_gemma":[0.0002885216,0.0008664243,0.0002606025,0.0008507716,0.0009197972,0.001415581,0.001654468,0.001770014,0.00003844957],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008272792,"about_ca_system_score_gemma":0.0006781772,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006620177,"about_ca_topic_score_gemma":0.00001290362,"domain_scores_codex":[0.9935486,0.0001008392,0.0009775623,0.002546287,0.001648397,0.001178367],"domain_scores_gemma":[0.9960173,0.0001643787,0.0005831363,0.002523095,0.0003990305,0.0003130513],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00000480735,0.00004643658,0.000005154509,0.00003714208,0.00000896816,0.00001688006,0.0009093508,0.7425615,0.001282999,0.06827597,0.000009760548,0.186841],"study_design_scores_gemma":[0.0002948041,0.00005237076,0.00001026388,0.00022353,0.00001086386,0.00005261763,9.093679e-8,0.8702775,0.004047384,0.1240792,0.0001095295,0.0008418508],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00004440554,0.0002240839,0.9943593,0.000291391,0.001634997,0.0005535077,0.000003883448,0.0003362822,0.002552122],"genre_scores_gemma":[0.01497092,0.0000305688,0.9820687,0.002176142,0.0002098014,0.00002281391,0.000003787837,0.0000749929,0.0004423404],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.1859992,"threshold_uncertainty_score":0.9993786,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.0813120162940838,"gpt":0.3161018302563561,"spread":0.2347898139622723,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008583867,0.000141384,0.000162206,0.0002010834,0.0001354274,0.0000431816,0.0001694351,0.0001700047,0.000003253592],"category_scores_gemma":[0.001214585,0.0001443978,0.00002918539,0.0003011975,0.00003702195,0.0002134169,0.000006170497,0.000263219,0.000003850639],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003048405,"about_ca_system_score_gemma":0.00001305305,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004200977,"about_ca_topic_score_gemma":0.000001020762,"domain_scores_codex":[0.998958,0.0003131609,0.0001307601,0.0003360712,0.00008169855,0.0001803051],"domain_scores_gemma":[0.9986043,0.0007574012,0.00004691265,0.0004646825,0.00004624789,0.00008047326],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00004417855,0.00007896351,0.0001214316,0.0001411824,0.0001123899,0.000006354624,0.001833201,0.01415278,0.04813806,0.0455482,0.00006183551,0.8897614],"study_design_scores_gemma":[0.001849204,0.0008619842,0.03354447,0.00009074926,0.0001234025,0.001641883,0.0001959537,0.343977,0.4955776,0.003172101,0.1176008,0.001364898],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.008814172,0.0002570294,0.9889448,0.0001246869,0.000701615,0.0001213945,0.000001879047,0.001020663,0.00001376338],"genre_scores_gemma":[0.05730532,0.0001720258,0.9423321,0.00005476642,0.00001486384,0.00003461567,8.977212e-7,0.00001299326,0.00007245467],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8883965,"threshold_uncertainty_score":0.5888373,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02005992062363393,"gpt":0.303808427045778,"spread":0.2837485064221441,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002890291,0.0001136966,0.000171379,0.0002312776,0.0001186588,0.0000888816,0.0006531054,0.00005350238,9.124812e-7],"category_scores_gemma":[0.0004437282,0.0001074691,0.00001811101,0.0009761789,0.001199032,0.001281219,0.0001936871,0.0001448809,1.918284e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009149486,"about_ca_system_score_gemma":0.0001163069,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000673566,"about_ca_topic_score_gemma":4.388912e-7,"domain_scores_codex":[0.9983157,0.0001537528,0.0003577427,0.0004025274,0.0004011408,0.0003691262],"domain_scores_gemma":[0.9989776,0.0002448425,0.0002019192,0.0003610644,0.0001567256,0.00005783379],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000006822012,0.00002535504,0.0005001831,0.00001107203,7.799247e-7,1.56957e-7,0.0003390327,0.0009972261,0.03000008,0.7377539,2.419264e-8,0.2303653],"study_design_scores_gemma":[0.0001192471,0.0002714916,0.008394551,0.00003610316,0.000003031336,0.00001920032,0.000002801658,0.6722065,0.2033984,0.1154639,6.853033e-7,0.00008396263],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4355108,0.00005798932,0.5641756,0.0000913734,0.00002847717,0.00009657052,1.866999e-7,0.00001676933,0.00002220698],"genre_scores_gemma":[0.6519042,0.00001955712,0.3480419,0.00002108381,0.000009031535,0.000001523541,4.388694e-7,0.000002086245,1.402418e-7],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6712093,"threshold_uncertainty_score":0.4417882,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.043871529287083,"gpt":0.3166956051957158,"spread":0.2728240759086328,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001101539,0.0003369382,0.0003550423,0.0009463028,0.0002085423,0.0001578644,0.002041392,0.0003524063,0.00003166753],"category_scores_gemma":[0.0001855571,0.0003389429,0.0001083766,0.0006395609,0.0007391176,0.001011257,0.0003395242,0.0006304127,0.00002868574],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003364808,"about_ca_system_score_gemma":0.0003452276,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002169166,"about_ca_topic_score_gemma":0.00002090625,"domain_scores_codex":[0.9970254,0.00003328601,0.000684891,0.0009529379,0.0009107034,0.000392773],"domain_scores_gemma":[0.9970801,0.0003363671,0.0006457003,0.001378273,0.0004535791,0.0001059115],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000009428635,0.00002036525,0.00008764757,0.00007468073,0.00001140471,0.00001102899,0.0005473119,0.02662464,0.001148994,0.1145643,0.0000110143,0.8568892],"study_design_scores_gemma":[0.0004126859,0.0003130095,0.01253411,0.000485969,0.00002403484,0.0001795876,6.73549e-7,0.6239231,0.02568255,0.3339859,0.00126476,0.00119365],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0004821615,0.0001188318,0.9946907,0.00006373908,0.002535112,0.0003313331,0.0000115799,0.0001526538,0.001613918],"genre_scores_gemma":[0.1049527,0.00001630458,0.8945116,0.0001917869,0.0001848274,0.000005604853,0.00002079404,0.00001990276,0.00009641048],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8556955,"threshold_uncertainty_score":0.9999062,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}