{"meta":{"query_hash":"01b6e37955eb","filters":{"venue":"International Journal on Software Tools for Technology Transfer"},"cohort_total":42,"direct_labels_cover":0,"predictions_cover":42,"exported":42,"export_cap":100000,"truncated":false,"label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"permalink":"https://metacan.xera.ac/q/01b6e37955eb","api":"https://metacan.xera.ac/api/v1/cohort?venue=International+Journal+on+Software+Tools+for+Technology+Transfer"},"results":[{"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.06308820971383697,"score_gpt":0.317853069119804,"score_spread":0.25476485940596705,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1273632282","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45504567,0.0010112547,0.5166716,0.0007691598,0.00018199069,0.00034694417,0.00041766523,0.0050903177,0.02046547],"genre_scores_gemma":[0.72308195,0.0005627067,0.2585904,0.00016511336,0.000060669558,0.00014783948,0.0011586633,0.0013633101,0.014869305],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9962872,0.001065942,0.00021420229,0.00057010836,0.0016521557,0.00021032064],"domain_scores_gemma":[0.98345596,0.00451457,0.0016578258,0.0078101833,0.0019492427,0.0006121655],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033843366,0.0005225644,0.00034109777,0.0011707408,0.00057004887,0.0039145057,0.002723888,0.0011429226,0.003712588],"category_scores_gemma":[0.014229093,0.0005929699,0.00049295614,0.0018993112,0.0018619354,0.0046542613,0.002615562,0.001654718,0.0012075182],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010870186,0.0010076372,0.03703025,0.0005149291,0.0002036049,0.0056169294,0.0066070403,0.020236123,0.0655193,0.18787798,0.00807707,0.6662221],"study_design_scores_gemma":[0.000625194,0.0036397807,0.026533926,0.00081914786,0.0008434092,0.013516051,0.0043778033,0.27097946,0.18106239,0.21075259,0.28650004,0.00035016684],"about_ca_topic_score_codex":0.0014022933,"about_ca_topic_score_gemma":0.0012873901,"teacher_disagreement_score":0.0039145057,"about_ca_system_score_codex":0.0010568177,"about_ca_system_score_gemma":0.0014509195,"threshold_uncertainty_score":0.017898321},"labels":[],"label_agreement":null},{"id":"W1515040974","doi":"10.1007/s10009-009-0109-2","title":"Encoding a process algebra using the Event B method","year":2009,"lang":"en","type":"article","venue":"International Journal on Software Tools for Technology Transfer","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Moncton","funders":"","keywords":"Computer science; Process calculus; Event (particle physics); Asynchronous communication; Theory of computation; Semantics (computer science); ENCODE; Theoretical computer science; Process (computing); Operator (biology); Programming language; Algorithm; Algebra over a field; Mathematics","score_opus":0.04812510076258449,"score_gpt":0.38269175519297816,"score_spread":0.3345666544303937,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1515040974","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019583115,0.000039590268,0.9925127,0.00008001543,0.00007171457,0.00006665397,0.00022403119,0.002086518,0.0029606053],"genre_scores_gemma":[0.13455683,0.0003102515,0.8542262,0.00016068634,0.00008038805,0.00025714314,0.0009178515,0.001131159,0.008359561],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99892896,0.0003129058,0.00011439675,0.00022871332,0.00028748153,0.00012747102],"domain_scores_gemma":[0.9983424,0.00089834264,0.00010644866,0.00039326795,0.00018857187,0.00007101926],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001442653,0.0007957694,0.0006240812,0.0009709159,0.00095962535,0.0027125967,0.001171303,0.0011217111,0.0155462315],"category_scores_gemma":[0.003067529,0.0006864272,0.0018566075,0.00096994004,0.0015556375,0.0030298366,0.001600181,0.0019267292,0.003347452],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038714215,0.0001360566,0.00042016673,0.00036028604,0.000049970673,0.00044435027,0.00033282378,0.025620965,0.011837318,0.8766349,0.004656698,0.07911935],"study_design_scores_gemma":[0.00025260606,0.00012043279,0.00015653353,0.00016495974,0.000117400545,0.0004010818,0.00012930168,0.18585129,0.034580328,0.6858058,0.09232675,0.00009352002],"about_ca_topic_score_codex":0.002432257,"about_ca_topic_score_gemma":0.002052618,"teacher_disagreement_score":0.0155462315,"about_ca_system_score_codex":0.000647872,"about_ca_system_score_gemma":0.0013173172,"threshold_uncertainty_score":0.052007318},"labels":[],"label_agreement":null},{"id":"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Predicate abstraction; Predicate (mathematical logic); Programming language; Memory safety; Model checking; Programmer; Program analysis; Symbolic execution; Static analysis; Software","score_opus":0.029266124064769698,"score_gpt":0.3019749021356067,"score_spread":0.272708778070837,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1577404745","genre_codex":"methods","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030684728,0.000747805,0.85916394,0.0012193903,0.0004702523,0.00013640468,0.0011014462,0.075376466,0.031099547],"genre_scores_gemma":[0.43899733,0.0008296994,0.52607524,0.0011386661,0.00017714707,0.00019560504,0.0033601222,0.00766588,0.02156033],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99801517,0.0005311157,0.00011034089,0.0003188596,0.000876713,0.00014789692],"domain_scores_gemma":[0.9967263,0.0012889211,0.00016495664,0.0011925183,0.0005339804,0.000093411494],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015388378,0.0009394044,0.0010077625,0.0013998662,0.0007671447,0.0018744217,0.0017273582,0.0015231547,0.009388052],"category_scores_gemma":[0.009137308,0.000836429,0.00095891743,0.0010229489,0.0011384494,0.0036142801,0.0020334453,0.0022984454,0.0034627686],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010958522,0.0003966122,0.004156827,0.0008025023,0.00026012483,0.0009579579,0.0003163709,0.10888505,0.029580772,0.27376372,0.097338066,0.48244604],"study_design_scores_gemma":[0.0004143246,0.00023535594,0.00079142425,0.00027538367,0.00021956506,0.000743638,0.000073722185,0.6032544,0.04506527,0.2504209,0.09844049,0.00006556918],"about_ca_topic_score_codex":0.0026645786,"about_ca_topic_score_gemma":0.0036865687,"teacher_disagreement_score":0.009388052,"about_ca_system_score_codex":0.00059171795,"about_ca_system_score_gemma":0.002096661,"threshold_uncertainty_score":0.031406164},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"","keywords":"Computer science; Object-oriented programming; Object-oriented design; Object (grammar); Software engineering; Theory of computation; Process (computing); Software; Programming language; Distributed computing; Artificial intelligence","score_opus":0.041865767254532116,"score_gpt":0.32452154465712285,"score_spread":0.28265577740259074,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1971429192","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008008505,0.000059677015,0.99258125,0.00009490253,0.00004104926,0.00010695576,0.000039232058,0.0047065206,0.0015694739],"genre_scores_gemma":[0.019215459,0.0002357747,0.9730997,0.00007169782,0.000041445364,0.00028946844,0.0002505841,0.0012292517,0.005566637],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99662256,0.00078543974,0.00041122283,0.00040406495,0.0014984536,0.00027822246],"domain_scores_gemma":[0.9955983,0.0010325515,0.00026539864,0.002160548,0.0006472098,0.00029599143],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0061098617,0.0016644694,0.0013286929,0.003050943,0.0025384005,0.0065946337,0.004250171,0.002873995,0.010840183],"category_scores_gemma":[0.009523557,0.0022693942,0.0028334497,0.002547892,0.003195753,0.0079909125,0.0049585314,0.003571841,0.0050651478],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010551878,0.00017726484,0.0007911012,0.00030119938,0.00007664994,0.0003130606,0.0009973636,0.01760406,0.005567786,0.7470789,0.010228608,0.21675858],"study_design_scores_gemma":[0.0001654674,0.00014291714,0.00027609096,0.0003294004,0.00020653514,0.0005222798,0.00023435659,0.15117064,0.009676495,0.5920823,0.24506518,0.0001283482],"about_ca_topic_score_codex":0.004282657,"about_ca_topic_score_gemma":0.0060493336,"teacher_disagreement_score":0.010840183,"about_ca_system_score_codex":0.0015802702,"about_ca_system_score_gemma":0.0030608794,"threshold_uncertainty_score":0.036264002},"labels":[],"label_agreement":null},{"id":"W1971979814","doi":"10.1007/s100090200073","title":"Comparison of SPIN and VIS for protocol verification","year":2003,"lang":"en","type":"article","venue":"International Journal on Software Tools for Technology Transfer","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Asynchronous communication; Protocol (science); Theory of computation; Software; Formal verification; Software verification; Formal methods; Promela; Model checking; Communications protocol; Embedded system; Programming language; Computer network; Software system; Software construction","score_opus":0.06635256689107977,"score_gpt":0.41037756509548057,"score_spread":0.3440249982044008,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1971979814","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32537654,0.0043117623,0.6043215,0.00080349465,0.0005869672,0.00041685312,0.00066162605,0.019248074,0.044273127],"genre_scores_gemma":[0.9212441,0.0005908127,0.0739753,0.000106925894,0.00004467693,0.00010112174,0.00031326327,0.00045049502,0.003173373],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9952969,0.0021639743,0.00020719525,0.00028582066,0.001675805,0.0003704234],"domain_scores_gemma":[0.9779333,0.013826242,0.0009398912,0.0047520706,0.0021715667,0.00037708305],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005613618,0.00091206864,0.001189139,0.0021877454,0.00087933434,0.002306592,0.0017049896,0.0011004532,0.008346822],"category_scores_gemma":[0.022209609,0.0004596215,0.000628394,0.0010975495,0.001382592,0.004771032,0.0015617105,0.0011687061,0.0009241527],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.012067119,0.00074164907,0.010064096,0.0016661789,0.0005799383,0.000212413,0.00038943146,0.14852953,0.016358111,0.22235368,0.006468273,0.5805695],"study_design_scores_gemma":[0.00040665394,0.001254757,0.0027883584,0.0001785455,0.00029776755,0.00020461479,0.0004348072,0.88115776,0.023793496,0.08239777,0.0070107076,0.00007468651],"about_ca_topic_score_codex":0.0023411757,"about_ca_topic_score_gemma":0.0055733807,"teacher_disagreement_score":0.008346822,"about_ca_system_score_codex":0.0013987628,"about_ca_system_score_gemma":0.0023510442,"threshold_uncertainty_score":0.02968806},"labels":[],"label_agreement":null},{"id":"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Heap (data structure); Reachability; Programming language; Pointer (user interface); Separation logic; Predicate (mathematical logic); Predicate abstraction; Theoretical computer science; Model checking; Artificial intelligence","score_opus":0.04833891506085652,"score_gpt":0.30122490532092105,"score_spread":0.25288599026006453,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1975757993","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018305646,0.00022883908,0.9523381,0.00097655033,0.00012789833,0.00010425069,0.00077002845,0.0031185066,0.024030231],"genre_scores_gemma":[0.6470113,0.00038966758,0.33011758,0.00049776374,0.00015463665,0.0004541051,0.000822642,0.00057074963,0.01998162],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993919,0.00010908341,0.00005105513,0.00013714784,0.0001619599,0.00014879239],"domain_scores_gemma":[0.9991698,0.00035286476,0.00006049235,0.00027011638,0.00009339389,0.000053340755],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006505508,0.0007501335,0.0006123252,0.0010355425,0.0010815411,0.0039310134,0.0026516642,0.0026756641,0.016127786],"category_scores_gemma":[0.0017763756,0.00067779183,0.001287633,0.0008992039,0.002306186,0.0076684286,0.002469069,0.0023969337,0.0027467324],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000985949,0.00004419477,0.0001971455,0.0000878866,0.000010370698,0.00034145682,0.00019420736,0.015359201,0.006070465,0.96831405,0.0014212072,0.007861319],"study_design_scores_gemma":[0.00007113811,0.00007754039,0.00010969259,0.000055111625,0.00007221448,0.00032845148,0.00010053534,0.16881494,0.016809773,0.7901699,0.023345055,0.00004567694],"about_ca_topic_score_codex":0.0020510363,"about_ca_topic_score_gemma":0.002561235,"teacher_disagreement_score":0.016127786,"about_ca_system_score_codex":0.0010206637,"about_ca_system_score_gemma":0.0010269436,"threshold_uncertainty_score":0.053952873},"labels":[],"label_agreement":null},{"id":"W1990325313","doi":"10.1007/s10009-007-0040-3","title":"Improving state class constructions for CTL* model checking of time Petri nets","year":2007,"lang":"en","type":"article","venue":"International Journal on Software Tools for Technology Transfer","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Petri net; Computer science; Theory of computation; Class (philosophy); State (computer science); Model checking; Process architecture; Stochastic Petri net; Programming language; Theoretical computer science; CTL*; Artificial intelligence","score_opus":0.028888280928302274,"score_gpt":0.3112200504831442,"score_spread":0.28233176955484196,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1990325313","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032844853,0.000058120946,0.9602982,0.00014447697,0.000052511507,0.00013168948,0.00012476521,0.004643016,0.0017023718],"genre_scores_gemma":[0.5754927,0.00011834688,0.41915363,0.00017859894,0.00005786217,0.0003814821,0.0006745096,0.0021446228,0.0017982901],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99167436,0.0026803985,0.00057568814,0.0011681011,0.0026988138,0.0012027184],"domain_scores_gemma":[0.9526463,0.034377053,0.0019081491,0.00801938,0.002556136,0.0004930842],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006569622,0.0014395487,0.0016787769,0.00235592,0.001742554,0.00312718,0.0036728368,0.001763145,0.006071902],"category_scores_gemma":[0.028422205,0.0017490383,0.004391899,0.0015872681,0.0034849294,0.006583129,0.006020439,0.0046366802,0.0011495332],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013953184,0.00056180736,0.006737729,0.000656427,0.00024832832,0.0005523106,0.0013263061,0.39990526,0.025924925,0.362185,0.0036715567,0.19683501],"study_design_scores_gemma":[0.000119547534,0.00010184266,0.00029005995,0.00006644748,0.00012567869,0.000059043898,0.00007642604,0.84855145,0.021793764,0.12668154,0.002074643,0.000059473117],"about_ca_topic_score_codex":0.005752826,"about_ca_topic_score_gemma":0.007040136,"teacher_disagreement_score":0.006569622,"about_ca_system_score_codex":0.0029172364,"about_ca_system_score_gemma":0.0037287837,"threshold_uncertainty_score":0.034743905},"labels":[],"label_agreement":null},{"id":"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Programming language; Java; Java Modeling Language; Compiler; Assertion; Eclipse; Java annotation; Real time Java; Software engineering","score_opus":0.26508377289896135,"score_gpt":0.4006144419160369,"score_spread":0.13553066901707556,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1998421080","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03950153,0.00042269423,0.87916607,0.00081215356,0.00039173305,0.00076719595,0.00030056646,0.045474205,0.03316386],"genre_scores_gemma":[0.15470691,0.00032049068,0.7920955,0.00069534424,0.00011458199,0.00039625773,0.0015652238,0.013128275,0.03697754],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9972121,0.00054865336,0.00023544706,0.0004057494,0.0011567646,0.00044118045],"domain_scores_gemma":[0.99611276,0.0005694098,0.00023161128,0.0013813183,0.0011718089,0.00053322816],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0047137253,0.0008093289,0.0007441094,0.0016485834,0.00078260346,0.0037981365,0.004024137,0.00206582,0.015607432],"category_scores_gemma":[0.007813308,0.0009831571,0.0011471327,0.0005937687,0.0009298211,0.0049418337,0.0034014145,0.003745657,0.006193421],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014931414,0.0021960037,0.006353696,0.0010116583,0.00011920651,0.0007312083,0.0015052018,0.0061260844,0.32513744,0.096802756,0.031436246,0.52708745],"study_design_scores_gemma":[0.0008164031,0.0028508848,0.0070475773,0.00075314153,0.0002907332,0.0013892585,0.00045849336,0.10031533,0.33719802,0.039661795,0.5089486,0.00026978404],"about_ca_topic_score_codex":0.0015579046,"about_ca_topic_score_gemma":0.0019394959,"teacher_disagreement_score":0.015607432,"about_ca_system_score_codex":0.0008770353,"about_ca_system_score_gemma":0.00222696,"threshold_uncertainty_score":0.05221212},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.013793488812369243,"score_gpt":0.22567143909776172,"score_spread":0.21187795028539247,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2006124204","genre_codex":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00014068146,0.013577273,0.0022418743,0.025275689,0.9555403,0.000020585107,0.00007018396,0.00011777064,0.0030157405],"genre_scores_gemma":[0.0015638429,0.01454867,0.0014149881,0.01765895,0.93549854,0.000052666215,0.0001655997,0.00023924014,0.028857457],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9977475,0.00031565691,0.000342965,0.00039797122,0.0009411955,0.00025484373],"domain_scores_gemma":[0.99036074,0.0020815704,0.0008043182,0.00034405725,0.0048729987,0.0015362625],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033749905,0.0026806109,0.002271131,0.003495535,0.0014218761,0.0050149956,0.0020840652,0.0040762364,0.02340769],"category_scores_gemma":[0.010554602,0.0007844779,0.0021338277,0.0016134229,0.0008542475,0.0044848025,0.0024716577,0.0075691342,0.01585634],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030211266,0.000026164531,0.00010411289,0.0001484414,0.000014320594,0.00008415437,0.000016643515,0.00009075095,0.00024642074,0.00056337024,0.9741434,0.024532],"study_design_scores_gemma":[0.000013626396,0.000043727396,0.00043587858,0.00015984113,0.000030311536,0.00026949757,0.0000267417,0.00032459036,0.00023088507,0.00096126273,0.99748456,0.000018986917],"about_ca_topic_score_codex":0.00078717555,"about_ca_topic_score_gemma":0.002734006,"teacher_disagreement_score":0.02340769,"about_ca_system_score_codex":0.0011384983,"about_ca_system_score_gemma":0.0012040966,"threshold_uncertainty_score":0.078306556},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.02550414897938195,"score_gpt":0.30783355710772803,"score_spread":0.28232940812834606,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2007472189","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21133998,0.0012591172,0.7803951,0.0002028318,0.00009847463,0.00024356651,0.00075806736,0.0024837174,0.003219045],"genre_scores_gemma":[0.5468384,0.0003588564,0.44946307,0.000044938042,0.00004455016,0.00016960556,0.00062218367,0.00017446287,0.0022839026],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99782264,0.00035594593,0.00015689508,0.0005057251,0.0009757808,0.00018304902],"domain_scores_gemma":[0.98996896,0.006378615,0.0011670474,0.00065532734,0.0015526568,0.00027739772],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016654981,0.0013130521,0.0009255564,0.004580856,0.00074433745,0.0015721994,0.00137645,0.0016569289,0.0020827071],"category_scores_gemma":[0.01375511,0.00073224446,0.0010490733,0.0029802236,0.00044361473,0.001849416,0.00085845834,0.0010464655,0.0006650685],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010850225,0.0005262064,0.046739623,0.00045403093,0.0003082922,0.00026153715,0.00055895676,0.30988964,0.039113183,0.006959275,0.0019952133,0.5921091],"study_design_scores_gemma":[0.00003616323,0.00029415154,0.011250418,0.000024078607,0.00010131914,0.00016848344,0.00015236504,0.9717665,0.010575262,0.0037791464,0.0018015187,0.000050583803],"about_ca_topic_score_codex":0.021168666,"about_ca_topic_score_gemma":0.018609144,"teacher_disagreement_score":0.021168666,"about_ca_system_score_codex":0.0016907662,"about_ca_system_score_gemma":0.0018446811,"threshold_uncertainty_score":0.042090952},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.019576658364042307,"score_gpt":0.290065488886945,"score_spread":0.2704888305229027,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2007846881","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00081640313,0.00014684358,0.9896264,0.00015439982,0.000057508605,0.000048386428,0.00027346355,0.0051485947,0.0037279637],"genre_scores_gemma":[0.050888475,0.000315391,0.93608505,0.00028966894,0.00015340996,0.00028737963,0.0011631042,0.0039130123,0.006904604],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9958187,0.0010519325,0.0003666608,0.0007594273,0.0016322539,0.0003710646],"domain_scores_gemma":[0.99521315,0.0019021607,0.00020918979,0.0016972215,0.0008427644,0.00013546104],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004071029,0.0012648695,0.0016019898,0.0037812379,0.0019053502,0.005918367,0.0045399033,0.0017607698,0.02973786],"category_scores_gemma":[0.009969069,0.0018044988,0.0045667295,0.0030519408,0.0025154336,0.007904973,0.004684014,0.0048588836,0.009099188],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012523853,0.000049622224,0.0004116003,0.00033916766,0.00008570543,0.00012146767,0.0002630514,0.00874813,0.0025077604,0.8341739,0.012880015,0.14029431],"study_design_scores_gemma":[0.000052337702,0.00002878317,0.00017034293,0.00017029194,0.000094971016,0.00024377658,0.0001069394,0.10464799,0.0060853865,0.77513844,0.11319436,0.00006635777],"about_ca_topic_score_codex":0.0024251335,"about_ca_topic_score_gemma":0.0037084909,"teacher_disagreement_score":0.02973786,"about_ca_system_score_codex":0.0017892034,"about_ca_system_score_gemma":0.0024811507,"threshold_uncertainty_score":0.09948307},"labels":[],"label_agreement":null},{"id":"W2008416362","doi":"10.1007/s10009-002-0082-5","title":"Hierarchical formal verification using a hybrid tool","year":2003,"lang":"en","type":"article","venue":"International Journal on Software Tools for Technology Transfer","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Intelligent verification; HOL; Formal verification; Functional verification; Runtime verification; High-level verification; Theory of computation; Component (thermodynamics); Software verification; Verification; Formal methods; Model checking; Programming language; Computer architecture; Embedded system; Software; Software development; Software construction","score_opus":0.04344229729073261,"score_gpt":0.3178908435027292,"score_spread":0.2744485462119966,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2008416362","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022469006,0.000032742242,0.97210914,0.0000304216,0.000019261925,0.000059174545,0.000051862426,0.0038693997,0.0013588584],"genre_scores_gemma":[0.40611434,0.000045738274,0.590814,0.000046211095,0.000014888634,0.00015287119,0.0001970163,0.00044536468,0.002169573],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99871874,0.0002842676,0.000107079955,0.00023577131,0.00052512833,0.00012904058],"domain_scores_gemma":[0.9967102,0.001836386,0.00014620037,0.00093598355,0.00028015766,0.00009118159],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015119122,0.0005217636,0.00056667073,0.00083875033,0.00078498153,0.0010442486,0.0012650237,0.0007313309,0.0054490343],"category_scores_gemma":[0.002348433,0.00064399274,0.001082985,0.00046068427,0.0012677182,0.0020376707,0.0021534283,0.0009952736,0.000872019],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011466913,0.00038697105,0.004531067,0.0007290342,0.00023099582,0.0011106415,0.0010601656,0.12752126,0.2153917,0.29255447,0.0034848526,0.35185212],"study_design_scores_gemma":[0.00026105635,0.0004314909,0.001169322,0.00006670781,0.0001862818,0.00049615797,0.00012837254,0.756146,0.10741767,0.11776221,0.015845302,0.00008954569],"about_ca_topic_score_codex":0.001056083,"about_ca_topic_score_gemma":0.0014336141,"teacher_disagreement_score":0.0054490343,"about_ca_system_score_codex":0.00048894185,"about_ca_system_score_gemma":0.0008476138,"threshold_uncertainty_score":0.018228829},"labels":[],"label_agreement":null},{"id":"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Systems Modeling Language; Correctness; 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","score_opus":0.06253671070161998,"score_gpt":0.3890180161623299,"score_spread":0.3264813054607099,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2025290054","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.453446,0.00027082584,0.523208,0.0006610824,0.00007415859,0.00058053934,0.0024548913,0.0017686464,0.017535843],"genre_scores_gemma":[0.9256099,0.00009406038,0.0699905,0.00003872387,0.000014240813,0.00030148824,0.0007567449,0.00012091907,0.0030734222],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9948389,0.0021300165,0.000260181,0.00027880326,0.0022859718,0.00020609821],"domain_scores_gemma":[0.9390124,0.04589001,0.0018254154,0.0015405808,0.011243174,0.00048848573],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0044669867,0.00026494873,0.00017850826,0.0042544897,0.0004803043,0.0015941641,0.00042635435,0.00031510027,0.005782272],"category_scores_gemma":[0.024165655,0.00016057353,0.00033070272,0.0016448661,0.0009006706,0.0010093778,0.0005307609,0.0005832996,0.00049075607],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001859404,0.0007443286,0.05296796,0.0034533169,0.00012111478,0.0008787132,0.03627567,0.03672201,0.25224426,0.121239945,0.006639872,0.48685348],"study_design_scores_gemma":[0.0001811047,0.0010546591,0.10711036,0.00096007524,0.00019529011,0.0013020756,0.023999868,0.4398548,0.3098808,0.058169447,0.057018057,0.00027344664],"about_ca_topic_score_codex":0.0031061764,"about_ca_topic_score_gemma":0.003167534,"teacher_disagreement_score":0.005782272,"about_ca_system_score_codex":0.0012646809,"about_ca_system_score_gemma":0.00136033,"threshold_uncertainty_score":0.023623943},"labels":[],"label_agreement":null},{"id":"W2028045996","doi":"10.1007/s10009-007-0047-9","title":"A framework for counterexample generation and exploration","year":2007,"lang":"en","type":"article","venue":"International Journal on Software Tools for Technology Transfer","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Counterexample; Debugging; Mathematical proof; Computer science; Property (philosophy); Programming language; Theoretical computer science; Model checking; Algorithm; Mathematics; Discrete mathematics","score_opus":0.10448173417546926,"score_gpt":0.36803121669309896,"score_spread":0.2635494825176297,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2028045996","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00067810086,0.00005515616,0.9947701,0.000062286854,0.000018643676,0.00007689663,0.000048701604,0.003738882,0.00055110786],"genre_scores_gemma":[0.038371205,0.00008751372,0.9592814,0.00007288423,0.000027068196,0.00021337089,0.00021567201,0.00083731255,0.0008935346],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9917156,0.002761932,0.000664214,0.0013286328,0.002843817,0.00068586116],"domain_scores_gemma":[0.98213655,0.011175509,0.0007308769,0.0038044283,0.001862226,0.0002903213],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007221956,0.0026417358,0.00219971,0.005403483,0.0016542556,0.00443478,0.0053826915,0.0034978213,0.012299251],"category_scores_gemma":[0.030926902,0.0020134058,0.0039754068,0.0024528974,0.0033407598,0.0070216996,0.006344877,0.0033440113,0.0033001646],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00062834023,0.00041196085,0.0016237727,0.0010127344,0.00033119542,0.00090992794,0.00090066803,0.099509716,0.015998727,0.39388043,0.011097797,0.47369474],"study_design_scores_gemma":[0.00013221764,0.000099816236,0.00018102955,0.00017925455,0.0001632041,0.00048812156,0.00011553804,0.7315498,0.021781866,0.2244771,0.020733507,0.00009849401],"about_ca_topic_score_codex":0.0031941435,"about_ca_topic_score_gemma":0.004197693,"teacher_disagreement_score":0.012299251,"about_ca_system_score_codex":0.0011190226,"about_ca_system_score_gemma":0.0029837098,"threshold_uncertainty_score":0.041145027},"labels":[],"label_agreement":null},{"id":"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.018265491520375744,"score_gpt":0.29074346319302397,"score_spread":0.2724779716726482,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2034321868","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012975356,0.0011271384,0.7876267,0.0056644627,0.0036876134,0.00025073293,0.00076804217,0.008827921,0.17907202],"genre_scores_gemma":[0.3721089,0.0026954769,0.24990767,0.0029422452,0.0018545698,0.00063389336,0.0017679695,0.009927091,0.35816225],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99353373,0.0015187805,0.0008863387,0.0011880096,0.0021184941,0.0007545437],"domain_scores_gemma":[0.98792434,0.0032234157,0.00037846417,0.0064471173,0.0016518201,0.00037472814],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032455593,0.0015457018,0.0016590765,0.002438204,0.004941979,0.010017774,0.0018117264,0.0028956945,0.04722336],"category_scores_gemma":[0.012768657,0.001673981,0.0019793701,0.00313686,0.0045342906,0.019873755,0.008398284,0.0074646943,0.027599715],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010717436,0.000048178816,0.00049979077,0.00016533009,0.000024817553,0.0001501087,0.0011866345,0.00049926835,0.0019411038,0.8986563,0.026198298,0.0705229],"study_design_scores_gemma":[0.00002758519,0.00003506323,0.00012091467,0.00013937303,0.000061352126,0.0003970175,0.00023922189,0.0032625974,0.004693887,0.80949306,0.18148333,0.00004671035],"about_ca_topic_score_codex":0.00081880076,"about_ca_topic_score_gemma":0.00064952334,"teacher_disagreement_score":0.04722336,"about_ca_system_score_codex":0.0015012823,"about_ca_system_score_gemma":0.0018439218,"threshold_uncertainty_score":0.15797788},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; 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","score_opus":0.019955196436883507,"score_gpt":0.26467455785269395,"score_spread":0.24471936141581044,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2043554371","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014356248,0.000052649764,0.96574366,0.000114244736,0.000049079663,0.00016141633,0.00024445137,0.015706271,0.003572033],"genre_scores_gemma":[0.14636222,0.00011677622,0.8470839,0.00009757325,0.000010328039,0.00018331574,0.0017815088,0.0018441455,0.0025201794],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9988747,0.00032023754,0.000102628044,0.00013167551,0.0004800651,0.00009059735],"domain_scores_gemma":[0.9977041,0.0007875596,0.00013106657,0.00069530803,0.0006236976,0.000058323007],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018058384,0.00046959004,0.00041236606,0.0014568834,0.00070381147,0.0014624288,0.00091784634,0.00055110175,0.0041095936],"category_scores_gemma":[0.0053693,0.00073485676,0.0008884438,0.0006853492,0.00037590953,0.0020743022,0.001476923,0.0012171627,0.0015116725],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022070849,0.00057937513,0.0049810144,0.0004061452,0.00020166193,0.0006911676,0.0011218308,0.026211705,0.05946535,0.05015914,0.02451864,0.83144325],"study_design_scores_gemma":[0.00008905292,0.000093786955,0.0025723863,0.00016142312,0.00019069036,0.0006851403,0.00047359316,0.7888246,0.09760129,0.037424557,0.07181332,0.000070083064],"about_ca_topic_score_codex":0.00381577,"about_ca_topic_score_gemma":0.005791586,"teacher_disagreement_score":0.0041095936,"about_ca_system_score_codex":0.0005300587,"about_ca_system_score_gemma":0.0016561073,"threshold_uncertainty_score":0.0137479305},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Concurrency; Atomicity; Correctness; Interleaving; Programming language; Debugging; Set (abstract data type); Theory of computation","score_opus":0.029292245096745266,"score_gpt":0.33535090047419397,"score_spread":0.3060586553774487,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2044863546","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04547626,0.00013896232,0.9447534,0.00019579811,0.0000391885,0.00026612368,0.00020832288,0.00508102,0.0038409936],"genre_scores_gemma":[0.44600582,0.00010369925,0.5518357,0.00009564134,0.000024631929,0.00028060545,0.00034892772,0.00044906273,0.0008559314],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99726593,0.000769824,0.00015633629,0.0003600743,0.0011699187,0.00027787237],"domain_scores_gemma":[0.9805736,0.016200777,0.0007819539,0.0010172025,0.0012127182,0.000213801],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015886282,0.0015722997,0.00081355573,0.002077835,0.00086322735,0.0013627075,0.002050118,0.0010380103,0.004909793],"category_scores_gemma":[0.016197748,0.0008104877,0.0013142808,0.0013589206,0.0019349158,0.001908624,0.0016767628,0.0015240649,0.0005015473],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00072092435,0.0005395392,0.0047800434,0.0010064569,0.00016430474,0.0014451505,0.0006772916,0.5215262,0.042417537,0.055181332,0.003915852,0.36762542],"study_design_scores_gemma":[0.00016250848,0.0002503221,0.00051349396,0.00005326083,0.000107944,0.00015009596,0.00015701582,0.9175482,0.029375667,0.049796514,0.0018515997,0.000033522032],"about_ca_topic_score_codex":0.005867213,"about_ca_topic_score_gemma":0.011646083,"teacher_disagreement_score":0.005867213,"about_ca_system_score_codex":0.0011707966,"about_ca_system_score_gemma":0.0026184567,"threshold_uncertainty_score":0.016424835},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Chicoutimi","funders":"","keywords":"Computer science; 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","score_opus":0.01863011222700764,"score_gpt":0.27914662900727993,"score_spread":0.2605165167802723,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2050388183","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.255436,0.0010334038,0.7223248,0.0007736958,0.00033071582,0.00016990138,0.00010125459,0.013816885,0.0060132355],"genre_scores_gemma":[0.89862746,0.00031424756,0.09672028,0.00036113284,0.00012724144,0.00007304687,0.00014303655,0.0009432552,0.0026903793],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99667764,0.0012438222,0.00015598502,0.00039804415,0.0010032379,0.0005213016],"domain_scores_gemma":[0.9883422,0.0061774147,0.0007172709,0.0038572482,0.00066461717,0.00024115459],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039516874,0.0009995598,0.0011026269,0.0011786562,0.0007697582,0.0015752302,0.0020436884,0.0011800353,0.0023188617],"category_scores_gemma":[0.014093538,0.00056260964,0.0007062508,0.0009040436,0.0020145138,0.0027342439,0.0022804681,0.001711696,0.0003672918],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0061782007,0.00090194505,0.021194026,0.0005641554,0.00024680968,0.0011794496,0.0016156033,0.18634355,0.07173074,0.0973738,0.009886917,0.60278475],"study_design_scores_gemma":[0.00014862699,0.0005585477,0.0029754569,0.00007907316,0.00019040272,0.000285349,0.00012965134,0.90416336,0.036287755,0.05137008,0.0037665758,0.00004506832],"about_ca_topic_score_codex":0.0034242757,"about_ca_topic_score_gemma":0.0028057632,"teacher_disagreement_score":0.0039516874,"about_ca_system_score_codex":0.00088896125,"about_ca_system_score_gemma":0.0009725338,"threshold_uncertainty_score":0.02089876},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; 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","score_opus":0.02034142140810467,"score_gpt":0.26195024814189677,"score_spread":0.2416088267337921,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2051066030","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7848582,0.00014819605,0.18849052,0.00025940154,0.000053780856,0.00025865895,0.00017838014,0.0036156499,0.02213717],"genre_scores_gemma":[0.91695845,0.000034460027,0.07950777,0.000041721218,0.000007676242,0.00007451377,0.00025602695,0.00022215833,0.0028972214],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9966184,0.0011266877,0.0001932026,0.000368596,0.0013068599,0.00038629706],"domain_scores_gemma":[0.9862132,0.0068061096,0.0009124151,0.0024178957,0.003064476,0.0005858636],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0046266494,0.00031323935,0.0003498184,0.0013898807,0.00052465586,0.001817713,0.0014253034,0.0009551907,0.0034391417],"category_scores_gemma":[0.01567254,0.00022494636,0.00047265278,0.0012326392,0.0009349978,0.0021694365,0.0015271469,0.0008058382,0.0004377196],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001771699,0.0022682874,0.1185583,0.00034440664,0.00014680298,0.0011667127,0.0022930626,0.15423542,0.04493135,0.05068579,0.0026131952,0.62098503],"study_design_scores_gemma":[0.00012706014,0.00083753746,0.026233653,0.000088639266,0.00013327258,0.000725743,0.00043090334,0.9168039,0.032513108,0.014409688,0.007638002,0.000058444453],"about_ca_topic_score_codex":0.008655168,"about_ca_topic_score_gemma":0.007214841,"teacher_disagreement_score":0.008655168,"about_ca_system_score_codex":0.0012240182,"about_ca_system_score_gemma":0.0024313396,"threshold_uncertainty_score":0.024468362},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Asynchronous communication; Handshake; Theory of computation; Distributed computing; Transfer (computing); Formal verification; Synchronization (alternating current); Programming language; Parallel computing; Computer network","score_opus":0.03253096513669736,"score_gpt":0.27882443406996954,"score_spread":0.2462934689332722,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2058806531","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009169018,0.000044604218,0.98882014,0.000027936629,0.000024545601,0.00006053055,0.00002909691,0.0009850132,0.0008391118],"genre_scores_gemma":[0.58419776,0.0001206575,0.41256958,0.000074404445,0.000027997514,0.00020791775,0.000154918,0.00056217087,0.0020846755],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9950323,0.0016467968,0.00032236215,0.0005749886,0.0019856878,0.0004378651],"domain_scores_gemma":[0.9872032,0.007999747,0.0008274843,0.0026264216,0.0012286777,0.00011448238],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0042454456,0.0012720264,0.0011822607,0.001399673,0.00068367634,0.0010822766,0.0023757694,0.0010401297,0.0034049982],"category_scores_gemma":[0.012884702,0.0011697536,0.0018838483,0.00076041475,0.0020056732,0.0023677791,0.002618006,0.0016686671,0.0006820562],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006898198,0.00015947192,0.0015025687,0.00044919414,0.00014384436,0.0006996979,0.00045922634,0.7047525,0.047009844,0.14670837,0.0009557573,0.09646969],"study_design_scores_gemma":[0.00012146807,0.00008482289,0.00016125903,0.000029277686,0.00007311165,0.00008039713,0.000018642093,0.9401279,0.022403134,0.035187412,0.0016843968,0.000028102959],"about_ca_topic_score_codex":0.00435345,"about_ca_topic_score_gemma":0.004376089,"teacher_disagreement_score":0.00435345,"about_ca_system_score_codex":0.0010335742,"about_ca_system_score_gemma":0.0012617698,"threshold_uncertainty_score":0.022452354},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Mathematical proof; Model checking; Theory of computation; Bounded function; Resolution (logic); Property (philosophy); Variable (mathematics); Theoretical computer science; Algorithm; Programming language; Mathematics","score_opus":0.033344721366806086,"score_gpt":0.3272435181166502,"score_spread":0.2938987967498441,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2066179571","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030352263,0.00062626204,0.89754856,0.00097427994,0.00038451713,0.00021137545,0.0010716408,0.06539448,0.0034366245],"genre_scores_gemma":[0.2682421,0.0002814661,0.7195257,0.0006073586,0.00014936467,0.00016168527,0.0019465942,0.006317072,0.0027687796],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99625117,0.0011567249,0.00038852662,0.0004223603,0.0014097164,0.000371606],"domain_scores_gemma":[0.97386813,0.017218012,0.0014222162,0.004106103,0.003036497,0.00034902617],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041570095,0.001487431,0.0007758337,0.0031033577,0.001233577,0.002405566,0.0023378858,0.0017204579,0.01580123],"category_scores_gemma":[0.02884316,0.0011952776,0.0017231692,0.0019406963,0.0009524327,0.005998612,0.0037121258,0.0020794373,0.004245627],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014985095,0.00033413366,0.0061996654,0.0020175702,0.000334249,0.0009596128,0.0010638054,0.01832975,0.08256302,0.08389871,0.0355325,0.7672684],"study_design_scores_gemma":[0.0003927603,0.00035117927,0.0013526757,0.0004391267,0.00033661502,0.0008522758,0.0003509494,0.5115553,0.29354736,0.12260112,0.06800685,0.0002138372],"about_ca_topic_score_codex":0.0015956016,"about_ca_topic_score_gemma":0.0029681735,"teacher_disagreement_score":0.01580123,"about_ca_system_score_codex":0.0010651057,"about_ca_system_score_gemma":0.0023879055,"threshold_uncertainty_score":0.05286038},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Software engineering; Web application; Test script; Web service; Test case; Programming language; Database; Operating system; Machine learning","score_opus":0.11853983412948066,"score_gpt":0.3479252943717749,"score_spread":0.22938546024229423,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2067284301","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6342572,0.0003513401,0.31505123,0.0002647725,0.00019001101,0.00042208,0.00082715735,0.038323514,0.010312658],"genre_scores_gemma":[0.90594506,0.00006957391,0.0890386,0.00007793707,0.0000128362935,0.00011291108,0.0010008009,0.0011321078,0.0026101517],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99609727,0.0011901382,0.0002873158,0.00045128455,0.0014072047,0.00056674634],"domain_scores_gemma":[0.9923516,0.0030915693,0.00040669684,0.0018336439,0.0020027086,0.0003138313],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002758046,0.0008756054,0.0005095896,0.0013342985,0.00059096323,0.001134778,0.0022710739,0.0010284641,0.005015969],"category_scores_gemma":[0.009353035,0.0003497182,0.00094813376,0.0007137943,0.0006879223,0.0015708153,0.001393921,0.00080299325,0.0006101688],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0047819326,0.0025324193,0.06253648,0.0012123629,0.00048235554,0.0026306915,0.0016284173,0.28186017,0.15113255,0.031528585,0.01518033,0.44449377],"study_design_scores_gemma":[0.00023085525,0.0007477264,0.005707136,0.000077101795,0.00009771783,0.0003420068,0.00016409087,0.89515096,0.08550467,0.004741618,0.0071709994,0.000065004526],"about_ca_topic_score_codex":0.013229818,"about_ca_topic_score_gemma":0.013712463,"teacher_disagreement_score":0.013229818,"about_ca_system_score_codex":0.0009114553,"about_ca_system_score_gemma":0.0022851557,"threshold_uncertainty_score":0.026305616},"labels":[],"label_agreement":null},{"id":"W2067623660","doi":"10.1007/s100090050045","title":"Formalization and validation of the General Inter-ORB Protocol (GIOP) using PROMELA and SPIN","year":2000,"lang":"en","type":"article","venue":"International Journal on Software Tools for Technology Transfer","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":51,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Promela; Computer science; Common Object Request Broker Architecture; Model checking; Programming language; Protocol (science); Formal verification; Linear temporal logic; Formal specification; Theoretical computer science","score_opus":0.03510101619760418,"score_gpt":0.34227709844996096,"score_spread":0.30717608225235676,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2067623660","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032142527,0.00036281644,0.9584871,0.0006198004,0.00015962728,0.00038587739,0.00013088823,0.0032515833,0.0044597383],"genre_scores_gemma":[0.72650194,0.00063487375,0.2674413,0.00040642737,0.00008865306,0.00046833738,0.00038152,0.00078302977,0.0032938689],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99055463,0.0036988854,0.0006990946,0.00075940584,0.0033506847,0.0009373307],"domain_scores_gemma":[0.9848642,0.007315092,0.0011054305,0.0049828845,0.0015140991,0.00021837663],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011462571,0.0009809554,0.000993107,0.001330913,0.001748742,0.004413173,0.002881552,0.0019043211,0.0028417516],"category_scores_gemma":[0.024192695,0.0013559833,0.0021868942,0.00076353166,0.0062201573,0.005402558,0.0047446075,0.005276642,0.00043740383],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00059523864,0.00023884709,0.0030630736,0.0009634588,0.00019022221,0.0009914028,0.0012622521,0.16487114,0.025702473,0.7309255,0.0022966296,0.06889977],"study_design_scores_gemma":[0.00024611954,0.0002802166,0.0008321516,0.00045621872,0.00027491123,0.00050498045,0.00029238372,0.55016774,0.06953253,0.35605422,0.021208942,0.00014964193],"about_ca_topic_score_codex":0.004306448,"about_ca_topic_score_gemma":0.0039988365,"teacher_disagreement_score":0.011462571,"about_ca_system_score_codex":0.0013711577,"about_ca_system_score_gemma":0.005805969,"threshold_uncertainty_score":0.060620606},"labels":[],"label_agreement":null},{"id":"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Computer Research Institute of Montréal","funders":"","keywords":"Computer science; 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","score_opus":0.09062809914528827,"score_gpt":0.30661703236558707,"score_spread":0.2159889332202988,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2083965123","genre_codex":"methods","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04658733,0.29085517,0.6293575,0.014148121,0.000845782,0.00011755365,0.00015972696,0.0019390037,0.015989827],"genre_scores_gemma":[0.624386,0.15649721,0.20943874,0.0021462673,0.0020827646,0.0002176875,0.0007312492,0.0005967135,0.0039032924],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.98997086,0.003906097,0.00045877259,0.0009270263,0.004453023,0.00028432315],"domain_scores_gemma":[0.9530092,0.03660307,0.0018952739,0.0036949618,0.004075221,0.00072229607],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010157286,0.0012406199,0.0025939508,0.0025116762,0.00033576696,0.0036023003,0.005114042,0.0025387541,0.002421341],"category_scores_gemma":[0.022252526,0.00063782313,0.0010747935,0.0030833054,0.0030104234,0.00788141,0.0023957426,0.002447246,0.000642589],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026874582,0.00044219458,0.006715571,0.0024048341,0.00019366064,0.00013417295,0.00027526641,0.03469002,0.0056594345,0.071145855,0.005469539,0.8726008],"study_design_scores_gemma":[0.00016477746,0.0011014426,0.006150268,0.002221374,0.00030938085,0.001981988,0.00077852176,0.6018795,0.011224488,0.2944967,0.07953287,0.00015868241],"about_ca_topic_score_codex":0.0015150171,"about_ca_topic_score_gemma":0.001341657,"teacher_disagreement_score":0.010157286,"about_ca_system_score_codex":0.001471828,"about_ca_system_score_gemma":0.0016661953,"threshold_uncertainty_score":0.053717494},"labels":[],"label_agreement":null},{"id":"W2085380106","doi":"10.1007/s10009-009-0117-2","title":"Approximating the safely reusable set of learned facts","year":2009,"lang":"en","type":"article","venue":"International Journal on Software Tools for Technology Transfer","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Theory of computation; Computer science; Set (abstract data type); Programming language; Theoretical computer science","score_opus":0.06439611653173218,"score_gpt":0.34099256682886137,"score_spread":0.2765964502971292,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2085380106","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22697689,0.0003653709,0.7632325,0.00050520076,0.00006759356,0.00011347666,0.0006874983,0.0013535548,0.0066979243],"genre_scores_gemma":[0.7751483,0.00042710977,0.21737157,0.0000971791,0.000049039594,0.00014618238,0.0016348272,0.00034677962,0.004778968],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978606,0.0003485676,0.00014749644,0.00034418123,0.001032177,0.00026697863],"domain_scores_gemma":[0.9884642,0.0073998054,0.00058762287,0.0020102647,0.0012512432,0.00028683554],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017344449,0.00093950966,0.0010832915,0.0023255022,0.00067537994,0.0024213041,0.002428354,0.0012261787,0.006582409],"category_scores_gemma":[0.023524104,0.00080442504,0.0014888104,0.0013572876,0.0017327104,0.0043613883,0.002729893,0.0021377332,0.0006476988],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006376084,0.0002162306,0.0055146194,0.000340431,0.00016019135,0.0006056604,0.00032411152,0.6960092,0.004617433,0.11061584,0.002662887,0.17829579],"study_design_scores_gemma":[0.00003918654,0.000056869176,0.00034255907,0.000036399157,0.000035408637,0.00008659507,0.000058638994,0.87987626,0.002599121,0.115881085,0.000978,0.000009881468],"about_ca_topic_score_codex":0.00821059,"about_ca_topic_score_gemma":0.0074463105,"teacher_disagreement_score":0.00821059,"about_ca_system_score_codex":0.0019159792,"about_ca_system_score_gemma":0.002795186,"threshold_uncertainty_score":0.02202034},"labels":[],"label_agreement":null},{"id":"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; 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","score_opus":0.04298718330889807,"score_gpt":0.355705237261135,"score_spread":0.31271805395223695,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2087702998","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010161991,0.000101618396,0.9924976,0.00012701089,0.00005236552,0.00008505147,0.000076237025,0.0047892923,0.0012547091],"genre_scores_gemma":[0.06345732,0.00034796333,0.92942965,0.0002469739,0.00017591345,0.00035975347,0.0004946037,0.002232431,0.0032554094],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9953375,0.0011001126,0.0005119071,0.00064783,0.0019014071,0.00050130417],"domain_scores_gemma":[0.9939698,0.002613052,0.0004805998,0.0014712843,0.0012644416,0.00020083602],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004885563,0.001848821,0.0014651916,0.0031015747,0.0019619705,0.0053795697,0.0051117865,0.0026438183,0.01085089],"category_scores_gemma":[0.012094288,0.0022727533,0.0032605985,0.0020193597,0.004011055,0.009603156,0.0043765856,0.0054221484,0.0045446507],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011337557,0.00011334194,0.0005200912,0.0004022197,0.0000869978,0.00035782435,0.0005581984,0.027393818,0.00599225,0.84796,0.0074488684,0.10905307],"study_design_scores_gemma":[0.00008640217,0.00009458,0.00014498552,0.00024229154,0.00015889549,0.00025274543,0.00015745852,0.2671784,0.013232919,0.6578425,0.06050973,0.00009903394],"about_ca_topic_score_codex":0.00444009,"about_ca_topic_score_gemma":0.0066920742,"teacher_disagreement_score":0.01085089,"about_ca_system_score_codex":0.0017525754,"about_ca_system_score_gemma":0.0033799566,"threshold_uncertainty_score":0.036299825},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.03718945379551026,"score_gpt":0.33089255944516616,"score_spread":0.2937031056496559,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2128454637","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007189599,0.0021634542,0.96295553,0.00046039547,0.0002724038,0.00014424384,0.0002019108,0.017145438,0.009467022],"genre_scores_gemma":[0.08676132,0.0029284125,0.89835066,0.00025601214,0.00016646562,0.0002872425,0.0010244511,0.0033456662,0.006879719],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9966371,0.0008220518,0.00040114397,0.0001877105,0.0017662628,0.00018577113],"domain_scores_gemma":[0.99123424,0.0047993464,0.0005904465,0.0018092613,0.0012990425,0.00026760716],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023849378,0.0013293694,0.00073587673,0.002832624,0.0006220497,0.002500167,0.001997226,0.0015053729,0.008516648],"category_scores_gemma":[0.016496692,0.00095567585,0.0011103532,0.0021606435,0.00078443007,0.0040371954,0.0028343066,0.002268195,0.004180362],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019694054,0.00018127792,0.0010473892,0.0015831614,0.00011414697,0.00049159926,0.000872632,0.010150361,0.02440506,0.122523755,0.02540733,0.8130263],"study_design_scores_gemma":[0.00039731842,0.0007120212,0.0020481457,0.0026162828,0.0004487855,0.0023557045,0.00043148047,0.15389615,0.078940384,0.29543087,0.46251038,0.00021257442],"about_ca_topic_score_codex":0.00054821244,"about_ca_topic_score_gemma":0.00057510374,"teacher_disagreement_score":0.008516648,"about_ca_system_score_codex":0.0003926067,"about_ca_system_score_gemma":0.0012963692,"threshold_uncertainty_score":0.02849102},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Computer science; Software engineering; Debugging; Documentation; Maintainability; Software; Programming language","score_opus":0.05327260685018031,"score_gpt":0.3286051605637318,"score_spread":0.2753325537135515,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2593098503","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05131775,0.020713653,0.7945894,0.06263353,0.0007595054,0.00007111236,0.000089025845,0.0011843451,0.06864168],"genre_scores_gemma":[0.6503255,0.03610401,0.2970497,0.0040923087,0.00049674575,0.00014670564,0.0001820612,0.0005726879,0.011030334],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.98930573,0.0053394972,0.0008033419,0.0009200431,0.003282987,0.00034839314],"domain_scores_gemma":[0.9555818,0.03127197,0.0019192618,0.0052031497,0.0050467295,0.0009771857],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012845335,0.0008543322,0.0005223682,0.0024794822,0.0009625096,0.008781744,0.0019675265,0.0025955515,0.0028212739],"category_scores_gemma":[0.025419014,0.0006098909,0.00042092014,0.0015097319,0.006897123,0.012681871,0.0044898614,0.004404328,0.0010556952],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007025518,0.00029610342,0.0023843085,0.0009553506,0.000064062144,0.00030729178,0.0059156027,0.01178154,0.0033375572,0.7288405,0.0037375835,0.24230994],"study_design_scores_gemma":[0.000052839583,0.00025813933,0.0011515825,0.0023624972,0.000055514847,0.00083414104,0.0071994844,0.024306927,0.006566894,0.7480992,0.20903742,0.00007536027],"about_ca_topic_score_codex":0.0017264418,"about_ca_topic_score_gemma":0.0012755279,"teacher_disagreement_score":0.012845335,"about_ca_system_score_codex":0.0021446405,"about_ca_system_score_gemma":0.0048421593,"threshold_uncertainty_score":0.06793344},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.06697194097679657,"score_gpt":0.3901902874634464,"score_spread":0.3232183464866498,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2622780030","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30984852,0.0011004274,0.35314506,0.006931814,0.00024394161,0.0004903789,0.000546446,0.0003349877,0.32735842],"genre_scores_gemma":[0.981931,0.00015765398,0.0137472255,0.00010583539,0.000012702821,0.00013153726,0.000061365434,0.000023526634,0.0038290704],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99600047,0.00218405,0.00012792983,0.00017869558,0.0011976393,0.00031119178],"domain_scores_gemma":[0.9871035,0.008664328,0.00073262205,0.00064755604,0.0024632781,0.00038869763],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0049330723,0.00025770647,0.00024666992,0.0016940427,0.0012092245,0.0029417342,0.0006537358,0.0007317582,0.0079135895],"category_scores_gemma":[0.012836116,0.0001422801,0.00027067625,0.0011348672,0.0058561563,0.0025573338,0.0012804205,0.00088703464,0.0004063896],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012851425,0.00004700768,0.003382838,0.0004960311,0.00002326596,0.00033800968,0.029174307,0.0050870487,0.006881047,0.9172657,0.0022680596,0.034908134],"study_design_scores_gemma":[0.000064994834,0.0004957651,0.020518146,0.0008511608,0.000083846084,0.0007874774,0.13890871,0.043195277,0.018021885,0.66616094,0.11076823,0.0001434661],"about_ca_topic_score_codex":0.0020148924,"about_ca_topic_score_gemma":0.0014751652,"teacher_disagreement_score":0.0079135895,"about_ca_system_score_codex":0.0017766005,"about_ca_system_score_gemma":0.001993662,"threshold_uncertainty_score":0.026473582},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.03993430915760716,"score_gpt":0.26907315315342245,"score_spread":0.2291388439958153,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2972465897","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6908224,0.00027521932,0.30586985,0.00030630786,0.000020099435,0.00013130173,0.000117149175,0.0005555672,0.001902111],"genre_scores_gemma":[0.95229214,0.00005983265,0.047064632,0.00003535986,0.00000872948,0.000056308225,0.00018852612,0.00010716499,0.00018725534],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.989608,0.006253354,0.00036268632,0.001012531,0.00237291,0.00039064343],"domain_scores_gemma":[0.9092877,0.07603114,0.0046633193,0.0061291573,0.0029042268,0.0009844657],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00855693,0.000722795,0.0007449431,0.0033339872,0.0007154479,0.0017423342,0.0013956664,0.0016838738,0.00078528305],"category_scores_gemma":[0.053440645,0.0006858926,0.0009096464,0.0012620655,0.0027320383,0.0033950421,0.0023644597,0.00132902,0.000108006396],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00051731896,0.0002756941,0.023433596,0.00014045092,0.000111942754,0.0004300984,0.0005780072,0.8733724,0.013035996,0.03121748,0.00045871997,0.0564284],"study_design_scores_gemma":[0.000036710004,0.00027554776,0.0018814297,0.000026727526,0.000032095097,0.0002607667,0.000103838465,0.9626543,0.0077962833,0.02644657,0.00046255146,0.000023138691],"about_ca_topic_score_codex":0.0013617001,"about_ca_topic_score_gemma":0.0015269404,"teacher_disagreement_score":0.00855693,"about_ca_system_score_codex":0.0013971373,"about_ca_system_score_gemma":0.0007958084,"threshold_uncertainty_score":0.045253932},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.014284486774029657,"score_gpt":0.26277824508350645,"score_spread":0.2484937583094768,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2976486068","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09956579,0.00026774526,0.86642784,0.00046163204,0.00006821682,0.0001998862,0.00054450094,0.030192604,0.0022716995],"genre_scores_gemma":[0.70323575,0.00008518797,0.29323307,0.00010050872,0.000031701664,0.00014386079,0.0008509477,0.0013783169,0.00094072317],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99423486,0.0021458692,0.00032008332,0.000911816,0.0021177453,0.00026952536],"domain_scores_gemma":[0.99192613,0.0035397937,0.00077395915,0.0023204463,0.0011549006,0.00028483692],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032460575,0.0011621325,0.00078723487,0.0013248104,0.0005423434,0.0022679607,0.0017201016,0.001032743,0.0016408593],"category_scores_gemma":[0.0125110485,0.0004527852,0.00080440356,0.0011014647,0.0011781529,0.003513164,0.0020643244,0.0013033007,0.0004770324],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015066748,0.0005919919,0.011990787,0.0003924828,0.00018461247,0.0005583617,0.0011830842,0.64509726,0.051753465,0.054286193,0.010232743,0.22222242],"study_design_scores_gemma":[0.000031106738,0.00003801755,0.0003109676,0.0000051755396,0.000009867752,0.000025554393,0.000052728057,0.984689,0.0071513336,0.0065108514,0.0011643533,0.000010968808],"about_ca_topic_score_codex":0.0084338235,"about_ca_topic_score_gemma":0.008584642,"teacher_disagreement_score":0.0084338235,"about_ca_system_score_codex":0.0019430537,"about_ca_system_score_gemma":0.0011870271,"threshold_uncertainty_score":0.017166972},"labels":[],"label_agreement":null},{"id":"W2981584093","doi":"10.1007/s10009-019-00543-1","title":"A formal refinement-based analysis of the hybrid ERTMS/ETCS level 3 standard","year":2019,"lang":"en","type":"article","venue":"International Journal on Software Tools for Technology Transfer","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Train; Supervisor; Theory of computation; Computer science; Nondeterministic algorithm; Event (particle physics); Control (management); Algorithm; Artificial intelligence","score_opus":0.03523788722718633,"score_gpt":0.3029168370994255,"score_spread":0.26767894987223917,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2981584093","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042473227,0.00010488845,0.9426149,0.00023912729,0.00007782837,0.00023804173,0.00048485704,0.0043983376,0.009368747],"genre_scores_gemma":[0.48412168,0.00017024147,0.5041687,0.00020480105,0.000046596324,0.00025060415,0.0013273759,0.0014793572,0.008230641],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9937785,0.0013374924,0.00038432612,0.00053214666,0.003362252,0.00060522323],"domain_scores_gemma":[0.99516284,0.0015311748,0.0003835825,0.0015353458,0.0013293736,0.0000577246],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003854113,0.0006028417,0.00048200705,0.0017190065,0.00058957055,0.0017409688,0.0016186428,0.0007713366,0.0067327586],"category_scores_gemma":[0.007840492,0.00052173896,0.0019067898,0.00077380356,0.0014413705,0.0023437901,0.0015938181,0.0012047815,0.0014484236],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00078253634,0.00020730839,0.007880713,0.0006248171,0.00017617138,0.0008297232,0.00077940157,0.13457422,0.068148986,0.5959833,0.008219715,0.18179311],"study_design_scores_gemma":[0.00012380564,0.00047105108,0.0030283667,0.00022585192,0.00020472535,0.00051256263,0.00035998912,0.6703139,0.09874662,0.1771666,0.048741035,0.00010553685],"about_ca_topic_score_codex":0.0050895587,"about_ca_topic_score_gemma":0.005087762,"teacher_disagreement_score":0.0067327586,"about_ca_system_score_codex":0.0012821204,"about_ca_system_score_gemma":0.0025584884,"threshold_uncertainty_score":0.022523344},"labels":[],"label_agreement":null},{"id":"W3030250248","doi":"10.1007/s10009-020-00563-2","title":"An efficient statistical model checker for nondeterminism and rare events","year":2020,"lang":"en","type":"article","venue":"International Journal on Software Tools for Technology Transfer","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":39,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Exploratory Research for Advanced Technology; Agencia Nacional de Promoción Científica y Tecnológica; RWTH Aachen University; Singapore University of Technology and Design; Westfälische Wilhelms-Universität Münster; Nederlandse Organisatie voor Wetenschappelijk Onderzoek; University of Twente","keywords":"Nondeterministic algorithm; Computer science; Rotation formalisms in three dimensions; Model checking; Modular design; Theoretical computer science; Statistical model; Rare events; Programming language; Parallel computing; Distributed computing; Algorithm; Artificial intelligence","score_opus":0.05361837148655482,"score_gpt":0.34287862601652463,"score_spread":0.28926025452996984,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3030250248","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015390809,0.000045026474,0.97453386,0.000112876805,0.000036498895,0.00007398901,0.00013343309,0.009058379,0.0006151151],"genre_scores_gemma":[0.48080543,0.00009221605,0.51563185,0.0002315334,0.00005387329,0.00026091826,0.0005464848,0.0010923833,0.0012853403],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99048936,0.0033418857,0.00060373143,0.0011699472,0.0038041405,0.00059092406],"domain_scores_gemma":[0.9677017,0.021720845,0.0024558615,0.0051552206,0.002612815,0.0003535712],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007731813,0.00087713765,0.001416133,0.0017962295,0.0007446911,0.0023776926,0.0028358905,0.0009595882,0.0028747416],"category_scores_gemma":[0.028969888,0.0009222579,0.0015982494,0.0009923778,0.0016375412,0.0027153057,0.0022489298,0.002464546,0.00058802107],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00061819714,0.0004573839,0.01061754,0.00038393372,0.0003538993,0.00043932642,0.0002625916,0.675902,0.032549426,0.11870804,0.005170386,0.15453729],"study_design_scores_gemma":[0.000033426288,0.000037613634,0.00017420042,0.000011903551,0.000025337562,0.000040498653,0.000007834343,0.97498375,0.009779123,0.013957281,0.0009363998,0.0000127316835],"about_ca_topic_score_codex":0.003915339,"about_ca_topic_score_gemma":0.0057616914,"teacher_disagreement_score":0.007731813,"about_ca_system_score_codex":0.0011530811,"about_ca_system_score_gemma":0.005282444,"threshold_uncertainty_score":0.040890217},"labels":[],"label_agreement":null},{"id":"W3176562981","doi":"10.1007/s10009-021-00625-z","title":"What can we monitor over unreliable channels?","year":2021,"lang":"en","type":"article","venue":"International Journal on Software Tools for Technology Transfer","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Theory of computation; Programming language","score_opus":0.03448311251912821,"score_gpt":0.3164275150670675,"score_spread":0.2819444025479393,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3176562981","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16818799,0.0040463246,0.77648884,0.027252391,0.001284106,0.00013718073,0.00017435758,0.0031204466,0.0193083],"genre_scores_gemma":[0.9557661,0.0016059644,0.035872787,0.0013353936,0.000502583,0.000082825936,0.000041124502,0.00031441034,0.004478884],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979405,0.0006838862,0.00009647698,0.000288708,0.00063472247,0.0003558101],"domain_scores_gemma":[0.9721931,0.015337211,0.0033759165,0.004476572,0.0033225825,0.0012946104],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038091652,0.000665846,0.00064536254,0.0006991586,0.0011963118,0.002940283,0.0013823616,0.001680824,0.003437372],"category_scores_gemma":[0.03782776,0.0004317799,0.00039160103,0.00053319125,0.0029245093,0.013567727,0.0019349626,0.0028479144,0.0006673145],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011869306,0.00031383205,0.026879044,0.0013296283,0.0004151514,0.0016658352,0.0035651755,0.07681611,0.026663207,0.47643602,0.022609366,0.36211962],"study_design_scores_gemma":[0.00010485448,0.0002812739,0.002847107,0.00041977566,0.0004375949,0.00059662014,0.0017127931,0.18488279,0.0250652,0.7418179,0.041677434,0.00015661775],"about_ca_topic_score_codex":0.0018821573,"about_ca_topic_score_gemma":0.0013921176,"teacher_disagreement_score":0.0038091652,"about_ca_system_score_codex":0.0006059293,"about_ca_system_score_gemma":0.0014719911,"threshold_uncertainty_score":0.020145059},"labels":[],"label_agreement":null},{"id":"W376991050","doi":"10.1007/s100090100043","title":"A light-weight framework for hardware verification","year":2001,"lang":"en","type":"article","venue":"International Journal on Software Tools for Technology Transfer","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Gas meter prover; Automated theorem proving; Mathematical proof; Correctness; Domain (mathematical analysis); Programming language; Theory of computation; Formal verification; Formal proof; Automated reasoning; Formal methods; Rule of inference; First-order logic; Theoretical computer science; Mathematics","score_opus":0.03967065511286106,"score_gpt":0.32750380026130743,"score_spread":0.2878331451484464,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W376991050","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00082037714,0.00012639783,0.9953492,0.000081669685,0.00004159073,0.0000675707,0.00004033788,0.0016701261,0.0018027182],"genre_scores_gemma":[0.08731825,0.0005213226,0.90317297,0.0002695031,0.00015568057,0.00034473115,0.00024729277,0.0009567057,0.007013551],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99649507,0.00063331675,0.00023941425,0.00050335727,0.0017883114,0.000340674],"domain_scores_gemma":[0.99605393,0.0012132492,0.00020910392,0.0018895939,0.00047605112,0.00015804356],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023378914,0.0018497022,0.001268936,0.0027599419,0.001625839,0.0037973172,0.0045292056,0.0014972171,0.014255617],"category_scores_gemma":[0.0073518334,0.0015256339,0.0025048412,0.0015923793,0.0028413746,0.00741869,0.005219217,0.004229338,0.0059927073],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021737536,0.00016381552,0.00038145395,0.00044788796,0.00008722867,0.00028681714,0.0001854007,0.03206375,0.01334082,0.7206411,0.0057967287,0.22638762],"study_design_scores_gemma":[0.00007681585,0.00010315588,0.000110575165,0.00011396666,0.0001337971,0.00018518454,0.000040552095,0.20336106,0.010235635,0.7439599,0.04162043,0.00005895823],"about_ca_topic_score_codex":0.0024664938,"about_ca_topic_score_gemma":0.0043530576,"teacher_disagreement_score":0.014255617,"about_ca_system_score_codex":0.0011442847,"about_ca_system_score_gemma":0.002237722,"threshold_uncertainty_score":0.047689795},"labels":[],"label_agreement":null},{"id":"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"Agence Nationale de la Recherche","keywords":"Computer science; Formal specification; Formal methods; Formal verification; Programming language; Software engineering; Systems Modeling Language; Domain (mathematical analysis); Unified Modeling Language","score_opus":0.04120826836569858,"score_gpt":0.2544398037154147,"score_spread":0.21323153534971612,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4241863337","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.059163943,0.00013033481,0.91050184,0.000488929,0.00007603798,0.0004654037,0.00089152396,0.0043053357,0.023976684],"genre_scores_gemma":[0.45054093,0.0002749313,0.52960736,0.00030561865,0.00003638365,0.0005864312,0.003227221,0.001239225,0.014181908],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9956424,0.0010294416,0.0005398424,0.00038551856,0.0019448679,0.00045795782],"domain_scores_gemma":[0.99587387,0.0011474275,0.000509045,0.001227581,0.0011508456,0.00009119279],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039384495,0.00056816335,0.00037892262,0.001281847,0.00045287132,0.003419477,0.0019384034,0.0012108773,0.004145155],"category_scores_gemma":[0.006276231,0.000576795,0.0012725263,0.00059325027,0.00093033165,0.0029904437,0.0017777008,0.0014187598,0.0018062501],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002936488,0.00027026742,0.0054977536,0.00048203612,0.000119317265,0.0011998554,0.0011380524,0.34183782,0.045346253,0.5005853,0.0070908433,0.09613881],"study_design_scores_gemma":[0.00007244718,0.00019550967,0.0015042913,0.000239628,0.000115462215,0.0003751329,0.00037726722,0.7898599,0.036538154,0.068874076,0.10174574,0.000102422506],"about_ca_topic_score_codex":0.008191679,"about_ca_topic_score_gemma":0.0076466086,"teacher_disagreement_score":0.008191679,"about_ca_system_score_codex":0.0015534873,"about_ca_system_score_gemma":0.003009479,"threshold_uncertainty_score":0.020828784},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Theory of computation; Programming language","score_opus":0.037730297424076256,"score_gpt":0.2723309694881597,"score_spread":0.23460067206408347,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4245891996","genre_codex":"other","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020783544,0.0076724268,0.015215003,0.027485413,0.25412542,0.0006992662,0.017759904,0.0027861204,0.67217815],"genre_scores_gemma":[0.006488405,0.0030019453,0.00406912,0.004310646,0.0205323,0.000321663,0.010199141,0.0011617204,0.9499151],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993494,0.000088014465,0.00004043871,0.00010118566,0.00037148994,0.000049536335],"domain_scores_gemma":[0.9946543,0.0007939711,0.00014662693,0.00045066222,0.0032715271,0.0006829088],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011504414,0.0008160119,0.0005282628,0.0028658393,0.0019964562,0.0024879433,0.00094995537,0.00069312734,0.4767325],"category_scores_gemma":[0.011175765,0.00021300022,0.00047288934,0.001873587,0.00044194394,0.0018461207,0.0018479212,0.0019021562,0.3009987],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023338083,0.000017938488,0.00008316123,0.000063208194,0.0000015806999,0.000032954624,0.00003881275,0.000058444642,0.000117941585,0.0033944116,0.94897795,0.04719029],"study_design_scores_gemma":[0.000004069061,0.00001106706,0.00023664445,0.00006915013,0.0000016400795,0.00003769468,0.00004449082,0.000036817757,0.00011455072,0.0028066966,0.99663323,0.00000400804],"about_ca_topic_score_codex":0.0043156426,"about_ca_topic_score_gemma":0.004906704,"teacher_disagreement_score":0.4767325,"about_ca_system_score_codex":0.0015011694,"about_ca_system_score_gemma":0.0019519774,"threshold_uncertainty_score":0},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.026409466744672108,"score_gpt":0.2762155736869909,"score_spread":0.2498061069423188,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4301181330","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06368891,0.00005560926,0.9337915,0.00015948093,0.000025778267,0.000056217883,0.00010299258,0.0008900533,0.001229426],"genre_scores_gemma":[0.937476,0.000045046476,0.061254587,0.00006144728,0.000010575307,0.00010913652,0.0001576109,0.00015675543,0.0007288713],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962585,0.0014451641,0.00020677432,0.00059243955,0.0011715513,0.0003255167],"domain_scores_gemma":[0.9767934,0.016003579,0.002074891,0.0028169942,0.0020201502,0.00029101124],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004775059,0.0008299035,0.00079617364,0.000807579,0.0004134353,0.0012769349,0.0016589897,0.0013165998,0.0026566288],"category_scores_gemma":[0.033412833,0.0005593544,0.0016253245,0.0002607785,0.002576875,0.0019722108,0.002040269,0.0017358128,0.00028457845],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001163632,0.00003980771,0.0018784404,0.000090657544,0.000054568663,0.0002744865,0.00010390421,0.9285862,0.006778928,0.054752342,0.00023895105,0.007085307],"study_design_scores_gemma":[0.000004639983,0.000020871334,0.00004697815,0.0000072835296,0.000004781997,0.00001656029,0.000005363075,0.98387146,0.0022612354,0.013666346,0.000090295165,0.0000041825515],"about_ca_topic_score_codex":0.0017699113,"about_ca_topic_score_gemma":0.0017006295,"teacher_disagreement_score":0.004775059,"about_ca_system_score_codex":0.001209691,"about_ca_system_score_gemma":0.0015617559,"threshold_uncertainty_score":0.025253236},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Satisfiability modulo theories; Solver; Ranking (information retrieval); Pairwise comparison; Theory of computation; Selection (genetic algorithm); Domain (mathematical analysis); Theoretical computer science; Programming language; Algorithm; Artificial intelligence; Mathematics","score_opus":0.02944465937477168,"score_gpt":0.31299095544415556,"score_spread":0.28354629606938386,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4321242415","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013271586,0.00043503175,0.97966355,0.0001980821,0.00012242545,0.000117546595,0.0001803527,0.0025338784,0.003477603],"genre_scores_gemma":[0.20496413,0.00024442645,0.7855612,0.00020108807,0.00015992543,0.00038711133,0.0012766337,0.0007850222,0.006420453],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99847144,0.00060355803,0.00011516536,0.00026638166,0.00039479346,0.00014855202],"domain_scores_gemma":[0.9970921,0.0017978885,0.00011315181,0.00032534945,0.00057858485,0.0000928962],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017775029,0.0010461779,0.0012439046,0.0020495825,0.0010084915,0.0012612178,0.0013612313,0.0016616494,0.011422779],"category_scores_gemma":[0.007770849,0.00049127726,0.001438336,0.0014618357,0.00042184725,0.0012505489,0.0012281612,0.0013229569,0.0033359255],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00047182618,0.00015949157,0.0013979,0.00021222298,0.00016247325,0.00020121592,0.00008259697,0.17677274,0.0071162377,0.010865506,0.011574546,0.7909832],"study_design_scores_gemma":[0.000053675463,0.0001131464,0.00031519154,0.000019992982,0.000029429908,0.00011699851,0.00002264778,0.9840189,0.0028054577,0.008907444,0.003588189,0.000008892874],"about_ca_topic_score_codex":0.0018123679,"about_ca_topic_score_gemma":0.0026680976,"teacher_disagreement_score":0.011422779,"about_ca_system_score_codex":0.0005714404,"about_ca_system_score_gemma":0.001640369,"threshold_uncertainty_score":0.038213015},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Theory of computation; Computer science; Selection (genetic algorithm); Algorithm; Artificial intelligence","score_opus":0.024416113692210247,"score_gpt":0.29348725613433285,"score_spread":0.2690711424421226,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385802534","genre_codex":"editorial","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007591739,0.0013803345,0.03320641,0.025461026,0.91150326,0.00009187239,0.0043403944,0.0063375058,0.016920026],"genre_scores_gemma":[0.05834415,0.004461487,0.12619877,0.02825408,0.2340557,0.00064328697,0.01524243,0.02449556,0.50830454],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9929842,0.0016138516,0.00097009615,0.0010890844,0.002947772,0.0003951447],"domain_scores_gemma":[0.9325325,0.012648082,0.0016703837,0.006933466,0.04504501,0.0011706095],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004689871,0.0025138885,0.0025846544,0.005576381,0.0034552896,0.005082667,0.003926994,0.0043419963,0.1920172],"category_scores_gemma":[0.09478725,0.0011784997,0.002421728,0.005390828,0.0016811731,0.0035103322,0.0023148982,0.00723762,0.07946075],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000052042156,0.000009859346,0.00009959495,0.00017471908,0.00003032418,0.00011596798,0.00001843527,0.0005451475,0.00013209145,0.00328648,0.9750744,0.02046086],"study_design_scores_gemma":[0.00013269525,0.00007570913,0.0012935667,0.0004318257,0.00011621766,0.00073839125,0.00007416595,0.010353406,0.0021402922,0.01428259,0.970265,0.00009627232],"about_ca_topic_score_codex":0.010105072,"about_ca_topic_score_gemma":0.012185457,"teacher_disagreement_score":0.1920172,"about_ca_system_score_codex":0.0032917603,"about_ca_system_score_gemma":0.0050375396,"threshold_uncertainty_score":0.6423615},"labels":[],"label_agreement":null},{"id":"W4396904796","doi":"10.1007/s10009-024-00748-z","title":"An Event-B model of an automotive adaptive exterior light system","year":2024,"lang":"en","type":"article","venue":"International Journal on Software Tools for Technology Transfer","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"Natural Sciences and Engineering Research Council of Canada; Agence Nationale de la Recherche","keywords":"Computer science; Visibility; Theory of computation; Context (archaeology); Event (particle physics); Controller (irrigation); Key (lock); Real-time computing; Algorithm; Computer security","score_opus":0.03258320893785447,"score_gpt":0.32559853777195463,"score_spread":0.29301532883410014,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396904796","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.067217246,0.0002549702,0.8797522,0.0008598325,0.00012368428,0.00028253195,0.0013070164,0.0024402032,0.047762178],"genre_scores_gemma":[0.9301528,0.00024590726,0.049319256,0.00017620952,0.000029146659,0.0003316335,0.00060255785,0.00015674194,0.01898578],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995745,0.000088757246,0.000025987074,0.00010480975,0.00013934635,0.00006673463],"domain_scores_gemma":[0.9996562,0.0001374805,0.000051544517,0.000041523734,0.00008248417,0.00003069949],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004340184,0.0007404001,0.00048874144,0.0006392776,0.00060908054,0.0022373463,0.001302937,0.0016995838,0.01133411],"category_scores_gemma":[0.0007387865,0.00038687358,0.00082007627,0.00031985214,0.0010085428,0.001237153,0.0009793796,0.0009435977,0.0012695688],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003992333,0.0001387693,0.0013482191,0.00019050272,0.00006504836,0.0011853793,0.00047967638,0.66030663,0.018279586,0.30699742,0.0016204154,0.008989088],"study_design_scores_gemma":[0.00012273266,0.0000892111,0.00033693545,0.00002814008,0.000038668008,0.00009415581,0.00008036893,0.94261307,0.0029695076,0.046533283,0.00706777,0.000026086249],"about_ca_topic_score_codex":0.02028716,"about_ca_topic_score_gemma":0.008328493,"teacher_disagreement_score":0.02028716,"about_ca_system_score_codex":0.0010974841,"about_ca_system_score_gemma":0.0012412523,"threshold_uncertainty_score":0.04033816},"labels":[],"label_agreement":null},{"id":"W4396932180","doi":"10.1007/s10009-024-00749-y","title":"Modeling of a speed control system using Event-B","year":2024,"lang":"en","type":"article","venue":"International Journal on Software Tools for Technology Transfer","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"Natural Sciences and Engineering Research Council of Canada; Agence Nationale de la Recherche","keywords":"Computer science; Theory of computation; Event (particle physics); Control (management); Algorithm; Artificial intelligence","score_opus":0.044912694429051256,"score_gpt":0.33188686174655296,"score_spread":0.2869741673175017,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396932180","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.049661685,0.00013376144,0.926953,0.0002387074,0.000105051135,0.00019500649,0.00031575974,0.0027049803,0.019691935],"genre_scores_gemma":[0.9431696,0.00016247731,0.045616582,0.000058454527,0.000023283492,0.0001727714,0.00016141767,0.00011190708,0.010523542],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996228,0.00008488907,0.000023278355,0.000081238904,0.00013762768,0.000050197406],"domain_scores_gemma":[0.9996699,0.00014649432,0.000054757584,0.00003756642,0.00006714589,0.00002421024],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042294772,0.00069730706,0.0005636638,0.000606236,0.0007077125,0.0015991962,0.0012881352,0.001123786,0.009582343],"category_scores_gemma":[0.00078703085,0.00035285062,0.0006637236,0.0003143049,0.000618322,0.00105937,0.0006527748,0.000693356,0.0009811855],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015721991,0.00007791096,0.0007381434,0.00010119255,0.00003326605,0.00029176727,0.00014227402,0.9442994,0.007035381,0.038591318,0.00056548964,0.007966686],"study_design_scores_gemma":[0.000019568834,0.00003371396,0.00010245681,0.000005747079,0.000010545676,0.00002143466,0.000007804511,0.994125,0.0015611466,0.002604591,0.0015017473,0.0000062219137],"about_ca_topic_score_codex":0.012874821,"about_ca_topic_score_gemma":0.0051366934,"teacher_disagreement_score":0.012874821,"about_ca_system_score_codex":0.00060890266,"about_ca_system_score_gemma":0.0009195234,"threshold_uncertainty_score":0.032056153},"labels":[],"label_agreement":null}]}