{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":42,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":42,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"query_hash":"01b6e37955eb","filters":{"venue":"International Journal on Software Tools for Technology Transfer"}},"results":[{"id":"W1577404745","doi":"10.1007/s10009-007-0044-z","title":"The software model checker Blast","year":2007,"lang":"en","type":"article","venue":"International Journal on Software Tools for Technology Transfer","topic":"Software Testing and Debugging Techniques","field":"Computer Science","cited_by":594,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Predicate abstraction; Predicate (mathematical logic); Programming language; Memory safety; Model checking; Programmer; Program analysis; Symbolic execution; Static analysis; Software","retraction":null,"screen_n_in":null,"score":{"opus":0.0292661240647697,"gpt":0.3019749021356067,"spread":0.272708778070837,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001304751,0.0002882028,0.000227223,0.0005495513,0.0006265812,0.0006346113,0.003376931,0.0003183575,0.00000516752],"category_scores_gemma":[0.002479609,0.0002097764,0.0002735305,0.0003686378,0.0002213255,0.0006114863,0.0001441744,0.0008166314,0.00002634934],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002116833,"about_ca_system_score_gemma":0.0001578328,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000148654,"about_ca_topic_score_gemma":0.000006861332,"domain_scores_codex":[0.9975857,0.00002261766,0.0006160554,0.0004322928,0.0007136144,0.0006297166],"domain_scores_gemma":[0.9971406,0.001131021,0.0001172259,0.0005876943,0.0008975687,0.0001259258],"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.0002173323,0.0001852705,0.001616816,0.000006059486,0.0002118439,0.0001423882,0.000166019,0.00056613,0.000144486,0.1697166,0.01446239,0.8125647],"study_design_scores_gemma":[0.002718662,0.001110028,0.001134573,0.0003471548,0.0000483385,0.002425137,0.00003723467,0.02204656,0.02035416,0.839809,0.1088631,0.001106037],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.007489565,0.0001519657,0.9785917,0.004840612,0.001246469,0.0002508382,0.00002076642,0.007317055,0.00009095945],"genre_scores_gemma":[0.262687,0.00009126679,0.7343988,0.002031089,0.0002855171,0.00008012202,0.000006807586,0.00005315768,0.00036629],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8114586,"threshold_uncertainty_score":0.8554432,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2067623660","doi":"10.1007/s100090050045","title":"Formalization and validation of the General Inter-ORB Protocol (GIOP) using PROMELA and SPIN","year":2000,"lang":"en","type":"article","venue":"International Journal on Software Tools for Technology Transfer","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":51,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Promela; Computer science; Common Object Request Broker Architecture; Model checking; Programming language; Protocol (science); Formal verification; Linear temporal logic; Formal specification; Theoretical computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.03510101619760418,"gpt":0.342277098449961,"spread":0.3071760822523568,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003824209,0.0001199279,0.0001302127,0.0002429602,0.0001358606,0.0001589201,0.0006560532,0.000139496,0.00001792502],"category_scores_gemma":[0.0001717661,0.00008949785,0.00006133223,0.0002091647,0.0001324214,0.0009568074,0.00005032383,0.000205538,8.134017e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006621621,"about_ca_system_score_gemma":0.00004614441,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001784993,"about_ca_topic_score_gemma":6.428301e-7,"domain_scores_codex":[0.9989363,0.00005528078,0.0004032528,0.0002025559,0.0002625982,0.0001400064],"domain_scores_gemma":[0.99935,0.00004399201,0.0001089674,0.0001968411,0.0002704592,0.00002973618],"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.0002296605,0.0001234594,0.004011258,0.00004590412,0.00008946114,0.00000309944,0.0003612586,0.0007521097,0.00690684,0.1190766,0.00002658077,0.8683738],"study_design_scores_gemma":[0.006948893,0.001979334,0.01392107,0.0008894952,0.00008218274,0.002672499,0.00006701586,0.1122046,0.7310315,0.09560372,0.03377856,0.0008211356],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.3197868,0.000006176845,0.6756921,0.0005418721,0.0001718145,0.003716978,0.000007843362,0.00005296338,0.00002343388],"genre_scores_gemma":[0.4180379,0.00002575136,0.578459,0.0002752698,0.000105627,0.002984639,0.000004049514,0.00002284114,0.00008497323],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8675526,"threshold_uncertainty_score":0.3649617,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2043554371","doi":"10.1007/s10009-006-0002-1","title":"MDA-based Automatic OWL Ontology Development","year":2006,"lang":"en","type":"article","venue":"International Journal on Software Tools for Technology Transfer","topic":"Semantic Web and Ontologies","field":"Computer Science","cited_by":48,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; OWL-S; Metamodeling; Process ontology; Ontology; Ontology Inference Layer; Programming language; Ontology-based data integration; Web Ontology Language; Upper ontology; Suggested Upper Merged Ontology; Software engineering; Semantic Web; Information retrieval; Semantic Web Stack","retraction":null,"screen_n_in":null,"score":{"opus":0.01995519643688351,"gpt":0.2646745578526939,"spread":0.2447193614158104,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002684869,0.0002234732,0.0002777365,0.0006904933,0.0001928535,0.0002608187,0.001914405,0.0002659464,0.00004151323],"category_scores_gemma":[0.0002493773,0.0001878778,0.0001662049,0.0002070638,0.0001175436,0.0003931855,0.00004852361,0.0003345311,0.00005790022],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000197988,"about_ca_system_score_gemma":0.000264327,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004121554,"about_ca_topic_score_gemma":0.0000385422,"domain_scores_codex":[0.9982227,0.0000297018,0.0005647143,0.0003470615,0.0004352718,0.0004005666],"domain_scores_gemma":[0.9988221,0.0003795478,0.00008805705,0.0002814973,0.0003794086,0.00004941196],"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.00009065751,0.0005143389,0.006779005,0.00002005836,0.000240442,0.0003747625,0.00009484251,0.000597476,0.0005439864,0.2421977,0.002255598,0.7462911],"study_design_scores_gemma":[0.01431506,0.002258695,0.06298698,0.0006789289,0.0001086195,0.003664657,0.0001347747,0.01839223,0.1886266,0.2764248,0.4300939,0.002314732],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1350698,0.0001133164,0.8531663,0.009268822,0.001285353,0.0001793391,0.000006641536,0.0007592354,0.0001511782],"genre_scores_gemma":[0.7065797,0.000005653117,0.2918718,0.001206,0.0001123514,0.00008016996,0.0000113695,0.00001607416,0.0001169174],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7439764,"threshold_uncertainty_score":0.7661434,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3030250248","doi":"10.1007/s10009-020-00563-2","title":"An efficient statistical model checker for nondeterminism and rare events","year":2020,"lang":"en","type":"article","venue":"International Journal on Software Tools for Technology Transfer","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":39,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"Exploratory Research for Advanced Technology; Agencia Nacional de Promoción Científica y Tecnológica; RWTH Aachen University; Singapore University of Technology and Design; Westfälische Wilhelms-Universität Münster; Nederlandse Organisatie voor Wetenschappelijk Onderzoek; University of Twente","keywords":"Nondeterministic algorithm; Computer science; Rotation formalisms in three dimensions; Model checking; Modular design; Theoretical computer science; Statistical model; Rare events; Programming language; Parallel computing; Distributed computing; Algorithm; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.05361837148655482,"gpt":0.3428786260165246,"spread":0.2892602545299698,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003124771,0.0001707643,0.0001970298,0.0002056215,0.0001450641,0.000180728,0.001197605,0.0001895993,0.000006605593],"category_scores_gemma":[0.0005981322,0.0001561268,0.00008859325,0.0001088183,0.00008399936,0.0005157102,0.00004883445,0.0003078207,0.000005069575],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006694831,"about_ca_system_score_gemma":0.00008120617,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":1.411944e-7,"about_ca_topic_score_gemma":1.73978e-7,"domain_scores_codex":[0.9985801,0.00003087289,0.0003876547,0.0004030642,0.0003447903,0.0002535461],"domain_scores_gemma":[0.9990935,0.0001214202,0.00006478828,0.000206977,0.0003618121,0.0001515475],"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.000474915,0.0002246754,0.0001556512,0.00002690631,0.0001034178,0.0000223451,0.0005406434,0.006799439,0.001429172,0.7428433,0.0001759693,0.2472035],"study_design_scores_gemma":[0.001801702,0.001160025,0.0003064847,0.00003408728,0.00002009253,0.0001557994,0.00002966394,0.9580754,0.008026085,0.02776224,0.002382045,0.0002463501],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.04705151,0.00001940661,0.948691,0.002947783,0.0004379567,0.0003915293,0.0002208556,0.0002315878,0.00000837539],"genre_scores_gemma":[0.3345949,0.000009755969,0.664122,0.001079475,0.00007297528,0.00008382089,0.00001438109,0.00001603331,0.000006715864],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.951276,"threshold_uncertainty_score":0.6366667,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1998421080","doi":"10.1007/s10009-010-0164-8","title":"Towards an industrial grade IVE for Java and next generation research platform for JML","year":2010,"lang":"en","type":"article","venue":"International Journal on Software Tools for Technology Transfer","topic":"Software Testing and Debugging Techniques","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Programming language; Java; Java Modeling Language; Compiler; Assertion; Eclipse; Java annotation; Real time Java; Software engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.2650837728989613,"gpt":0.4006144419160369,"spread":0.1355306690170756,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001577094,0.0002162837,0.0002454755,0.0008879078,0.0005152882,0.0008682634,0.001521902,0.0005621305,0.000005364119],"category_scores_gemma":[0.00368549,0.0001934642,0.0001497727,0.0002336565,0.0001936281,0.001229302,0.00007704188,0.000985408,0.000001532696],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001058356,"about_ca_system_score_gemma":0.0002488983,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008895621,"about_ca_topic_score_gemma":0.00001976546,"domain_scores_codex":[0.998048,0.00002857305,0.000449239,0.000512246,0.0005018645,0.0004600743],"domain_scores_gemma":[0.9968562,0.001193717,0.00008044822,0.0003477555,0.00138894,0.0001329406],"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.0002693502,0.0001883902,0.0002785229,0.000009299957,0.00009438912,0.00001063546,0.0002878642,0.00001121231,0.006540154,0.1518312,0.006181159,0.8342978],"study_design_scores_gemma":[0.006112284,0.005436201,0.0001811653,0.0001448395,0.00004015399,0.0008641277,0.00004703387,0.02192391,0.07756431,0.7921787,0.09482796,0.0006793308],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1610363,0.00002931486,0.8275391,0.006875375,0.001743326,0.0008814827,0.0001029006,0.001783107,0.000009103049],"genre_scores_gemma":[0.4953875,0.00002428638,0.502119,0.0004789975,0.001261052,0.0005979417,0.00005544561,0.00003861417,0.00003717243],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8336185,"threshold_uncertainty_score":0.8372684,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2087702998","doi":"10.1007/s10009-002-0087-0","title":"A framework for superscalar microprocessor correctness statements","year":2003,"lang":"en","type":"article","venue":"International Journal on Software Tools for Technology Transfer","topic":"Embedded Systems Design Techniques","field":"Computer Science","cited_by":35,"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":"Natural Sciences and Engineering Research Council of Canada; University of Pennsylvania","keywords":"Correctness; Computer science; Superscalar; Theory of computation; Implementation; Microprocessor; Parameterized complexity; Programming language; Set (abstract data type); Parallel computing; Variety (cybernetics); Formal verification; Instruction set; Computer architecture; Embedded system; Algorithm; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.04298718330889807,"gpt":0.355705237261135,"spread":0.312718053952237,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006924882,0.0002837248,0.0003356481,0.0006616687,0.0002168589,0.0004487046,0.002191155,0.0004178885,0.00002669371],"category_scores_gemma":[0.001472592,0.0002568965,0.0002664334,0.0003259751,0.0000873231,0.001026368,0.00003514365,0.0005235758,0.00001681081],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002391828,"about_ca_system_score_gemma":0.0001656676,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":6.217961e-7,"about_ca_topic_score_gemma":0.000001365546,"domain_scores_codex":[0.9978222,0.00005988259,0.0006432447,0.0004960765,0.0004951999,0.0004834266],"domain_scores_gemma":[0.9976476,0.000623626,0.0001211959,0.000395756,0.001113765,0.00009808412],"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.0001828945,0.0003030034,0.0005198765,0.00004009514,0.0003502165,0.00005925225,0.0002770663,0.00003442662,0.002912352,0.9192097,0.001893987,0.07421713],"study_design_scores_gemma":[0.002639387,0.00122567,0.00002243804,0.000434046,0.00003280343,0.0008812361,0.0001295327,0.0002564349,0.2404776,0.6413426,0.1119622,0.0005960236],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01139543,0.0001434196,0.982479,0.002079503,0.002174709,0.0008399769,0.00008101665,0.0007520178,0.00005496892],"genre_scores_gemma":[0.3573877,0.00005421789,0.6406035,0.001030546,0.000113164,0.0005793018,0.000009273597,0.00005024307,0.0001720685],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3459922,"threshold_uncertainty_score":0.9999883,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1273632282","doi":"10.1007/s10009-014-0347-9","title":"Cloned product variants: from ad-hoc to managed software product lines","year":2015,"lang":"en","type":"article","venue":"International Journal on Software Tools for Technology Transfer","topic":"Advanced Software Engineering Methodologies","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo; University of Toronto","funders":"","keywords":"Software product line; Code refactoring; Computer science; Cloning (programming); Product (mathematics); Software engineering; Software; Representation (politics); Operator (biology); Focus (optics); New product development; Software development; Programming language; Business; Mathematics; Biology","retraction":null,"screen_n_in":null,"score":{"opus":0.06308820971383697,"gpt":0.317853069119804,"spread":0.254764859405967,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaresearch","metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009451029,0.0004584176,0.000526061,0.0009807193,0.0001696889,0.0004027456,0.003590917,0.0002381004,0.00001299971],"category_scores_gemma":[0.0136183,0.0004146359,0.000211585,0.0007071901,0.0001086469,0.001375019,0.0002729833,0.0008436439,0.00008632879],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003475361,"about_ca_system_score_gemma":0.000213384,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002648254,"about_ca_topic_score_gemma":0.000005558433,"domain_scores_codex":[0.996731,0.0001110873,0.0007144617,0.00099361,0.0008343459,0.0006155164],"domain_scores_gemma":[0.9963421,0.0009478468,0.0001213501,0.0009412375,0.001389066,0.000258397],"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.0007752405,0.0003115659,0.0005462067,0.00002019575,0.0005891344,0.0004083409,0.0007059834,0.02312212,0.002500508,0.007549734,0.003886593,0.9595844],"study_design_scores_gemma":[0.01015218,0.003902656,0.005152314,0.0009251386,0.0001779472,0.001826245,0.0003079392,0.0006147752,0.1040567,0.5055756,0.3639019,0.003406551],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02499883,0.0008732463,0.9522167,0.0131511,0.005460983,0.0006707975,0.0001230706,0.00249732,0.000007991555],"genre_scores_gemma":[0.03939732,0.0001184439,0.9581973,0.001098946,0.0006265382,0.0002161831,0.0000311349,0.0000769655,0.0002371736],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9561778,"threshold_uncertainty_score":0.9998305,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2028045996","doi":"10.1007/s10009-007-0047-9","title":"A framework for counterexample generation and exploration","year":2007,"lang":"en","type":"article","venue":"International Journal on Software Tools for Technology Transfer","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Counterexample; Debugging; Mathematical proof; Computer science; Property (philosophy); Programming language; Theoretical computer science; Model checking; Algorithm; Mathematics; Discrete mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.1044817341754693,"gpt":0.368031216693099,"spread":0.2635494825176297,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001021614,0.0001424813,0.000141698,0.0004675232,0.0002060541,0.0003486574,0.0007173965,0.0002596911,0.000005183776],"category_scores_gemma":[0.00116746,0.0001350749,0.0000856541,0.0001772989,0.00006669459,0.001417004,0.00002753549,0.0002767797,0.000004044753],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001279474,"about_ca_system_score_gemma":0.00004198514,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":5.195879e-7,"about_ca_topic_score_gemma":0.0000037536,"domain_scores_codex":[0.9987307,0.00002036754,0.0004174435,0.0002963257,0.0002934184,0.000241784],"domain_scores_gemma":[0.9985827,0.0004306261,0.00009268582,0.0002161177,0.0006202236,0.00005767488],"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.0001005306,0.00004327491,0.0000684621,0.000004318033,0.00004060657,0.000003171865,0.0001528694,0.00004253035,0.001633756,0.6751723,0.0001359626,0.3226022],"study_design_scores_gemma":[0.002613334,0.001694986,0.0008119663,0.0001466813,0.00003392067,0.0004818481,0.0001472233,0.01716223,0.1291459,0.7588444,0.08836135,0.0005562326],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0224307,0.00006265346,0.9708614,0.004186642,0.001778055,0.0004105464,0.00002669921,0.0002301061,0.00001322012],"genre_scores_gemma":[0.1740339,0.0000595839,0.8245085,0.0008824763,0.0003598753,0.0001037478,0.00001843106,0.00001606669,0.00001738263],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.322046,"threshold_uncertainty_score":0.5508193,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2083965123","doi":"10.1007/s10009-012-0240-3","title":"Model-based testing of software and systems: recent advances and challenges","year":2012,"lang":"en","type":"article","venue":"International Journal on Software Tools for Technology Transfer","topic":"Software Testing and Debugging Techniques","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Computer Research Institute of Montréal","funders":"","keywords":"Computer science; Software testing; Variety (cybernetics); System integration testing; Software engineering; Automation; Software; Test strategy; Model-based testing; Software performance testing; Software system; Data science; Software construction; Test case; Artificial intelligence; Machine learning; Programming language; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.09062809914528827,"gpt":0.3066170323655871,"spread":0.2159889332202988,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005585232,0.0002000121,0.0002739789,0.000478027,0.0001269254,0.0001211829,0.0006612934,0.0001862121,9.31975e-7],"category_scores_gemma":[0.002390305,0.0001740273,0.00005450909,0.0001648788,0.0001462416,0.0007605766,0.00007102409,0.000283104,5.955527e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005886269,"about_ca_system_score_gemma":0.00006848658,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000103429,"about_ca_topic_score_gemma":5.375247e-7,"domain_scores_codex":[0.9986464,0.00003330564,0.000398442,0.000277717,0.0003347118,0.0003093914],"domain_scores_gemma":[0.9976711,0.001247352,0.0001271667,0.0002288893,0.0006240807,0.0001014434],"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.00004513143,0.0001259648,0.01204493,0.0001290215,0.0000572957,0.000007597847,0.0001310409,0.0005487833,0.00006708664,0.0132204,0.00009431379,0.9735284],"study_design_scores_gemma":[0.01161899,0.007573233,0.01290987,0.008920372,0.0003358869,0.007205257,0.0003241542,0.1926237,0.02561154,0.5747255,0.1541057,0.004045667],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01592528,0.0211353,0.9580212,0.001927911,0.0005165031,0.0002006916,0.0000256443,0.002228619,0.00001888835],"genre_scores_gemma":[0.5096116,0.003302326,0.4867545,0.0001733362,0.00007412962,0.00005783578,0.000001983768,0.00002013079,0.000004079446],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9694828,"threshold_uncertainty_score":0.7096627,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2067284301","doi":"10.1007/s10009-008-0082-1","title":"Framework testing of web applications using TTCN-3","year":2008,"lang":"en","type":"article","venue":"International Journal on Software Tools for Technology Transfer","topic":"Advanced Software Engineering Methodologies","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Software engineering; Web application; Test script; Web service; Test case; Programming language; Database; Operating system; Machine learning","retraction":null,"screen_n_in":null,"score":{"opus":0.1185398341294807,"gpt":0.3479252943717749,"spread":0.2293854602422942,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002775865,0.0001787539,0.0002620543,0.0005944833,0.0001859116,0.00004982845,0.001685146,0.0002371635,0.000005049101],"category_scores_gemma":[0.003303722,0.000172128,0.0001440005,0.0006239214,0.0001741196,0.0005229734,0.00008064502,0.0005510272,0.000004393423],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001212649,"about_ca_system_score_gemma":0.0001489047,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":4.779336e-7,"about_ca_topic_score_gemma":1.426711e-7,"domain_scores_codex":[0.9985862,0.00002835352,0.0004674887,0.0002885469,0.0003598315,0.0002695655],"domain_scores_gemma":[0.9967505,0.002021174,0.0001150563,0.0003540623,0.0007054177,0.00005380888],"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.0001021813,0.0003473918,0.005631218,0.00004300807,0.0004288689,0.0001741986,0.0003040554,0.1296305,0.01890167,0.2712065,0.00008430181,0.5731462],"study_design_scores_gemma":[0.003057767,0.001268033,0.002049641,0.0008366368,0.0000728743,0.00743505,0.00009139685,0.01233701,0.1220435,0.8252854,0.02413513,0.00138762],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03667273,0.0001613966,0.9610675,0.0005049736,0.0006555137,0.0002130998,0.00002676835,0.0006832331,0.00001481179],"genre_scores_gemma":[0.2061964,0.00005452447,0.793433,0.0001168378,0.000115169,0.00005256157,0.000001422904,0.00001999836,0.00001019017],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.5717586,"threshold_uncertainty_score":0.7019174,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2007846881","doi":"10.1007/s10009-010-0183-5","title":"The Clara framework for hybrid typestate analysis","year":2010,"lang":"en","type":"article","venue":"International Journal on Software Tools for Technology Transfer","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Static analysis; Runtime verification; AspectJ; Property (philosophy); State (computer science); Dependency (UML); Programming language; Program analysis; Field (mathematics); Distributed computing; Formal verification; Software engineering; Aspect-oriented programming; Software","retraction":null,"screen_n_in":null,"score":{"opus":0.01957665836404231,"gpt":0.290065488886945,"spread":0.2704888305229027,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006122413,0.0001635918,0.0002159419,0.0003992713,0.0004024057,0.0007093527,0.002188,0.0002188605,0.00001368774],"category_scores_gemma":[0.0007775155,0.0001087457,0.0004049191,0.0003569186,0.0001270978,0.000318309,0.00004449016,0.0007032296,0.00002274736],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004395158,"about_ca_system_score_gemma":0.00007598457,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001869363,"about_ca_topic_score_gemma":0.00002121978,"domain_scores_codex":[0.998594,0.00002214909,0.0003877678,0.0003039086,0.0003449792,0.0003471396],"domain_scores_gemma":[0.9979637,0.0008202036,0.0001019608,0.0004099455,0.0006340288,0.00007013969],"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.00005344734,0.00004672224,0.0005781313,0.000002141619,0.000606611,0.00001666155,0.00004053875,0.00003328857,0.00005980018,0.7856589,0.0003655232,0.2125382],"study_design_scores_gemma":[0.0006027815,0.0003113447,0.0002753887,0.000005630362,0.00009309208,0.0001966325,0.00001936971,0.00103574,0.002397787,0.674356,0.3205135,0.0001927994],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01047869,0.0000911009,0.9778097,0.007626709,0.003333087,0.0003133666,0.00002154364,0.0002780814,0.00004777711],"genre_scores_gemma":[0.9170855,0.00005255056,0.08165793,0.0004860813,0.0003400791,0.0001542626,0.00001111409,0.00001759,0.0001948669],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9066069,"threshold_uncertainty_score":0.6840304,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2128454637","doi":"10.1007/s10009-005-0209-6","title":"Software tools for safety-critical software development","year":2005,"lang":"en","type":"article","venue":"International Journal on Software Tools for Technology Transfer","topic":"Software Reliability and Analysis Research","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"","keywords":"Computer science; Software development; Software engineering; Package development process; Variety (cybernetics); Software construction; Software peer review; Software analytics; Software; Social software engineering; Personal software process; Verification and validation; Avionics software; Operating system; Engineering; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.03718945379551026,"gpt":0.3308925594451662,"spread":0.2937031056496559,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaresearch","metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001279067,0.0004965095,0.0006385461,0.001154801,0.0007831091,0.00127501,0.003857913,0.0005964128,0.000159598],"category_scores_gemma":[0.011769,0.0004524435,0.0007027183,0.000605981,0.000311402,0.002363799,0.0002411973,0.001054961,0.0001483931],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007684914,"about_ca_system_score_gemma":0.0006751653,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001194421,"about_ca_topic_score_gemma":0.00001362537,"domain_scores_codex":[0.9951978,0.0000837917,0.001279139,0.0009898549,0.001383946,0.001065467],"domain_scores_gemma":[0.9919865,0.004662997,0.0001132585,0.0006880027,0.002227713,0.0003215195],"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.0003511416,0.0005037458,0.0007329546,0.00004380263,0.000447271,0.00004881564,0.0001626169,0.00064087,0.00009666994,0.0319862,0.001277172,0.9637088],"study_design_scores_gemma":[0.004965976,0.001143395,0.00100216,0.0004557436,0.00009423805,0.0007083658,0.00009494412,0.001712283,0.01820538,0.04333861,0.9269729,0.001306057],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.008360988,0.0003363412,0.9668025,0.02153144,0.0009785263,0.0006901661,0.0001986049,0.001080583,0.00002088777],"genre_scores_gemma":[0.1139395,0.0001859375,0.8817133,0.002342138,0.0006891686,0.0005506462,0.0001124086,0.00008011149,0.0003868259],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9624027,"threshold_uncertainty_score":0.9997928,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2981584093","doi":"10.1007/s10009-019-00543-1","title":"A formal refinement-based analysis of the hybrid ERTMS/ETCS level 3 standard","year":2019,"lang":"en","type":"article","venue":"International Journal on Software Tools for Technology Transfer","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Train; Supervisor; Theory of computation; Computer science; Nondeterministic algorithm; Event (particle physics); Control (management); Algorithm; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.03523788722718633,"gpt":0.3029168370994255,"spread":0.2676789498722392,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007710956,0.000167991,0.0003121952,0.0009651004,0.0001185601,0.0001307201,0.002556652,0.0001308364,0.00007211571],"category_scores_gemma":[0.0004453962,0.0001220106,0.0004627352,0.0008448083,0.0001031775,0.0006834685,0.00008810057,0.0003908256,0.000008907611],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001945504,"about_ca_system_score_gemma":0.0001683375,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001896304,"about_ca_topic_score_gemma":0.000003653614,"domain_scores_codex":[0.9980235,0.00005636253,0.0005881416,0.0002810872,0.000773207,0.000277697],"domain_scores_gemma":[0.9981822,0.00021763,0.0001962498,0.0005984587,0.0007650366,0.00004041416],"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.001069241,0.0003817527,0.01646155,0.00004016934,0.003156782,0.00001576096,0.0002059791,0.01354618,0.004906086,0.4161147,0.0006299675,0.5434718],"study_design_scores_gemma":[0.01161011,0.003880175,0.04885602,0.0005461706,0.001154575,0.0003179048,0.0001260539,0.1267395,0.6401265,0.02707539,0.1381929,0.001374741],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1923433,0.0000207874,0.8034033,0.002609153,0.00100643,0.0002459809,0.0002181239,0.0001000781,0.00005279958],"genre_scores_gemma":[0.720927,0.000009063375,0.2781324,0.0007649334,0.0000266933,0.00003429596,0.00001312577,0.00001224089,0.00008028061],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6352204,"threshold_uncertainty_score":0.4975449,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1990325313","doi":"10.1007/s10009-007-0040-3","title":"Improving state class constructions for CTL* model checking of time Petri nets","year":2007,"lang":"en","type":"article","venue":"International Journal on Software Tools for Technology Transfer","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Petri net; Computer science; Theory of computation; Class (philosophy); State (computer science); Model checking; Process architecture; Stochastic Petri net; Programming language; Theoretical computer science; CTL*; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.02888828092830227,"gpt":0.3112200504831442,"spread":0.282331769554842,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001072992,0.0001698315,0.0002339461,0.0008307966,0.0001655521,0.000126303,0.001332729,0.0002099783,0.000006045195],"category_scores_gemma":[0.0008612077,0.0001665882,0.0002078322,0.0002849217,0.0001564863,0.0008584891,0.00005152178,0.0003816278,0.000004363525],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001958968,"about_ca_system_score_gemma":0.0001477773,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001174886,"about_ca_topic_score_gemma":0.000001902064,"domain_scores_codex":[0.9982638,0.00001799464,0.0006928269,0.0002986091,0.0003805035,0.0003462775],"domain_scores_gemma":[0.9980443,0.0004054443,0.0002139673,0.0002769549,0.000993175,0.00006617443],"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.0002898616,0.0001211279,0.0001727447,0.00001990455,0.0001615614,0.000007796149,0.0001611762,0.005294989,0.02521137,0.2315442,0.00008911529,0.7369261],"study_design_scores_gemma":[0.003914648,0.001094194,0.0003050737,0.0001940666,0.00005501102,0.0008464577,0.00007578694,0.4321755,0.4166844,0.1362833,0.007769258,0.0006023092],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.05159913,0.00002990705,0.9458395,0.000792994,0.0009783,0.0003564587,0.00009238467,0.0002440087,0.0000673202],"genre_scores_gemma":[0.2087304,0.00001658752,0.7908478,0.0001897043,0.00006534607,0.0000372601,0.000007502175,0.00002078469,0.00008457679],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7363238,"threshold_uncertainty_score":0.6793271,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2976486068","doi":"10.1007/s10009-019-00531-5","title":"Distributed graph queries over models@run.time for runtime monitoring of cyber-physical systems","year":2019,"lang":"en","type":"article","venue":"International Journal on Software Tools for Technology Transfer","topic":"Software System Performance and Reliability","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"Budapesti Műszaki és Gazdaságtudományi Egyetem","keywords":"Computer science; Scalability; Distributed computing; Graph; Cyber-physical system; Database; Theoretical computer science; Operating system","retraction":null,"screen_n_in":null,"score":{"opus":0.01428448677402966,"gpt":0.2627782450835064,"spread":0.2484937583094768,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003607257,0.0002560829,0.0005016963,0.000428231,0.0001251865,0.000196264,0.001511565,0.0002806302,0.00000601967],"category_scores_gemma":[0.0001458941,0.0002080761,0.0004208686,0.0002956337,0.0001087768,0.001213002,0.00006979012,0.0003348794,0.0000193762],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001603678,"about_ca_system_score_gemma":0.0001070742,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005037407,"about_ca_topic_score_gemma":2.738427e-7,"domain_scores_codex":[0.997996,0.00002838449,0.0006289722,0.0004098837,0.0005724065,0.0003642999],"domain_scores_gemma":[0.9979211,0.0004810897,0.0001607054,0.0004416593,0.0009260919,0.00006936409],"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.003675345,0.003200252,0.163055,0.00118602,0.00495586,0.00007531829,0.002324743,0.1021382,0.02469122,0.5460977,0.002275772,0.1463246],"study_design_scores_gemma":[0.03660214,0.01431986,0.03866803,0.006791247,0.0005722309,0.001753891,0.0009832479,0.3143353,0.2146014,0.3215856,0.04422886,0.005558134],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4833355,0.00007184895,0.5137637,0.0003187653,0.001632176,0.0004621677,0.0001806817,0.0002244108,0.00001073269],"genre_scores_gemma":[0.9902546,0.00002860724,0.009155758,0.0000308323,0.000243332,0.0001563501,0.00002496619,0.00002659798,0.00007892192],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5069191,"threshold_uncertainty_score":0.8485097,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2972465897","doi":"10.1007/s10009-019-00530-6","title":"Diversity of graph models and graph generators in mutation testing","year":2019,"lang":"en","type":"article","venue":"International Journal on Software Tools for Technology Transfer","topic":"Software Testing and Debugging Techniques","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"Emberi Eroforrások Minisztériuma; Natural Sciences and Engineering Research Council of Canada; Magyar Tudományos Akadémia; Budapesti Műszaki és Gazdaságtudományi Egyetem","keywords":"Computer science; Test suite; Predicate abstraction; Random testing; Graph; Model-based testing; Theoretical computer science; Predicate (mathematical logic); Software quality; Programming language; Test case; Software; Software engineering; Model checking; Machine learning; Software development","retraction":null,"screen_n_in":null,"score":{"opus":0.03993430915760716,"gpt":0.2690731531534225,"spread":0.2291388439958153,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003621998,0.0001352918,0.0001997358,0.0009920273,0.0001369859,0.00006986558,0.0008233027,0.0001547,0.000001952164],"category_scores_gemma":[0.0004370459,0.0001289334,0.0000791834,0.0004356054,0.0000721038,0.00066955,0.0001806311,0.0002886193,9.666547e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005489747,"about_ca_system_score_gemma":0.00004413755,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001643092,"about_ca_topic_score_gemma":0.000003757841,"domain_scores_codex":[0.99888,0.00002466926,0.0003286768,0.0002738771,0.000307904,0.000184904],"domain_scores_gemma":[0.9987747,0.0005012092,0.00008670385,0.0001810049,0.0004179002,0.00003846999],"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.0001776988,0.0003433404,0.3905751,0.00005531672,0.000204214,0.00015991,0.001235167,0.007601483,0.001203656,0.1239298,0.0002300929,0.4742842],"study_design_scores_gemma":[0.001696416,0.0007455391,0.009124073,0.0003279725,0.00001383713,0.0004183487,0.00002264969,0.01336405,0.007160775,0.9667837,0.00004323369,0.0002993931],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4833988,0.00004514564,0.5152939,0.0002701297,0.00019311,0.0001133322,0.000006759524,0.000665189,0.00001368855],"genre_scores_gemma":[0.8154672,0.0000209532,0.1843204,0.0001515778,0.0000148734,0.00001113075,0.000001835149,0.000008557595,0.000003504676],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.842854,"threshold_uncertainty_score":0.5257754,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2593098503","doi":"10.1007/s10009-017-0450-9","title":"Software engineering practices and Simulink: bridging the gap","year":2017,"lang":"en","type":"article","venue":"International Journal on Software Tools for Technology Transfer","topic":"Embedded Systems Design Techniques","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"","keywords":"Computer science; Software engineering; Debugging; Documentation; Maintainability; Software; Programming language","retraction":null,"screen_n_in":null,"score":{"opus":0.05327260685018031,"gpt":0.3286051605637318,"spread":0.2753325537135515,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0007813728,0.0002164267,0.0002212686,0.0003379533,0.0006380427,0.001807317,0.003494416,0.000221154,0.000004631584],"category_scores_gemma":[0.004841917,0.0001625542,0.0001301476,0.00007495438,0.0001382495,0.001840961,0.0001930976,0.0006955441,0.000007618185],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008971578,"about_ca_system_score_gemma":0.00006747819,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004789696,"about_ca_topic_score_gemma":0.000003921481,"domain_scores_codex":[0.9984787,0.00003316846,0.0003850026,0.0003605521,0.0004354429,0.0003071319],"domain_scores_gemma":[0.9976447,0.0008336377,0.0003378088,0.0006874963,0.0004291721,0.00006713384],"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.0001330199,0.000144915,0.0091534,0.00005729017,0.0006908646,0.0004448273,0.0005597511,0.0004586281,0.003278475,0.2398636,0.00165719,0.743558],"study_design_scores_gemma":[0.01126038,0.003786071,0.02176344,0.004039548,0.0003442257,0.02077417,0.0003446823,0.06864368,0.1926667,0.1989161,0.473104,0.004356969],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03555251,0.0002162553,0.9494971,0.01261473,0.001026941,0.0003137411,0.00001452727,0.0007283847,0.00003579109],"genre_scores_gemma":[0.8556063,0.0001302329,0.1432163,0.0005169185,0.0003405671,0.00008474228,0.000001497383,0.00003045991,0.00007298588],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8200538,"threshold_uncertainty_score":0.9992289,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1515040974","doi":"10.1007/s10009-009-0109-2","title":"Encoding a process algebra using the Event B method","year":2009,"lang":"en","type":"article","venue":"International Journal on Software Tools for Technology Transfer","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Moncton","funders":"","keywords":"Computer science; Process calculus; Event (particle physics); Asynchronous communication; Theory of computation; Semantics (computer science); ENCODE; Theoretical computer science; Process (computing); Operator (biology); Programming language; Algorithm; Algebra over a field; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.04812510076258449,"gpt":0.3826917551929782,"spread":0.3345666544303937,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001048311,0.0001699455,0.0001669823,0.0004229552,0.0002920735,0.0003433734,0.002450916,0.0001753496,0.00001306684],"category_scores_gemma":[0.0006984639,0.0001249602,0.0001737681,0.0004008914,0.00006194517,0.0009694044,0.00003455403,0.0005443888,0.000005518433],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001649586,"about_ca_system_score_gemma":0.0001096229,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":4.916287e-7,"about_ca_topic_score_gemma":2.98144e-7,"domain_scores_codex":[0.9983735,0.00008076071,0.0004420468,0.0002981623,0.0005138738,0.0002916687],"domain_scores_gemma":[0.9987578,0.0002393104,0.0001158613,0.0003294463,0.0005067188,0.00005083651],"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.00007493455,0.0001069339,0.00007433486,0.000004078571,0.00008752739,0.00002203748,0.000342046,0.002448699,0.003031926,0.4128574,0.00004747475,0.5809026],"study_design_scores_gemma":[0.002292183,0.001367254,0.0009906507,0.0003484572,0.00007523799,0.00381935,0.0002635066,0.08372179,0.2410595,0.650894,0.01441652,0.0007515583],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02267576,0.00006529985,0.9690325,0.006634785,0.0009973836,0.0002509039,0.00000663313,0.0002725426,0.00006415376],"genre_scores_gemma":[0.3892245,0.000018473,0.6092929,0.001277818,0.0001338199,0.00002718459,0.000001298451,0.00001014078,0.00001391121],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.580151,"threshold_uncertainty_score":0.5095728,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4241863337","doi":"10.1007/s10009-019-00542-2","title":"Modeling the hybrid ERTMS/ETCS level 3 standard using a formal requirements engineering approach","year":2019,"lang":"en","type":"article","venue":"International Journal on Software Tools for Technology Transfer","topic":"Safety Systems Engineering in Autonomy","field":"Engineering","cited_by":17,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Sherbrooke","funders":"Agence Nationale de la Recherche","keywords":"Computer science; Formal specification; Formal methods; Formal verification; Programming language; Software engineering; Systems Modeling Language; Domain (mathematical analysis); Unified Modeling Language","retraction":null,"screen_n_in":null,"score":{"opus":0.04120826836569858,"gpt":0.2544398037154147,"spread":0.2132315353497161,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000419386,0.0003246845,0.0003274096,0.0005045307,0.0001086476,0.0001815926,0.0009059464,0.0001976665,0.00003663292],"category_scores_gemma":[0.0001143086,0.0002742417,0.000229044,0.0001700316,0.00002774698,0.0006814073,0.00004057169,0.0007352989,0.00001738316],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006140287,"about_ca_system_score_gemma":0.00005871387,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001397193,"about_ca_topic_score_gemma":2.578173e-7,"domain_scores_codex":[0.9981001,0.00000983813,0.0006115628,0.0002415388,0.0005158082,0.0005211257],"domain_scores_gemma":[0.9992425,0.0001029483,0.00003374217,0.0002978097,0.0002587547,0.00006422816],"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.00006027477,0.00001769326,0.0001075411,0.00005287371,0.0004314354,0.00001163242,0.00007697109,0.979688,0.001478346,0.002256454,0.00003181318,0.01578697],"study_design_scores_gemma":[0.001624946,0.000113273,0.0000492151,0.0001877134,0.00004103111,0.0006737341,0.00006835972,0.9823931,0.004574724,0.0003288028,0.009541732,0.0004033909],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2401267,0.0001438431,0.7561315,0.0001282421,0.002265518,0.000422667,0.0001162257,0.0005850988,0.00008017141],"genre_scores_gemma":[0.9577184,0.00003239567,0.04170436,0.0000624598,0.0002406703,0.00007885102,0.00002046573,0.0001149546,0.00002749414],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7175916,"threshold_uncertainty_score":0.999971,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2066179571","doi":"10.1007/s10009-009-0134-1","title":"Exploiting resolution proofs to speed up LTL vacuity detection for BMC","year":2010,"lang":"en","type":"article","venue":"International Journal on Software Tools for Technology Transfer","topic":"Glycosylation and Glycoproteins Research","field":"Biochemistry, Genetics and Molecular Biology","cited_by":13,"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":"Computer science; Mathematical proof; Model checking; Theory of computation; Bounded function; Resolution (logic); Property (philosophy); Variable (mathematics); Theoretical computer science; Algorithm; Programming language; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.03334472136680609,"gpt":0.3272435181166502,"spread":0.2938987967498441,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004489678,0.0001626824,0.0001375778,0.0003898671,0.0002302587,0.0001268062,0.0004781861,0.0003816265,0.00003881037],"category_scores_gemma":[0.002109452,0.0001551657,0.0001973272,0.0001303093,0.00006300142,0.00002859244,0.00004037354,0.0004292377,0.00001665671],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006011235,"about_ca_system_score_gemma":0.0001035201,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002472764,"about_ca_topic_score_gemma":0.0001279181,"domain_scores_codex":[0.9986794,0.00002284173,0.0003285015,0.0003466037,0.000299157,0.0003235193],"domain_scores_gemma":[0.9986523,0.00006693486,0.00005383778,0.0002077493,0.0009127222,0.0001064165],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.001630989,0.00009083497,0.000484037,0.00001216222,0.0000868653,0.000002587096,0.00002181187,0.0001576291,0.8694453,0.001739779,0.0004031477,0.1259249],"study_design_scores_gemma":[0.002074268,0.001096011,0.0005328868,0.00002675285,0.00001227503,0.0001454015,0.0000434094,0.0002455165,0.8547891,0.002269834,0.1385572,0.000207348],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5103571,0.00001194975,0.4871365,0.0009921902,0.0008136104,0.0005509881,0.00005895755,0.00005174914,0.00002685712],"genre_scores_gemma":[0.9836746,0.00001363121,0.01441748,0.0003157676,0.0006817103,0.000253611,0.00008636614,0.0000370525,0.0005197683],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4733175,"threshold_uncertainty_score":0.6327474,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2008416362","doi":"10.1007/s10009-002-0082-5","title":"Hierarchical formal verification using a hybrid tool","year":2003,"lang":"en","type":"article","venue":"International Journal on Software Tools for Technology Transfer","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Intelligent verification; HOL; Formal verification; Functional verification; Runtime verification; High-level verification; Theory of computation; Component (thermodynamics); Software verification; Verification; Formal methods; Model checking; Programming language; Computer architecture; Embedded system; Software; Software development; Software construction","retraction":null,"screen_n_in":null,"score":{"opus":0.04344229729073261,"gpt":0.3178908435027292,"spread":0.2744485462119966,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009294958,0.000214132,0.0002105701,0.0006602656,0.0002871607,0.0003676703,0.001608117,0.000205,0.00003079331],"category_scores_gemma":[0.001398675,0.0002033933,0.0001998709,0.0003200256,0.0001234417,0.001953521,0.00004420118,0.0006053753,0.00002628494],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002722032,"about_ca_system_score_gemma":0.0001831322,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":4.47434e-7,"about_ca_topic_score_gemma":2.048649e-7,"domain_scores_codex":[0.9979551,0.00009642325,0.0005850205,0.0003899648,0.0005431778,0.0004302598],"domain_scores_gemma":[0.9986389,0.0001905422,0.0001123946,0.0004380089,0.0005407496,0.00007944844],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00009935414,0.0001341739,0.0001734272,0.000005345973,0.00008247737,0.00002736111,0.00005712955,0.0002916447,0.00345319,0.7844375,0.0000725169,0.2111659],"study_design_scores_gemma":[0.006246475,0.001720063,0.001328074,0.0002453006,0.00008145472,0.008822823,0.0000821179,0.04667901,0.4020928,0.3297219,0.2015015,0.001478515],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1166951,0.00003981618,0.8799518,0.0008659927,0.001715932,0.0002754172,0.00002722194,0.0003125411,0.0001162219],"genre_scores_gemma":[0.3918687,0.000026971,0.6074966,0.0004120525,0.00009123642,0.0000513822,0.000007269272,0.00001914607,0.00002661467],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4547155,"threshold_uncertainty_score":0.8294138,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1971979814","doi":"10.1007/s100090200073","title":"Comparison of SPIN and VIS for protocol verification","year":2003,"lang":"en","type":"article","venue":"International Journal on Software Tools for Technology Transfer","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Asynchronous communication; Protocol (science); Theory of computation; Software; Formal verification; Software verification; Formal methods; Promela; Model checking; Communications protocol; Embedded system; Programming language; Computer network; Software system; Software construction","retraction":null,"screen_n_in":null,"score":{"opus":0.06635256689107977,"gpt":0.4103775650954806,"spread":0.3440249982044008,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005902524,0.0001287169,0.0002110085,0.0003807248,0.000106786,0.0001119126,0.0007845837,0.0001773937,0.000007106974],"category_scores_gemma":[0.001067522,0.0001185167,0.00009751451,0.0001772819,0.0001004662,0.0005326098,0.00001707767,0.0002084983,0.000002054958],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007196656,"about_ca_system_score_gemma":0.00006806659,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":2.65145e-7,"about_ca_topic_score_gemma":4.059576e-7,"domain_scores_codex":[0.9987451,0.00004358295,0.0005278438,0.0002508168,0.0002610419,0.000171588],"domain_scores_gemma":[0.9987637,0.0002054718,0.0001573315,0.0002404097,0.0005916577,0.00004143798],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.000172433,0.0001946307,0.001184741,0.00003140481,0.00006054126,7.526775e-7,0.0001157332,0.0000617398,0.004055078,0.7201539,0.0001174462,0.2738516],"study_design_scores_gemma":[0.004761513,0.002618224,0.002122773,0.0001746014,0.00002955521,0.0002112509,0.0001013685,0.007430705,0.69201,0.09211581,0.1980089,0.0004153108],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.008677611,0.00001745019,0.981458,0.0007488035,0.0004338152,0.00847549,0.00001983335,0.0001140245,0.00005498538],"genre_scores_gemma":[0.2038478,0.00000584899,0.7842453,0.0001043832,0.00003473344,0.01172475,0.000003901583,0.00001398758,0.00001931001],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.687955,"threshold_uncertainty_score":0.4832973,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2044863546","doi":"10.1007/s10009-013-0277-y","title":"Generating effective tests for concurrent programs via AI automated planning techniques","year":2013,"lang":"en","type":"article","venue":"International Journal on Software Tools for Technology Transfer","topic":"Software Testing and Debugging Techniques","field":"Computer Science","cited_by":11,"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":"Computer science; Concurrency; Atomicity; Correctness; Interleaving; Programming language; Debugging; Set (abstract data type); Theory of computation","retraction":null,"screen_n_in":null,"score":{"opus":0.02929224509674527,"gpt":0.335350900474194,"spread":0.3060586553774487,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004689904,0.0003455321,0.0003518491,0.0006806186,0.0003316097,0.0008320075,0.001626323,0.0003453835,0.00000525516],"category_scores_gemma":[0.001231316,0.0002997217,0.0002459336,0.0003073681,0.0001215674,0.0009502738,0.00009385577,0.0005918337,0.00001087733],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002187116,"about_ca_system_score_gemma":0.00008577346,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007121532,"about_ca_topic_score_gemma":9.595544e-7,"domain_scores_codex":[0.9978967,0.00004757668,0.0005894704,0.000528432,0.0004129331,0.0005248273],"domain_scores_gemma":[0.9970033,0.0009718363,0.0001533913,0.0003175418,0.001445592,0.000108407],"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.00002585372,0.0001861763,0.001561344,0.00001988464,0.0001532117,0.00002445925,0.0001061942,0.00009755297,0.002213247,0.003812407,0.006533229,0.9852664],"study_design_scores_gemma":[0.005981523,0.01089397,0.002031214,0.003239589,0.0001322941,0.003632688,0.00003389769,0.3577022,0.186334,0.3913365,0.03597181,0.002710374],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01882311,0.0001029873,0.9490025,0.002855446,0.0009711447,0.00178665,0.00001868436,0.02643009,0.000009404893],"genre_scores_gemma":[0.4489124,0.000005175812,0.5473067,0.001092264,0.0002158489,0.002383321,0.00002676391,0.0000421462,0.0000154953],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.982556,"threshold_uncertainty_score":0.9999455,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3176562981","doi":"10.1007/s10009-021-00625-z","title":"What can we monitor over unreliable channels?","year":2021,"lang":"en","type":"article","venue":"International Journal on Software Tools for Technology Transfer","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Theory of computation; Programming language","retraction":null,"screen_n_in":null,"score":{"opus":0.03448311251912821,"gpt":0.3164275150670675,"spread":0.2819444025479393,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0003579351,0.0002110194,0.0002291302,0.0004709654,0.0001870865,0.001100219,0.001769339,0.0002926584,0.00006869101],"category_scores_gemma":[0.0006478836,0.0002017756,0.0002028226,0.0004378545,0.00008482626,0.002195389,0.00009936932,0.0005716575,0.00003340202],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002436492,"about_ca_system_score_gemma":0.000168345,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001066718,"about_ca_topic_score_gemma":0.000002537537,"domain_scores_codex":[0.9981326,0.00005637128,0.0004502854,0.0004290176,0.0005636364,0.0003680177],"domain_scores_gemma":[0.99823,0.0002410739,0.00008502691,0.0004592974,0.0008881569,0.00009645228],"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.0001085208,0.0002884485,0.0002635565,0.00001779994,0.0002938152,0.0002607386,0.0004090872,0.0006429662,0.003121322,0.3414874,0.001425052,0.6516812],"study_design_scores_gemma":[0.003714975,0.0008787233,0.0005867899,0.0008808156,0.00005226684,0.002511211,0.0004798872,0.006154024,0.4653594,0.2114206,0.3070013,0.0009600061],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02932771,0.0004935482,0.9400297,0.01656484,0.01295846,0.0001760435,0.00002815218,0.0003764853,0.00004500551],"genre_scores_gemma":[0.2435105,0.002659799,0.7483277,0.003156729,0.0008456408,0.000185182,0.00003018003,0.00006243876,0.001221834],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.6507213,"threshold_uncertainty_score":0.9999368,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1975757993","doi":"10.1007/s10009-009-0098-1","title":"A low-level memory model and an accompanying reachability predicate","year":2009,"lang":"en","type":"article","venue":"International Journal on Software Tools for Technology Transfer","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":10,"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; Heap (data structure); Reachability; Programming language; Pointer (user interface); Separation logic; Predicate (mathematical logic); Predicate abstraction; Theoretical computer science; Model checking; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.04833891506085652,"gpt":0.3012249053209211,"spread":0.2528859902600645,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005211284,0.0001907257,0.0002376884,0.0003447404,0.0001847083,0.0003575036,0.001375152,0.0002313496,0.000003784743],"category_scores_gemma":[0.0001852104,0.0001587501,0.0001203702,0.000133848,0.000102103,0.001021121,0.00004709767,0.0004242717,0.000005199348],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009072295,"about_ca_system_score_gemma":0.00008543182,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002362559,"about_ca_topic_score_gemma":0.000004971572,"domain_scores_codex":[0.9984469,0.00003473115,0.0004046634,0.0004223517,0.0003852897,0.0003060169],"domain_scores_gemma":[0.9990411,0.0000897111,0.0000747779,0.000333196,0.0003396838,0.0001215282],"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.00007752811,0.0003538178,0.000263808,0.000007887152,0.0000633183,0.00003219219,0.0003318558,0.0003400702,0.0007543026,0.1426213,0.00006454848,0.8550894],"study_design_scores_gemma":[0.004268138,0.001746811,0.004431024,0.00007438427,0.00003854655,0.001274871,0.0001062021,0.03863907,0.008073284,0.9372852,0.003353233,0.0007091667],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1603631,0.0000667731,0.8356341,0.00277546,0.0004088411,0.0002418697,0.00001173587,0.0004197169,0.00007841035],"genre_scores_gemma":[0.9620785,0.00002739102,0.03699443,0.0006481681,0.0001397317,0.00003033338,0.000006230444,0.00001111544,0.00006414357],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8543802,"threshold_uncertainty_score":0.6473642,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2051066030","doi":"10.1007/s10009-013-0278-x","title":"Innovation and evolution in integrated web application testing with TTCN-3","year":2013,"lang":"en","type":"article","venue":"International Journal on Software Tools for Technology Transfer","topic":"Software Testing and Debugging Techniques","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Integration testing; Software engineering; Vendor; Web service; Web application security; Web application; Test strategy; Unit testing; Model-based testing; Conformance testing; Web development; World Wide Web; Test case; Operating system; Software","retraction":null,"screen_n_in":null,"score":{"opus":0.02034142140810467,"gpt":0.2619502481418968,"spread":0.2416088267337921,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003348042,0.0001701824,0.0001622314,0.001239515,0.0001078019,0.0003045856,0.0006805933,0.0001784051,0.000002574764],"category_scores_gemma":[0.001189005,0.000139777,0.00002526838,0.001264918,0.0000876419,0.0009322157,0.00004034346,0.0004374036,0.000007354176],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002070848,"about_ca_system_score_gemma":0.0001171175,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002884353,"about_ca_topic_score_gemma":0.00000843945,"domain_scores_codex":[0.9987562,0.00002323158,0.0004039195,0.0003283515,0.0002700344,0.0002182786],"domain_scores_gemma":[0.9981099,0.0004030382,0.00009911943,0.0002043099,0.001148597,0.00003503014],"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.00006209778,0.0001550585,0.1050614,0.00001146142,0.00004991237,0.00001915615,0.00006304615,0.0001218638,0.003960522,0.1154073,0.0004286621,0.7746595],"study_design_scores_gemma":[0.00387998,0.0019065,0.1001757,0.0009332062,0.00002086167,0.001848301,0.00005599304,0.07098611,0.005390318,0.8121743,0.001763872,0.0008647751],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2872882,0.00002315204,0.7079019,0.002240051,0.00009690474,0.0003040054,0.000004531095,0.002114463,0.00002676482],"genre_scores_gemma":[0.729242,0.0000038481,0.2702065,0.0002705031,0.00003208314,0.0002157458,0.000007539189,0.00001322764,0.000008574433],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7737947,"threshold_uncertainty_score":0.5699939,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4321242415","doi":"10.1007/s10009-023-00696-0","title":"Algorithm selection for SMT","year":2023,"lang":"en","type":"article","venue":"International Journal on Software Tools for Technology Transfer","topic":"Software Engineering Research","field":"Computer Science","cited_by":10,"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; Satisfiability modulo theories; Solver; Ranking (information retrieval); Pairwise comparison; Theory of computation; Selection (genetic algorithm); Domain (mathematical analysis); Theoretical computer science; Programming language; Algorithm; Artificial intelligence; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.02944465937477168,"gpt":0.3129909554441556,"spread":0.2835462960693839,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005165638,0.0001728952,0.0001787435,0.001314799,0.0001956327,0.000339176,0.001659218,0.0002314452,0.00001429997],"category_scores_gemma":[0.001786177,0.0001661708,0.0002066976,0.0007915409,0.00004829924,0.0005824727,0.00006307434,0.0004489382,0.00007543546],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002094118,"about_ca_system_score_gemma":0.0001171615,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":8.868844e-7,"about_ca_topic_score_gemma":0.000001143604,"domain_scores_codex":[0.9983061,0.00001500912,0.0003153371,0.0003660053,0.000528066,0.0004694879],"domain_scores_gemma":[0.9976487,0.001252567,0.00003387194,0.0002127136,0.0007686962,0.00008341605],"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.00006227844,0.00007643763,0.0009450865,0.00001161629,0.0002241974,0.00003721781,0.00006065284,0.0009123645,0.0007996034,0.02461827,0.003720302,0.968532],"study_design_scores_gemma":[0.009598255,0.003965411,0.006640418,0.0003441036,0.00005492532,0.002100616,0.00007546663,0.1159165,0.09190303,0.205667,0.5622085,0.001525735],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01321555,0.00002947894,0.9763648,0.005900223,0.00207665,0.0003825159,0.00006493453,0.001960195,0.00000567007],"genre_scores_gemma":[0.1559562,0.0001507013,0.8400378,0.0006912324,0.001003103,0.0009729029,0.00006961043,0.0001117669,0.001006645],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9670062,"threshold_uncertainty_score":0.6776248,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4301181330","doi":"10.1007/s10009-022-00684-w","title":"Analysis of recurrent neural networks via property-directed verification of surrogate models","year":2022,"lang":"en","type":"article","venue":"International Journal on Software Tools for Technology Transfer","topic":"Adversarial Robustness in Machine Learning","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"Campus France; Universität zu Lübeck; Deutsche Forschungsgemeinschaft; Deutscher Akademischer Austauschdienst","keywords":"Recurrent neural network; Property (philosophy); Computer science; Robustness (evolution); Automaton; Counterexample; Artificial intelligence; Model checking; Artificial neural network; Algorithm; Theoretical computer science; Machine learning; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.02640946674467211,"gpt":0.2762155736869909,"spread":0.2498061069423188,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005193643,0.0001515386,0.0003603492,0.00125734,0.0001709951,0.00004624073,0.001824164,0.000101327,0.00004396903],"category_scores_gemma":[0.0002066654,0.0001278987,0.0003172487,0.001282198,0.00008455566,0.0004730764,0.000148287,0.0006540117,2.987541e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001540795,"about_ca_system_score_gemma":0.00005998956,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007549767,"about_ca_topic_score_gemma":0.000003360923,"domain_scores_codex":[0.9981108,0.0001305738,0.000632506,0.0003115785,0.0006085248,0.0002059882],"domain_scores_gemma":[0.9984953,0.0002507551,0.0002689445,0.0003161065,0.0006310624,0.00003785234],"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.0002107846,0.0001555903,0.001307393,0.0000037197,0.0007426318,0.000009265685,0.0001424254,0.8112248,0.0002234916,0.01099177,0.0000188879,0.1749692],"study_design_scores_gemma":[0.0007209505,0.0003899998,0.0006859642,0.00001629326,0.0001549268,0.00003714604,0.00002526273,0.9944656,0.0004875317,0.002392022,0.0004859692,0.0001382998],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06345631,0.00007420087,0.9338502,0.001243362,0.0009163246,0.0001978419,0.00004522561,0.0002028853,0.00001365628],"genre_scores_gemma":[0.9772342,0.00002596323,0.0224792,0.00008321257,0.0000348112,0.00005958239,0.00004668993,0.00001530914,0.00002106022],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9137779,"threshold_uncertainty_score":0.5215557,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2034321868","doi":"10.1007/s10009-002-0100-7","title":"Security by typing","year":2003,"lang":"en","type":"article","venue":"International Journal on Software Tools for Technology Transfer","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":6,"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":"Computer science; Soundness; Cryptographic protocol; Correctness; Type inference; Secrecy; Protocol (science); Cryptography; Theoretical computer science; Programming language; Theory of computation; Authentication protocol; Typing; Authentication (law); Inference; Computer security; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.01826549152037574,"gpt":0.290743463193024,"spread":0.2724779716726482,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003210084,0.000141967,0.0001395956,0.00042772,0.0002184944,0.0003217634,0.001010435,0.0001354007,0.00008809062],"category_scores_gemma":[0.0002532505,0.0001328655,0.000159287,0.0003009105,0.00006299101,0.0005898609,0.00002511037,0.0003597058,0.00001301428],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007626673,"about_ca_system_score_gemma":0.00006491331,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001188053,"about_ca_topic_score_gemma":0.000004166385,"domain_scores_codex":[0.9988248,0.00003332893,0.0003299401,0.0002594174,0.0002780239,0.0002744604],"domain_scores_gemma":[0.9991772,0.0001587335,0.00004864978,0.0002091754,0.0003403696,0.00006593182],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00002331168,0.0001839503,0.0009437929,0.000003090418,0.0001381925,0.00001782791,0.0001657066,0.00001057117,0.0004355751,0.9249876,0.003878153,0.06921227],"study_design_scores_gemma":[0.002449854,0.0004251291,0.0001417722,0.00004204036,0.00001663055,0.000574199,0.0001329675,0.0002065983,0.01627789,0.3201507,0.6592063,0.0003759422],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06236517,0.0001323146,0.9320723,0.00378834,0.001002046,0.0001613277,0.00006313375,0.000229106,0.000186247],"genre_scores_gemma":[0.9644328,0.0001135142,0.03409199,0.001203552,0.00005074964,0.00004881326,0.00001532524,0.00001368826,0.00002953471],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9020677,"threshold_uncertainty_score":0.5418097,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4396904796","doi":"10.1007/s10009-024-00748-z","title":"An Event-B model of an automotive adaptive exterior light system","year":2024,"lang":"en","type":"article","venue":"International Journal on Software Tools for Technology Transfer","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Sherbrooke","funders":"Natural Sciences and Engineering Research Council of Canada; Agence Nationale de la Recherche","keywords":"Computer science; Visibility; Theory of computation; Context (archaeology); Event (particle physics); Controller (irrigation); Key (lock); Real-time computing; Algorithm; Computer security","retraction":null,"screen_n_in":null,"score":{"opus":0.03258320893785447,"gpt":0.3255985377719546,"spread":0.2930153288341001,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006621475,0.0002031091,0.0002463329,0.0008036205,0.0001008034,0.0003054953,0.002034474,0.0002581856,0.000006965113],"category_scores_gemma":[0.0001374377,0.0001770644,0.0001820186,0.000333817,0.00008853844,0.002388724,0.00004174025,0.0004464294,0.00001213862],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002912323,"about_ca_system_score_gemma":0.0001876885,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":9.756025e-7,"about_ca_topic_score_gemma":0.000001195164,"domain_scores_codex":[0.9981723,0.00008367987,0.0005649193,0.0004364573,0.0004993697,0.0002432885],"domain_scores_gemma":[0.9985014,0.0001058867,0.00008724433,0.0004186916,0.0007963997,0.000090413],"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.0001643915,0.0001857688,0.000008346087,0.00003173225,0.0001790744,0.00005985647,0.0005996356,0.008296204,0.01181427,0.6839969,0.00002512262,0.2946387],"study_design_scores_gemma":[0.0005240553,0.001635359,0.00006257248,0.0004232049,0.00003155941,0.0005369378,0.0001792123,0.8576805,0.115137,0.02293522,0.0006045949,0.0002497517],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06379534,0.00009600109,0.9325511,0.0007670447,0.00156262,0.0002661629,0.0001121115,0.0008034357,0.00004613292],"genre_scores_gemma":[0.608049,0.00001031987,0.3916785,0.00007471516,0.00008259871,0.00005705308,0.000005175406,0.00001999804,0.00002265226],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8493843,"threshold_uncertainty_score":0.7220476,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2025290054","doi":"10.1007/s10009-014-0305-6","title":"Quantitative and qualitative analysis of SysML activity diagrams","year":2014,"lang":"en","type":"article","venue":"International Journal on Software Tools for Technology Transfer","topic":"Advanced Software Engineering Methodologies","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Systems Modeling Language; Correctness; Soundness; Model checking; Probabilistic logic; Theoretical computer science; Activity diagram; Programming language; Probabilistic CTL; Modeling language; Software engineering; Unified Modeling Language; Software; Artificial intelligence; Probabilistic analysis of algorithms","retraction":null,"screen_n_in":null,"score":{"opus":0.06253671070161998,"gpt":0.3890180161623299,"spread":0.3264813054607099,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000980351,0.0001765889,0.0004452131,0.001128884,0.00007617877,0.0000864215,0.0009059393,0.0001573224,0.000003164071],"category_scores_gemma":[0.004924957,0.0001539605,0.0002098183,0.0006634849,0.0001983482,0.0006117897,0.00006588191,0.0003355459,0.000001277357],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006890938,"about_ca_system_score_gemma":0.00002706904,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001818326,"about_ca_topic_score_gemma":0.000004510625,"domain_scores_codex":[0.9986402,0.0001667133,0.0003423582,0.0003158459,0.0003251725,0.000209701],"domain_scores_gemma":[0.9941399,0.004922965,0.0001228661,0.0002480198,0.000514299,0.00005202712],"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.0002341824,0.0001367325,0.000653036,0.00001913707,0.002513916,0.00001097573,0.002197103,0.01728939,0.00261349,0.5901374,0.00001646366,0.3841782],"study_design_scores_gemma":[0.004924896,0.006364808,0.02087629,0.0003625598,0.0010118,0.0002004765,0.001514063,0.04228272,0.08203617,0.8354129,0.003369809,0.00164347],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1988,0.00006230977,0.7993777,0.001035426,0.0003505567,0.00009708551,0.00003838753,0.0002312994,0.000007132557],"genre_scores_gemma":[0.5608613,0.00004259421,0.4389741,0.00006467762,0.00001492851,0.00002206402,0.000002823984,0.000008638995,0.000008754068],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.3825347,"threshold_uncertainty_score":0.6278327,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2007472189","doi":"10.1007/s10009-009-0122-5","title":"An approach for estimating the time needed to perform code changes in business applications","year":2009,"lang":"en","type":"article","venue":"International Journal on Software Tools for Technology Transfer","topic":"Software Engineering Research","field":"Computer Science","cited_by":3,"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":"Business process modeling; Artifact-centric business process model; Computer science; Business Process Model and Notation; Business rule; Business process management; Business process discovery; Business process; Source code; Metric (unit); Competitive advantage; Process management; Task (project management); Business; Work in process; Programming language; Systems engineering; Marketing","retraction":null,"screen_n_in":null,"score":{"opus":0.02550414897938195,"gpt":0.307833557107728,"spread":0.2823294081283461,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005809886,0.0001727101,0.0001866656,0.0007714537,0.000196757,0.0003748626,0.002662135,0.0001522588,0.000005822187],"category_scores_gemma":[0.0008521167,0.0001363963,0.00006943932,0.0007367586,0.00004658598,0.0004422137,0.00003998244,0.0003811092,0.000008621809],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001783015,"about_ca_system_score_gemma":0.00008131278,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001738588,"about_ca_topic_score_gemma":0.000003031432,"domain_scores_codex":[0.9985707,0.00001602605,0.0002902733,0.0003547881,0.0003891731,0.0003790107],"domain_scores_gemma":[0.9982741,0.0005893016,0.00003606142,0.0003946766,0.0006235495,0.00008234986],"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.0001520116,0.0004015552,0.0003444623,0.0000176313,0.00006722853,0.000009464406,0.0003911388,0.04897087,0.003061861,0.02192994,0.0004280843,0.9242257],"study_design_scores_gemma":[0.006533695,0.003535853,0.01391689,0.0003996746,0.00004845075,0.001151293,0.000264802,0.8764173,0.0243328,0.04072833,0.03105993,0.001610917],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03210516,0.000020503,0.9407331,0.02555534,0.0001887428,0.000947054,0.00003907894,0.000402024,0.000008949225],"genre_scores_gemma":[0.3378841,0.000006682022,0.6592583,0.001455465,0.0003037103,0.00100387,0.00002768543,0.00002542423,0.0000347143],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9226148,"threshold_uncertainty_score":0.5562078,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2085380106","doi":"10.1007/s10009-009-0117-2","title":"Approximating the safely reusable set of learned facts","year":2009,"lang":"en","type":"article","venue":"International Journal on Software Tools for Technology Transfer","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Theory of computation; Computer science; Set (abstract data type); Programming language; Theoretical computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.06439611653173218,"gpt":0.3409925668288614,"spread":0.2765964502971292,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009400569,0.0001427042,0.0001952038,0.0003286158,0.0001699749,0.0001775659,0.002405234,0.0001689933,0.00001239009],"category_scores_gemma":[0.001395304,0.0001030117,0.0001473495,0.0003131866,0.0001002436,0.0007477508,0.00004247701,0.0004895023,0.00001037265],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008689698,"about_ca_system_score_gemma":0.00006940516,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":7.292668e-7,"about_ca_topic_score_gemma":3.837824e-7,"domain_scores_codex":[0.9984563,0.0000606802,0.0005469618,0.000231009,0.0004621386,0.0002429396],"domain_scores_gemma":[0.9986101,0.0002926328,0.0001681649,0.0003996738,0.0004917171,0.00003765629],"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.00008785748,0.00006366547,0.00008972113,0.000004917287,0.00006482648,0.000006623792,0.000246972,0.0005014549,0.003466746,0.3928904,0.0001359612,0.6024409],"study_design_scores_gemma":[0.003250439,0.002783272,0.00336721,0.000367503,0.0000498511,0.001211515,0.0002830785,0.01656534,0.3739814,0.5470503,0.05041828,0.0006718645],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03230713,0.00004981547,0.9541039,0.01226905,0.000575172,0.0002318571,0.00001530303,0.0002015531,0.0002461743],"genre_scores_gemma":[0.4994307,0.0000364492,0.4996763,0.000684694,0.00008141316,0.00001868253,0.000003855166,0.000008877028,0.00005898099],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.601769,"threshold_uncertainty_score":0.4469564,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4385802534","doi":"10.1007/s10009-023-00714-1","title":"Publisher Correction: Algorithm selection for SMT","year":2023,"lang":"en","type":"article","venue":"International Journal on Software Tools for Technology Transfer","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":2,"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":"Theory of computation; Computer science; Selection (genetic algorithm); Algorithm; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.02441611369221025,"gpt":0.2934872561343329,"spread":0.2690711424421226,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004654974,0.0001853609,0.0001938917,0.0009418895,0.0001769383,0.0002594056,0.000398507,0.000324095,0.00005744217],"category_scores_gemma":[0.0007309581,0.0001926256,0.0001860652,0.0006297617,0.00003898753,0.0005142629,0.00001160015,0.0004443963,0.00002975199],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002364136,"about_ca_system_score_gemma":0.00004165622,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":5.256683e-7,"about_ca_topic_score_gemma":0.000002143243,"domain_scores_codex":[0.9987655,0.0000195131,0.0003917988,0.0002177181,0.0002751233,0.0003302975],"domain_scores_gemma":[0.99875,0.0003998677,0.00003423479,0.0001059038,0.0006494821,0.00006045869],"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.00007884433,0.00004187614,0.000516703,0.00001420932,0.0003394515,0.00000686495,0.00005464805,0.1120039,0.0003866616,0.001393898,0.05190875,0.8332542],"study_design_scores_gemma":[0.004159042,0.0006564609,0.0006428054,0.0001536313,0.00008922833,0.000696422,0.000152272,0.5588568,0.0126355,0.01835965,0.4028616,0.0007365625],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.003850284,0.00002545096,0.9786312,0.001662295,0.01263916,0.0003443155,0.00004667939,0.002671887,0.0001287444],"genre_scores_gemma":[0.06917712,0.0003105047,0.9210983,0.0007295443,0.002169343,0.001040859,0.0003393572,0.0003563828,0.004778587],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8325177,"threshold_uncertainty_score":0.7855046,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2622780030","doi":"10.1007/s10009-017-0461-6","title":"A qualitative assessment of $$\\alpha $$ α Rby in the perspective of the supervisory control theory","year":2017,"lang":"en","type":"article","venue":"International Journal on Software Tools for Technology Transfer","topic":"Petri Nets in System Modeling","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Parameterized complexity; Computer science; Alpha (finance); Perspective (graphical); Abstraction; Supervisory control theory; Theory of computation; Control (management); Supervisory control; Theoretical computer science; Rotation formalisms in three dimensions; Programming language; Artificial intelligence; Algorithm; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.06697194097679657,"gpt":0.3901902874634464,"spread":0.3232183464866498,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002506447,0.000142865,0.0002884716,0.0003347131,0.0002206507,0.0001531642,0.00522773,0.0001376744,0.000006071707],"category_scores_gemma":[0.00152607,0.00008425958,0.0002606188,0.0001482329,0.0003684276,0.0005299707,0.00009956289,0.0005452629,7.270716e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001862461,"about_ca_system_score_gemma":0.000200357,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001073097,"about_ca_topic_score_gemma":0.0000153718,"domain_scores_codex":[0.9980024,0.0003474682,0.0005547545,0.0002323639,0.0006723667,0.000190684],"domain_scores_gemma":[0.9966245,0.001495106,0.0002849314,0.000698623,0.0008779828,0.0000188082],"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.00010753,0.0001914402,0.002042564,0.000008835988,0.0002486195,0.00001323836,0.006801823,0.0003958255,0.0006689263,0.9748223,0.00002531522,0.01467359],"study_design_scores_gemma":[0.008152238,0.001064879,0.02628524,0.001041657,0.00007483199,0.0004163326,0.0160371,0.005970304,0.006721949,0.9329988,0.0008216711,0.0004149846],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1348866,0.0001337357,0.8522845,0.01123493,0.0006688967,0.0003612511,0.00006820612,0.00002675858,0.0003351662],"genre_scores_gemma":[0.9905083,0.00002415695,0.009004049,0.0003270086,0.00004731902,0.00006041831,4.119644e-7,0.000009253887,0.00001903978],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8556218,"threshold_uncertainty_score":0.9714509,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2058806531","doi":"10.1007/s10009-002-0096-z","title":"Refinement-based formal verification with heterogeneous timing","year":2003,"lang":"en","type":"article","venue":"International Journal on Software Tools for Technology Transfer","topic":"Embedded Systems Design Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Asynchronous communication; Handshake; Theory of computation; Distributed computing; Transfer (computing); Formal verification; Synchronization (alternating current); Programming language; Parallel computing; Computer network","retraction":null,"screen_n_in":null,"score":{"opus":0.03253096513669736,"gpt":0.2788244340699695,"spread":0.2462934689332722,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004660309,0.000217601,0.0002037052,0.0006206763,0.000188712,0.0002996043,0.001311299,0.0002052898,0.00002274774],"category_scores_gemma":[0.00019179,0.0001819595,0.0001312349,0.0002536718,0.00006775706,0.0007893803,0.00001806029,0.0003446146,0.0000148966],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002176113,"about_ca_system_score_gemma":0.0001479742,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":7.967151e-7,"about_ca_topic_score_gemma":0.000002749287,"domain_scores_codex":[0.9982671,0.00005374996,0.0004479349,0.0003550373,0.0005163306,0.0003599185],"domain_scores_gemma":[0.9986929,0.0001517373,0.0001145857,0.0004096814,0.0005618746,0.00006920487],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0005338588,0.000594007,0.001276317,0.00004217363,0.0005416039,0.0004087229,0.0002057522,0.003149818,0.0104689,0.6526231,0.0007779655,0.3293778],"study_design_scores_gemma":[0.005670646,0.004024781,0.000123289,0.0005008836,0.00005668556,0.003938324,0.00005430589,0.003845678,0.8375926,0.02174822,0.121399,0.001045585],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01989513,0.00005246693,0.9769045,0.00143863,0.0004280974,0.0003605302,0.00001330158,0.0007298081,0.0001775685],"genre_scores_gemma":[0.7191457,0.000009147826,0.2800022,0.0005710152,0.00003890699,0.000159392,0.00000729832,0.00002472255,0.00004162705],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8271237,"threshold_uncertainty_score":0.7420092,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2050388183","doi":"10.1007/s10009-014-0326-1","title":"On piggyback runtime monitoring of object-oriented programs","year":2014,"lang":"en","type":"article","venue":"International Journal on Software Tools for Technology Transfer","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université du Québec à Chicoutimi","funders":"","keywords":"Computer science; State (computer science); Object (grammar); Process (computing); Task (project management); Overhead (engineering); Code (set theory); Programming language; Theory of computation; Sequence (biology); Distributed computing; Operating system; Set (abstract data type); Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.01863011222700764,"gpt":0.2791466290072799,"spread":0.2605165167802723,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003760948,0.0001854071,0.0002440899,0.000601768,0.000124559,0.0001535948,0.001461434,0.00019277,0.000006199301],"category_scores_gemma":[0.0004451979,0.0001643225,0.0001824244,0.0003152849,0.0000803331,0.0003184455,0.00005808595,0.0003856949,0.0000122926],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007949202,"about_ca_system_score_gemma":0.00004482971,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":7.548536e-7,"about_ca_topic_score_gemma":1.98559e-7,"domain_scores_codex":[0.9984609,0.00004196656,0.0004574678,0.0003087095,0.0004706919,0.0002602205],"domain_scores_gemma":[0.9985701,0.0002772095,0.0001247818,0.0003137957,0.000654718,0.00005943354],"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.0001983144,0.0005387139,0.004657661,0.0000142711,0.0002247077,0.00001607542,0.0001426586,0.004325514,0.0005633761,0.3601893,0.000395197,0.6287342],"study_design_scores_gemma":[0.01611531,0.02070033,0.006548494,0.003794731,0.0001344027,0.001031953,0.0001297316,0.06812008,0.4672893,0.2954797,0.1176659,0.002990067],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07445711,0.0000223133,0.9223813,0.001027711,0.0009936328,0.0001983045,0.000004827635,0.0007259834,0.0001887515],"genre_scores_gemma":[0.7317454,0.00002671235,0.2678285,0.0001560235,0.0001176866,0.00003416908,0.000005412652,0.00001738876,0.00006871774],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6572883,"threshold_uncertainty_score":0.6700877,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2006124204","doi":"10.1007/s10009-011-0187-9","title":"Guest editors’ introduction to the special section from the international symposium on web systems evolution","year":2011,"lang":"en","type":"article","venue":"International Journal on Software Tools for Technology Transfer","topic":"Service-Oriented Architecture and Web Services","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta; Queen's University","funders":"","keywords":"Computer science; World Wide Web; Web development; Web modeling; Web service; Ajax; Web standards; Web API; Web engineering; The Internet; Mashup; Web page; Web application security","retraction":null,"screen_n_in":null,"score":{"opus":0.01379348881236924,"gpt":0.2256714390977617,"spread":0.2118779502853925,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000442649,0.0002437231,0.0001690096,0.0003617282,0.0004063053,0.0005079886,0.003313529,0.00022046,0.00005186823],"category_scores_gemma":[0.0001208102,0.0001524559,0.0001723952,0.0003899971,0.00006389552,0.0006388717,0.0001280129,0.000722927,0.0001170917],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003160049,"about_ca_system_score_gemma":0.00007762406,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007598781,"about_ca_topic_score_gemma":0.0001939411,"domain_scores_codex":[0.997851,0.0000787546,0.0004558973,0.0005004838,0.0008256455,0.0002882355],"domain_scores_gemma":[0.9983169,0.0003008593,0.0001236932,0.0005078014,0.0006794487,0.00007130033],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.003805097,0.001441443,0.004332087,0.00001990178,0.002500387,0.0001103362,0.009462566,0.008998351,0.009808075,0.4521077,0.399936,0.1074781],"study_design_scores_gemma":[0.0009052788,0.0006845974,0.00144907,0.0001068784,0.00003725138,0.0002440451,0.0003302153,0.000817721,0.005065185,0.004508239,0.9855946,0.0002568605],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04589723,0.0000472456,0.6192071,0.1174338,0.2157643,0.0006384716,0.000162069,0.0004265554,0.0004231998],"genre_scores_gemma":[0.6550678,0.00006396131,0.004144224,0.005349149,0.3348326,0.0002691025,0.00007902157,0.00004817763,0.0001459216],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6150629,"threshold_uncertainty_score":0.6216972,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4245891996","doi":"10.1007/s10009-011-0194-x","title":"Preface","year":2011,"lang":"en","type":"article","venue":"International Journal on Software Tools for Technology Transfer","topic":"Ubiquitin and proteasome pathways","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"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; Theory of computation; Programming language","retraction":null,"screen_n_in":null,"score":{"opus":0.03773029742407626,"gpt":0.2723309694881597,"spread":0.2346006720640835,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001490245,0.0001431621,0.0001119309,0.0001593503,0.00008219874,0.00004015797,0.0005865716,0.0002699858,0.0001570769],"category_scores_gemma":[0.0002391522,0.0001276403,0.0001593763,0.00005261427,0.00008687947,0.0000132852,0.00003247285,0.00022854,0.00003366365],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000218338,"about_ca_system_score_gemma":0.00005650434,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":7.093462e-7,"about_ca_topic_score_gemma":0.000002522295,"domain_scores_codex":[0.9991549,0.00001681831,0.0002247417,0.000227269,0.0001604027,0.0002159309],"domain_scores_gemma":[0.9994305,0.00001760999,0.0000382669,0.0001739872,0.0002797073,0.00005988663],"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.004332761,0.001036925,0.009910556,0.00003108297,0.001585749,0.0001739206,0.0004258205,0.00003732711,0.3916268,0.05230147,0.006645894,0.5318917],"study_design_scores_gemma":[0.001231236,0.001127096,0.0005291714,0.00003293196,0.00001709254,0.0003634031,0.00003980107,0.000002373884,0.7989816,0.006412026,0.1910557,0.0002074985],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7463635,0.0002664714,0.2491774,0.0008381347,0.001030541,0.0003225543,0.0001483315,0.0001201637,0.001732931],"genre_scores_gemma":[0.9841206,0.0001573621,0.01393337,0.0008209231,0.0003096457,0.00008222164,0.0000461884,0.00003280249,0.0004968641],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5316842,"threshold_uncertainty_score":0.5205021,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W376991050","doi":"10.1007/s100090100043","title":"A light-weight framework for hardware verification","year":2001,"lang":"en","type":"article","venue":"International Journal on Software Tools for Technology Transfer","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Gas meter prover; Automated theorem proving; Mathematical proof; Correctness; Domain (mathematical analysis); Programming language; Theory of computation; Formal verification; Formal proof; Automated reasoning; Formal methods; Rule of inference; First-order logic; Theoretical computer science; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.03967065511286106,"gpt":0.3275038002613074,"spread":0.2878331451484464,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005655546,0.0002343133,0.0002408089,0.000650525,0.0002759814,0.0003905551,0.002411944,0.0004261294,0.0000315912],"category_scores_gemma":[0.001656392,0.0002164803,0.0002642422,0.0004194543,0.00005766806,0.001177571,0.00004453796,0.0005205313,0.00004255216],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002303577,"about_ca_system_score_gemma":0.00009396612,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":3.662801e-7,"about_ca_topic_score_gemma":6.698112e-7,"domain_scores_codex":[0.9980744,0.00004148297,0.0005611881,0.0004703302,0.0004676348,0.000384983],"domain_scores_gemma":[0.9978767,0.0004034957,0.0001416274,0.0005370438,0.0009499926,0.00009115763],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0002163684,0.0001249331,0.0001954797,0.000006803111,0.000100182,0.00001297509,0.0001064422,0.00004723516,0.0009040969,0.7022271,0.0004747199,0.2955836],"study_design_scores_gemma":[0.001669853,0.000810615,0.0005795023,0.000182836,0.00003199063,0.0006333237,0.00004040437,0.002619172,0.05031064,0.4061202,0.5365542,0.0004472996],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.006609392,0.0001141142,0.9744054,0.01452227,0.003054888,0.0005548152,0.00003814857,0.0005990602,0.0001019163],"genre_scores_gemma":[0.08099364,0.0001892017,0.9166889,0.001064282,0.0004661845,0.0004187653,0.00001923289,0.00003676124,0.0001230284],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.5360795,"threshold_uncertainty_score":0.882781,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4396932180","doi":"10.1007/s10009-024-00749-y","title":"Modeling of a speed control system using Event-B","year":2024,"lang":"en","type":"article","venue":"International Journal on Software Tools for Technology Transfer","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Sherbrooke","funders":"Natural Sciences and Engineering Research Council of Canada; Agence Nationale de la Recherche","keywords":"Computer science; Theory of computation; Event (particle physics); Control (management); Algorithm; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.04491269442905126,"gpt":0.331886861746553,"spread":0.2869741673175017,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006710252,0.0001451423,0.0002219881,0.0007528303,0.00007734986,0.0002396582,0.001229243,0.0001844038,0.000005103269],"category_scores_gemma":[0.0002518346,0.0001281108,0.0002169723,0.0003025914,0.0000517767,0.0008326285,0.00003037576,0.0003614849,0.000008156529],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002621936,"about_ca_system_score_gemma":0.0001321741,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002012554,"about_ca_topic_score_gemma":3.134799e-7,"domain_scores_codex":[0.9984811,0.000044718,0.0005767611,0.0002663129,0.0004243045,0.0002068068],"domain_scores_gemma":[0.9989984,0.0001531603,0.0000540057,0.0002360911,0.000515888,0.00004244753],"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.0001392586,0.00006841029,0.00006318835,0.0000848621,0.0003776311,0.00007565081,0.0001363791,0.09482665,0.007620593,0.7853711,0.00001488343,0.1112214],"study_design_scores_gemma":[0.0006541005,0.0001610266,0.000007404958,0.0004969245,0.00003082937,0.000722228,0.00004328264,0.9807619,0.009312202,0.007158063,0.000523283,0.0001287185],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05673664,0.0002527202,0.9392583,0.0006381521,0.002386025,0.000221741,0.00004138395,0.0004379932,0.00002701749],"genre_scores_gemma":[0.7006544,0.00001146506,0.2991458,0.00005602146,0.00009891232,0.00001066743,0.000001451321,0.00001445994,0.00000678288],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8859353,"threshold_uncertainty_score":0.5224206,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1971429192","doi":"10.1007/s10009-002-0090-5","title":"A framework for distributing object-oriented designs","year":2003,"lang":"en","type":"article","venue":"International Journal on Software Tools for Technology Transfer","topic":"Software Engineering Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université du Québec en Outaouais","funders":"","keywords":"Computer science; Object-oriented programming; Object-oriented design; Object (grammar); Software engineering; Theory of computation; Process (computing); Software; Programming language; Distributed computing; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.04186576725453212,"gpt":0.3245215446571229,"spread":0.2826557774025907,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.0006815384,0.0002328588,0.0002435126,0.0005998039,0.0002542411,0.0003554707,0.001677225,0.0003271709,0.00002284662],"category_scores_gemma":[0.01408631,0.0002201682,0.0002575777,0.000500133,0.00007733733,0.0004837451,0.00004671545,0.0007361387,0.00001615125],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002905233,"about_ca_system_score_gemma":0.0001861615,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":3.635444e-7,"about_ca_topic_score_gemma":4.457982e-7,"domain_scores_codex":[0.9979434,0.00003706817,0.0004282724,0.0004358758,0.0005531879,0.0006021901],"domain_scores_gemma":[0.9953803,0.003217497,0.00005830614,0.0003711629,0.0008485955,0.0001241168],"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.0001070534,0.0001692556,0.002138649,0.00001433687,0.000253853,0.00006127506,0.0001009266,0.0003818545,0.0004825976,0.912201,0.000448191,0.08364097],"study_design_scores_gemma":[0.006869268,0.00274307,0.001365494,0.0006883997,0.00006075424,0.001778183,0.0001336152,0.001862949,0.1416082,0.5629628,0.2785247,0.001402575],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01815599,0.0000991897,0.9764055,0.002101487,0.001953919,0.0004747793,0.000078637,0.0007176043,0.00001288962],"genre_scores_gemma":[0.4948017,0.00001861055,0.5044838,0.0002405423,0.0001342973,0.0002287395,0.00001126072,0.00003421124,0.00004675816],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4766457,"threshold_uncertainty_score":0.9942185,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}