{"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","author_layer_release":"2026-06-26"},"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","authors":[{"name":"Patrick Cousot","is_ca":false},{"name":"Radhia Cousot","is_ca":true},{"name":"Jérôme Ferêt","is_ca":false},{"name":"Laurent Mauborgne","is_ca":false},{"name":"Antoine Miné","is_ca":false},{"name":"David Monniaux","is_ca":true},{"name":"Xavier Rival","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001510129,0.001785075,0.001392511,0.002276981,0.0008792715,0.003777555,0.002735901,0.001386637,0.06724998],"category_scores_gemma":[0.005555473,0.001751705,0.001865545,0.001492486,0.0007640185,0.006397686,0.003014267,0.002387606,0.06180749],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007075608,"about_ca_system_score_gemma":0.001792575,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001595249,"about_ca_topic_score_gemma":0.002138383,"domain_scores_codex":[0.9970834,0.0005327332,0.0002050458,0.0007534972,0.00114337,0.0002820036],"domain_scores_gemma":[0.9973685,0.000697971,0.00009515031,0.001273154,0.0004980307,0.00006723491],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0009068252,0.0002739505,0.002189599,0.0005923106,0.0001516332,0.000388925,0.0003228969,0.002897784,0.02274314,0.0994715,0.3698913,0.5001701],"study_design_scores_gemma":[0.0002254157,0.0001353977,0.001720369,0.0002134222,0.0002284937,0.001204806,0.0002061093,0.06240632,0.1098345,0.1103811,0.7132636,0.0001804545],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.007409723,0.0007065156,0.5542204,0.0006333346,0.0004717926,0.0002998688,0.00551465,0.3366242,0.09411953],"genre_scores_gemma":[0.1379146,0.001079813,0.5198135,0.001962321,0.0003240911,0.0005309393,0.03159899,0.1265308,0.1802449],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.06724998,"threshold_uncertainty_score":0.2249736,"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","authors":[{"name":"Joëlle Pineau","is_ca":true},{"name":"Geoff Gordon","is_ca":false},{"name":"Sebastian Thrun","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002145037,0.0009475613,0.001248599,0.0007497215,0.0006603666,0.001417407,0.00181831,0.0009319307,0.003713108],"category_scores_gemma":[0.008311304,0.0006773534,0.001033132,0.0007423804,0.001241385,0.001762777,0.001799247,0.002472513,0.0005471493],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001799957,"about_ca_system_score_gemma":0.001753627,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006393275,"about_ca_topic_score_gemma":0.007936267,"domain_scores_codex":[0.9990777,0.0003568742,0.00004609062,0.0001043199,0.000325595,0.00008939272],"domain_scores_gemma":[0.9959572,0.002956388,0.0003012829,0.000350908,0.0002990632,0.0001350591],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00004146252,0.00001533745,0.0002369366,0.00004922326,0.00001345032,0.00003149117,0.00006158873,0.9457229,0.0002205947,0.0442944,0.0002493987,0.009063159],"study_design_scores_gemma":[0.000006658418,0.000009211825,0.00001726061,0.000007171919,0.000002373517,0.000004390884,0.000009627853,0.9823615,0.0001349253,0.01710399,0.0003405687,0.00000230071],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006249705,0.0001048573,0.9918368,0.00005979656,0.00001395657,0.00002877389,0.00004198347,0.0001903055,0.001473793],"genre_scores_gemma":[0.4815742,0.0003619051,0.5151876,0.0000576459,0.00003189039,0.0003315104,0.0002600088,0.0001626471,0.002032606],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006393275,"threshold_uncertainty_score":0.01305968,"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","authors":[{"name":"Josée Desharnais","is_ca":true},{"name":"Vineet Gupta","is_ca":false},{"name":"Radha Jagadeesan","is_ca":false},{"name":"Prakash Panangaden","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007560621,0.001861256,0.002029256,0.007120518,0.00227676,0.005986439,0.002030024,0.002997371,0.008142412],"category_scores_gemma":[0.04725746,0.001071416,0.001664881,0.004540347,0.003889611,0.01558932,0.004171124,0.00312206,0.0009311129],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.006737899,"about_ca_system_score_gemma":0.002100351,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003003439,"about_ca_topic_score_gemma":0.002347891,"domain_scores_codex":[0.9919155,0.00313528,0.0007850719,0.001405511,0.002073091,0.0006855302],"domain_scores_gemma":[0.9573455,0.02712356,0.00503763,0.002509865,0.004723776,0.003259646],"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.00004298691,0.00001631409,0.0005755942,0.00008494331,0.00002334022,0.00004246431,0.0001751784,0.009355995,0.0003692221,0.9809223,0.0008396423,0.007551921],"study_design_scores_gemma":[0.000007441325,0.00002068881,0.0002286826,0.00003452288,0.00001159857,0.00002752312,0.00002806096,0.03527883,0.0001940919,0.9622076,0.001943786,0.00001718243],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.06462575,0.002073241,0.9133915,0.001515365,0.000256728,0.0001806808,0.001145508,0.0005855879,0.01622568],"genre_scores_gemma":[0.7512827,0.002301487,0.2218906,0.0005625503,0.0006418175,0.0009317848,0.003270275,0.0007461575,0.01837265],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.008142412,"threshold_uncertainty_score":0.04888713,"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","authors":[],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004540828,0.001266529,0.001505199,0.001890072,0.002305426,0.003754718,0.002524487,0.002125193,0.00687647],"category_scores_gemma":[0.01981508,0.001037744,0.002436092,0.001610774,0.004253785,0.006728659,0.004241829,0.004198548,0.001177328],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004292408,"about_ca_system_score_gemma":0.002911022,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004552702,"about_ca_topic_score_gemma":0.004086094,"domain_scores_codex":[0.9938681,0.002399092,0.0004096803,0.001117544,0.001398509,0.0008071667],"domain_scores_gemma":[0.9836573,0.01182342,0.001114703,0.001462927,0.001356189,0.0005854107],"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.0001031727,0.00004304783,0.0001279304,0.00006154831,0.0000239137,0.00005074131,0.0002196108,0.02115649,0.0007699492,0.971307,0.0003426664,0.005793987],"study_design_scores_gemma":[0.00003340397,0.0000212442,0.00003931939,0.00002310009,0.0000181342,0.00001635288,0.00002570305,0.07419014,0.0009709726,0.9236257,0.001019965,0.0000158647],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03061905,0.0002165682,0.9579888,0.0003564596,0.00007631912,0.0001377303,0.0001995618,0.00055031,0.009855207],"genre_scores_gemma":[0.7598712,0.0005379377,0.2244706,0.0004245935,0.000133357,0.001074314,0.0008176789,0.0005058799,0.01216436],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00687647,"threshold_uncertainty_score":0.03114378,"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","authors":[{"name":"Christel Baier","is_ca":false},{"name":"Marjan Sirjani","is_ca":false},{"name":"Farhad Arbab","is_ca":true},{"name":"Jan Rutten","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001907628,0.001127886,0.0009124511,0.001112981,0.0009962275,0.003630015,0.002713691,0.001979943,0.008400873],"category_scores_gemma":[0.006354854,0.00139513,0.002246,0.001277525,0.002225866,0.005186937,0.002368194,0.002237413,0.001647342],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001172387,"about_ca_system_score_gemma":0.001927081,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.009677315,"about_ca_topic_score_gemma":0.01623084,"domain_scores_codex":[0.9981248,0.0005409066,0.0001457658,0.0004624798,0.0004248687,0.0003011463],"domain_scores_gemma":[0.9959192,0.002097498,0.0004175629,0.0009814197,0.0004122886,0.000172038],"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.0002286701,0.000153404,0.00140889,0.000249616,0.00007073493,0.0007748938,0.0006578571,0.3316738,0.01432813,0.6190818,0.001096287,0.03027583],"study_design_scores_gemma":[0.0000736373,0.00004859578,0.0001756876,0.0000545636,0.00007680588,0.0001673348,0.0001393596,0.8260574,0.01348747,0.1446284,0.01503115,0.00005965128],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01483175,0.00006553858,0.9756147,0.0001022249,0.00003613455,0.0001262381,0.0001252333,0.001269133,0.007829065],"genre_scores_gemma":[0.3243844,0.0002632415,0.6641281,0.0001363965,0.00002062893,0.0003792489,0.0004332635,0.0008337577,0.009420943],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009677315,"threshold_uncertainty_score":0.02810377,"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)","authors":[{"name":"Eugène Asarin","is_ca":false},{"name":"Olivier Bournez","is_ca":true},{"name":"Thao Dang","is_ca":false},{"name":"Oded Maler","is_ca":false},{"name":"Amir Pnueli","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000751398,0.0007055404,0.0004777604,0.0004144424,0.0003321457,0.0006981595,0.0006625781,0.0005264598,0.002118734],"category_scores_gemma":[0.00176439,0.0003261623,0.0005492708,0.0002772126,0.0007825617,0.0006521185,0.0005703848,0.0008654613,0.0002343614],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005670846,"about_ca_system_score_gemma":0.0007088698,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009645871,"about_ca_topic_score_gemma":0.001396261,"domain_scores_codex":[0.9992614,0.0001286522,0.00005853065,0.0001249359,0.0003690501,0.0000573816],"domain_scores_gemma":[0.9993376,0.0004110704,0.00006574774,0.00008742417,0.00008008251,0.00001804037],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001153011,0.00007233725,0.0003143096,0.0003692771,0.00005808371,0.0001796045,0.0003117606,0.6607093,0.05951551,0.1670209,0.0006608056,0.1106727],"study_design_scores_gemma":[0.00004797832,0.0001060222,0.00007067734,0.00002636766,0.00003013597,0.00003605572,0.00002677669,0.9342749,0.02176123,0.03844671,0.005160276,0.0000127793],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01018064,0.00009691878,0.9871553,0.00003897955,0.00002947184,0.00004870023,0.00001752084,0.0004619959,0.001970383],"genre_scores_gemma":[0.4892154,0.0002610371,0.5079868,0.00007301055,0.00003029424,0.0002407556,0.0001158423,0.0001054794,0.001971478],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.002118734,"threshold_uncertainty_score":0.007087886,"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","authors":[{"name":"Prakash Panangaden","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007419045,0.0009677809,0.0006200416,0.001240953,0.00087923,0.003316272,0.00100609,0.001373238,0.03340706],"category_scores_gemma":[0.003831137,0.0005989093,0.001035651,0.001817986,0.002006933,0.005246939,0.001359502,0.002594303,0.009481449],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00170429,"about_ca_system_score_gemma":0.001137775,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00121556,"about_ca_topic_score_gemma":0.001554206,"domain_scores_codex":[0.998768,0.0003251475,0.00007484964,0.0002806759,0.0004645107,0.00008677577],"domain_scores_gemma":[0.998628,0.0007431416,0.0001099082,0.0002128436,0.000239142,0.00006695295],"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.00001140224,0.000008915665,0.00005773338,0.000154866,0.00001311891,0.00008791326,0.0001876826,0.001940981,0.0005777478,0.9444427,0.02173778,0.03077917],"study_design_scores_gemma":[0.000007620765,0.00001405951,0.0001162374,0.0001179839,0.00001202978,0.0002205039,0.0000471585,0.005024142,0.0004864963,0.6138078,0.3801295,0.00001647532],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003821144,0.01865293,0.5501751,0.004164671,0.003469055,0.0002208123,0.002314363,0.001990742,0.4151913],"genre_scores_gemma":[0.1735363,0.02867431,0.2624446,0.004179351,0.002890858,0.0007168889,0.004733988,0.001234799,0.5215889],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.03340706,"threshold_uncertainty_score":0.1117578,"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","authors":[{"name":"Rajeev Alur","is_ca":true},{"name":"Salvatore La Torre","is_ca":false},{"name":"George J. Pappas","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008992066,0.0007524391,0.0009141114,0.001071798,0.0008419055,0.001867206,0.001288993,0.000804343,0.006131408],"category_scores_gemma":[0.004724517,0.001065376,0.001010234,0.001810993,0.001435815,0.003852244,0.001597054,0.001818984,0.0005773176],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001453649,"about_ca_system_score_gemma":0.001240219,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002029431,"about_ca_topic_score_gemma":0.002926448,"domain_scores_codex":[0.9990619,0.0001950027,0.00009032297,0.0002302419,0.0002952034,0.0001273372],"domain_scores_gemma":[0.9980153,0.001328792,0.0001537089,0.0001857566,0.0002201194,0.00009639776],"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.0001611494,0.00005140539,0.0003197764,0.0002526091,0.00003716395,0.0001085341,0.0002353379,0.1193695,0.004582725,0.8139658,0.001231287,0.05968466],"study_design_scores_gemma":[0.00002209076,0.00002640918,0.00006695866,0.00002780283,0.00002498936,0.00003869107,0.00004343057,0.1199832,0.001991208,0.875428,0.002336793,0.00001045837],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.06334856,0.0004934103,0.919227,0.0002150488,0.00009746654,0.00010176,0.0002427772,0.0005611578,0.01571282],"genre_scores_gemma":[0.5349347,0.001330819,0.4425956,0.0001109617,0.00007873565,0.00037025,0.000622239,0.0005700698,0.01938666],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.006131408,"threshold_uncertainty_score":0.02051163,"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","authors":[{"name":"Marsha Chećhik","is_ca":true},{"name":"Benet Devereux","is_ca":true},{"name":"Steve Easterbrook","is_ca":true},{"name":"Arie Gurfinkel","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005600933,0.001132307,0.00147992,0.001512904,0.001264736,0.003920918,0.003476509,0.001557758,0.004792453],"category_scores_gemma":[0.01655601,0.0007470801,0.002841321,0.001349346,0.003900097,0.006764889,0.004209601,0.002886376,0.0005700552],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003185109,"about_ca_system_score_gemma":0.003867555,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003913706,"about_ca_topic_score_gemma":0.004841553,"domain_scores_codex":[0.9928832,0.00228974,0.0005339594,0.001093258,0.002634537,0.0005652841],"domain_scores_gemma":[0.9868034,0.008081825,0.00086336,0.002661633,0.001341709,0.0002481412],"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.000223964,0.0001096801,0.001543814,0.0003566549,0.0001391397,0.0004598579,0.0004512782,0.2755729,0.005388716,0.6705075,0.001877678,0.04336882],"study_design_scores_gemma":[0.0000582361,0.00003594123,0.00007916423,0.00006606608,0.00005094384,0.00009422375,0.00004556232,0.7462946,0.008944369,0.2389122,0.005389352,0.00002948721],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01120479,0.000171009,0.9820306,0.0003902851,0.00009396883,0.0001082942,0.0001807664,0.001993113,0.003827104],"genre_scores_gemma":[0.4159349,0.0003185491,0.5790212,0.0003638101,0.00006672918,0.0003392937,0.0005335012,0.0003952394,0.003026759],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005600933,"threshold_uncertainty_score":0.02962089,"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","authors":[{"name":"Marc Berndl","is_ca":true},{"name":"Ondřej Lhoták","is_ca":true},{"name":"Feng Qian","is_ca":true},{"name":"Laurie Hendren","is_ca":true},{"name":"Navindra Umanee","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002443804,0.001703843,0.001324593,0.003023247,0.001092083,0.003736852,0.001942666,0.001024604,0.008063818],"category_scores_gemma":[0.008767108,0.001101211,0.00286956,0.002028926,0.001955392,0.005200544,0.002332012,0.002857478,0.001599664],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001789295,"about_ca_system_score_gemma":0.002071286,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004551611,"about_ca_topic_score_gemma":0.004347458,"domain_scores_codex":[0.9961019,0.001034945,0.000349974,0.0006029072,0.001707229,0.0002031268],"domain_scores_gemma":[0.9953081,0.003023024,0.0002627546,0.0006142019,0.0007281641,0.00006372571],"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.0002623484,0.00008637081,0.0009895165,0.0007501561,0.0001524264,0.0002308729,0.000459669,0.2199725,0.007729187,0.5605205,0.005291875,0.2035547],"study_design_scores_gemma":[0.00008514996,0.00007864981,0.000136425,0.0001587367,0.00009921798,0.0001669432,0.0001177125,0.5137652,0.01920722,0.4166424,0.04947909,0.00006327355],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00098889,0.00006783775,0.9968433,0.000065778,0.00002123855,0.00005899294,0.00009202689,0.0007797112,0.001082225],"genre_scores_gemma":[0.05661099,0.0005221029,0.9392241,0.0001306088,0.00004518883,0.0002614784,0.0005014093,0.0005379108,0.0021662],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008063818,"threshold_uncertainty_score":0.02697617,"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","authors":[{"name":"Wenfei Fan","is_ca":false},{"name":"Leonid Libkin","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009825457,0.001626623,0.001824364,0.002177781,0.003071408,0.006614729,0.002854351,0.003075841,0.006121113],"category_scores_gemma":[0.05507664,0.001943924,0.002345143,0.0056263,0.005850296,0.0210895,0.005149903,0.007096113,0.001045487],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004876309,"about_ca_system_score_gemma":0.00393241,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0112987,"about_ca_topic_score_gemma":0.00974946,"domain_scores_codex":[0.9844358,0.007217756,0.001392742,0.002130299,0.003752451,0.0010708],"domain_scores_gemma":[0.8988146,0.08855272,0.003968493,0.00428781,0.003573681,0.0008026639],"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.0001671058,0.0001108127,0.0007105806,0.000521152,0.00005875532,0.0009439238,0.0006154827,0.1610368,0.002159378,0.7908875,0.003859656,0.03892882],"study_design_scores_gemma":[0.00009012471,0.00007219196,0.0002242516,0.0002031772,0.00005376878,0.0005661089,0.0002932595,0.2441733,0.004473339,0.7311041,0.01869003,0.00005634661],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02628368,0.001544959,0.9488677,0.005993593,0.0002032565,0.0003540715,0.0007994217,0.0004525343,0.01550082],"genre_scores_gemma":[0.3457747,0.004590786,0.6335754,0.001799133,0.0007950734,0.0009081019,0.002211789,0.0005062023,0.009838897],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.0112987,"threshold_uncertainty_score":0.05196255,"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","authors":[{"name":"Liang Jia","is_ca":true},{"name":"Vijay Ganesh","is_ca":true},{"name":"Pascal Poupart","is_ca":true},{"name":"Krzysztof Czarnecki","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002415431,0.001304557,0.00163654,0.001565416,0.0006884526,0.001576912,0.002943619,0.001903189,0.01430406],"category_scores_gemma":[0.01268432,0.0008015594,0.001301847,0.001814415,0.001281856,0.002552847,0.002096713,0.004422565,0.002604212],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002207282,"about_ca_system_score_gemma":0.002437595,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002707711,"about_ca_topic_score_gemma":0.004105716,"domain_scores_codex":[0.9982826,0.0006962633,0.00008297492,0.0002714068,0.0004594626,0.0002074212],"domain_scores_gemma":[0.9931099,0.005246103,0.0002279555,0.0006177115,0.0005570158,0.0002413552],"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.0005111845,0.0002522055,0.0007116941,0.0003588816,0.00007594336,0.00007030314,0.0001291845,0.518254,0.003116846,0.08370535,0.01179708,0.3810174],"study_design_scores_gemma":[0.00004204389,0.00004497395,0.00008531537,0.00003892828,0.00001748895,0.00002017854,0.00001174688,0.9487786,0.000736583,0.04903797,0.001176701,0.00000952217],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01365851,0.0009728248,0.9701774,0.0004599244,0.000160426,0.0001454621,0.0002039861,0.002310615,0.01191079],"genre_scores_gemma":[0.2960051,0.0007323078,0.6886036,0.0004494601,0.0002495836,0.000487831,0.00112584,0.001056969,0.0112894],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01430406,"threshold_uncertainty_score":0.0478518,"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","authors":[{"name":"Steve Easterbrook","is_ca":true},{"name":"Marsha Chećhik","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.02502923,0.001943916,0.001854031,0.004623451,0.00325112,0.00929508,0.007892227,0.003423571,0.005050896],"category_scores_gemma":[0.0324838,0.002785129,0.006894448,0.003219993,0.007894296,0.01441881,0.008254424,0.007948301,0.001154514],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004748448,"about_ca_system_score_gemma":0.004922363,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01160734,"about_ca_topic_score_gemma":0.01078167,"domain_scores_codex":[0.9836094,0.007108325,0.001839334,0.002082286,0.004369481,0.0009910718],"domain_scores_gemma":[0.9804419,0.01169734,0.001795085,0.003263205,0.002088286,0.0007141629],"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.00007841748,0.00004868095,0.0003408191,0.0002754439,0.0001129603,0.0005027425,0.001001737,0.0322684,0.001416386,0.9335623,0.001702688,0.02868952],"study_design_scores_gemma":[0.0001072587,0.00006061902,0.0001146291,0.0002309856,0.0001247853,0.0002808255,0.0002154624,0.1862255,0.002561121,0.7891876,0.02080537,0.00008591978],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0005573625,0.00008663871,0.9974424,0.0002523169,0.00002443388,0.00008484223,0.00005481124,0.0005045907,0.0009926666],"genre_scores_gemma":[0.03846093,0.0001924966,0.9595445,0.0001982924,0.00006676568,0.0002975771,0.0002528723,0.0001012992,0.0008852463],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02502923,"threshold_uncertainty_score":0.1323688,"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","authors":[{"name":"Alberto Rivas","is_ca":true},{"name":"Rodrigo Toro Icarte","is_ca":true},{"name":"Toryn Q. Klassen","is_ca":true},{"name":"Richard Valenzano","is_ca":true},{"name":"Sheila A. McIlraith","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005083673,0.001395117,0.0007623931,0.0008307347,0.0006858223,0.003375202,0.002041877,0.001979582,0.007150466],"category_scores_gemma":[0.02006145,0.001006435,0.001986192,0.0009767839,0.004660803,0.005352544,0.002210238,0.006037684,0.002186079],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001835213,"about_ca_system_score_gemma":0.003086314,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003616436,"about_ca_topic_score_gemma":0.004541392,"domain_scores_codex":[0.9954404,0.002414245,0.0004885991,0.0005338441,0.0008618232,0.0002611509],"domain_scores_gemma":[0.9892531,0.007684153,0.0006675111,0.00149458,0.0007055899,0.0001950978],"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.0001039257,0.00006737574,0.0004680937,0.0002367265,0.00002459195,0.0001611037,0.0004924806,0.0811724,0.002164507,0.870478,0.003584672,0.04104614],"study_design_scores_gemma":[0.0000570925,0.00004368497,0.00006422536,0.0001389684,0.00002090474,0.00008083292,0.00006585196,0.3428856,0.002662052,0.6382343,0.0157141,0.00003250549],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0009239567,0.00011456,0.996861,0.0003354216,0.00003354926,0.00003943208,0.0001137088,0.0006158713,0.0009625165],"genre_scores_gemma":[0.1348026,0.0005784435,0.8584221,0.0009340654,0.0001318681,0.000854929,0.0006257404,0.0008868663,0.002763517],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.007150466,"threshold_uncertainty_score":0.02688533,"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","authors":[{"name":"M. Doostfatemeh","is_ca":true},{"name":"Stefan C. Kremer","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00602626,0.000901488,0.002198347,0.002627769,0.001793864,0.005518719,0.002492764,0.00402876,0.01204628],"category_scores_gemma":[0.01670892,0.001035941,0.002293003,0.002170288,0.007906061,0.02289702,0.00253007,0.006738782,0.001536424],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00364295,"about_ca_system_score_gemma":0.001287454,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002690762,"about_ca_topic_score_gemma":0.002360929,"domain_scores_codex":[0.9975939,0.0009782963,0.000174241,0.0004572954,0.0006864808,0.0001097238],"domain_scores_gemma":[0.9873372,0.00936611,0.0002144637,0.001223791,0.001527168,0.0003312915],"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.00002475742,0.00001652011,0.00009177738,0.00007126006,0.00001218061,0.00002027347,0.000118947,0.001369361,0.0001081073,0.9834912,0.00176012,0.01291547],"study_design_scores_gemma":[0.0000123578,0.000009632262,0.00002865842,0.00002475871,0.000007641724,0.00001703507,0.000044721,0.009936747,0.00007966611,0.9816648,0.008166091,0.000008003509],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01949813,0.05083645,0.8227901,0.0418344,0.005589284,0.00006614481,0.0002880392,0.000403649,0.05869379],"genre_scores_gemma":[0.5066133,0.03472858,0.403963,0.006196024,0.01377091,0.0003620524,0.0004574088,0.0002792025,0.03362947],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01204628,"threshold_uncertainty_score":0.04029882,"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","authors":[{"name":"Dirk Beyer","is_ca":true},{"name":"Alessandro Cimatti","is_ca":false},{"name":"Alberto Griggio","is_ca":true},{"name":"M. Erkan Keremoğlu","is_ca":true},{"name":"Simon Fraser Univers","is_ca":true},{"name":"Roberto Sebastiani","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002124654,0.0009940355,0.000936343,0.001306665,0.0005509437,0.001740535,0.001653589,0.000920318,0.004261781],"category_scores_gemma":[0.009106504,0.0007479168,0.001349518,0.00136553,0.001538666,0.005074986,0.001955285,0.001741649,0.0008590316],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001824306,"about_ca_system_score_gemma":0.002245991,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003780512,"about_ca_topic_score_gemma":0.006257597,"domain_scores_codex":[0.9971966,0.00121658,0.0001666896,0.0002784024,0.0008957068,0.0002460391],"domain_scores_gemma":[0.9921134,0.005241798,0.0005037333,0.001475773,0.0005734449,0.00009188673],"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.0007572257,0.0002021636,0.001293638,0.0004934049,0.00008674301,0.0003618179,0.0003149994,0.6469973,0.01463269,0.2175215,0.003057481,0.1142811],"study_design_scores_gemma":[0.00007621443,0.00006153795,0.00007653805,0.00005006236,0.00002821871,0.00004802284,0.00002113262,0.8788298,0.009304746,0.1087184,0.002766518,0.00001888753],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02169421,0.0001983152,0.9705238,0.0002354535,0.00002409396,0.0001184644,0.0003758552,0.004511203,0.002318635],"genre_scores_gemma":[0.4626443,0.0004528557,0.5307787,0.0001993894,0.00003869389,0.0005119122,0.001508896,0.0008904213,0.002974783],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.004261781,"threshold_uncertainty_score":0.01425713,"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","authors":[{"name":"Marc Berndl","is_ca":true},{"name":"Ondřej Lhoták","is_ca":true},{"name":"Feng Qian","is_ca":true},{"name":"Laurie Hendren","is_ca":true},{"name":"Navindra Umanee","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002462938,0.001652321,0.001336904,0.002895769,0.001069367,0.003539867,0.001856096,0.001014931,0.007344102],"category_scores_gemma":[0.008726798,0.001027555,0.002711935,0.001935934,0.001924347,0.005103686,0.002179831,0.002717852,0.001451861],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001674994,"about_ca_system_score_gemma":0.001956685,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004016225,"about_ca_topic_score_gemma":0.003673844,"domain_scores_codex":[0.9961972,0.001028105,0.0003505494,0.0005907304,0.001646198,0.0001872021],"domain_scores_gemma":[0.9952133,0.00311305,0.0002775266,0.0006134743,0.0007202029,0.00006248624],"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.0002712358,0.00008498637,0.0009779452,0.0007617385,0.0001564281,0.0002346987,0.0004713228,0.21146,0.008412833,0.5578681,0.004981143,0.2143196],"study_design_scores_gemma":[0.00008882507,0.00008026123,0.0001403791,0.0001594372,0.0001015029,0.0001815836,0.0001187293,0.5129035,0.02131735,0.4169213,0.04792257,0.00006466213],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001034987,0.00006521623,0.9969759,0.00006347821,0.00001926439,0.00005769766,0.00008661768,0.0007315713,0.0009652709],"genre_scores_gemma":[0.05926104,0.0005160901,0.9368914,0.000124192,0.00004333891,0.0002601421,0.0004677938,0.0004824149,0.001953738],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007344102,"threshold_uncertainty_score":0.02456844,"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","authors":[{"name":"D. Michael Miller","is_ca":true},{"name":"Mitchell A. Thornton","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001092712,0.001379008,0.0009320927,0.002049456,0.0009459677,0.005417524,0.001198196,0.00139083,0.005778498],"category_scores_gemma":[0.001786461,0.0007396864,0.001041551,0.003561515,0.003157854,0.006314864,0.001274103,0.004117816,0.001611304],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002302348,"about_ca_system_score_gemma":0.0009378599,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007216299,"about_ca_topic_score_gemma":0.0006334169,"domain_scores_codex":[0.9992062,0.0001918606,0.00006294777,0.0001769815,0.0002964881,0.00006558993],"domain_scores_gemma":[0.9995019,0.000264666,0.00005985945,0.00005714667,0.00008478794,0.00003154046],"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.000005441683,0.000006871025,0.00002390483,0.00007106047,0.000004305165,0.00002231833,0.00009109043,0.0007907609,0.000419878,0.981122,0.002420027,0.01502221],"study_design_scores_gemma":[0.00000462895,0.000009049502,0.00003783802,0.00005870543,0.000007235908,0.00007088394,0.00003716298,0.003164614,0.0003339204,0.9689539,0.0273139,0.000008088244],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01200534,0.05155139,0.8042892,0.005810229,0.001758476,0.00006752973,0.0005487158,0.0005013621,0.1234678],"genre_scores_gemma":[0.4977111,0.04646152,0.3746425,0.002312991,0.004073834,0.000518184,0.001004698,0.0003782969,0.07289689],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005778498,"threshold_uncertainty_score":0.01933098,"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","authors":[{"name":"Caroline Lemieux","is_ca":true},{"name":"Dennis Park","is_ca":true},{"name":"Ivan Beschastnikh","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00230234,0.001425427,0.0006096555,0.002137168,0.0007098625,0.002904837,0.002237852,0.001202381,0.01691744],"category_scores_gemma":[0.01565026,0.0009923418,0.002840815,0.002472847,0.0009436148,0.002972472,0.001935653,0.001725013,0.009041245],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001219977,"about_ca_system_score_gemma":0.002927216,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005064499,"about_ca_topic_score_gemma":0.004654156,"domain_scores_codex":[0.9967687,0.0005912192,0.0005406645,0.0007287835,0.001187336,0.0001833296],"domain_scores_gemma":[0.9930245,0.002733584,0.0006678364,0.002178596,0.001274354,0.0001211674],"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.0004301927,0.000198265,0.007968549,0.002026195,0.0002402883,0.001179697,0.0005501876,0.08200081,0.01657023,0.2100392,0.05543094,0.6233655],"study_design_scores_gemma":[0.0001092881,0.0001188127,0.0007448973,0.0003304377,0.0001113184,0.001243523,0.0001735815,0.6305154,0.03812143,0.20223,0.1262167,0.00008470572],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002060091,0.0001621572,0.9759631,0.0001842339,0.00002740759,0.0002683362,0.002487011,0.01495677,0.003890941],"genre_scores_gemma":[0.07608387,0.0005605441,0.9019322,0.0004472961,0.00006818705,0.0009299982,0.01089409,0.002642965,0.006440782],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01691744,"threshold_uncertainty_score":0.05659449,"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","authors":[{"name":"Corina S. Păsăreanu","is_ca":false},{"name":"Dimitra Giannakopoulou","is_ca":false},{"name":"Mihaela Gheorghiu Bobaru","is_ca":true},{"name":"Jamieson M. Cobleigh","is_ca":false},{"name":"Howard Barringer","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006435745,0.001063703,0.001464033,0.001300423,0.001502773,0.002566836,0.003995461,0.002066488,0.007030066],"category_scores_gemma":[0.03130167,0.001168358,0.001711029,0.0009014077,0.003552292,0.00569971,0.005287134,0.004101628,0.001433505],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001771535,"about_ca_system_score_gemma":0.005295394,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006401555,"about_ca_topic_score_gemma":0.009609075,"domain_scores_codex":[0.994132,0.002642466,0.0003270787,0.001021763,0.001329502,0.0005471163],"domain_scores_gemma":[0.9792108,0.01456502,0.001012753,0.00335794,0.001472334,0.0003811894],"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.001007666,0.0004054194,0.002667548,0.0003412669,0.0001532834,0.0002164824,0.0006741969,0.184724,0.007167767,0.1319235,0.00802456,0.6626943],"study_design_scores_gemma":[0.00008390859,0.00004901034,0.0001031986,0.00002787951,0.00002396852,0.00003938561,0.00006592118,0.8524445,0.005525797,0.1401993,0.00142132,0.00001579053],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.008049882,0.00005072123,0.9884778,0.0003709286,0.00001729242,0.00005638404,0.00003241064,0.001789348,0.001155217],"genre_scores_gemma":[0.2195965,0.00005818302,0.7777379,0.0002825695,0.00003660113,0.0001425761,0.0001489328,0.0004054528,0.001591474],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.007030066,"threshold_uncertainty_score":0.03403592,"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","authors":[{"name":"Robert St‐Aubin","is_ca":true},{"name":"Jesse Hoey","is_ca":true},{"name":"Craig Boutilier","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002543707,0.0008780835,0.001028578,0.001327337,0.0006564429,0.001883931,0.001461189,0.0009391811,0.004633939],"category_scores_gemma":[0.009037191,0.000845063,0.001244887,0.0009111871,0.001246615,0.002302753,0.002231336,0.001903018,0.0008196529],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001220438,"about_ca_system_score_gemma":0.002667461,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002651049,"about_ca_topic_score_gemma":0.002431832,"domain_scores_codex":[0.9974988,0.000908946,0.0001486773,0.0003962801,0.0008891219,0.0001581953],"domain_scores_gemma":[0.9961318,0.00261379,0.0002195281,0.0006255551,0.0003057249,0.0001035661],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002052598,0.0000897061,0.001036654,0.0003108925,0.00008661237,0.0001182506,0.0001568887,0.6433227,0.005792861,0.1394227,0.001595219,0.2078622],"study_design_scores_gemma":[0.00003454,0.00004090831,0.00005589279,0.00003182626,0.00001935514,0.00005327492,0.0000193176,0.9261941,0.006402875,0.06088128,0.0062503,0.00001637338],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001952052,0.00004786497,0.9967644,0.00004230132,0.00001217788,0.00003245161,0.00004502033,0.0005130009,0.0005907094],"genre_scores_gemma":[0.1246699,0.0001759524,0.8734344,0.00005420448,0.00001586306,0.0002546729,0.0001953157,0.0001847594,0.001014879],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004633939,"threshold_uncertainty_score":0.01550204,"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","authors":[{"name":"Nina Narodytska","is_ca":true},{"name":"Fahiem Bacchus","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001526004,0.0009988515,0.0007740721,0.0009238485,0.0005086375,0.001385231,0.001637667,0.001069342,0.006400469],"category_scores_gemma":[0.007587963,0.0007982993,0.001281926,0.001242,0.001224314,0.002563798,0.002350011,0.002200063,0.0008492093],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009418995,"about_ca_system_score_gemma":0.001974921,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002017281,"about_ca_topic_score_gemma":0.004621456,"domain_scores_codex":[0.9983997,0.0005958672,0.00008340396,0.0002592308,0.0004955422,0.0001661856],"domain_scores_gemma":[0.9967705,0.002335634,0.0001892449,0.0003559011,0.0002843767,0.00006438076],"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.0003124343,0.0002277691,0.0008036304,0.0007704227,0.0001545012,0.0003888872,0.0002830611,0.5943039,0.01076239,0.1529502,0.0154201,0.2236227],"study_design_scores_gemma":[0.0001067438,0.00004861985,0.0001040263,0.00005606003,0.00003283365,0.0001039444,0.00005288891,0.8813563,0.00674223,0.1058001,0.005579362,0.00001688903],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0236278,0.0004895989,0.960189,0.0006225986,0.00009195686,0.0001832506,0.0003209178,0.002326085,0.01214871],"genre_scores_gemma":[0.2760453,0.0003709206,0.7167009,0.0005757175,0.00009439624,0.0003207787,0.0009771193,0.0005719052,0.004342875],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006400469,"threshold_uncertainty_score":0.02141172,"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","authors":[{"name":"Dirk Beyer","is_ca":true},{"name":"M. Erkan Keremoğlu","is_ca":true},{"name":"Philipp Wendler","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002360154,0.0005475364,0.0005236501,0.0008503594,0.0004711784,0.001583566,0.001343495,0.0007308042,0.00289016],"category_scores_gemma":[0.006185382,0.0004220041,0.000826924,0.0008950036,0.001831628,0.003934568,0.001988069,0.001997589,0.0006293173],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001126584,"about_ca_system_score_gemma":0.001547388,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001962464,"about_ca_topic_score_gemma":0.001537741,"domain_scores_codex":[0.9975989,0.0008950279,0.0001867713,0.0002821952,0.0007462188,0.0002907077],"domain_scores_gemma":[0.9947984,0.002430704,0.0003673314,0.001876154,0.0004239866,0.0001033172],"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.001454708,0.0002677873,0.003037454,0.0003071089,0.00008304218,0.0004448632,0.0004603706,0.2488249,0.03821562,0.5783811,0.004081938,0.124441],"study_design_scores_gemma":[0.00009580968,0.0001278988,0.0002389188,0.00006331094,0.00005270952,0.0001364304,0.00003401463,0.815292,0.05154743,0.1224079,0.009952911,0.00005059868],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03643107,0.0001249126,0.9557638,0.0001955214,0.0000428024,0.00006951823,0.0001351797,0.003864189,0.003373109],"genre_scores_gemma":[0.6512118,0.0001747499,0.3448755,0.0001410207,0.00003830828,0.0001708628,0.0002984148,0.0007519507,0.002337352],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00289016,"threshold_uncertainty_score":0.01248181,"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","authors":[{"name":"Lin Xu","is_ca":true},{"name":"Frank Hutter","is_ca":true},{"name":"Holger H. Hoos","is_ca":true},{"name":"Kevin Leyton‐Brown","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004569522,0.001184135,0.0009473952,0.001153859,0.000723173,0.003983445,0.004349275,0.001760583,0.01991929],"category_scores_gemma":[0.01243663,0.001358828,0.002102431,0.001153107,0.001565728,0.004765718,0.003087909,0.002723448,0.0053595],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00227963,"about_ca_system_score_gemma":0.003351796,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009942416,"about_ca_topic_score_gemma":0.002013042,"domain_scores_codex":[0.9954477,0.001813307,0.000337771,0.0006496274,0.001296899,0.0004546891],"domain_scores_gemma":[0.9961978,0.001960194,0.0002278397,0.001058282,0.0004317777,0.0001240204],"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.0009468522,0.0004618276,0.002808074,0.0008158278,0.000272067,0.0001627272,0.0002714473,0.1761192,0.01517077,0.4246528,0.03778004,0.3405383],"study_design_scores_gemma":[0.0001804038,0.0002464949,0.0002812194,0.000102383,0.00008557621,0.0001589472,0.00004293626,0.8189465,0.01848427,0.1315288,0.0299079,0.00003455245],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01091166,0.0002445787,0.9625624,0.0004069098,0.0001419031,0.0004093205,0.0004194131,0.01287666,0.0120272],"genre_scores_gemma":[0.1726127,0.0002722213,0.8120479,0.0004640331,0.00009742845,0.000798324,0.00147966,0.003663982,0.008563857],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01991929,"threshold_uncertainty_score":0.06663674,"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","authors":[{"name":"Osman Hasan","is_ca":false},{"name":"Sofiène Tahar","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004946831,0.001679257,0.0009151136,0.002594411,0.00106062,0.003455901,0.002481838,0.001350524,0.07895497],"category_scores_gemma":[0.01095332,0.001226151,0.001931698,0.001901156,0.002182867,0.004982662,0.002366801,0.003141392,0.03716699],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001843311,"about_ca_system_score_gemma":0.00177058,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001274899,"about_ca_topic_score_gemma":0.001506662,"domain_scores_codex":[0.9963537,0.001119639,0.0003003942,0.0004594973,0.001587945,0.0001788657],"domain_scores_gemma":[0.9946699,0.003462427,0.0001462955,0.0009452485,0.000713842,0.00006233132],"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.00003319732,0.00005725271,0.0002582298,0.001182663,0.00007800587,0.0001501605,0.0004000228,0.003493273,0.001960759,0.6353032,0.09381294,0.2632702],"study_design_scores_gemma":[0.00004077025,0.00002017211,0.0001336147,0.000608078,0.00003480894,0.0002907468,0.00009338314,0.01226933,0.004113624,0.5179386,0.4644235,0.00003343932],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0006619719,0.005730761,0.8707264,0.001412256,0.0005588619,0.0002403506,0.001561604,0.005945796,0.1131618],"genre_scores_gemma":[0.06489107,0.01306246,0.7403373,0.001254523,0.0007173093,0.001243362,0.005849401,0.004364954,0.1682797],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.07895497,"threshold_uncertainty_score":0.2641307,"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","authors":[{"name":"Ilan Beer","is_ca":false},{"name":"Shoham Ben-David","is_ca":false},{"name":"Hana Chockler","is_ca":false},{"name":"Avigail Orni","is_ca":false},{"name":"Richard Trefler","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006216609,0.00145224,0.0009317704,0.0029402,0.001556867,0.002664884,0.0016401,0.003020688,0.01190498],"category_scores_gemma":[0.05777351,0.001118632,0.001893097,0.001317873,0.004856687,0.009423453,0.003459459,0.004191761,0.0006395034],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001152938,"about_ca_system_score_gemma":0.001675438,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002231878,"about_ca_topic_score_gemma":0.002216048,"domain_scores_codex":[0.993489,0.003188075,0.0004020366,0.0007612641,0.001569889,0.0005897771],"domain_scores_gemma":[0.9278431,0.0624136,0.001825269,0.005636012,0.001904937,0.0003772281],"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.0003112839,0.0001463931,0.002415688,0.000363968,0.00006177228,0.001102483,0.001277577,0.03578976,0.00315903,0.9236122,0.002191701,0.02956822],"study_design_scores_gemma":[0.0001219319,0.00007086445,0.0003158713,0.000165934,0.00009636149,0.0004191664,0.0003092258,0.1951784,0.01158443,0.7815413,0.01013728,0.00005912449],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.04665187,0.0002321381,0.9386559,0.001773067,0.0002986867,0.0001363497,0.0001177814,0.002383058,0.009751115],"genre_scores_gemma":[0.7854453,0.0003081057,0.2087484,0.0005155609,0.00007899291,0.000224724,0.0001838002,0.0006769624,0.003818072],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01190498,"threshold_uncertainty_score":0.03982615,"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","authors":[{"name":"Jianwen Zhu","is_ca":true},{"name":"Silvian Calman","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00161246,0.001084479,0.001081582,0.002730533,0.001066378,0.002249438,0.002288274,0.001534224,0.006999947],"category_scores_gemma":[0.01329958,0.0005422271,0.001288042,0.004183334,0.004845359,0.007373769,0.002928834,0.004234474,0.001722466],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001989037,"about_ca_system_score_gemma":0.002432604,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003083688,"about_ca_topic_score_gemma":0.001810315,"domain_scores_codex":[0.9972097,0.0007625194,0.0001277837,0.0004222807,0.001282463,0.0001952419],"domain_scores_gemma":[0.9945922,0.00345627,0.0003056517,0.0009533889,0.0006113114,0.00008107318],"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.00006380822,0.00001786275,0.0003760646,0.0002213451,0.0000258563,0.000118319,0.0002099196,0.03842173,0.003344927,0.8525515,0.002406881,0.1022419],"study_design_scores_gemma":[0.00001643495,0.00002778334,0.0001199363,0.00007321766,0.00002599122,0.0001544015,0.00005338191,0.1455557,0.005736926,0.8346058,0.01360132,0.00002918647],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00596276,0.001447648,0.9832675,0.0009112049,0.0001332595,0.00002153438,0.00006328442,0.001130243,0.007062585],"genre_scores_gemma":[0.4353514,0.005721926,0.5371932,0.001033283,0.0005563423,0.0002129286,0.0003330629,0.001392622,0.01820523],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006999947,"threshold_uncertainty_score":0.02341712,"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","authors":[{"name":"Pascal Poupart","is_ca":true},{"name":"Craig Boutilier","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002636338,0.0007753304,0.0008962708,0.0007837781,0.0004386314,0.0009935346,0.001164505,0.0007558402,0.002603927],"category_scores_gemma":[0.01720805,0.0004174262,0.0005761915,0.0008641375,0.001683585,0.002545703,0.001671467,0.001838902,0.0002360028],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001344131,"about_ca_system_score_gemma":0.0009421415,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001122935,"about_ca_topic_score_gemma":0.001033647,"domain_scores_codex":[0.9983141,0.0005579247,0.0001132933,0.0002616442,0.0005938386,0.000159207],"domain_scores_gemma":[0.9871892,0.01021461,0.0007108629,0.001059946,0.0005964366,0.0002288501],"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.0003043413,0.0001026578,0.0007828287,0.0001515125,0.00004104721,0.0002002723,0.0002025289,0.8794257,0.00355008,0.06704315,0.0006337887,0.04756218],"study_design_scores_gemma":[0.00004353007,0.00009582265,0.0001570274,0.00002623428,0.0000113281,0.00003377964,0.00003878673,0.9184276,0.003892104,0.07662103,0.0006421711,0.00001071187],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1241752,0.0002882598,0.8691409,0.0005956923,0.00004384667,0.0002927037,0.0003829865,0.000552195,0.004528292],"genre_scores_gemma":[0.8615552,0.0002013683,0.1356982,0.0001265057,0.00002764863,0.0004075149,0.0004010692,0.00006930174,0.00151317],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002636338,"threshold_uncertainty_score":0.01394248,"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","authors":[{"name":"Josée Desharnais","is_ca":true},{"name":"François Laviolette","is_ca":true},{"name":"Mathieu Tracol","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00332108,0.0009880714,0.001320794,0.001331354,0.0006574453,0.002851733,0.002255013,0.001441759,0.002522876],"category_scores_gemma":[0.01307382,0.0005324904,0.002000431,0.001431562,0.00381068,0.006150481,0.002696239,0.002658708,0.0003296071],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002894669,"about_ca_system_score_gemma":0.001415005,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002708359,"about_ca_topic_score_gemma":0.001502484,"domain_scores_codex":[0.9965947,0.001423524,0.000216316,0.0004634571,0.001069315,0.0002325892],"domain_scores_gemma":[0.9930743,0.004934792,0.0006045417,0.0007551658,0.0004480135,0.0001832297],"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.00005289836,0.00003006542,0.0005353077,0.000122945,0.00004804555,0.00006769463,0.0001396283,0.2396134,0.001417529,0.7435972,0.0002738833,0.01410133],"study_design_scores_gemma":[0.000008409095,0.00002102303,0.00007258428,0.00001481948,0.00001032656,0.00002995573,0.00001626003,0.4904248,0.0007217262,0.5076991,0.0009706601,0.00001040247],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.008849894,0.0003062038,0.9887084,0.0003574229,0.00002065174,0.00002035452,0.00002727058,0.00009558318,0.001614307],"genre_scores_gemma":[0.6094826,0.001256549,0.3839885,0.000336443,0.0001861324,0.0002552904,0.0001876602,0.000147519,0.004159363],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00332108,"threshold_uncertainty_score":0.02100241,"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","authors":[{"name":"Marc Boulé","is_ca":true},{"name":"Željko Žilić","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001147592,0.0005409268,0.0004126763,0.0007950239,0.0004708291,0.001044255,0.0008995703,0.000457571,0.003585333],"category_scores_gemma":[0.00427346,0.0004537972,0.0008514694,0.0003072292,0.0008906989,0.001181253,0.0008135181,0.0008462645,0.001174245],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006042712,"about_ca_system_score_gemma":0.001467096,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001149869,"about_ca_topic_score_gemma":0.002103888,"domain_scores_codex":[0.998584,0.0003213707,0.0001705905,0.0002264693,0.000575147,0.0001223022],"domain_scores_gemma":[0.996443,0.001596129,0.0002658915,0.0008190143,0.0008061152,0.00006997865],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000650636,0.0003356764,0.002905287,0.0008812744,0.0001598908,0.00125305,0.0007868744,0.2413764,0.2549719,0.2433281,0.008455951,0.2448951],"study_design_scores_gemma":[0.0001001596,0.0001743689,0.0002736724,0.00006066623,0.00008985293,0.0001857633,0.00004608906,0.7718745,0.1838554,0.03144341,0.01185884,0.00003726864],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02818723,0.00007516791,0.9589319,0.00008945398,0.00008259172,0.0001648664,0.0002462753,0.007231666,0.004990839],"genre_scores_gemma":[0.5176131,0.0001119069,0.4762763,0.0001295817,0.00003382767,0.0003859123,0.0007430075,0.000813948,0.003892403],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003585333,"threshold_uncertainty_score":0.01199412,"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","authors":[{"name":"Frank Hutter","is_ca":false},{"name":"Domagoj Babić","is_ca":false},{"name":"Holger H. Hoos","is_ca":false},{"name":"Alan J. Hu","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00758256,0.001688191,0.001415598,0.001452838,0.0008031303,0.002295624,0.002492335,0.001457833,0.004024813],"category_scores_gemma":[0.04110152,0.001244307,0.001209163,0.0009921055,0.001896623,0.003462726,0.002679172,0.002988952,0.001707432],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001478906,"about_ca_system_score_gemma":0.002600675,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001204973,"about_ca_topic_score_gemma":0.002098451,"domain_scores_codex":[0.9887085,0.006160284,0.0007832676,0.001700659,0.001985948,0.0006612427],"domain_scores_gemma":[0.9616891,0.02744726,0.001618766,0.007313064,0.001685075,0.0002466739],"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.0008811416,0.0005928265,0.004136806,0.0006075196,0.0001564865,0.0002090046,0.0004198633,0.4537548,0.05005272,0.04730071,0.00370671,0.4381814],"study_design_scores_gemma":[0.0001638075,0.0001352057,0.0004025344,0.00006856963,0.00006270445,0.000101022,0.00004803331,0.9278995,0.02408765,0.04276799,0.004208278,0.00005464419],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.06273591,0.0005731839,0.9232054,0.0003459028,0.00008289206,0.0002850365,0.000109919,0.006736074,0.00592566],"genre_scores_gemma":[0.5308714,0.0002777613,0.4656935,0.0003153843,0.00005868263,0.0003170033,0.0002772977,0.001117722,0.00107123],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.00758256,"threshold_uncertainty_score":0.04010087,"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","authors":[{"name":"Jessica Davies","is_ca":true},{"name":"Fahiem Bacchus","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002005649,0.001406987,0.0008769864,0.0009902192,0.0007481246,0.002907819,0.00226601,0.0008579571,0.01304272],"category_scores_gemma":[0.008636466,0.001181191,0.001505305,0.001822348,0.001851486,0.007027004,0.003709873,0.005107316,0.003878125],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008132008,"about_ca_system_score_gemma":0.001151438,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009480637,"about_ca_topic_score_gemma":0.001765809,"domain_scores_codex":[0.9984905,0.000595006,0.00007839019,0.0002022651,0.0004777816,0.0001560711],"domain_scores_gemma":[0.9958268,0.003141946,0.000129879,0.0006566072,0.0001733283,0.00007148932],"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.0002302732,0.0000979481,0.0003409651,0.0005993866,0.0001063102,0.0001550409,0.0001986145,0.06469928,0.006026857,0.6846311,0.01749203,0.2254222],"study_design_scores_gemma":[0.0000448892,0.00003438634,0.00009335329,0.000124108,0.00004308344,0.0001120655,0.00003804352,0.1961135,0.00482612,0.7737889,0.02475855,0.00002304705],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.008609922,0.0020774,0.9168664,0.001817801,0.0002871327,0.00006427697,0.0002549091,0.001858534,0.06816369],"genre_scores_gemma":[0.2634785,0.003811328,0.7090305,0.001255471,0.0006796024,0.0002037962,0.0008611779,0.001692625,0.0189869],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01304272,"threshold_uncertainty_score":0.04363221,"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","authors":[{"name":"Josée Desharnais","is_ca":true},{"name":"Prakash Panangaden","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005809107,0.001241039,0.001535024,0.003026967,0.001779104,0.006022177,0.002824793,0.001987997,0.003169493],"category_scores_gemma":[0.03092249,0.001326403,0.003452383,0.001821283,0.00514541,0.008285371,0.00411228,0.004127009,0.0004901906],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003892252,"about_ca_system_score_gemma":0.003261731,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003459613,"about_ca_topic_score_gemma":0.002686216,"domain_scores_codex":[0.9927641,0.001697352,0.0005931239,0.001786534,0.002009638,0.001149326],"domain_scores_gemma":[0.9554441,0.02957427,0.005953718,0.002757521,0.004080769,0.002189724],"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.000232979,0.0001272008,0.00184919,0.00008190487,0.0001001896,0.0002910744,0.0005373822,0.04893682,0.003638675,0.9379146,0.0002460163,0.006043979],"study_design_scores_gemma":[0.00005074154,0.00007169098,0.0003282063,0.00002298233,0.00005696553,0.0001032575,0.00008586417,0.3334365,0.002778184,0.6625801,0.0004486378,0.00003692564],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1223168,0.0001232738,0.871603,0.0003118713,0.0000436197,0.00009234758,0.0001568563,0.0004736638,0.004878597],"genre_scores_gemma":[0.9367446,0.0001494965,0.06015585,0.0002118244,0.00009071051,0.0002025716,0.0003048169,0.0001838829,0.001956368],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006022177,"threshold_uncertainty_score":0.0307219,"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","authors":[{"name":"Hyoung Seok Hong","is_ca":false},{"name":"Sung Deok","is_ca":false},{"name":"Insup Lee","is_ca":false},{"name":"Oleg Sokolsky","is_ca":false},{"name":"Hasan Ural","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004200664,0.001090363,0.0009221103,0.001930838,0.0006272664,0.003530663,0.002219088,0.001580212,0.003213038],"category_scores_gemma":[0.01545072,0.0005995518,0.001789463,0.00127821,0.004394501,0.005553229,0.002490011,0.002993259,0.0004772145],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002537353,"about_ca_system_score_gemma":0.001876915,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00258762,"about_ca_topic_score_gemma":0.001721873,"domain_scores_codex":[0.9937125,0.002104479,0.0002782293,0.0006670448,0.002919392,0.0003182622],"domain_scores_gemma":[0.9870854,0.009694752,0.0005474007,0.001744268,0.0007645924,0.0001635781],"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.00004782398,0.00008160293,0.0004223002,0.0001808707,0.00003210661,0.0001238845,0.000172789,0.05813717,0.003302758,0.890506,0.001250821,0.0457418],"study_design_scores_gemma":[0.00003769618,0.00005104974,0.0001014521,0.0001105597,0.00003228602,0.0001547419,0.00003293075,0.3212178,0.006442439,0.661204,0.01059206,0.00002307814],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004086492,0.0003290606,0.9885564,0.0007994407,0.00006020386,0.00006818531,0.00005506806,0.0006227624,0.005422496],"genre_scores_gemma":[0.3185516,0.001247035,0.6737859,0.0007851718,0.0002373339,0.0004148007,0.000326439,0.0003623886,0.004289404],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004200664,"threshold_uncertainty_score":0.02221555,"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","authors":[{"name":"Jonathan D. Hay","is_ca":true},{"name":"Joanne M. Atlee","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00594194,0.001315752,0.001036822,0.001248171,0.001937281,0.00334089,0.002979888,0.002218508,0.004806294],"category_scores_gemma":[0.01910878,0.001437514,0.001360292,0.0008386776,0.004502909,0.008927448,0.007379624,0.003188657,0.001238217],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009895293,"about_ca_system_score_gemma":0.001685398,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001908438,"about_ca_topic_score_gemma":0.002023169,"domain_scores_codex":[0.9914848,0.002044648,0.0006584483,0.001723123,0.002975356,0.001113704],"domain_scores_gemma":[0.9880447,0.0045976,0.0008516408,0.004925237,0.001119583,0.000461205],"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.0004192673,0.00026848,0.007947537,0.0005724625,0.0001812658,0.003990594,0.008668592,0.0460373,0.05297144,0.4845016,0.006691906,0.3877496],"study_design_scores_gemma":[0.0001028502,0.0003043371,0.001569411,0.0002029491,0.0002908354,0.001527619,0.001355892,0.1363119,0.06483605,0.6760885,0.1172466,0.0001631655],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.04638662,0.0002442661,0.9371178,0.0005416847,0.0001282379,0.000176671,0.00005362561,0.004116966,0.01123417],"genre_scores_gemma":[0.3837157,0.0002840742,0.6017392,0.0003216928,0.0001311222,0.0002728219,0.0002429214,0.001723965,0.01156855],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.00594194,"threshold_uncertainty_score":0.03142434,"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","authors":[{"name":"David Bergman","is_ca":true},{"name":"André A. Ciré","is_ca":true},{"name":"Willem‐Jan van Hoeve","is_ca":true},{"name":"J. N. Hooker","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002331166,0.001290156,0.0009211637,0.0009378439,0.0005125495,0.002233756,0.001180822,0.001153868,0.005329804],"category_scores_gemma":[0.00693767,0.000780761,0.001409984,0.001376729,0.001512829,0.00188356,0.001713731,0.002435977,0.0009597537],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001672623,"about_ca_system_score_gemma":0.002404502,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003188208,"about_ca_topic_score_gemma":0.003322856,"domain_scores_codex":[0.9979163,0.0009647105,0.0001156592,0.0002911862,0.0005669259,0.0001452314],"domain_scores_gemma":[0.9974975,0.001930554,0.0001233765,0.0001953457,0.0001755201,0.00007767539],"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.00006806472,0.0000474998,0.00031697,0.0002549387,0.000042285,0.00004691347,0.00007046738,0.5977787,0.001105071,0.3354376,0.002022662,0.06280869],"study_design_scores_gemma":[0.00004399096,0.00003111782,0.00004055738,0.0000411113,0.00001334709,0.00002104125,0.0000125899,0.7817537,0.0009324685,0.2069532,0.01014644,0.00001051811],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002084241,0.0003031764,0.9933587,0.0002029282,0.00003451776,0.00004617758,0.00006888377,0.0002010562,0.003700276],"genre_scores_gemma":[0.1282346,0.0009196142,0.86657,0.000173203,0.00005804828,0.0003000619,0.0003168575,0.0001664535,0.003261163],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005329804,"threshold_uncertainty_score":0.01783001,"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","authors":[{"name":"D. Michael Miller","is_ca":true},{"name":"Rolf Drechsler","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006767796,0.0007563885,0.0006780625,0.001063921,0.0004529214,0.003166985,0.002024682,0.0009012222,0.006319027],"category_scores_gemma":[0.01408265,0.0006945792,0.001139229,0.000717055,0.0008487824,0.003695812,0.002046795,0.001394003,0.002380212],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007717134,"about_ca_system_score_gemma":0.001770047,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007137202,"about_ca_topic_score_gemma":0.0008374617,"domain_scores_codex":[0.9957943,0.001421649,0.0004316932,0.0005991812,0.001499931,0.0002532293],"domain_scores_gemma":[0.9899436,0.00570268,0.0006113566,0.002191426,0.001294852,0.0002560731],"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.0008856023,0.0004978323,0.003754653,0.0007709998,0.0002126144,0.0008781537,0.001274154,0.06790946,0.05897941,0.3480928,0.01257822,0.5041662],"study_design_scores_gemma":[0.0003678457,0.0005978859,0.0007284037,0.0002118008,0.0001918664,0.0006831026,0.0002038868,0.5657857,0.1457762,0.1547095,0.1305783,0.000165471],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00509608,0.00002402502,0.9883147,0.0001009493,0.00002959901,0.00007930167,0.0001048421,0.004960474,0.001290023],"genre_scores_gemma":[0.08255897,0.00006653245,0.9137969,0.00008596139,0.00002157341,0.0001887224,0.0003821636,0.0008111854,0.002088068],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.006767796,"threshold_uncertainty_score":0.03579193,"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","authors":[{"name":"Steve Easterbrook","is_ca":true},{"name":"Marsha Chećhik","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.02986001,0.002607689,0.00242992,0.006302593,0.004169918,0.01263318,0.01016942,0.004837114,0.006741275],"category_scores_gemma":[0.04371566,0.003297857,0.009335136,0.005062703,0.009405332,0.01820185,0.01147223,0.00950287,0.001552686],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004615038,"about_ca_system_score_gemma":0.004481727,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01281597,"about_ca_topic_score_gemma":0.01058492,"domain_scores_codex":[0.9765416,0.01038226,0.002840773,0.00322592,0.005717373,0.001291942],"domain_scores_gemma":[0.97548,0.01543154,0.00200941,0.00387555,0.002412537,0.0007909537],"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.00008364151,0.00005383914,0.0003361922,0.0003244542,0.0001413817,0.000816006,0.001403638,0.02681685,0.00144589,0.9316785,0.002089723,0.03480985],"study_design_scores_gemma":[0.00009506428,0.00004827037,0.00008778226,0.0002702904,0.000138012,0.0003451026,0.0002806858,0.1262946,0.001943535,0.8472071,0.02319736,0.00009214305],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0004707862,0.0001250427,0.9975474,0.0003015988,0.0000341482,0.00009745943,0.00005412905,0.0003779536,0.0009914106],"genre_scores_gemma":[0.02421723,0.0002640527,0.9736265,0.0002152718,0.00009249317,0.000310005,0.0002654781,0.0001156784,0.0008933977],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.02986001,"threshold_uncertainty_score":0.1579167,"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","authors":[{"name":"Michelle L. Crane","is_ca":true},{"name":"Juergen Dingel","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009053471,0.0004388242,0.000484245,0.001006013,0.001097712,0.00506435,0.001518421,0.001407995,0.006841976],"category_scores_gemma":[0.02604463,0.0004702886,0.0006152294,0.0008315231,0.004576698,0.0162193,0.003129556,0.001766144,0.001685305],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001644235,"about_ca_system_score_gemma":0.00224795,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002719676,"about_ca_topic_score_gemma":0.00253401,"domain_scores_codex":[0.9922685,0.004083268,0.0003477383,0.001136976,0.001664648,0.000498887],"domain_scores_gemma":[0.9845365,0.007010451,0.0009104005,0.005242754,0.001672066,0.0006278214],"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.0001089201,0.00001650212,0.0007025843,0.0001107378,0.00002431598,0.00003674707,0.0006840391,0.002255228,0.00123294,0.9474958,0.002988714,0.04434355],"study_design_scores_gemma":[0.00005025595,0.00007477553,0.0006352314,0.0001509408,0.00009550455,0.0001616582,0.0004182911,0.01390212,0.005828127,0.9237132,0.05493135,0.00003855617],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05210856,0.001637796,0.8508759,0.00938705,0.000565997,0.0001374957,0.0005536667,0.003607004,0.08112659],"genre_scores_gemma":[0.7762548,0.001290997,0.1992434,0.001772063,0.0002359492,0.0002257168,0.000528058,0.00110848,0.0193405],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009053471,"threshold_uncertainty_score":0.04787987,"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","authors":[{"name":"Aws Albarghouthi","is_ca":true},{"name":"Kenneth L. McMillan","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001170345,0.001080491,0.0008330743,0.001381977,0.001396968,0.001961925,0.001218671,0.0009976916,0.01887468],"category_scores_gemma":[0.003472302,0.0006129018,0.0008492395,0.001034834,0.003622036,0.004937259,0.00346303,0.004650426,0.007095259],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007247982,"about_ca_system_score_gemma":0.0004619564,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003251567,"about_ca_topic_score_gemma":0.0004323777,"domain_scores_codex":[0.9992871,0.0001539015,0.00003243851,0.0001528636,0.0003007719,0.00007302647],"domain_scores_gemma":[0.9993721,0.000231637,0.00003084943,0.0001879722,0.0001170493,0.00006055777],"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.00003244874,0.000008497785,0.00002583925,0.00006329853,0.000005430099,0.00002560347,0.00008856424,0.0007225429,0.0006172062,0.9617915,0.005491685,0.03112748],"study_design_scores_gemma":[0.00001285137,0.00003664276,0.00004469422,0.00009999262,0.00001449493,0.0001597204,0.00007547789,0.00370041,0.002468795,0.8476599,0.1457054,0.00002156355],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"other","genre_scores_codex":[0.01368611,0.01005341,0.5609403,0.0034783,0.00522448,0.00006726982,0.0003418114,0.001395341,0.4048129],"genre_scores_gemma":[0.317268,0.01395043,0.2943577,0.00231877,0.003077317,0.0002214613,0.0006987783,0.00319125,0.3649162],"genre_candidate":"other","genre_consensus":null,"teacher_disagreement_score":0.01887468,"threshold_uncertainty_score":0.06314206,"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","authors":[{"name":"Marco Benedetti","is_ca":false},{"name":"Hratch Mangassarian","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.03474772,0.001620189,0.001010099,0.002329179,0.001010846,0.006292588,0.004108015,0.003102843,0.005935434],"category_scores_gemma":[0.02679964,0.0006998999,0.0007406559,0.002016255,0.006515711,0.01404786,0.00336442,0.00489675,0.001919359],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00321186,"about_ca_system_score_gemma":0.002220924,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003277296,"about_ca_topic_score_gemma":0.001437273,"domain_scores_codex":[0.9898371,0.005916516,0.0004824648,0.0007249531,0.002580361,0.0004586078],"domain_scores_gemma":[0.9711158,0.01899288,0.0004403239,0.002437769,0.005743041,0.001270124],"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.0004849376,0.0006130203,0.002307947,0.0012992,0.00007974484,0.0004737985,0.004751356,0.01274608,0.003054732,0.4310614,0.01502208,0.5281057],"study_design_scores_gemma":[0.0002632258,0.001007247,0.001127275,0.002794784,0.00005248359,0.001308011,0.004109359,0.03983252,0.009937045,0.5017534,0.4375811,0.0002336025],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03003579,0.2359083,0.5909734,0.04121311,0.000990858,0.0001407565,0.0001569304,0.0007763334,0.09980455],"genre_scores_gemma":[0.3932811,0.2156586,0.3651131,0.004702924,0.002239456,0.0002331483,0.0005736348,0.0004177411,0.0177804],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.03474772,"threshold_uncertainty_score":0.1837657,"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","authors":[{"name":"Ilan Beer","is_ca":false},{"name":"Shoham Ben-David","is_ca":true},{"name":"Hana Chockler","is_ca":false},{"name":"Avigail Orni","is_ca":false},{"name":"Richard Trefler","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001758406,0.001289206,0.0007310675,0.002338306,0.001364591,0.00272211,0.001577418,0.002554806,0.02267878],"category_scores_gemma":[0.01522102,0.0009616439,0.00183509,0.001494007,0.003107476,0.008268015,0.002953893,0.003177947,0.001592467],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008632705,"about_ca_system_score_gemma":0.0009100396,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001602915,"about_ca_topic_score_gemma":0.001659251,"domain_scores_codex":[0.998582,0.0004363444,0.00009058161,0.0002742035,0.000411927,0.0002050311],"domain_scores_gemma":[0.9882081,0.009641064,0.0003667249,0.001215291,0.0004560768,0.0001126455],"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.0001487157,0.00006671904,0.001080071,0.0002233139,0.00003136691,0.0009811905,0.0009033084,0.01340068,0.00277615,0.9345152,0.004915905,0.04095737],"study_design_scores_gemma":[0.00003926683,0.00002667779,0.0002329752,0.0001109761,0.0000660875,0.0005308327,0.0002424306,0.07656246,0.007628412,0.8931327,0.02138489,0.00004212997],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.05166559,0.000548334,0.8878499,0.002508243,0.000545622,0.000188601,0.0003857953,0.006014084,0.05029381],"genre_scores_gemma":[0.7141605,0.0007580229,0.2622559,0.0006029378,0.0001570867,0.0001932028,0.00060076,0.001723733,0.01954782],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.02267878,"threshold_uncertainty_score":0.07586801,"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","authors":[{"name":"Ahmed Abdelkhalek","is_ca":true},{"name":"Yu Sasaki","is_ca":false},{"name":"Yosuke Todo","is_ca":false},{"name":"Mohamed F. Tolba","is_ca":true},{"name":"Amr Youssef","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001117095,0.001410657,0.001107452,0.0005762527,0.000436199,0.001526434,0.001191028,0.001098318,0.007640539],"category_scores_gemma":[0.002497629,0.0006657249,0.000935212,0.0006901822,0.0009720257,0.001615107,0.001036364,0.001854731,0.0008109061],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001397619,"about_ca_system_score_gemma":0.001858787,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002339202,"about_ca_topic_score_gemma":0.0030775,"domain_scores_codex":[0.9993371,0.0001797913,0.00002429007,0.0001133508,0.0002224204,0.0001229759],"domain_scores_gemma":[0.9989291,0.0006872144,0.000127989,0.00005611301,0.0001451831,0.00005435352],"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.00002890993,0.00001423699,0.000130034,0.00004431176,0.0000106413,0.00005633278,0.00001707598,0.9694524,0.0009020593,0.02422202,0.0005666245,0.004555305],"study_design_scores_gemma":[0.000005766577,0.000009932625,0.00001587804,0.00000575985,0.000004391167,0.000008034216,0.00000589136,0.9920411,0.0003804942,0.007037629,0.0004826833,0.000002529921],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0116555,0.0002058036,0.9795273,0.0002262641,0.00003557454,0.00007320754,0.0001500419,0.0002649732,0.00786139],"genre_scores_gemma":[0.6303756,0.0004642498,0.3551708,0.0003077555,0.00005093323,0.0005769794,0.0004087224,0.0003038815,0.01234095],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007640539,"threshold_uncertainty_score":0.02556014,"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","authors":[{"name":"Marsha Chećhik","is_ca":true},{"name":"Steve Easterbrook","is_ca":true},{"name":"Victor Petrovykh","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00483419,0.00143223,0.001442638,0.001824787,0.001094235,0.004289419,0.003190373,0.001442021,0.003946953],"category_scores_gemma":[0.01617589,0.001850485,0.003307934,0.001938925,0.003095133,0.01074361,0.003930584,0.003981693,0.0005246436],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003257471,"about_ca_system_score_gemma":0.001975806,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003005142,"about_ca_topic_score_gemma":0.004097455,"domain_scores_codex":[0.9934603,0.00210435,0.0005196069,0.001013778,0.002379651,0.000522412],"domain_scores_gemma":[0.9848914,0.01174327,0.000743792,0.001733819,0.0006854662,0.0002022734],"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.0006908532,0.0001673595,0.001723426,0.0008673669,0.000306723,0.0004115672,0.0004437391,0.2179129,0.01497785,0.6273283,0.002821776,0.1323481],"study_design_scores_gemma":[0.0001180657,0.00005237882,0.0001720865,0.0001148202,0.00012474,0.0001214568,0.00005883613,0.3771989,0.0204604,0.59873,0.002808788,0.00003948941],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02965333,0.0005614962,0.9621446,0.0004304854,0.00009828591,0.00008844201,0.0002315419,0.002728048,0.004063739],"genre_scores_gemma":[0.6686873,0.0006366954,0.3246626,0.0002963143,0.00009803573,0.0001742585,0.0005783825,0.0005841553,0.00428219],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.00483419,"threshold_uncertainty_score":0.02556592,"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","authors":[{"name":"Liang Jia","is_ca":true},{"name":"Vijay Ganesh","is_ca":true},{"name":"Pascal Poupart","is_ca":true},{"name":"Krzysztof Czarnecki","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002992206,0.001314527,0.001177268,0.001397001,0.0006936719,0.001356537,0.002385614,0.001367823,0.005983329],"category_scores_gemma":[0.010811,0.0007078224,0.001073709,0.001739197,0.001128991,0.002337346,0.001339506,0.003482911,0.001237304],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00202946,"about_ca_system_score_gemma":0.003089144,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004352357,"about_ca_topic_score_gemma":0.008227794,"domain_scores_codex":[0.9980939,0.0008693718,0.00009662884,0.000298038,0.0004100681,0.000232],"domain_scores_gemma":[0.9939434,0.004654277,0.0002864901,0.0004954124,0.000423331,0.0001970017],"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.0005428503,0.0003298715,0.00203478,0.0003573224,0.0001057723,0.0001288117,0.000203023,0.6389019,0.003938026,0.065805,0.0104467,0.2772059],"study_design_scores_gemma":[0.00008838598,0.00006714489,0.0001307117,0.00003103522,0.00002166343,0.00002759132,0.00002989904,0.9579946,0.001129206,0.03856017,0.001909583,0.000009987663],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05583769,0.001478861,0.9253277,0.001122404,0.000146914,0.0003005163,0.0003642335,0.003374012,0.01204763],"genre_scores_gemma":[0.3195892,0.0005255864,0.6730819,0.0007547639,0.00009647089,0.0004772591,0.001037945,0.0006303519,0.003806517],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005983329,"threshold_uncertainty_score":0.02001619,"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","authors":[{"name":"Arie Gurfinkel","is_ca":true},{"name":"Marsha Chećhik","is_ca":true},{"name":"Benet Devereux","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008106193,0.001641196,0.00144808,0.002991338,0.001258714,0.003432382,0.003845726,0.001763169,0.005249583],"category_scores_gemma":[0.03484001,0.001623049,0.003377285,0.002419559,0.005528235,0.009750882,0.006420494,0.005205478,0.0009561746],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001736437,"about_ca_system_score_gemma":0.00289491,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003490327,"about_ca_topic_score_gemma":0.003048197,"domain_scores_codex":[0.9913693,0.003300776,0.0007333376,0.001294448,0.002796743,0.0005054129],"domain_scores_gemma":[0.9650836,0.02589614,0.001647098,0.005233979,0.001718241,0.0004209621],"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.0006734086,0.0002677476,0.002942641,0.001012972,0.0002900989,0.001152461,0.001755689,0.08064788,0.01791601,0.6163363,0.01572727,0.2612774],"study_design_scores_gemma":[0.0001570236,0.0001491202,0.000233536,0.0001991135,0.0001178575,0.0005478488,0.0001946078,0.5701344,0.02741492,0.3762074,0.02454856,0.00009561584],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001950414,0.00009049918,0.9902238,0.0002543266,0.00002799582,0.00009045768,0.0001415946,0.006410328,0.0008105014],"genre_scores_gemma":[0.1111023,0.0002703744,0.8848001,0.0003835187,0.00007700578,0.0004222654,0.0005573101,0.001161602,0.001225354],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008106193,"threshold_uncertainty_score":0.0428701,"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","authors":[{"name":"Arie Gurfinkel","is_ca":true},{"name":"Marsha Chećhik","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002977377,0.001211459,0.001520068,0.001585923,0.0007949512,0.003039024,0.003560174,0.001163727,0.004644264],"category_scores_gemma":[0.00803413,0.001304271,0.002844665,0.001575967,0.003310574,0.007120248,0.003692728,0.003961438,0.0009747391],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001772847,"about_ca_system_score_gemma":0.00141738,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001112663,"about_ca_topic_score_gemma":0.001784421,"domain_scores_codex":[0.9946695,0.00148678,0.0003081796,0.0008285691,0.00233189,0.0003750878],"domain_scores_gemma":[0.9949766,0.002686491,0.0002312251,0.001573714,0.0004630794,0.00006901458],"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.0002564458,0.0001390385,0.0003855788,0.0005109092,0.0002074578,0.0002207042,0.0002306576,0.1074732,0.0116044,0.7460629,0.002583215,0.1303254],"study_design_scores_gemma":[0.00005783704,0.00003835715,0.00009606217,0.00006889226,0.00007292387,0.0001069739,0.00001925438,0.4236438,0.01729686,0.5555657,0.00300023,0.0000331763],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.005724904,0.0002445845,0.9886444,0.0001230831,0.00006330545,0.00004663722,0.00006445402,0.001269602,0.003819006],"genre_scores_gemma":[0.4141171,0.0004669984,0.5783647,0.0002554506,0.000078269,0.0002303859,0.00026237,0.0004914454,0.00573332],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.004644264,"threshold_uncertainty_score":0.01574606,"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","authors":[{"name":"Amy Felty","is_ca":true},{"name":"Kedar S. Namjoshi","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005623145,0.001245722,0.001009199,0.003528077,0.0009204544,0.001968911,0.002394823,0.001359735,0.003245397],"category_scores_gemma":[0.0290672,0.001266942,0.001582099,0.002751593,0.001591249,0.00393622,0.002495034,0.001591492,0.0008590099],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001110883,"about_ca_system_score_gemma":0.002126701,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003795638,"about_ca_topic_score_gemma":0.003432441,"domain_scores_codex":[0.9878262,0.003862282,0.001170929,0.001280473,0.0052341,0.0006259946],"domain_scores_gemma":[0.9756245,0.01436227,0.002800654,0.004388364,0.002603588,0.0002205365],"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.0007868587,0.0004064822,0.03411559,0.00124127,0.0003058965,0.002074234,0.002550129,0.1458248,0.07926623,0.1120754,0.009626948,0.611726],"study_design_scores_gemma":[0.0001727039,0.0002758825,0.003830814,0.0001445275,0.0001275776,0.001429207,0.0004396462,0.7863252,0.1051512,0.08068908,0.02125844,0.0001557555],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02001463,0.00008185664,0.9735869,0.00009555811,0.00001350848,0.00008522848,0.0002255251,0.004953034,0.0009438202],"genre_scores_gemma":[0.2358938,0.0001304306,0.7597038,0.0001152539,0.00001883302,0.0002902469,0.001780614,0.0007436755,0.001323411],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005623145,"threshold_uncertainty_score":0.02973843,"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","authors":[{"name":"Vitor Lima","is_ca":true},{"name":"Chamseddine Talhi","is_ca":true},{"name":"Djedjiga Mouheb","is_ca":true},{"name":"Mourad Debbabi","is_ca":true},{"name":"Liangzhu Wang","is_ca":true},{"name":"Makan Pourzandi","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009320548,0.001250397,0.0005273927,0.002007754,0.0008847868,0.002217541,0.001369344,0.001090633,0.002253077],"category_scores_gemma":[0.02184527,0.000869928,0.001421542,0.0007530496,0.002042515,0.002073106,0.001383698,0.001330841,0.0006785758],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001859699,"about_ca_system_score_gemma":0.004795347,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006426176,"about_ca_topic_score_gemma":0.005223616,"domain_scores_codex":[0.989539,0.004623436,0.0009038093,0.0009028729,0.003575459,0.0004554779],"domain_scores_gemma":[0.984529,0.008935026,0.001862051,0.002117143,0.002393083,0.000163863],"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.0005919149,0.0003190889,0.007023258,0.001278529,0.0001436771,0.001557841,0.002790472,0.2558668,0.06546874,0.5255309,0.003809913,0.1356188],"study_design_scores_gemma":[0.0002477135,0.0003517658,0.001731338,0.0005332121,0.0001656052,0.0007014637,0.0002757031,0.6949037,0.1205441,0.1189133,0.06147555,0.0001564438],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.012021,0.0001009248,0.9833195,0.0001045239,0.00005511126,0.0002145766,0.0002123842,0.002482529,0.001489446],"genre_scores_gemma":[0.311042,0.000481217,0.6823802,0.0001238651,0.00005469843,0.0008450512,0.001175419,0.0007547326,0.003142895],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.009320548,"threshold_uncertainty_score":0.04929233,"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","authors":[{"name":"Domagoj Babić","is_ca":true},{"name":"Alan J. Hu","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002085756,0.0009382935,0.0006666925,0.00154654,0.0007048415,0.001692274,0.001185581,0.0008334944,0.009093189],"category_scores_gemma":[0.005746837,0.0008629301,0.001240545,0.001034366,0.00320989,0.004994316,0.00209978,0.003113237,0.002406552],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001352053,"about_ca_system_score_gemma":0.001263579,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006047566,"about_ca_topic_score_gemma":0.0006410739,"domain_scores_codex":[0.997916,0.0005937649,0.000150614,0.0002917079,0.000815409,0.0002325208],"domain_scores_gemma":[0.9966484,0.001821936,0.0001886035,0.0007685289,0.0004857813,0.00008673823],"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.00003912692,0.00001614891,0.00007232596,0.00009562555,0.000007795575,0.0000662873,0.0001823988,0.003467957,0.002340998,0.9646292,0.001589689,0.0274926],"study_design_scores_gemma":[0.0000269355,0.00004017896,0.0001169926,0.00006673604,0.00003169942,0.0001257738,0.00004218127,0.02188582,0.005637656,0.9499218,0.02208815,0.00001598847],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.008148692,0.000495405,0.9576575,0.0003277886,0.000191639,0.0001021956,0.0001090465,0.001064723,0.03190315],"genre_scores_gemma":[0.5246643,0.001134174,0.4496519,0.0003358016,0.0004475508,0.0004263465,0.000588118,0.0006866127,0.02206507],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.009093189,"threshold_uncertainty_score":0.03041977,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}