{"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024998834,0.0008732463,0.9522167,0.013151099,0.0054609827,0.0006707975,0.00012307061,0.0024973196,0.000007991555],"genre_scores_gemma":[0.039397318,0.000118443924,0.9581973,0.0010989457,0.0006265382,0.00021618312,0.0000311349,0.0000769655,0.00023717363],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996731,0.0001110873,0.0007144617,0.00099361,0.0008343459,0.0006155164],"domain_scores_gemma":[0.9963421,0.0009478468,0.000121350124,0.0009412375,0.0013890659,0.000258397],"candidate_categories":["metaresearch","metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009451029,0.0004584176,0.000526061,0.0009807193,0.00016968894,0.00040274565,0.0035909167,0.00023810039,0.000012999711],"category_scores_gemma":[0.013618296,0.0004146359,0.00021158498,0.0007071901,0.00010864691,0.001375019,0.00027298328,0.00084364385,0.000086328786],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007752405,0.0003115659,0.0005462067,0.000020195748,0.0005891344,0.00040834086,0.0007059834,0.023122124,0.0025005075,0.0075497343,0.0038865926,0.95958436],"study_design_scores_gemma":[0.010152184,0.003902656,0.0051523135,0.0009251386,0.00017794721,0.0018262445,0.00030793925,0.0006147752,0.1040567,0.5055756,0.3639019,0.003406551],"about_ca_topic_score_codex":0.000002648254,"about_ca_topic_score_gemma":0.000005558433,"teacher_disagreement_score":0.95617783,"about_ca_system_score_codex":0.0003475361,"about_ca_system_score_gemma":0.00021338399,"threshold_uncertainty_score":0.99983054},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022675756,0.00006529985,0.9690325,0.006634785,0.0009973836,0.0002509039,0.00000663313,0.00027254256,0.000064153755],"genre_scores_gemma":[0.38922447,0.000018472998,0.60929286,0.0012778185,0.0001338199,0.000027184586,0.0000012984514,0.000010140779,0.00001391121],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983735,0.000080760714,0.00044204685,0.00029816228,0.00051387376,0.0002916687],"domain_scores_gemma":[0.99875784,0.0002393104,0.000115861294,0.00032944628,0.0005067188,0.00005083651],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010483115,0.00016994547,0.00016698228,0.00042295517,0.00029207347,0.00034337337,0.0024509158,0.00017534959,0.000013066837],"category_scores_gemma":[0.00069846393,0.00012496018,0.00017376806,0.00040089144,0.000061945175,0.0009694044,0.000034554032,0.0005443888,0.000005518433],"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.00007493455,0.00010693394,0.000074334865,0.000004078571,0.00008752739,0.000022037482,0.000342046,0.0024486994,0.0030319262,0.4128574,0.00004747475,0.5809026],"study_design_scores_gemma":[0.0022921835,0.0013672538,0.0009906507,0.00034845716,0.000075237986,0.00381935,0.00026350663,0.083721794,0.2410595,0.650894,0.014416517,0.00075155834],"about_ca_topic_score_codex":4.9162867e-7,"about_ca_topic_score_gemma":2.9814396e-7,"teacher_disagreement_score":0.580151,"about_ca_system_score_codex":0.0001649586,"about_ca_system_score_gemma":0.000109622946,"threshold_uncertainty_score":0.5095728},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007489565,0.00015196574,0.97859174,0.0048406124,0.0012464693,0.00025083817,0.000020766423,0.0073170555,0.000090959446],"genre_scores_gemma":[0.262687,0.00009126679,0.7343988,0.0020310886,0.0002855171,0.000080122016,0.0000068075856,0.000053157684,0.00036629],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975857,0.000022617658,0.0006160554,0.00043229284,0.0007136144,0.0006297166],"domain_scores_gemma":[0.9971406,0.0011310207,0.00011722586,0.0005876943,0.0008975687,0.00012592578],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013047513,0.0002882028,0.00022722298,0.0005495513,0.0006265812,0.0006346113,0.0033769312,0.00031835746,0.00000516752],"category_scores_gemma":[0.0024796089,0.00020977636,0.00027353046,0.0003686378,0.00022132552,0.0006114863,0.00014417435,0.0008166314,0.00002634934],"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.00021733234,0.00018527055,0.0016168162,0.000006059486,0.0002118439,0.00014238816,0.00016601897,0.00056613,0.00014448597,0.16971655,0.014462394,0.81256473],"study_design_scores_gemma":[0.0027186621,0.0011100281,0.0011345732,0.0003471548,0.000048338505,0.0024251367,0.000037234673,0.022046564,0.020354163,0.839809,0.10886308,0.0011060373],"about_ca_topic_score_codex":0.0000014865402,"about_ca_topic_score_gemma":0.000006861332,"teacher_disagreement_score":0.81145865,"about_ca_system_score_codex":0.00021168333,"about_ca_system_score_gemma":0.00015783278,"threshold_uncertainty_score":0.8554432},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018155992,0.0000991897,0.9764055,0.002101487,0.001953919,0.00047477928,0.000078637,0.0007176043,0.000012889617],"genre_scores_gemma":[0.49480173,0.000018610546,0.5044838,0.0002405423,0.00013429734,0.00022873946,0.000011260717,0.000034211236,0.00004675816],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979434,0.000037068174,0.00042827244,0.00043587585,0.0005531879,0.00060219015],"domain_scores_gemma":[0.99538034,0.0032174967,0.000058306137,0.00037116287,0.0008485955,0.00012411682],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.0006815384,0.00023285885,0.00024351261,0.00059980387,0.00025424105,0.0003554707,0.0016772255,0.0003271709,0.000022846622],"category_scores_gemma":[0.014086307,0.00022016816,0.00025757766,0.000500133,0.00007733733,0.00048374507,0.00004671545,0.0007361387,0.000016151249],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010705337,0.00016925563,0.0021386493,0.000014336874,0.000253853,0.00006127506,0.000100926576,0.0003818545,0.00048259756,0.91220105,0.00044819101,0.08364097],"study_design_scores_gemma":[0.006869268,0.0027430705,0.0013654936,0.00068839965,0.000060754235,0.0017781826,0.00013361525,0.001862949,0.14160824,0.5629628,0.2785247,0.0014025748],"about_ca_topic_score_codex":3.6354442e-7,"about_ca_topic_score_gemma":4.4579815e-7,"teacher_disagreement_score":0.47664574,"about_ca_system_score_codex":0.00029052325,"about_ca_system_score_gemma":0.0001861615,"threshold_uncertainty_score":0.99421847},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008677611,0.000017450186,0.981458,0.00074880355,0.00043381518,0.00847549,0.00001983335,0.000114024544,0.000054985383],"genre_scores_gemma":[0.20384778,0.00000584899,0.7842453,0.000104383165,0.000034733443,0.011724749,0.0000039015827,0.000013987583,0.000019310013],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99874514,0.000043582953,0.00052784383,0.00025081675,0.0002610419,0.000171588],"domain_scores_gemma":[0.9987637,0.0002054718,0.00015733147,0.00024040966,0.0005916577,0.00004143798],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005902524,0.00012871686,0.00021100846,0.00038072478,0.00010678598,0.00011191262,0.0007845837,0.00017739371,0.000007106974],"category_scores_gemma":[0.0010675219,0.00011851674,0.00009751451,0.0001772819,0.00010046622,0.00053260976,0.000017077666,0.00020849834,0.0000020549585],"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.00017243304,0.00019463069,0.0011847413,0.00003140481,0.000060541264,7.526775e-7,0.00011573317,0.0000617398,0.0040550777,0.7201539,0.00011744615,0.27385157],"study_design_scores_gemma":[0.0047615133,0.0026182237,0.0021227726,0.00017460143,0.000029555205,0.00021125094,0.00010136853,0.007430705,0.69201005,0.09211581,0.19800885,0.00041531085],"about_ca_topic_score_codex":2.6514496e-7,"about_ca_topic_score_gemma":4.0595762e-7,"teacher_disagreement_score":0.68795496,"about_ca_system_score_codex":0.00007196656,"about_ca_system_score_gemma":0.00006806659,"threshold_uncertainty_score":0.48329726},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16036308,0.0000667731,0.8356341,0.0027754596,0.00040884112,0.0002418697,0.000011735868,0.00041971693,0.000078410354],"genre_scores_gemma":[0.96207845,0.000027391025,0.036994435,0.0006481681,0.00013973174,0.00003033338,0.0000062304443,0.000011115437,0.00006414357],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99844694,0.000034731147,0.0004046634,0.00042235167,0.00038528972,0.0003060169],"domain_scores_gemma":[0.9990411,0.0000897111,0.0000747779,0.00033319596,0.00033968384,0.00012152822],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052112836,0.00019072571,0.00023768844,0.00034474037,0.0001847083,0.0003575036,0.001375152,0.00023134961,0.0000037847426],"category_scores_gemma":[0.00018521039,0.00015875012,0.000120370234,0.00013384802,0.00010210297,0.0010211214,0.000047097667,0.00042427174,0.000005199348],"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.00007752811,0.00035381777,0.00026380797,0.000007887152,0.0000633183,0.000032192194,0.0003318558,0.00034007017,0.0007543026,0.14262128,0.000064548476,0.85508937],"study_design_scores_gemma":[0.004268138,0.0017468111,0.004431024,0.00007438427,0.000038546554,0.0012748714,0.00010620212,0.03863907,0.008073284,0.93728524,0.0033532325,0.0007091667],"about_ca_topic_score_codex":0.000002362559,"about_ca_topic_score_gemma":0.000004971572,"teacher_disagreement_score":0.85438025,"about_ca_system_score_codex":0.00009072295,"about_ca_system_score_gemma":0.00008543182,"threshold_uncertainty_score":0.6473642},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.051599126,0.000029907049,0.9458395,0.000792994,0.0009783,0.00035645874,0.00009238467,0.00024400867,0.0000673202],"genre_scores_gemma":[0.20873041,0.000016587517,0.79084784,0.00018970427,0.000065346074,0.000037260103,0.000007502175,0.000020784686,0.000084576786],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982638,0.000017994642,0.0006928269,0.00029860905,0.00038050348,0.0003462775],"domain_scores_gemma":[0.9980443,0.00040544427,0.00021396732,0.0002769549,0.000993175,0.000066174434],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010729921,0.00016983149,0.00023394614,0.0008307966,0.00016555215,0.00012630304,0.0013327289,0.00020997826,0.000006045195],"category_scores_gemma":[0.00086120766,0.00016658823,0.0002078322,0.00028492173,0.0001564863,0.0008584891,0.000051521783,0.00038162782,0.0000043635255],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028986158,0.00012112788,0.00017274472,0.00001990455,0.00016156136,0.000007796149,0.00016117618,0.0052949893,0.025211371,0.2315442,0.00008911529,0.73692614],"study_design_scores_gemma":[0.0039146477,0.0010941941,0.00030507366,0.0001940666,0.000055011016,0.00084645767,0.00007578694,0.43217552,0.41668436,0.13628334,0.007769258,0.00060230924],"about_ca_topic_score_codex":0.0000011748862,"about_ca_topic_score_gemma":0.0000019020645,"teacher_disagreement_score":0.73632383,"about_ca_system_score_codex":0.00019589678,"about_ca_system_score_gemma":0.00014777732,"threshold_uncertainty_score":0.6793271},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16103627,0.000029314859,0.82753915,0.0068753753,0.0017433261,0.00088148273,0.000102900594,0.0017831068,0.000009103049],"genre_scores_gemma":[0.4953875,0.000024286384,0.502119,0.00047899748,0.0012610524,0.00059794175,0.000055445606,0.000038614166,0.000037172427],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998048,0.000028573048,0.00044923899,0.000512246,0.00050186453,0.00046007434],"domain_scores_gemma":[0.9968562,0.0011937172,0.00008044822,0.00034775547,0.0013889401,0.00013294061],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001577094,0.0002162837,0.00024547553,0.0008879078,0.0005152882,0.0008682634,0.0015219024,0.0005621305,0.000005364119],"category_scores_gemma":[0.0036854895,0.0001934642,0.00014977268,0.00023365648,0.00019362812,0.0012293018,0.00007704188,0.000985408,0.0000015326958],"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.00026935022,0.00018839017,0.00027852287,0.000009299957,0.00009438912,0.000010635464,0.00028786424,0.00001121231,0.0065401536,0.15183122,0.0061811586,0.8342978],"study_design_scores_gemma":[0.006112284,0.005436201,0.00018116533,0.00014483953,0.000040153987,0.00086412765,0.000047033867,0.021923915,0.077564314,0.7921787,0.094827965,0.0006793308],"about_ca_topic_score_codex":0.000008895621,"about_ca_topic_score_gemma":0.000019765457,"teacher_disagreement_score":0.83361846,"about_ca_system_score_codex":0.00010583563,"about_ca_system_score_gemma":0.00024889834,"threshold_uncertainty_score":0.8372684},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04589723,0.000047245605,0.61920714,0.117433794,0.21576431,0.0006384716,0.00016206905,0.00042655537,0.00042319976],"genre_scores_gemma":[0.6550678,0.000063961306,0.004144224,0.005349149,0.3348326,0.00026910246,0.00007902157,0.000048177626,0.00014592161],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99785095,0.0000787546,0.00045589727,0.00050048385,0.0008256455,0.00028823552],"domain_scores_gemma":[0.9983169,0.0003008593,0.00012369324,0.0005078014,0.0006794487,0.00007130033],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044264903,0.00024372307,0.00016900963,0.00036172816,0.00040630533,0.0005079886,0.0033135293,0.00022046002,0.000051868232],"category_scores_gemma":[0.00012081022,0.00015245593,0.00017239516,0.00038999712,0.00006389552,0.00063887174,0.0001280129,0.00072292704,0.000117091695],"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.0038050967,0.0014414428,0.0043320875,0.000019901785,0.0025003871,0.00011033617,0.009462566,0.008998351,0.009808075,0.45210773,0.39993596,0.10747808],"study_design_scores_gemma":[0.0009052788,0.0006845974,0.0014490696,0.00010687838,0.000037251382,0.00024404509,0.00033021535,0.00081772095,0.0050651855,0.0045082388,0.98559463,0.00025686045],"about_ca_topic_score_codex":0.00007598781,"about_ca_topic_score_gemma":0.00019394113,"teacher_disagreement_score":0.6150629,"about_ca_system_score_codex":0.00031600488,"about_ca_system_score_gemma":0.000077624056,"threshold_uncertainty_score":0.62169725},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03210516,0.000020502997,0.94073313,0.025555337,0.00018874276,0.00094705395,0.000039078943,0.00040202402,0.000008949225],"genre_scores_gemma":[0.33788413,0.0000066820216,0.6592583,0.0014554651,0.00030371026,0.0010038702,0.000027685433,0.000025424231,0.000034714303],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99857074,0.000016026052,0.00029027325,0.00035478806,0.00038917313,0.00037901071],"domain_scores_gemma":[0.9982741,0.00058930164,0.000036061425,0.0003946766,0.0006235495,0.000082349856],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058098865,0.00017271006,0.00018666558,0.0007714537,0.00019675696,0.00037486257,0.002662135,0.00015225883,0.000005822187],"category_scores_gemma":[0.0008521167,0.00013639625,0.000069439324,0.0007367586,0.000046585978,0.00044221373,0.00003998244,0.0003811092,0.000008621809],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015201163,0.00040155515,0.00034446226,0.000017631302,0.00006722853,0.000009464406,0.0003911388,0.04897087,0.0030618608,0.021929944,0.0004280843,0.92422575],"study_design_scores_gemma":[0.0065336954,0.0035358535,0.013916895,0.00039967455,0.000048450747,0.001151293,0.000264802,0.87641734,0.024332803,0.04072833,0.03105993,0.0016109174],"about_ca_topic_score_codex":0.0000017385876,"about_ca_topic_score_gemma":0.0000030314322,"teacher_disagreement_score":0.9226148,"about_ca_system_score_codex":0.00017830146,"about_ca_system_score_gemma":0.000081312784,"threshold_uncertainty_score":0.5562078},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010478693,0.0000911009,0.97780967,0.007626709,0.0033330868,0.0003133666,0.000021543645,0.00027808137,0.00004777711],"genre_scores_gemma":[0.9170855,0.000052550564,0.08165793,0.0004860813,0.0003400791,0.0001542626,0.000011114094,0.00001759,0.0001948669],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99859405,0.00002214909,0.00038776782,0.0003039086,0.00034497917,0.00034713963],"domain_scores_gemma":[0.9979637,0.0008202036,0.00010196077,0.00040994553,0.00063402875,0.000070139686],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061224133,0.00016359183,0.00021594192,0.00039927132,0.0004024057,0.00070935267,0.002188,0.00021886051,0.000013687736],"category_scores_gemma":[0.00077751547,0.00010874567,0.00040491906,0.00035691855,0.00012709775,0.000318309,0.000044490156,0.00070322957,0.000022747361],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053447337,0.00004672224,0.0005781313,0.000002141619,0.000606611,0.000016661546,0.000040538747,0.000033288572,0.000059800182,0.7856589,0.00036552324,0.21253821],"study_design_scores_gemma":[0.0006027815,0.0003113447,0.00027538865,0.000005630362,0.00009309208,0.00019663252,0.000019369712,0.0010357402,0.002397787,0.674356,0.32051346,0.00019279937],"about_ca_topic_score_codex":0.0000018693629,"about_ca_topic_score_gemma":0.000021219785,"teacher_disagreement_score":0.90660685,"about_ca_system_score_codex":0.00004395158,"about_ca_system_score_gemma":0.00007598457,"threshold_uncertainty_score":0.6840304},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.116695106,0.000039816183,0.8799518,0.0008659927,0.0017159317,0.00027541723,0.000027221942,0.00031254106,0.000116221934],"genre_scores_gemma":[0.39186874,0.000026970998,0.6074966,0.00041205253,0.00009123642,0.0000513822,0.000007269272,0.00001914607,0.000026614667],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99795514,0.00009642325,0.00058502046,0.00038996476,0.00054317777,0.0004302598],"domain_scores_gemma":[0.99863887,0.00019054223,0.000112394606,0.00043800886,0.0005407496,0.000079448444],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00092949584,0.00021413201,0.00021057014,0.0006602656,0.00028716068,0.00036767035,0.0016081173,0.00020500005,0.000030793308],"category_scores_gemma":[0.0013986751,0.00020339331,0.00019987092,0.00032002563,0.0001234417,0.0019535208,0.000044201184,0.00060537533,0.000026284943],"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.00009935414,0.00013417394,0.00017342722,0.0000053459726,0.00008247737,0.000027361113,0.00005712955,0.00029164474,0.0034531902,0.7844375,0.0000725169,0.21116592],"study_design_scores_gemma":[0.006246475,0.0017200632,0.0013280738,0.00024530065,0.00008145472,0.008822823,0.0000821179,0.04667901,0.40209278,0.3297219,0.20150149,0.001478515],"about_ca_topic_score_codex":4.4743396e-7,"about_ca_topic_score_gemma":2.0486495e-7,"teacher_disagreement_score":0.45471555,"about_ca_system_score_codex":0.0002722032,"about_ca_system_score_gemma":0.00018313222,"threshold_uncertainty_score":0.82941383},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19880004,0.000062309766,0.79937774,0.0010354259,0.0003505567,0.00009708551,0.000038387527,0.00023129942,0.0000071325567],"genre_scores_gemma":[0.56086135,0.00004259421,0.43897414,0.00006467762,0.000014928508,0.000022064023,0.0000028239842,0.000008638995,0.000008754068],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986402,0.00016671332,0.0003423582,0.0003158459,0.0003251725,0.00020970101],"domain_scores_gemma":[0.99413985,0.0049229646,0.00012286605,0.00024801985,0.000514299,0.000052027124],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000980351,0.00017658895,0.00044521314,0.0011288844,0.000076178774,0.0000864215,0.00090593926,0.00015732237,0.0000031640714],"category_scores_gemma":[0.0049249567,0.00015396049,0.0002098183,0.0006634849,0.00019834816,0.0006117897,0.00006588191,0.00033554586,0.0000012773567],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023418237,0.00013673246,0.000653036,0.00001913707,0.0025139165,0.000010975729,0.002197103,0.017289393,0.0026134897,0.5901374,0.00001646366,0.38417816],"study_design_scores_gemma":[0.004924896,0.0063648084,0.020876294,0.00036255977,0.0010118004,0.00020047654,0.0015140631,0.042282723,0.08203617,0.8354129,0.0033698091,0.0016434699],"about_ca_topic_score_codex":0.000001818326,"about_ca_topic_score_gemma":0.0000045106253,"teacher_disagreement_score":0.38253468,"about_ca_system_score_codex":0.00006890938,"about_ca_system_score_gemma":0.000027069038,"threshold_uncertainty_score":0.62783265},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022430697,0.00006265346,0.9708614,0.0041866424,0.0017780554,0.0004105464,0.000026699214,0.00023010609,0.000013220119],"genre_scores_gemma":[0.17403387,0.0000595839,0.82450855,0.00088247634,0.00035987527,0.00010374778,0.000018431056,0.000016066691,0.000017382628],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99873066,0.000020367539,0.00041744355,0.00029632574,0.0002934184,0.000241784],"domain_scores_gemma":[0.99858266,0.00043062607,0.00009268582,0.0002161177,0.00062022364,0.000057674875],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010216143,0.00014248132,0.00014169795,0.00046752318,0.00020605412,0.00034865743,0.0007173965,0.00025969112,0.000005183776],"category_scores_gemma":[0.0011674598,0.00013507486,0.0000856541,0.00017729888,0.000066694585,0.0014170039,0.000027535489,0.00027677973,0.0000040447535],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010053061,0.00004327491,0.000068462105,0.0000043180326,0.00004060657,0.000003171865,0.00015286935,0.000042530348,0.0016337564,0.67517227,0.00013596262,0.32260224],"study_design_scores_gemma":[0.0026133342,0.0016949859,0.0008119663,0.00014668134,0.00003392067,0.00048184805,0.00014722333,0.01716223,0.12914588,0.7588444,0.08836135,0.00055623264],"about_ca_topic_score_codex":5.195879e-7,"about_ca_topic_score_gemma":0.0000037536001,"teacher_disagreement_score":0.322046,"about_ca_system_score_codex":0.00012794735,"about_ca_system_score_gemma":0.00004198514,"threshold_uncertainty_score":0.55081934},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.062365174,0.00013231456,0.9320723,0.0037883404,0.0010020459,0.00016132767,0.000063133746,0.00022910604,0.00018624698],"genre_scores_gemma":[0.96443284,0.000113514165,0.034091994,0.0012035522,0.00005074964,0.00004881326,0.000015325239,0.000013688263,0.000029534707],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99882483,0.000033328928,0.00032994014,0.00025941737,0.0002780239,0.00027446044],"domain_scores_gemma":[0.99917716,0.00015873346,0.00004864978,0.00020917538,0.00034036965,0.00006593182],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032100838,0.000141967,0.00013959558,0.00042772,0.00021849445,0.00032176342,0.0010104348,0.00013540065,0.00008809062],"category_scores_gemma":[0.00025325047,0.00013286549,0.00015928701,0.00030091053,0.00006299101,0.0005898609,0.000025110372,0.00035970577,0.000013014276],"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.000023311684,0.00018395031,0.0009437929,0.0000030904184,0.0001381925,0.000017827908,0.00016570665,0.000010571168,0.00043557512,0.92498755,0.0038781527,0.06921227],"study_design_scores_gemma":[0.0024498543,0.0004251291,0.00014177217,0.000042040356,0.000016630549,0.00057419896,0.0001329675,0.00020659834,0.016277889,0.32015067,0.65920633,0.00037594215],"about_ca_topic_score_codex":0.0000011880527,"about_ca_topic_score_gemma":0.0000041663848,"teacher_disagreement_score":0.90206766,"about_ca_system_score_codex":0.000076266726,"about_ca_system_score_gemma":0.000064913314,"threshold_uncertainty_score":0.54180974},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13506977,0.00011331636,0.85316634,0.009268822,0.0012853529,0.0001793391,0.0000066415364,0.00075923535,0.00015117817],"genre_scores_gemma":[0.7065797,0.0000056531167,0.29187176,0.001206,0.00011235136,0.000080169964,0.000011369503,0.000016074164,0.000116917385],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9982227,0.000029701803,0.0005647143,0.00034706155,0.0004352718,0.0004005666],"domain_scores_gemma":[0.9988221,0.0003795478,0.00008805705,0.0002814973,0.0003794086,0.000049411956],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002684869,0.00022347321,0.0002777365,0.0006904933,0.00019285349,0.00026081875,0.0019144055,0.00026594644,0.00004151323],"category_scores_gemma":[0.00024937728,0.0001878778,0.00016620493,0.00020706383,0.00011754357,0.00039318547,0.000048523612,0.0003345311,0.000057900215],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009065751,0.0005143389,0.006779005,0.000020058364,0.00024044196,0.00037476252,0.000094842515,0.000597476,0.00054398645,0.24219772,0.0022555976,0.7462911],"study_design_scores_gemma":[0.0143150585,0.0022586954,0.062986985,0.00067892886,0.00010861951,0.0036646568,0.0001347747,0.01839223,0.18862657,0.27642483,0.4300939,0.0023147322],"about_ca_topic_score_codex":0.000004121554,"about_ca_topic_score_gemma":0.0000385422,"teacher_disagreement_score":0.74397635,"about_ca_system_score_codex":0.00019798796,"about_ca_system_score_gemma":0.00026432698,"threshold_uncertainty_score":0.76614344},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018823108,0.000102987266,0.9490025,0.0028554462,0.0009711447,0.00178665,0.00001868436,0.02643009,0.000009404893],"genre_scores_gemma":[0.44891235,0.0000051758116,0.54730666,0.0010922644,0.00021584894,0.0023833208,0.000026763913,0.000042146195,0.000015495298],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99789673,0.00004757668,0.00058947044,0.000528432,0.00041293306,0.0005248273],"domain_scores_gemma":[0.99700326,0.0009718363,0.0001533913,0.0003175418,0.0014455923,0.000108406995],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00046899036,0.0003455321,0.00035184913,0.00068061857,0.00033160968,0.0008320075,0.0016263227,0.0003453835,0.00000525516],"category_scores_gemma":[0.0012313159,0.00029972172,0.00024593357,0.00030736811,0.00012156743,0.0009502738,0.00009385577,0.0005918337,0.000010877332],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025853718,0.00018617627,0.0015613443,0.000019884636,0.00015321169,0.000024459252,0.00010619421,0.00009755297,0.0022132471,0.003812407,0.0065332293,0.98526645],"study_design_scores_gemma":[0.005981523,0.010893971,0.0020312136,0.0032395886,0.00013229408,0.003632688,0.00003389769,0.35770217,0.18633397,0.39133653,0.035971813,0.0027103743],"about_ca_topic_score_codex":0.0000071215322,"about_ca_topic_score_gemma":9.595544e-7,"teacher_disagreement_score":0.98255605,"about_ca_system_score_codex":0.00021871163,"about_ca_system_score_gemma":0.00008577346,"threshold_uncertainty_score":0.99994546},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07445711,0.000022313296,0.92238134,0.0010277105,0.0009936328,0.00019830448,0.0000048276347,0.0007259834,0.00018875152],"genre_scores_gemma":[0.73174536,0.000026712354,0.26782852,0.00015602348,0.00011768665,0.000034169076,0.0000054126517,0.000017388758,0.00006871774],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99846095,0.000041966556,0.0004574678,0.00030870945,0.0004706919,0.00026022055],"domain_scores_gemma":[0.9985701,0.00027720953,0.00012478181,0.00031379567,0.00065471797,0.000059433536],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003760948,0.00018540715,0.00024408994,0.00060176797,0.000124559,0.00015359482,0.0014614336,0.00019276998,0.000006199301],"category_scores_gemma":[0.00044519795,0.0001643225,0.00018242444,0.0003152849,0.0000803331,0.00031844547,0.000058085945,0.00038569488,0.000012292605],"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.00019831443,0.0005387139,0.0046576606,0.000014271096,0.00022470766,0.00001607542,0.00014265862,0.0043255137,0.00056337606,0.36018926,0.00039519698,0.62873423],"study_design_scores_gemma":[0.016115306,0.020700332,0.0065484936,0.003794731,0.00013440268,0.0010319529,0.00012973156,0.068120085,0.46728927,0.2954797,0.11766593,0.0029900668],"about_ca_topic_score_codex":7.548536e-7,"about_ca_topic_score_gemma":1.9855902e-7,"teacher_disagreement_score":0.65728825,"about_ca_system_score_codex":0.00007949202,"about_ca_system_score_gemma":0.00004482971,"threshold_uncertainty_score":0.6700877},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28728825,0.000023152043,0.7079019,0.002240051,0.00009690474,0.0003040054,0.0000045310953,0.002114463,0.000026764821],"genre_scores_gemma":[0.729242,0.0000038481003,0.27020645,0.00027050314,0.000032083135,0.0002157458,0.000007539189,0.000013227642,0.000008574433],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987562,0.00002323158,0.00040391946,0.00032835148,0.00027003436,0.00021827861],"domain_scores_gemma":[0.9981099,0.0004030382,0.00009911943,0.00020430992,0.0011485972,0.000035030138],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033480418,0.00017018238,0.0001622314,0.0012395149,0.000107801854,0.00030458556,0.0006805933,0.00017840507,0.0000025747645],"category_scores_gemma":[0.0011890047,0.00013977695,0.000025268382,0.001264918,0.0000876419,0.00093221565,0.00004034346,0.00043740362,0.0000073541764],"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.00006209778,0.00015505851,0.10506145,0.000011461423,0.000049912374,0.00001915615,0.00006304615,0.00012186384,0.003960522,0.11540728,0.00042866205,0.7746595],"study_design_scores_gemma":[0.0038799797,0.0019064997,0.100175746,0.00093320623,0.00002086167,0.0018483009,0.000055993038,0.07098611,0.005390318,0.8121743,0.0017638719,0.0008647751],"about_ca_topic_score_codex":0.000028843526,"about_ca_topic_score_gemma":0.00000843945,"teacher_disagreement_score":0.7737947,"about_ca_system_score_codex":0.00020708483,"about_ca_system_score_gemma":0.0001171175,"threshold_uncertainty_score":0.56999385},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019895127,0.00005246693,0.97690445,0.00143863,0.00042809735,0.00036053022,0.000013301581,0.0007298081,0.00017756847],"genre_scores_gemma":[0.71914566,0.000009147826,0.2800022,0.00057101523,0.00003890699,0.00015939202,0.00000729832,0.000024722553,0.000041627052],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99826705,0.00005374996,0.00044793493,0.0003550373,0.00051633065,0.00035991846],"domain_scores_gemma":[0.9986929,0.00015173732,0.000114585724,0.0004096814,0.0005618746,0.00006920487],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004660309,0.00021760099,0.00020370522,0.0006206763,0.00018871203,0.00029960432,0.0013112988,0.00020528985,0.000022747741],"category_scores_gemma":[0.00019179001,0.00018195948,0.0001312349,0.00025367178,0.00006775706,0.0007893803,0.000018060295,0.00034461464,0.000014896596],"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.00053385884,0.000594007,0.0012763174,0.00004217363,0.0005416039,0.00040872287,0.0002057522,0.0031498184,0.0104689,0.65262306,0.0007779655,0.32937783],"study_design_scores_gemma":[0.005670646,0.004024781,0.00012328902,0.0005008836,0.000056685556,0.0039383243,0.000054305892,0.0038456782,0.8375926,0.021748222,0.12139901,0.0010455851],"about_ca_topic_score_codex":7.967151e-7,"about_ca_topic_score_gemma":0.000002749287,"teacher_disagreement_score":0.8271237,"about_ca_system_score_codex":0.00021761126,"about_ca_system_score_gemma":0.00014797418,"threshold_uncertainty_score":0.7420092},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.51035714,0.000011949752,0.48713654,0.0009921902,0.0008136104,0.0005509881,0.000058957547,0.000051749143,0.00002685712],"genre_scores_gemma":[0.9836746,0.000013631206,0.014417478,0.00031576757,0.00068171025,0.00025361095,0.00008636614,0.0000370525,0.0005197683],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9986794,0.000022841734,0.00032850148,0.0003466037,0.000299157,0.00032351929],"domain_scores_gemma":[0.99865234,0.00006693486,0.00005383778,0.00020774933,0.0009127222,0.00010641649],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004489678,0.00016268238,0.0001375778,0.00038986714,0.00023025867,0.0001268062,0.0004781861,0.00038162648,0.000038810373],"category_scores_gemma":[0.002109452,0.0001551657,0.00019732719,0.00013030927,0.00006300142,0.000028592443,0.000040373543,0.00042923773,0.000016656708],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016309895,0.00009083497,0.000484037,0.000012162218,0.0000868653,0.0000025870957,0.000021811873,0.00015762911,0.86944526,0.0017397795,0.00040314771,0.1259249],"study_design_scores_gemma":[0.0020742682,0.0010960111,0.00053288677,0.000026752848,0.000012275025,0.00014540151,0.000043409404,0.00024551648,0.85478914,0.0022698338,0.13855718,0.00020734798],"about_ca_topic_score_codex":0.0000024727644,"about_ca_topic_score_gemma":0.00012791812,"teacher_disagreement_score":0.47331747,"about_ca_system_score_codex":0.000060112354,"about_ca_system_score_gemma":0.00010352014,"threshold_uncertainty_score":0.63274735},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036672726,0.00016139665,0.9610675,0.00050497364,0.0006555137,0.0002130998,0.00002676835,0.0006832331,0.000014811793],"genre_scores_gemma":[0.20619635,0.00005452447,0.79343295,0.0001168378,0.00011516904,0.00005256157,0.0000014229038,0.000019998357,0.000010190172],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99858624,0.000028353525,0.00046748866,0.00028854687,0.00035983152,0.0002695655],"domain_scores_gemma":[0.9967505,0.0020211737,0.00011505632,0.00035406227,0.0007054177,0.000053808875],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027758646,0.00017875386,0.0002620543,0.0005944833,0.00018591163,0.000049828453,0.0016851457,0.00023716353,0.000005049101],"category_scores_gemma":[0.003303722,0.00017212796,0.00014400054,0.0006239214,0.00017411959,0.00052297337,0.00008064502,0.0005510272,0.000004393423],"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.0001021813,0.00034739176,0.0056312177,0.000043008073,0.00042886892,0.00017419863,0.00030405537,0.12963046,0.018901667,0.2712065,0.000084301806,0.57314616],"study_design_scores_gemma":[0.003057767,0.0012680329,0.0020496405,0.0008366368,0.0000728743,0.0074350503,0.00009139685,0.012337013,0.12204345,0.8252854,0.024135133,0.0013876205],"about_ca_topic_score_codex":4.779336e-7,"about_ca_topic_score_gemma":1.4267106e-7,"teacher_disagreement_score":0.57175857,"about_ca_system_score_codex":0.00012126488,"about_ca_system_score_gemma":0.00014890468,"threshold_uncertainty_score":0.7019174},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31978676,0.0000061768446,0.67569214,0.00054187205,0.00017181452,0.0037169782,0.000007843362,0.000052963383,0.000023433877],"genre_scores_gemma":[0.41803786,0.000025751364,0.57845896,0.00027526976,0.00010562699,0.0029846388,0.000004049514,0.000022841143,0.00008497323],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9989363,0.000055280783,0.00040325275,0.00020255588,0.00026259816,0.0001400064],"domain_scores_gemma":[0.99935,0.000043992015,0.0001089674,0.00019684108,0.00027045922,0.000029736182],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038242087,0.00011992786,0.00013021275,0.0002429602,0.00013586064,0.00015892005,0.0006560532,0.00013949604,0.000017925022],"category_scores_gemma":[0.00017176614,0.00008949785,0.000061332226,0.00020916473,0.00013242135,0.0009568074,0.000050323826,0.00020553799,8.134017e-7],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022966047,0.00012345937,0.0040112576,0.00004590412,0.00008946114,0.0000030994397,0.0003612586,0.00075210974,0.0069068405,0.11907663,0.000026580768,0.86837375],"study_design_scores_gemma":[0.0069488934,0.001979334,0.013921073,0.00088949525,0.00008218274,0.0026724993,0.000067015855,0.112204626,0.7310315,0.09560372,0.033778556,0.00082113565],"about_ca_topic_score_codex":0.0000017849926,"about_ca_topic_score_gemma":6.4283006e-7,"teacher_disagreement_score":0.8675526,"about_ca_system_score_codex":0.00006621621,"about_ca_system_score_gemma":0.000046144414,"threshold_uncertainty_score":0.36496165},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015925284,0.021135302,0.95802116,0.0019279114,0.00051650306,0.00020069162,0.000025644296,0.0022286186,0.000018888351],"genre_scores_gemma":[0.5096116,0.0033023262,0.48675454,0.00017333624,0.00007412962,0.000057835783,0.0000019837685,0.000020130792,0.0000040794457],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99864644,0.00003330564,0.00039844197,0.000277717,0.0003347118,0.00030939138],"domain_scores_gemma":[0.99767107,0.0012473523,0.00012716666,0.00022888933,0.0006240807,0.00010144336],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005585232,0.00020001209,0.00027397892,0.00047802704,0.00012692536,0.00012118292,0.0006612934,0.00018621207,9.31975e-7],"category_scores_gemma":[0.0023903053,0.0001740273,0.000054509088,0.00016487882,0.00014624157,0.00076057663,0.00007102409,0.00028310396,5.955527e-7],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045131434,0.00012596481,0.012044927,0.00012902147,0.0000572957,0.000007597847,0.00013104093,0.00054878334,0.000067086636,0.013220399,0.00009431379,0.97352844],"study_design_scores_gemma":[0.011618991,0.0075732335,0.012909871,0.008920372,0.00033588693,0.007205257,0.00032415424,0.19262375,0.025611538,0.5747255,0.15410574,0.004045667],"about_ca_topic_score_codex":0.0000010342901,"about_ca_topic_score_gemma":5.3752467e-7,"teacher_disagreement_score":0.9694828,"about_ca_system_score_codex":0.000058862694,"about_ca_system_score_gemma":0.00006848658,"threshold_uncertainty_score":0.70966274},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03230713,0.000049815473,0.95410395,0.012269053,0.00057517196,0.00023185714,0.000015303032,0.0002015531,0.00024617434],"genre_scores_gemma":[0.49943075,0.000036449204,0.4996763,0.000684694,0.000081413156,0.000018682527,0.0000038551657,0.000008877028,0.000058980993],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984563,0.000060680195,0.0005469618,0.00023100898,0.00046213865,0.00024293963],"domain_scores_gemma":[0.99861014,0.0002926328,0.00016816493,0.0003996738,0.00049171713,0.000037656286],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009400569,0.00014270417,0.00019520376,0.0003286158,0.00016997485,0.00017756587,0.0024052344,0.00016899327,0.000012390085],"category_scores_gemma":[0.0013953038,0.00010301171,0.00014734954,0.00031318658,0.00010024355,0.0007477508,0.000042477008,0.00048950233,0.000010372652],"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.00008785748,0.00006366547,0.00008972113,0.0000049172872,0.00006482648,0.000006623792,0.000246972,0.00050145487,0.0034667458,0.3928904,0.00013596119,0.6024409],"study_design_scores_gemma":[0.0032504392,0.0027832717,0.0033672098,0.000367503,0.000049851104,0.0012115149,0.00028307847,0.016565343,0.37398136,0.5470503,0.05041828,0.0006718645],"about_ca_topic_score_codex":7.292668e-7,"about_ca_topic_score_gemma":3.8378244e-7,"teacher_disagreement_score":0.60176903,"about_ca_system_score_codex":0.00008689698,"about_ca_system_score_gemma":0.000069405156,"threshold_uncertainty_score":0.44695637},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01139543,0.0001434196,0.982479,0.0020795031,0.0021747092,0.00083997694,0.000081016646,0.0007520178,0.000054968918],"genre_scores_gemma":[0.35738766,0.00005421789,0.64060354,0.0010305457,0.000113164046,0.0005793018,0.000009273597,0.00005024307,0.0001720685],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99782217,0.00005988259,0.0006432447,0.0004960765,0.00049519987,0.00048342661],"domain_scores_gemma":[0.9976476,0.000623626,0.00012119591,0.000395756,0.0011137647,0.00009808412],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00069248816,0.0002837248,0.00033564813,0.00066166866,0.00021685894,0.00044870455,0.002191155,0.0004178885,0.000026693711],"category_scores_gemma":[0.0014725915,0.00025689654,0.0002664334,0.00032597507,0.0000873231,0.0010263685,0.000035143654,0.00052357576,0.000016810805],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018289447,0.00030300338,0.0005198765,0.00004009514,0.00035021646,0.00005925225,0.00027706628,0.000034426623,0.002912352,0.9192097,0.0018939874,0.074217126],"study_design_scores_gemma":[0.0026393866,0.0012256699,0.000022438042,0.00043404597,0.00003280343,0.0008812361,0.00012953268,0.00025643493,0.24047764,0.6413426,0.11196221,0.00059602363],"about_ca_topic_score_codex":6.217961e-7,"about_ca_topic_score_gemma":0.0000013655462,"teacher_disagreement_score":0.34599224,"about_ca_system_score_codex":0.00023918279,"about_ca_system_score_gemma":0.00016566765,"threshold_uncertainty_score":0.9999883},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008360988,0.00033634115,0.9668025,0.021531437,0.0009785263,0.0006901661,0.00019860492,0.0010805826,0.000020887774],"genre_scores_gemma":[0.113939494,0.00018593746,0.8817133,0.0023421384,0.0006891686,0.00055064616,0.00011240861,0.00008011149,0.00038682594],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9951978,0.000083791696,0.0012791392,0.0009898549,0.0013839456,0.0010654671],"domain_scores_gemma":[0.9919865,0.004662997,0.00011325849,0.0006880027,0.0022277134,0.00032151953],"candidate_categories":["metaresearch","metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0012790665,0.00049650954,0.00063854613,0.001154801,0.0007831091,0.0012750103,0.0038579134,0.0005964128,0.000159598],"category_scores_gemma":[0.011769003,0.00045244355,0.0007027183,0.00060598104,0.00031140196,0.002363799,0.00024119725,0.0010549608,0.00014839313],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035114164,0.0005037458,0.0007329546,0.000043802625,0.00044727104,0.000048815644,0.00016261687,0.00064086996,0.00009666994,0.031986203,0.0012771724,0.96370876],"study_design_scores_gemma":[0.004965976,0.0011433945,0.0010021603,0.0004557436,0.00009423805,0.0007083658,0.00009494412,0.0017122832,0.018205376,0.043338608,0.92697287,0.0013060567],"about_ca_topic_score_codex":0.0000011944214,"about_ca_topic_score_gemma":0.000013625372,"teacher_disagreement_score":0.9624027,"about_ca_system_score_codex":0.0007684914,"about_ca_system_score_gemma":0.00067516527,"threshold_uncertainty_score":0.99979275},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035552505,0.00021625527,0.9494971,0.012614726,0.0010269413,0.00031374113,0.000014527266,0.0007283847,0.000035791087],"genre_scores_gemma":[0.85560626,0.00013023287,0.14321634,0.00051691855,0.00034056706,0.00008474228,0.0000014973829,0.000030459907,0.00007298588],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9984787,0.000033168464,0.00038500264,0.0003605521,0.0004354429,0.0003071319],"domain_scores_gemma":[0.9976447,0.00083363766,0.00033780877,0.0006874963,0.00042917213,0.00006713384],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00078137283,0.00021642666,0.00022126856,0.00033795327,0.0006380427,0.0018073166,0.0034944157,0.00022115397,0.0000046315845],"category_scores_gemma":[0.004841917,0.00016255418,0.00013014757,0.000074954376,0.00013824948,0.0018409608,0.00019309757,0.00069554406,0.000007618185],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013301993,0.00014491504,0.0091534,0.000057290166,0.0006908646,0.0004448273,0.0005597511,0.00045862814,0.0032784753,0.23986365,0.0016571896,0.743558],"study_design_scores_gemma":[0.01126038,0.0037860707,0.02176344,0.0040395483,0.00034422567,0.020774174,0.00034468234,0.06864368,0.19266672,0.19891608,0.473104,0.004356969],"about_ca_topic_score_codex":0.000004789696,"about_ca_topic_score_gemma":0.0000039214815,"teacher_disagreement_score":0.82005376,"about_ca_system_score_codex":0.00008971578,"about_ca_system_score_gemma":0.00006747819,"threshold_uncertainty_score":0.9992289},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1348866,0.00013373572,0.8522845,0.011234929,0.00066889665,0.0003612511,0.00006820612,0.000026758578,0.0003351662],"genre_scores_gemma":[0.9905083,0.00002415695,0.009004049,0.00032700857,0.00004731902,0.000060418308,4.1196444e-7,0.000009253887,0.000019039779],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99800235,0.00034746816,0.0005547545,0.00023236386,0.0006723667,0.00019068403],"domain_scores_gemma":[0.9966245,0.001495106,0.00028493136,0.000698623,0.00087798276,0.0000188082],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025064468,0.00014286497,0.00028847155,0.00033471306,0.0002206507,0.00015316416,0.0052277297,0.00013767436,0.000006071707],"category_scores_gemma":[0.0015260704,0.00008425958,0.0002606188,0.00014823292,0.0003684276,0.0005299707,0.000099562894,0.0005452629,7.270716e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010753001,0.00019144015,0.0020425643,0.000008835988,0.00024861947,0.0000132383575,0.0068018227,0.00039582545,0.0006689263,0.9748223,0.00002531522,0.014673588],"study_design_scores_gemma":[0.008152238,0.0010648789,0.026285242,0.0010416574,0.00007483199,0.00041633256,0.016037105,0.005970304,0.006721949,0.93299884,0.0008216711,0.00041498462],"about_ca_topic_score_codex":0.000010730971,"about_ca_topic_score_gemma":0.000015371796,"teacher_disagreement_score":0.85562176,"about_ca_system_score_codex":0.00018624609,"about_ca_system_score_gemma":0.000200357,"threshold_uncertainty_score":0.9714509},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48339877,0.000045145644,0.5152939,0.00027012968,0.00019311,0.000113332244,0.0000067595242,0.000665189,0.000013688547],"genre_scores_gemma":[0.8154672,0.000020953203,0.18432042,0.00015157784,0.000014873396,0.000011130752,0.0000018351494,0.000008557595,0.0000035046755],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99887997,0.000024669256,0.00032867678,0.0002738771,0.00030790397,0.00018490401],"domain_scores_gemma":[0.9987747,0.0005012092,0.000086703854,0.00018100493,0.00041790018,0.000038469992],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036219976,0.00013529176,0.00019973585,0.0009920273,0.00013698587,0.00006986558,0.00082330266,0.00015470001,0.000001952164],"category_scores_gemma":[0.00043704588,0.00012893345,0.0000791834,0.00043560535,0.0000721038,0.00066955003,0.00018063115,0.00028861928,9.666547e-7],"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.00017769878,0.00034334042,0.39057514,0.000055316723,0.00020421397,0.00015991004,0.0012351669,0.007601483,0.0012036558,0.123929776,0.00023009289,0.4742842],"study_design_scores_gemma":[0.0016964156,0.00074553915,0.009124073,0.00032797255,0.000013837129,0.0004183487,0.00002264969,0.013364053,0.0071607754,0.9667837,0.000043233686,0.00029939305],"about_ca_topic_score_codex":0.000016430917,"about_ca_topic_score_gemma":0.000003757841,"teacher_disagreement_score":0.84285396,"about_ca_system_score_codex":0.000054897468,"about_ca_system_score_gemma":0.000044137545,"threshold_uncertainty_score":0.5257754},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4833355,0.000071848954,0.5137637,0.0003187653,0.0016321756,0.0004621677,0.00018068169,0.00022441077,0.000010732693],"genre_scores_gemma":[0.99025464,0.000028607239,0.009155758,0.0000308323,0.000243332,0.00015635014,0.000024966188,0.000026597982,0.00007892192],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99799603,0.000028384491,0.0006289722,0.00040988365,0.0005724065,0.00036429986],"domain_scores_gemma":[0.9979211,0.0004810897,0.00016070544,0.0004416593,0.0009260919,0.00006936409],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036072568,0.0002560829,0.0005016963,0.00042823097,0.0001251865,0.000196264,0.001511565,0.0002806302,0.00000601967],"category_scores_gemma":[0.00014589411,0.00020807609,0.00042086863,0.00029563368,0.000108776774,0.001213002,0.00006979012,0.00033487938,0.000019376195],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0036753446,0.0032002523,0.16305505,0.0011860197,0.00495586,0.00007531829,0.002324743,0.10213818,0.024691217,0.5460977,0.002275772,0.14632457],"study_design_scores_gemma":[0.036602143,0.014319861,0.03866803,0.006791247,0.0005722309,0.001753891,0.0009832479,0.3143353,0.21460144,0.32158563,0.044228856,0.005558134],"about_ca_topic_score_codex":0.000005037407,"about_ca_topic_score_gemma":2.738427e-7,"teacher_disagreement_score":0.50691915,"about_ca_system_score_codex":0.00016036778,"about_ca_system_score_gemma":0.00010707422,"threshold_uncertainty_score":0.84850967},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19234332,0.0000207874,0.8034033,0.0026091526,0.0010064298,0.00024598095,0.00021812394,0.000100078076,0.00005279958],"genre_scores_gemma":[0.720927,0.000009063375,0.27813238,0.00076493336,0.000026693302,0.000034295965,0.0000131257675,0.000012240888,0.00008028061],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9980235,0.000056362533,0.00058814156,0.00028108724,0.000773207,0.00027769702],"domain_scores_gemma":[0.99818224,0.00021762999,0.0001962498,0.00059845875,0.00076503656,0.00004041416],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007710956,0.00016799099,0.00031219522,0.00096510036,0.00011856012,0.00013072006,0.0025566518,0.00013083636,0.00007211571],"category_scores_gemma":[0.0004453962,0.00012201062,0.00046273522,0.0008448083,0.00010317752,0.00068346853,0.00008810057,0.0003908256,0.000008907611],"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.0010692414,0.00038175273,0.01646155,0.00004016934,0.0031567817,0.000015760963,0.00020597906,0.013546182,0.0049060863,0.41611472,0.00062996754,0.5434718],"study_design_scores_gemma":[0.011610111,0.0038801746,0.048856024,0.0005461706,0.0011545749,0.00031790478,0.0001260539,0.1267395,0.64012647,0.027075391,0.13819286,0.0013747412],"about_ca_topic_score_codex":0.000001896304,"about_ca_topic_score_gemma":0.000003653614,"teacher_disagreement_score":0.6352204,"about_ca_system_score_codex":0.00019455038,"about_ca_system_score_gemma":0.00016833753,"threshold_uncertainty_score":0.49754488},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04705151,0.000019406605,0.948691,0.0029477833,0.00043795674,0.00039152926,0.00022085557,0.0002315878,0.00000837539],"genre_scores_gemma":[0.33459488,0.000009755969,0.664122,0.0010794753,0.00007297528,0.00008382089,0.000014381091,0.000016033313,0.000006715864],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985801,0.000030872892,0.00038765467,0.0004030642,0.00034479026,0.00025354614],"domain_scores_gemma":[0.9990935,0.00012142021,0.00006478828,0.00020697697,0.00036181213,0.00015154755],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003124771,0.0001707643,0.00019702983,0.00020562152,0.00014506414,0.00018072804,0.0011976049,0.00018959935,0.0000066055927],"category_scores_gemma":[0.0005981322,0.00015612681,0.00008859325,0.000108818276,0.00008399936,0.00051571016,0.000048834452,0.0003078207,0.000005069575],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00047491497,0.00022467536,0.00015565123,0.00002690631,0.00010341784,0.000022345097,0.0005406434,0.006799439,0.0014291719,0.74284333,0.00017596927,0.24720353],"study_design_scores_gemma":[0.0018017024,0.0011600248,0.00030648467,0.000034087283,0.000020092528,0.00015579938,0.000029663943,0.9580754,0.008026085,0.027762236,0.0023820451,0.00024635007],"about_ca_topic_score_codex":1.4119438e-7,"about_ca_topic_score_gemma":1.7397801e-7,"teacher_disagreement_score":0.951276,"about_ca_system_score_codex":0.00006694831,"about_ca_system_score_gemma":0.00008120617,"threshold_uncertainty_score":0.63666666},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029327711,0.00049354817,0.94002974,0.016564839,0.012958457,0.00017604353,0.000028152184,0.00037648526,0.000045005512],"genre_scores_gemma":[0.24351054,0.0026597993,0.7483277,0.0031567293,0.00084564084,0.00018518201,0.000030180034,0.00006243876,0.0012218342],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99813265,0.00005637128,0.00045028544,0.00042901761,0.0005636364,0.0003680177],"domain_scores_gemma":[0.99823,0.00024107385,0.000085026906,0.00045929736,0.00088815694,0.00009645228],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00035793512,0.00021101945,0.00022913024,0.0004709654,0.00018708645,0.001100219,0.0017693393,0.0002926584,0.000068691006],"category_scores_gemma":[0.0006478836,0.00020177558,0.00020282256,0.00043785453,0.000084826264,0.0021953885,0.00009936932,0.0005716575,0.000033402015],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000108520755,0.0002884485,0.0002635565,0.000017799945,0.00029381525,0.00026073863,0.00040908717,0.0006429662,0.0031213216,0.34148744,0.001425052,0.65168124],"study_design_scores_gemma":[0.0037149747,0.00087872334,0.0005867899,0.0008808156,0.00005226684,0.002511211,0.00047988718,0.006154024,0.4653594,0.21142063,0.3070013,0.0009600061],"about_ca_topic_score_codex":0.0000010667176,"about_ca_topic_score_gemma":0.0000025375373,"teacher_disagreement_score":0.65072125,"about_ca_system_score_codex":0.0002436492,"about_ca_system_score_gemma":0.00016834501,"threshold_uncertainty_score":0.99993676},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0066093924,0.000114114206,0.9744054,0.014522273,0.0030548882,0.00055481517,0.000038148566,0.0005990602,0.00010191625],"genre_scores_gemma":[0.080993645,0.0001892017,0.9166889,0.0010642816,0.00046618446,0.00041876527,0.000019232892,0.000036761237,0.00012302843],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99807435,0.000041482966,0.0005611881,0.00047033015,0.00046763482,0.000384983],"domain_scores_gemma":[0.9978767,0.0004034957,0.0001416274,0.0005370438,0.00094999257,0.00009115763],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005655546,0.00023431332,0.00024080892,0.00065052503,0.00027598135,0.0003905551,0.0024119443,0.00042612944,0.0000315912],"category_scores_gemma":[0.0016563925,0.00021648029,0.0002642422,0.00041945427,0.000057668065,0.0011775708,0.000044537963,0.00052053126,0.00004255216],"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.00021636837,0.00012493311,0.00019547968,0.000006803111,0.00010018201,0.000012975093,0.00010644215,0.000047235164,0.0009040969,0.7022271,0.00047471985,0.29558364],"study_design_scores_gemma":[0.0016698532,0.00081061496,0.00057950226,0.00018283601,0.00003199063,0.00063332374,0.000040404368,0.0026191715,0.050310638,0.40612015,0.5365542,0.0004472996],"about_ca_topic_score_codex":3.6628006e-7,"about_ca_topic_score_gemma":6.698112e-7,"teacher_disagreement_score":0.5360795,"about_ca_system_score_codex":0.00023035768,"about_ca_system_score_gemma":0.00009396612,"threshold_uncertainty_score":0.88278097},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2401267,0.00014384309,0.75613153,0.00012824214,0.0022655178,0.00042266704,0.000116225725,0.0005850988,0.00008017141],"genre_scores_gemma":[0.9577184,0.000032395666,0.041704357,0.000062459796,0.00024067027,0.000078851015,0.000020465728,0.000114954586,0.000027494138],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981001,0.00000983813,0.0006115628,0.0002415388,0.0005158082,0.0005211257],"domain_scores_gemma":[0.99924254,0.00010294825,0.000033742173,0.00029780972,0.00025875468,0.00006422816],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00041938602,0.00032468452,0.0003274096,0.00050453073,0.00010864763,0.00018159261,0.00090594636,0.00019766646,0.00003663292],"category_scores_gemma":[0.00011430865,0.00027424173,0.000229044,0.00017003164,0.000027746977,0.00068140734,0.00004057169,0.0007352989,0.000017383165],"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.00006027477,0.000017693255,0.00010754106,0.00005287371,0.00043143542,0.000011632421,0.00007697109,0.979688,0.001478346,0.0022564537,0.00003181318,0.015786966],"study_design_scores_gemma":[0.0016249464,0.000113273025,0.000049215098,0.0001877134,0.00004103111,0.00067373406,0.000068359725,0.9823931,0.0045747245,0.00032880277,0.009541732,0.00040339088],"about_ca_topic_score_codex":0.0000013971933,"about_ca_topic_score_gemma":2.5781728e-7,"teacher_disagreement_score":0.71759164,"about_ca_system_score_codex":0.00061402866,"about_ca_system_score_gemma":0.00005871387,"threshold_uncertainty_score":0.999971},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.74636346,0.00026647138,0.24917738,0.0008381347,0.0010305408,0.0003225543,0.00014833146,0.00012016369,0.0017329309],"genre_scores_gemma":[0.9841206,0.00015736208,0.013933374,0.0008209231,0.00030964572,0.00008222164,0.000046188405,0.000032802487,0.00049686414],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99915487,0.000016818309,0.00022474167,0.00022726896,0.00016040273,0.00021593091],"domain_scores_gemma":[0.99943054,0.000017609995,0.000038266902,0.00017398717,0.0002797073,0.00005988663],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014902448,0.00014316208,0.00011193086,0.00015935034,0.00008219874,0.00004015797,0.00058657164,0.0002699858,0.00015707692],"category_scores_gemma":[0.00023915221,0.0001276403,0.00015937629,0.000052614272,0.00008687947,0.000013285199,0.000032472846,0.00022854001,0.000033663655],"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.004332761,0.0010369255,0.0099105565,0.00003108297,0.001585749,0.00017392058,0.0004258205,0.00003732711,0.3916268,0.05230147,0.006645894,0.5318917],"study_design_scores_gemma":[0.001231236,0.0011270961,0.00052917143,0.000032931963,0.000017092536,0.0003634031,0.000039801067,0.000002373884,0.7989816,0.006412026,0.19105574,0.00020749845],"about_ca_topic_score_codex":7.093462e-7,"about_ca_topic_score_gemma":0.0000025222948,"teacher_disagreement_score":0.53168416,"about_ca_system_score_codex":0.000021833805,"about_ca_system_score_gemma":0.000056504345,"threshold_uncertainty_score":0.5205021},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06345631,0.00007420087,0.93385017,0.0012433616,0.00091632456,0.0001978419,0.00004522561,0.00020288529,0.000013656285],"genre_scores_gemma":[0.9772342,0.000025963227,0.0224792,0.00008321257,0.000034811204,0.00005958239,0.000046689926,0.000015309139,0.000021060216],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99811083,0.0001305738,0.00063250604,0.00031157854,0.0006085248,0.0002059882],"domain_scores_gemma":[0.9984953,0.0002507551,0.00026894445,0.00031610648,0.00063106243,0.00003785234],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005193643,0.00015153861,0.00036034922,0.0012573404,0.00017099506,0.00004624073,0.0018241637,0.00010132697,0.000043969027],"category_scores_gemma":[0.00020666544,0.00012789867,0.00031724875,0.0012821978,0.000084555664,0.00047307645,0.00014828696,0.0006540117,2.9875406e-7],"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.00021078464,0.00015559027,0.0013073928,0.0000037197003,0.0007426318,0.000009265685,0.00014242544,0.8112248,0.00022349165,0.010991765,0.000018887902,0.17496923],"study_design_scores_gemma":[0.0007209505,0.0003899998,0.0006859642,0.000016293257,0.00015492685,0.000037146037,0.000025262727,0.99446565,0.0004875317,0.002392022,0.00048596924,0.00013829985],"about_ca_topic_score_codex":0.0000075497674,"about_ca_topic_score_gemma":0.0000033609233,"teacher_disagreement_score":0.9137779,"about_ca_system_score_codex":0.00015407955,"about_ca_system_score_gemma":0.000059989557,"threshold_uncertainty_score":0.52155566},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013215548,0.000029478935,0.9763648,0.005900223,0.0020766498,0.0003825159,0.00006493453,0.0019601954,0.0000056700696],"genre_scores_gemma":[0.15595622,0.0001507013,0.8400378,0.0006912324,0.0010031032,0.00097290287,0.00006961043,0.00011176694,0.0010066447],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9983061,0.000015009125,0.0003153371,0.00036600535,0.000528066,0.00046948795],"domain_scores_gemma":[0.9976487,0.0012525668,0.000033871936,0.0002127136,0.0007686962,0.00008341605],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005165638,0.00017289519,0.00017874353,0.0013147986,0.00019563266,0.00033917598,0.0016592182,0.00023144524,0.000014299974],"category_scores_gemma":[0.0017861774,0.00016617078,0.00020669757,0.0007915409,0.00004829924,0.0005824727,0.00006307434,0.00044893823,0.00007543546],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006227844,0.00007643763,0.0009450865,0.000011616292,0.00022419737,0.000037217807,0.000060652837,0.00091236446,0.0007996034,0.024618274,0.0037203024,0.96853197],"study_design_scores_gemma":[0.009598255,0.0039654113,0.006640418,0.00034410355,0.000054925324,0.0021006158,0.00007546663,0.11591651,0.09190303,0.20566702,0.56220853,0.0015257354],"about_ca_topic_score_codex":8.868844e-7,"about_ca_topic_score_gemma":0.0000011436039,"teacher_disagreement_score":0.9670062,"about_ca_system_score_codex":0.0002094118,"about_ca_system_score_gemma":0.00011716152,"threshold_uncertainty_score":0.67762476},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0038502843,0.000025450961,0.9786312,0.0016622947,0.012639159,0.0003443155,0.000046679394,0.0026718872,0.00012874439],"genre_scores_gemma":[0.06917712,0.0003105047,0.9210983,0.00072954426,0.0021693434,0.0010408591,0.00033935724,0.00035638278,0.004778587],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987655,0.000019513102,0.0003917988,0.00021771809,0.00027512325,0.00033029754],"domain_scores_gemma":[0.99875003,0.00039986774,0.000034234792,0.00010590383,0.0006494821,0.000060458693],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046549737,0.0001853609,0.00019389167,0.0009418895,0.00017693825,0.00025940564,0.000398507,0.000324095,0.00005744217],"category_scores_gemma":[0.00073095807,0.00019262564,0.00018606524,0.0006297617,0.000038987528,0.00051426294,0.000011600148,0.00044439625,0.000029751987],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007884433,0.000041876145,0.000516703,0.000014209316,0.00033945148,0.0000068649497,0.000054648048,0.11200387,0.0003866616,0.0013938982,0.051908754,0.8332542],"study_design_scores_gemma":[0.0041590417,0.0006564609,0.0006428054,0.0001536313,0.00008922833,0.00069642195,0.00015227203,0.5588568,0.012635496,0.01835965,0.40286162,0.0007365625],"about_ca_topic_score_codex":5.2566827e-7,"about_ca_topic_score_gemma":0.0000021432431,"teacher_disagreement_score":0.8325177,"about_ca_system_score_codex":0.00023641356,"about_ca_system_score_gemma":0.00004165622,"threshold_uncertainty_score":0.7855046},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.063795336,0.00009600109,0.93255115,0.0007670447,0.00156262,0.00026616285,0.00011211154,0.00080343575,0.00004613292],"genre_scores_gemma":[0.60804904,0.000010319869,0.39167845,0.00007471516,0.00008259871,0.000057053076,0.000005175406,0.000019998042,0.000022652262],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981723,0.00008367987,0.0005649193,0.00043645734,0.0004993697,0.00024328846],"domain_scores_gemma":[0.99850136,0.000105886706,0.00008724433,0.0004186916,0.00079639966,0.000090413],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066214753,0.00020310914,0.00024633287,0.0008036205,0.00010080337,0.00030549528,0.0020344744,0.00025818558,0.000006965113],"category_scores_gemma":[0.00013743767,0.00017706437,0.00018201856,0.00033381704,0.000088538436,0.0023887241,0.00004174025,0.00044642942,0.000012138619],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016439152,0.0001857688,0.000008346087,0.000031732252,0.00017907444,0.00005985647,0.00059963565,0.008296204,0.011814267,0.6839969,0.000025122617,0.2946387],"study_design_scores_gemma":[0.00052405533,0.0016353595,0.00006257248,0.0004232049,0.000031559408,0.00053693785,0.00017921226,0.8576805,0.11513704,0.022935225,0.0006045949,0.00024975173],"about_ca_topic_score_codex":9.756025e-7,"about_ca_topic_score_gemma":0.0000011951643,"teacher_disagreement_score":0.8493843,"about_ca_system_score_codex":0.00029123228,"about_ca_system_score_gemma":0.00018768848,"threshold_uncertainty_score":0.72204757},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05673664,0.0002527202,0.93925834,0.0006381521,0.0023860252,0.000221741,0.000041383948,0.00043799318,0.00002701749],"genre_scores_gemma":[0.70065445,0.000011465058,0.29914576,0.00005602146,0.00009891232,0.000010667427,0.0000014513208,0.000014459943,0.0000067828796],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984811,0.000044718,0.00057676114,0.00026631285,0.00042430454,0.0002068068],"domain_scores_gemma":[0.9989984,0.00015316033,0.0000540057,0.00023609109,0.000515888,0.00004244753],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00067102525,0.00014514226,0.00022198811,0.0007528303,0.00007734986,0.0002396582,0.0012292425,0.00018440382,0.000005103269],"category_scores_gemma":[0.00025183457,0.00012811078,0.00021697233,0.00030259142,0.000051776697,0.0008326285,0.000030375762,0.00036148494,0.0000081565295],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013925855,0.000068410285,0.00006318835,0.0000848621,0.0003776311,0.00007565081,0.00013637905,0.09482665,0.0076205926,0.7853711,0.000014883426,0.111221366],"study_design_scores_gemma":[0.0006541005,0.00016102663,0.000007404958,0.0004969245,0.00003082937,0.00072222797,0.00004328264,0.98076195,0.009312202,0.0071580634,0.00052328303,0.00012871854],"about_ca_topic_score_codex":0.0000020125544,"about_ca_topic_score_gemma":3.1347992e-7,"teacher_disagreement_score":0.8859353,"about_ca_system_score_codex":0.00026219361,"about_ca_system_score_gemma":0.00013217409,"threshold_uncertainty_score":0.5224206},"labels":[],"label_agreement":null}]}