{"meta":{"query_hash":"bdbfbbd1aee6","filters":{"venue":"Software Practice and Experience"},"cohort_total":140,"direct_labels_cover":0,"predictions_cover":140,"exported":140,"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/bdbfbbd1aee6","api":"https://metacan.xera.ac/api/v1/cohort?venue=Software+Practice+and+Experience"},"results":[{"id":"W1481266406","doi":"10.1002/spe.2327","title":"Stringlish: improved English string searching in binary files","year":2015,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":1,"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 Calgary","funders":"","keywords":"String (physics); Binary number; Computer science; False positive paradox; Theoretical computer science; Mathematics; Artificial intelligence; Physics; Arithmetic; Theoretical physics","score_opus":0.02811363975311193,"score_gpt":0.2985223667986366,"score_spread":0.27040872704552465,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1481266406","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07468742,0.0017466948,0.7691192,0.0012637145,0.0007371596,0.00032824714,0.005895691,0.1326106,0.013611259],"genre_scores_gemma":[0.27286747,0.00065316993,0.6752903,0.0011792111,0.00045322374,0.00031867527,0.013352912,0.01184509,0.024040002],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9978404,0.00031463947,0.00029321498,0.0004073992,0.0009696737,0.00017462808],"domain_scores_gemma":[0.994785,0.0018673798,0.0004013405,0.0014120033,0.0012896869,0.00024469756],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015532544,0.0008734551,0.0009401754,0.0028367185,0.0008203681,0.001584725,0.0015973145,0.00083389593,0.023105372],"category_scores_gemma":[0.009509587,0.00037104447,0.0006229013,0.0033825517,0.00071904424,0.0033294032,0.0022211126,0.00091641763,0.010455565],"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.001064314,0.00018239845,0.0043418854,0.0006655796,0.00008664674,0.0006753311,0.00046408898,0.003928918,0.055806827,0.01223436,0.09554522,0.82500434],"study_design_scores_gemma":[0.000440189,0.0009940666,0.010600905,0.0003798519,0.00020048216,0.00406007,0.00066485966,0.2904367,0.35064209,0.048109937,0.29308683,0.0003839386],"about_ca_topic_score_codex":0.0016273151,"about_ca_topic_score_gemma":0.0021850243,"teacher_disagreement_score":0.023105372,"about_ca_system_score_codex":0.0004457556,"about_ca_system_score_gemma":0.0010786133,"threshold_uncertainty_score":0.077295184},"labels":[],"label_agreement":null},{"id":"W1481457981","doi":"10.1002/spe.2147","title":"Methods for selecting and improving software clustering algorithms","year":2012,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Software Engineering Research","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Cluster analysis; Computer science; Software; Data mining; Algorithm; Strengths and weaknesses; Process (computing); Machine learning; Programming language","score_opus":0.03515311790681467,"score_gpt":0.3848034187302256,"score_spread":0.3496503008234109,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1481457981","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009170644,0.00017066758,0.9975216,0.00009036778,0.000021101734,0.00014193438,0.000020687985,0.0004548875,0.00066175294],"genre_scores_gemma":[0.010134661,0.00018654193,0.98860466,0.000038117698,0.00002372723,0.000276452,0.000087093074,0.00014246076,0.0005063146],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9700382,0.011009334,0.0033584,0.004021549,0.010712932,0.0008596409],"domain_scores_gemma":[0.95659107,0.021275003,0.0042477907,0.0054460694,0.0119809015,0.0004591588],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.022306519,0.0025136769,0.0018286747,0.008544557,0.0017204719,0.004795381,0.005069713,0.0026870384,0.0037705759],"category_scores_gemma":[0.061016586,0.0016197214,0.0027384835,0.00614393,0.0021414428,0.0053837835,0.0038847625,0.0029482953,0.0020932925],"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.00014193798,0.00018210831,0.003091728,0.001725686,0.00019465301,0.00021848016,0.0015690066,0.039072096,0.012520395,0.10875422,0.00633127,0.82619846],"study_design_scores_gemma":[0.000300747,0.0004081168,0.002685449,0.0011699117,0.00046299814,0.0016455587,0.0013588534,0.6210263,0.06079876,0.1736883,0.13609639,0.00035862954],"about_ca_topic_score_codex":0.0018172467,"about_ca_topic_score_gemma":0.0028926532,"teacher_disagreement_score":0.022306519,"about_ca_system_score_codex":0.0025674247,"about_ca_system_score_gemma":0.0037893527,"threshold_uncertainty_score":0.11796957},"labels":[],"label_agreement":null},{"id":"W1503262082","doi":"10.1002/spe.2116","title":"Playing MUSIC — building context‐aware and self‐adaptive mobile applications","year":2012,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Context-Aware Activity Recognition Systems","field":"Computer Science","cited_by":53,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Adaptation (eye); Computer science; Context (archaeology); Context awareness; Joint (building); Human–computer interaction; Mobile device; Mobile computing; Ubiquitous computing; Multimedia; World Wide Web; Telecommunications; Engineering; Architectural engineering; Psychology","score_opus":0.02921781814748071,"score_gpt":0.29604554579925413,"score_spread":0.2668277276517734,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1503262082","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18369915,0.0008658922,0.7882052,0.00068627374,0.0001139061,0.00037832724,0.000056758254,0.0075501385,0.018444393],"genre_scores_gemma":[0.6205476,0.00059705705,0.37171537,0.00019912854,0.000046960402,0.00016807996,0.00013339962,0.00029951707,0.006293001],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999382,0.00021514838,0.00004638285,0.00010666525,0.0002034759,0.000046346417],"domain_scores_gemma":[0.9992879,0.00026646708,0.000053354026,0.00015376668,0.00014867903,0.00008991312],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009611382,0.0003974652,0.00025420947,0.00041335236,0.00037799374,0.0011799892,0.00091080077,0.0007194143,0.0018456499],"category_scores_gemma":[0.0023109007,0.00026812343,0.00032906985,0.00022286958,0.00053648854,0.0016916639,0.0019119096,0.0006385971,0.0007966973],"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.00021735551,0.0004794271,0.0058060526,0.0006520752,0.00010333275,0.001357335,0.0056686546,0.02731472,0.25797406,0.029136693,0.005930846,0.6653595],"study_design_scores_gemma":[0.00016686892,0.0009790264,0.014096011,0.00038140255,0.00021826457,0.002930806,0.0025675835,0.45412078,0.21799137,0.03674798,0.2695474,0.0002525501],"about_ca_topic_score_codex":0.0008845693,"about_ca_topic_score_gemma":0.00075629266,"teacher_disagreement_score":0.0018456499,"about_ca_system_score_codex":0.00027520146,"about_ca_system_score_gemma":0.000346283,"threshold_uncertainty_score":0.006174326},"labels":[],"label_agreement":null},{"id":"W1532805649","doi":"10.1002/spe.2134","title":"Validating pragmatic reuse tasks by leveraging existing test suites","year":2012,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Software Engineering Research","field":"Computer Science","cited_by":14,"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 Calgary","funders":"","keywords":"Reuse; Computer science; Correctness; Software engineering; Test suite; Test (biology); Code (set theory); Task (project management); Code reuse; Software; Test case; Programming language; Systems engineering; Machine learning; Engineering","score_opus":0.033974894645382156,"score_gpt":0.32588452441226484,"score_spread":0.2919096297668827,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1532805649","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44090408,0.00030417222,0.54289013,0.00041206018,0.000089094385,0.0007962607,0.00028644426,0.010973012,0.0033447412],"genre_scores_gemma":[0.60440737,0.00016379243,0.39226037,0.00016924675,0.000028427534,0.00037157646,0.0010733121,0.0008518458,0.0006740442],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9540493,0.022030756,0.0047900053,0.0041883206,0.013460236,0.0014814304],"domain_scores_gemma":[0.7427518,0.16218735,0.017517183,0.05497807,0.020833945,0.0017316809],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.023574343,0.0018297745,0.0011056109,0.003319969,0.00067248906,0.0025719407,0.0035378272,0.00188561,0.0016683524],"category_scores_gemma":[0.14559034,0.000914175,0.0014995108,0.0011567192,0.002087854,0.002769984,0.002876586,0.0019224361,0.0009079251],"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.0009007201,0.0035278087,0.059126522,0.0015834367,0.0006798279,0.0022733225,0.003798576,0.13424921,0.17264232,0.0111418255,0.003777787,0.6062986],"study_design_scores_gemma":[0.00059201126,0.002815837,0.024216786,0.0006862694,0.00037274975,0.001900624,0.0009675661,0.7330743,0.20334984,0.017066248,0.014607396,0.0003503213],"about_ca_topic_score_codex":0.0021639832,"about_ca_topic_score_gemma":0.0027679156,"teacher_disagreement_score":0.023574343,"about_ca_system_score_codex":0.0012834668,"about_ca_system_score_gemma":0.0029245259,"threshold_uncertainty_score":0.1246745},"labels":[],"label_agreement":null},{"id":"W1539563854","doi":"10.1002/spe.1093","title":"Web workload generation challenges – an empirical investigation","year":2011,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Software System Performance and Reliability","field":"Computer Science","cited_by":29,"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 Calgary","funders":"","keywords":"Workload; Computer science; Scalability; Generator (circuit theory); Java; Web application; Operating system; Web server; Throughput; The Internet","score_opus":0.10099493882472575,"score_gpt":0.3225370317972244,"score_spread":0.22154209297249866,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1539563854","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.993652,0.00017344294,0.0026642093,0.00053278846,0.000017668146,0.00028144513,0.00038851134,0.0001337625,0.002156161],"genre_scores_gemma":[0.99625,0.000100907615,0.002133935,0.00015095605,0.00001871018,0.00017389226,0.000727771,0.00004311288,0.00040070547],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.98776126,0.005780349,0.0012797379,0.001255446,0.003457092,0.00046611298],"domain_scores_gemma":[0.6886668,0.24971494,0.019169461,0.014393351,0.02456196,0.0034934694],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.014398635,0.00046244022,0.00045406498,0.0015536383,0.0010990619,0.0020232515,0.0017491058,0.0013336766,0.0021398012],"category_scores_gemma":[0.13150431,0.00047749412,0.00034896136,0.0015609026,0.0009881284,0.0031495672,0.001161723,0.002325115,0.0007207961],"study_design_candidate":"observational","study_design_consensus":"observational","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.0015254517,0.010469474,0.7835691,0.0012398547,0.00024319862,0.0018568855,0.015139884,0.025916645,0.007999624,0.0045969863,0.02118284,0.12626],"study_design_scores_gemma":[0.0003981045,0.004877415,0.6184966,0.0007079694,0.00019240301,0.004388282,0.024435418,0.29268757,0.013197174,0.008288562,0.03204227,0.00028829215],"about_ca_topic_score_codex":0.0025506795,"about_ca_topic_score_gemma":0.0023834184,"teacher_disagreement_score":0.014398635,"about_ca_system_score_codex":0.0015067976,"about_ca_system_score_gemma":0.0010520827,"threshold_uncertainty_score":0.07614815},"labels":[],"label_agreement":null},{"id":"W1543881559","doi":"10.1002/spe.2228","title":"A recommendation system for repairing violations detected by static architecture conformance checking","year":2013,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Software Engineering Research","field":"Computer Science","cited_by":37,"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":"","keywords":"Code refactoring; Conformance checking; Computer science; Software engineering; Architecture; Process (computing); Systems architecture; Process management; Engineering; Operations management; Programming language; Work in process; Business process; Software","score_opus":0.013843532244916478,"score_gpt":0.28333398793798403,"score_spread":0.26949045569306757,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1543881559","genre_codex":"software","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022307463,0.00062885694,0.44478548,0.0011756226,0.00037836324,0.0019979542,0.0061059957,0.51508987,0.007530406],"genre_scores_gemma":[0.12028915,0.0009211389,0.8238632,0.0008810328,0.000184388,0.0012953925,0.020385513,0.012377455,0.019802732],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98914206,0.0025578076,0.0024705282,0.0016707911,0.0036813677,0.00047735168],"domain_scores_gemma":[0.9645466,0.011675688,0.003615156,0.008244595,0.010994749,0.0009230818],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.013959465,0.002410466,0.0014826045,0.008945057,0.0013677191,0.003084198,0.004155543,0.0032065515,0.018450111],"category_scores_gemma":[0.0459481,0.0014858149,0.0014184944,0.0027681605,0.0005636522,0.0033619583,0.0019519951,0.0016723895,0.0127261635],"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.0015616842,0.0007119435,0.01564437,0.0012293305,0.00028524682,0.0015455057,0.0012654854,0.012591923,0.01965352,0.0051085516,0.14270467,0.79769766],"study_design_scores_gemma":[0.0012560497,0.0014126496,0.014852307,0.0017647516,0.0006617364,0.0022089628,0.0012360188,0.4213023,0.07795895,0.010594265,0.46564376,0.0011082196],"about_ca_topic_score_codex":0.014240922,"about_ca_topic_score_gemma":0.017754452,"teacher_disagreement_score":0.018450111,"about_ca_system_score_codex":0.001498065,"about_ca_system_score_gemma":0.0028527323,"threshold_uncertainty_score":0.0738256},"labels":[],"label_agreement":null},{"id":"W1553924878","doi":"10.1002/spe.2282","title":"Improving J9 virtual machine with LTTng for efficient and effective tracing","year":2014,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Software System Performance and Reliability","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Atlantic Hydrogen (Canada); University of New Brunswick","funders":"Atlantic Canada Opportunities Agency; University of New Brunswick; International Business Machines Corporation","keywords":"Tracing; Computer science; Throughput; Kernel (algebra); Overhead (engineering); Virtual machine; Component (thermodynamics); Parallel computing; Operating system","score_opus":0.004570723289212413,"score_gpt":0.24223078633625061,"score_spread":0.2376600630470382,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1553924878","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1744796,0.0006635232,0.60145134,0.00042299522,0.0002983296,0.00023523536,0.00048339696,0.21395075,0.008014877],"genre_scores_gemma":[0.7322801,0.00023235106,0.2518821,0.0001910905,0.0000512328,0.00014155208,0.0013968439,0.009767002,0.0040576886],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99704057,0.00063848234,0.00031175808,0.00047073368,0.0011600015,0.00037844],"domain_scores_gemma":[0.9944267,0.001400417,0.00036165342,0.0026229364,0.00093876687,0.00024953336],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018682905,0.0011534656,0.0006433976,0.0010756954,0.0004929909,0.0017640901,0.0033224514,0.00061981624,0.004224888],"category_scores_gemma":[0.008373208,0.00065689126,0.000599497,0.0008325593,0.0007093273,0.002549702,0.0018958623,0.0014963328,0.0015064756],"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.002647822,0.0010112564,0.026109098,0.00089002954,0.00026498974,0.0012465159,0.0016083765,0.08943893,0.2350244,0.016573302,0.047676302,0.577509],"study_design_scores_gemma":[0.00017791777,0.00042294874,0.0064504286,0.00007674848,0.000113980466,0.00044140161,0.00014278122,0.75495595,0.18912469,0.005133388,0.042800773,0.00015897301],"about_ca_topic_score_codex":0.0031229744,"about_ca_topic_score_gemma":0.0015844896,"teacher_disagreement_score":0.004224888,"about_ca_system_score_codex":0.0007066874,"about_ca_system_score_gemma":0.0013483609,"threshold_uncertainty_score":0.014133692},"labels":[],"label_agreement":null},{"id":"W1555588376","doi":"10.1002/spe.2108","title":"Linguistic security testing for text communication protocols","year":2012,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Web Application Security Vulnerabilities","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University; Sheridan College","funders":"","keywords":"Computer science; Syntax; Protocol (science); Programming language; Grammar; Test (biology); Formal grammar; Cryptographic protocol; Communications protocol; Natural language processing; Rule-based machine translation; Computer security; Computer network; Linguistics","score_opus":0.054563875608530175,"score_gpt":0.3688064179561888,"score_spread":0.31424254234765864,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1555588376","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.057521325,0.00017005728,0.928237,0.0010542037,0.00007176936,0.00026396746,0.00012592431,0.004094419,0.008461286],"genre_scores_gemma":[0.65146095,0.0001527055,0.3434695,0.00038864886,0.000059319238,0.00035200614,0.00037352263,0.0006077598,0.0031355135],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.98590094,0.006060364,0.0010242633,0.0009986012,0.0053211963,0.000694634],"domain_scores_gemma":[0.9812051,0.010958113,0.0013500764,0.002576176,0.0035612273,0.00034929547],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0065640784,0.0008384299,0.0006978432,0.0018226156,0.0011546231,0.002609271,0.00220118,0.0015194562,0.0034934499],"category_scores_gemma":[0.018165192,0.00043918932,0.0013594105,0.00069083937,0.0059196744,0.00503206,0.00270261,0.0024959478,0.0006738603],"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.00053327467,0.0005171318,0.003103957,0.0005813371,0.00009149568,0.0015809028,0.0026011814,0.0764092,0.07168814,0.66375947,0.0057605947,0.17337333],"study_design_scores_gemma":[0.00019371453,0.00028932787,0.00092905597,0.00026332942,0.00007789372,0.00080555707,0.0004946669,0.51466155,0.105407365,0.35757932,0.019115476,0.00018268097],"about_ca_topic_score_codex":0.0031963168,"about_ca_topic_score_gemma":0.001333998,"teacher_disagreement_score":0.0065640784,"about_ca_system_score_codex":0.0020275137,"about_ca_system_score_gemma":0.0027649598,"threshold_uncertainty_score":0.03471458},"labels":[],"label_agreement":null},{"id":"W1582789180","doi":"10.1002/spe.1155","title":"Model‐driven rapid prototyping with Umple","year":2011,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Model-Driven Software Engineering Techniques","field":"Computer Science","cited_by":41,"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 Lethbridge; University of Ottawa","funders":"","keywords":"Computer science; Focus (optics); Interface (matter); Rapid prototyping; Process (computing); User interface; Class (philosophy); Point (geometry); Human–computer interaction; Software engineering; Modeling language; Software; Engineering; Programming language; Operating system; Artificial intelligence","score_opus":0.041277872181076855,"score_gpt":0.2631958965107642,"score_spread":0.22191802432968732,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1582789180","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011272049,0.000289058,0.96659297,0.0002654638,0.000110201756,0.00017012608,0.00008486489,0.0064191874,0.014795972],"genre_scores_gemma":[0.24395607,0.0005337432,0.74181795,0.0001814848,0.000039193408,0.00052545423,0.0002758195,0.0010635473,0.011606678],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99624085,0.0016931545,0.00017192558,0.00031369322,0.0013926182,0.00018772269],"domain_scores_gemma":[0.99393153,0.0031709597,0.00025794242,0.0019195499,0.0005336379,0.00018639697],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029431388,0.000928334,0.00072014827,0.00087940006,0.00073942216,0.0027942213,0.0017180542,0.0015947395,0.011009863],"category_scores_gemma":[0.0095535675,0.0008509921,0.001070672,0.00048778762,0.0009840619,0.002899548,0.0030517802,0.0019366643,0.0021868588],"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.0007045988,0.00032724589,0.0011869872,0.0012094873,0.00012659324,0.0015805974,0.0018807902,0.23329678,0.0947163,0.20532985,0.013783599,0.44585717],"study_design_scores_gemma":[0.00014267772,0.00030793005,0.00043295583,0.00028513034,0.000055580196,0.0010231243,0.00016734347,0.6965226,0.11040782,0.04739649,0.14309843,0.00015990305],"about_ca_topic_score_codex":0.00037506619,"about_ca_topic_score_gemma":0.00041487103,"teacher_disagreement_score":0.011009863,"about_ca_system_score_codex":0.0006374685,"about_ca_system_score_gemma":0.00065395486,"threshold_uncertainty_score":0.036831677},"labels":[],"label_agreement":null},{"id":"W1582803778","doi":"10.1002/spe.1157","title":"MpAssign: a framework for solving the many‐core platform mapping problem","year":2011,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; STMicroelectronics (Canada)","funders":"","keywords":"Computer science; Metaheuristic; Sorting; Evolutionary algorithm; Context (archaeology); Pareto principle; Multi-objective optimization; Genetic algorithm; Evolutionary computation; Mathematical optimization; Distributed computing; Theoretical computer science; Artificial intelligence; Algorithm; Machine learning; Mathematics","score_opus":0.08788266090564611,"score_gpt":0.30195133746322184,"score_spread":0.21406867655757572,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1582803778","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0035507085,0.00025225544,0.99133193,0.00018395763,0.000049866972,0.00007974505,0.000070546856,0.0012655099,0.0032154915],"genre_scores_gemma":[0.089935064,0.0003299666,0.90571123,0.00012256093,0.000038943595,0.00036208582,0.00027055325,0.00029324729,0.0029362368],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995291,0.00015424358,0.000025423471,0.0000628787,0.00014644058,0.000081919396],"domain_scores_gemma":[0.9996923,0.00016187747,0.000028368077,0.000029666699,0.00005334458,0.000034367073],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011856073,0.0011271841,0.0007077749,0.0008204859,0.0006169528,0.0011046013,0.0022734986,0.0015874464,0.0045990273],"category_scores_gemma":[0.0017673621,0.00050280115,0.0014457454,0.0006035129,0.0006595851,0.00090405217,0.0018455663,0.0018285974,0.0007647605],"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.000055379416,0.00009213927,0.00034202109,0.0002073185,0.00004883075,0.00014452449,0.00006786982,0.84586287,0.0022071518,0.064503886,0.0054218164,0.08104616],"study_design_scores_gemma":[0.000021627115,0.000017793662,0.000041590745,0.000014750648,0.000006102204,0.00002712286,0.00001371232,0.98228157,0.00042256442,0.011855696,0.0052904165,0.0000070224414],"about_ca_topic_score_codex":0.0058546877,"about_ca_topic_score_gemma":0.007599473,"teacher_disagreement_score":0.0058546877,"about_ca_system_score_codex":0.00079116883,"about_ca_system_score_gemma":0.00218465,"threshold_uncertainty_score":0.01538533},"labels":[],"label_agreement":null},{"id":"W1771373694","doi":"10.1002/spe.390","title":"Schrödinger's token","year":2001,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Software Engineering Research","field":"Computer Science","cited_by":33,"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 Victoria","funders":"","keywords":"Security token; Computer science; Compiler; Programming language; Parsing; Programmer; Grammar; Context (archaeology); Syntax; Simple (philosophy); Natural language processing; Artificial intelligence; Linguistics; Operating system","score_opus":0.021275170917820926,"score_gpt":0.309870892575293,"score_spread":0.28859572165747205,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1771373694","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0453757,0.0007625668,0.6267667,0.004303195,0.0021750994,0.00016439782,0.0006404998,0.0021447693,0.31766713],"genre_scores_gemma":[0.6354004,0.00082371006,0.22049351,0.0014963261,0.00047807148,0.0003215926,0.0004586082,0.001090306,0.1394375],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992766,0.0001804553,0.00006533097,0.00012622499,0.00024970344,0.00010179276],"domain_scores_gemma":[0.9991178,0.00032963319,0.00005180082,0.00029018373,0.00015026392,0.00006029143],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00093904743,0.0003571509,0.00073247193,0.0008205926,0.001184799,0.0020708828,0.0011010057,0.0011409514,0.023604041],"category_scores_gemma":[0.0028707215,0.0003928791,0.0008292324,0.0008699031,0.0024738736,0.003259503,0.0023563055,0.0019905136,0.005189425],"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.00002374298,0.000003967911,0.000049316757,0.000023880322,0.0000037175314,0.000058262995,0.00008344874,0.0009408015,0.0009025043,0.98820484,0.0022830723,0.0074222796],"study_design_scores_gemma":[0.000021756372,0.000018033777,0.00005378503,0.00002233557,0.000008226057,0.00014097505,0.000048225695,0.014289484,0.0038708718,0.95323855,0.028257638,0.000030004961],"about_ca_topic_score_codex":0.001074097,"about_ca_topic_score_gemma":0.0011580592,"teacher_disagreement_score":0.023604041,"about_ca_system_score_codex":0.0011632894,"about_ca_system_score_gemma":0.001307312,"threshold_uncertainty_score":0.07896334},"labels":[],"label_agreement":null},{"id":"W1791987072","doi":"10.1002/spe.2203","title":"Decoding billions of integers per second through vectorization","year":2013,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":227,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université TÉLUQ","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Decoding methods; Vectorization (mathematics); Scheme (mathematics); Encoding (memory); Data compression; Compression (physics)","score_opus":0.015749185143385063,"score_gpt":0.2803758415423402,"score_spread":0.2646266563989551,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1791987072","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04711363,0.001695903,0.9232878,0.00050044147,0.00036267596,0.00023797588,0.00054617255,0.015060417,0.011194994],"genre_scores_gemma":[0.24234438,0.0014741538,0.7368845,0.00030504697,0.00014499358,0.00036295006,0.0024235968,0.0010797484,0.0149806645],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9992919,0.000095358904,0.00008126787,0.000094610405,0.0003772395,0.0000596152],"domain_scores_gemma":[0.9991148,0.00023813495,0.00007586155,0.0002796312,0.0002696565,0.00002194504],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060075906,0.001046308,0.00047065073,0.0013347142,0.00038493334,0.0011296539,0.0009398051,0.00048141126,0.006816084],"category_scores_gemma":[0.002896723,0.00032019475,0.00033062676,0.0019147379,0.0005864769,0.0018705176,0.0013609313,0.0007055185,0.0037153456],"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.00055670127,0.00007000194,0.00071154744,0.000225372,0.000033719974,0.00014376263,0.00027052764,0.012281669,0.067647785,0.02612046,0.012913515,0.87902486],"study_design_scores_gemma":[0.00023911663,0.0006060284,0.0012809266,0.0001703044,0.00006834355,0.0010419338,0.00033869685,0.4025892,0.36989498,0.053014714,0.17062886,0.00012687186],"about_ca_topic_score_codex":0.0014031811,"about_ca_topic_score_gemma":0.0015119826,"teacher_disagreement_score":0.006816084,"about_ca_system_score_codex":0.0004706003,"about_ca_system_score_gemma":0.0008847202,"threshold_uncertainty_score":0.022802114},"labels":[],"label_agreement":null},{"id":"W1794179200","doi":"10.1002/spe.2286","title":"An evaluation framework for cross‐platform mobile application development tools","year":2014,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Mobile and Web Applications","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University; University of Guelph","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Benchmarking; Computer science; Cross-platform; Software engineering; Quality (philosophy); Development (topology); Systems engineering; Data science; Engineering; Operating system","score_opus":0.0360122442682971,"score_gpt":0.3744550579367658,"score_spread":0.33844281366846873,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1794179200","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04663455,0.0017167648,0.92066675,0.0017527046,0.00014231548,0.0042069303,0.0007494009,0.0046151513,0.019515403],"genre_scores_gemma":[0.251881,0.0003928159,0.7423311,0.00013573866,0.0000501951,0.0025818374,0.0010854386,0.00045312027,0.0010886919],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.8720519,0.06421282,0.014083581,0.0047446378,0.041220933,0.0036862383],"domain_scores_gemma":[0.8347657,0.07441534,0.013398137,0.011639726,0.062330455,0.003450658],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.10038268,0.0027803816,0.001669135,0.016700052,0.002408984,0.010288481,0.003896336,0.002072903,0.0025803654],"category_scores_gemma":[0.13792887,0.0010455387,0.0022327758,0.00633812,0.0034364199,0.009223948,0.0072875666,0.002614894,0.00086952694],"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.001015098,0.0020167371,0.031719863,0.0035884043,0.00076807983,0.0005310109,0.005663633,0.06697996,0.012140185,0.24894291,0.013182836,0.6134513],"study_design_scores_gemma":[0.00038859548,0.003038841,0.02349537,0.0056458763,0.0007637241,0.0008200295,0.0056908904,0.7059635,0.022330208,0.15028287,0.08110086,0.0004792984],"about_ca_topic_score_codex":0.00875433,"about_ca_topic_score_gemma":0.005610332,"teacher_disagreement_score":0.10038268,"about_ca_system_score_codex":0.0074911597,"about_ca_system_score_gemma":0.007912953,"threshold_uncertainty_score":0.5308807},"labels":[],"label_agreement":null},{"id":"W1838450684","doi":"10.1002/spe.2396","title":"Cold object identification in the Java virtual machine","year":2016,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick; IBM (Canada)","funders":"Atlantic Canada Opportunities Agency; International Business Machines Corporation","keywords":"Heap (data structure); Computer science; Java; Correctness; Marshalling; Programming language; Operating system; Stack (abstract data type)","score_opus":0.014006271210751988,"score_gpt":0.28875143193738834,"score_spread":0.27474516072663635,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1838450684","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21372448,0.0024387527,0.7581179,0.00034987312,0.00027361914,0.00010565056,0.00015781676,0.018344877,0.0064870487],"genre_scores_gemma":[0.69306487,0.00038048392,0.29824996,0.00027449094,0.0000868552,0.000110330584,0.0003412041,0.0017153117,0.00577652],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9953679,0.0010349767,0.00024568907,0.0008393823,0.0018499382,0.00066209544],"domain_scores_gemma":[0.99478036,0.0013608747,0.00078744977,0.002017914,0.0007117911,0.00034168514],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029178758,0.00086569344,0.0013391892,0.001564195,0.0014559882,0.004224583,0.0033749954,0.0012848385,0.0015885109],"category_scores_gemma":[0.007044574,0.00107611,0.00063767756,0.0014299422,0.0022208993,0.0063723717,0.004359119,0.0017766696,0.00096439733],"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.002886678,0.000506543,0.035163116,0.0007451298,0.00021377867,0.0015793829,0.0029510248,0.07083375,0.13881682,0.21082665,0.016593557,0.51888365],"study_design_scores_gemma":[0.00013847974,0.0007246588,0.010115913,0.00022760751,0.00022081925,0.0015797977,0.00060935214,0.5637439,0.20786113,0.15419888,0.060228333,0.0003512197],"about_ca_topic_score_codex":0.0029713644,"about_ca_topic_score_gemma":0.0026867494,"teacher_disagreement_score":0.004224583,"about_ca_system_score_codex":0.0010848515,"about_ca_system_score_gemma":0.0020096037,"threshold_uncertainty_score":0.0154313445},"labels":[],"label_agreement":null},{"id":"W1880500695","doi":"10.1002/spe.2122","title":"Fast and effective soft links","year":2012,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Software Engineering Research","field":"Computer Science","cited_by":0,"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":"","keywords":"Computer science; Hypertext; Markup language; Source code; Java; Code (set theory); Traceability; Information retrieval; Signature (topology); Programming language; Database; World Wide Web; XML; Software engineering","score_opus":0.012176318863095538,"score_gpt":0.29793788636462176,"score_spread":0.2857615675015262,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1880500695","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021604855,0.00028146736,0.9577361,0.00039284528,0.00012318487,0.00034157757,0.00042902876,0.012541592,0.0065494296],"genre_scores_gemma":[0.22590671,0.0002895645,0.7528395,0.00037688971,0.00017647115,0.00048552227,0.0016754671,0.0031917044,0.015058202],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9900287,0.002714394,0.00081289513,0.0015205503,0.0045000305,0.00042344144],"domain_scores_gemma":[0.96472245,0.016003486,0.0021975287,0.010697063,0.005475499,0.00090405333],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0042836643,0.0012114587,0.0010941724,0.004620007,0.0018006013,0.0054204124,0.003013221,0.0019139899,0.013729931],"category_scores_gemma":[0.038811993,0.0006937886,0.0009807275,0.0032900476,0.0021151104,0.00751621,0.0062857396,0.002385772,0.006406049],"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.00053040107,0.00036635302,0.0028213738,0.0008021154,0.000112120426,0.00073660247,0.001877088,0.018368268,0.026015941,0.05566914,0.019506492,0.8731941],"study_design_scores_gemma":[0.00032300683,0.00068336277,0.0033170567,0.00048279582,0.00021108973,0.0015520677,0.0019028938,0.38337958,0.19572785,0.23827416,0.1737975,0.00034864666],"about_ca_topic_score_codex":0.0013961636,"about_ca_topic_score_gemma":0.0014784188,"teacher_disagreement_score":0.013729931,"about_ca_system_score_codex":0.00081895676,"about_ca_system_score_gemma":0.0015933067,"threshold_uncertainty_score":0.04593122},"labels":[],"label_agreement":null},{"id":"W1907666016","doi":"10.1002/spe.1145","title":"Understanding design patterns — what is the problem?","year":2011,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Advanced Software Engineering Methodologies","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure; Université du Québec à Montréal","funders":"","keywords":"Computer science; Software design pattern; Representation (politics); Eclipse; Relevance (law); Context (archaeology); Object-oriented design; Simple (philosophy); Theoretical computer science; Transformation (genetics); Structural pattern; Design pattern; Key (lock); Specification pattern; Software design; Programming language; Software; Software development","score_opus":0.26059409250666976,"score_gpt":0.33105064535873946,"score_spread":0.0704565528520697,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1907666016","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.065154664,0.00484262,0.7522526,0.14230877,0.00072497356,0.00073743565,0.00054111093,0.0014939831,0.031943895],"genre_scores_gemma":[0.41436234,0.0046831183,0.56586736,0.0049349987,0.00034401377,0.00061257527,0.0009183641,0.00046804774,0.007809236],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9727433,0.014371009,0.0025063602,0.0032770648,0.0059402483,0.0011619832],"domain_scores_gemma":[0.92428815,0.04241757,0.006215993,0.013065328,0.012392,0.001620938],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.022749867,0.0014901068,0.001331339,0.0043631713,0.0027948485,0.014837865,0.004082511,0.0052046455,0.0048942645],"category_scores_gemma":[0.06038147,0.0012712955,0.0015194474,0.0044911914,0.0114097735,0.033279173,0.004963043,0.007549723,0.001229356],"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.000104017636,0.0002885031,0.011432971,0.001538009,0.00014399226,0.00054467726,0.020986272,0.007345784,0.0021672377,0.690963,0.020448051,0.2440375],"study_design_scores_gemma":[0.00003519573,0.000052276904,0.0015658421,0.001204465,0.000037265574,0.000640734,0.016659744,0.016101867,0.0015293556,0.8898898,0.072219074,0.0000643577],"about_ca_topic_score_codex":0.01071343,"about_ca_topic_score_gemma":0.005912333,"teacher_disagreement_score":0.022749867,"about_ca_system_score_codex":0.0060641402,"about_ca_system_score_gemma":0.008312378,"threshold_uncertainty_score":0.12031424},"labels":[],"label_agreement":null},{"id":"W1965370068","doi":"10.1002/spe.621","title":"Making XML document markup international","year":2004,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Mathematics, Computing, and Information Processing","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 Windsor; University of Toronto","funders":"","keywords":"Computer science; SGML; World Wide Web; XML validation; Markup language; Efficient XML Interchange; XML; Document Structure Description; XML Schema Editor; RuleML; XML Schema (W3C); Streaming XML; Document type definition; Information retrieval; Programming language","score_opus":0.02285094262741164,"score_gpt":0.3258010483175628,"score_spread":0.30295010569015113,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1965370068","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015985414,0.0007646828,0.9650563,0.001753934,0.0011398146,0.0002642178,0.00044023723,0.00887593,0.020106303],"genre_scores_gemma":[0.02711261,0.0024257808,0.9404869,0.0011913899,0.00068334775,0.00042371397,0.0031302178,0.003980178,0.020565892],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9896667,0.003663733,0.0019845536,0.0013786749,0.003013831,0.00029248808],"domain_scores_gemma":[0.9817655,0.006271259,0.0010317412,0.00659543,0.0039061555,0.00042988823],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011316021,0.0012747124,0.0008736453,0.0032074966,0.0016017129,0.008064398,0.0026609215,0.0023505231,0.010624411],"category_scores_gemma":[0.026367176,0.0010698411,0.0015182428,0.003899143,0.0030000454,0.012489358,0.004902657,0.005380465,0.010819021],"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.00016875553,0.00010732914,0.00059268065,0.0006054528,0.000069122325,0.0005706335,0.004320518,0.002862617,0.014420007,0.37103704,0.0622558,0.54299],"study_design_scores_gemma":[0.00003380713,0.000047570913,0.00025342026,0.00030979246,0.000051379353,0.00057668803,0.0005439457,0.006658816,0.024543399,0.061365735,0.9055519,0.00006349818],"about_ca_topic_score_codex":0.0010627679,"about_ca_topic_score_gemma":0.0006138155,"teacher_disagreement_score":0.011316021,"about_ca_system_score_codex":0.0010199444,"about_ca_system_score_gemma":0.0022037863,"threshold_uncertainty_score":0.059845507},"labels":[],"label_agreement":null},{"id":"W1968600331","doi":"10.1002/1097-024x(20001110)30:13<1465::aid-spe345>3.0.co;2-d","title":"Improvements to Burrows-Wheeler compression algorithm","year":2000,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":41,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"Silesian University of Technology","keywords":"Lossless compression; Computer science; Compression ratio; Algorithm; Data compression; Compression (physics); Class (philosophy); Data compression ratio; Image compression; Artificial intelligence; Engineering","score_opus":0.01028238630179139,"score_gpt":0.2851556309118273,"score_spread":0.27487324461003587,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1968600331","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009844394,0.0037757328,0.97674745,0.00046996362,0.0005676618,0.00024965938,0.00029866438,0.0038516587,0.004194817],"genre_scores_gemma":[0.030537043,0.002436783,0.95186585,0.00031656315,0.00038084248,0.00021675139,0.0012668482,0.0005365002,0.012442903],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973226,0.00028427385,0.00027594552,0.00043239532,0.001524568,0.00016030532],"domain_scores_gemma":[0.9974764,0.00054531265,0.00013206803,0.00059310836,0.0011860634,0.000066919114],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019467033,0.0013503773,0.0013315051,0.0039094575,0.00086715515,0.0019701472,0.0018877903,0.0015900922,0.00548604],"category_scores_gemma":[0.0068124435,0.0006162152,0.0012258202,0.0044552395,0.00084218034,0.0032721984,0.0014961504,0.0029862926,0.0060444362],"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.00028494734,0.00012739793,0.00055716763,0.00023329852,0.000082901235,0.00022838915,0.00019403406,0.016079694,0.036688026,0.021248031,0.013747474,0.9105286],"study_design_scores_gemma":[0.00025107092,0.0004356728,0.0034046096,0.00020570445,0.0002199759,0.0027531718,0.00020562933,0.47511837,0.21938367,0.027108338,0.27059087,0.0003230145],"about_ca_topic_score_codex":0.0046344646,"about_ca_topic_score_gemma":0.0043693422,"teacher_disagreement_score":0.00548604,"about_ca_system_score_codex":0.00076970324,"about_ca_system_score_gemma":0.0014248067,"threshold_uncertainty_score":0.018352628},"labels":[],"label_agreement":null},{"id":"W1971444540","doi":"10.1002/spe.1070","title":"PPM compression without escapes","year":2011,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Compression (physics); Gas compressor; Data compression; Coding (social sciences); Binary number; Computer science; Compression ratio; Character (mathematics); Arithmetic; Statistics; Algorithm; Mathematics; Engineering; Mechanical engineering; Physics","score_opus":0.03167187098252218,"score_gpt":0.2839718654866127,"score_spread":0.2522999945040905,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1971444540","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28218752,0.0046502342,0.6540101,0.0028425446,0.0013099,0.000366113,0.005381351,0.017377522,0.031874772],"genre_scores_gemma":[0.70997936,0.0013616146,0.26167035,0.0005882032,0.0003761199,0.0001994706,0.0067692054,0.0012985822,0.017756999],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99913245,0.00010593919,0.00008750463,0.00014160799,0.00045179925,0.000080748934],"domain_scores_gemma":[0.9970228,0.0008154249,0.00015134197,0.0009450596,0.0009983646,0.000066984954],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061904604,0.0006471771,0.00067461666,0.0014131435,0.00057447836,0.000965922,0.00074453856,0.0005471569,0.007408472],"category_scores_gemma":[0.0052825063,0.000248762,0.0002780172,0.0017109694,0.0008719267,0.0013897325,0.0015127186,0.0012434734,0.0024579475],"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.0007182097,0.00003494111,0.0018158145,0.00050700764,0.000043572876,0.0007613394,0.00031577275,0.009546763,0.1432313,0.012321801,0.016375117,0.81432825],"study_design_scores_gemma":[0.00015798434,0.00067308854,0.011971117,0.00041970957,0.00014697168,0.0033565224,0.00054891314,0.16004926,0.63341004,0.030300627,0.15880628,0.00015957946],"about_ca_topic_score_codex":0.0025374843,"about_ca_topic_score_gemma":0.0033248053,"teacher_disagreement_score":0.007408472,"about_ca_system_score_codex":0.00042628465,"about_ca_system_score_gemma":0.00076167524,"threshold_uncertainty_score":0.02478379},"labels":[],"label_agreement":null},{"id":"W1978380500","doi":"10.1002/spe.575","title":"Understanding Web server configuration issues","year":2004,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":14,"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 Calgary","funders":"","keywords":"Bottleneck; Web server; Computer science; Visualization; Application server; Operating system; Web API; Web application; Set (abstract data type); Database; World Wide Web; Distributed computing; Data mining; The Internet; Embedded system","score_opus":0.04786340885300471,"score_gpt":0.2900633936392327,"score_spread":0.242199984786228,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1978380500","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3496812,0.0021244057,0.6115043,0.006399806,0.00016486022,0.00038794565,0.00020312876,0.0010782194,0.02845609],"genre_scores_gemma":[0.94454753,0.0006921754,0.052911744,0.00024359627,0.00009080713,0.00016590481,0.00011098094,0.00012581606,0.0011115555],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99114776,0.0047603315,0.00048195964,0.00079607643,0.0023451445,0.00046868934],"domain_scores_gemma":[0.9701241,0.01849064,0.0032892174,0.0030075116,0.0045637097,0.0005247917],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011375407,0.0006637464,0.0006562212,0.0027011954,0.0014000982,0.007438438,0.0030252018,0.0020986511,0.0021251068],"category_scores_gemma":[0.048324775,0.0007706066,0.00032261948,0.0022814178,0.0038267025,0.010221522,0.0021720177,0.002287578,0.00039236835],"study_design_candidate":"observational","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.00022105583,0.0005046794,0.042584796,0.0011468375,0.00011580569,0.0020215516,0.014928258,0.14612438,0.020010559,0.57413286,0.0065538357,0.19165544],"study_design_scores_gemma":[0.00005245322,0.0002686377,0.011592569,0.0005311798,0.0000610797,0.0010529031,0.009508121,0.6066586,0.014715356,0.32725433,0.028206794,0.0000979204],"about_ca_topic_score_codex":0.0024565393,"about_ca_topic_score_gemma":0.0016880198,"teacher_disagreement_score":0.011375407,"about_ca_system_score_codex":0.002911763,"about_ca_system_score_gemma":0.0019410446,"threshold_uncertainty_score":0.060159624},"labels":[],"label_agreement":null},{"id":"W1986995668","doi":"10.1002/spe.1068","title":"A business process‐driven approach for generating software modules","year":2011,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Advanced Software Engineering Methodologies","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Business requirements; Computer science; Business process modeling; Business software; Modular design; Artifact-centric business process model; Software engineering; Business rule; Business domain; Business process; Modularity (biology); Software development; Business Process Model and Notation; Software; Process management; Programming language; Engineering; Operations management; Work in process","score_opus":0.07290072065577854,"score_gpt":0.31942029421027757,"score_spread":0.24651957355449902,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1986995668","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0064391717,0.000025419577,0.99046373,0.00007551408,0.000012745408,0.00037319754,0.00011474905,0.00097104086,0.001524359],"genre_scores_gemma":[0.051444355,0.000047260757,0.94580376,0.00003582908,0.0000049124556,0.0004113568,0.0006954456,0.00021025275,0.0013467916],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981823,0.00047513295,0.00010401489,0.0002969873,0.00086268183,0.0000789633],"domain_scores_gemma":[0.9973761,0.0011538536,0.00017165074,0.00053204206,0.0006875189,0.00007884905],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017629226,0.000761435,0.00035051175,0.0017061074,0.0008289768,0.0010988311,0.0016229029,0.0008506877,0.003466705],"category_scores_gemma":[0.0060393927,0.00065872003,0.0014637343,0.0012911784,0.0007591173,0.00094409403,0.0012514294,0.0011776143,0.0012501874],"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.00016627765,0.0004858842,0.0028940225,0.0006661196,0.00012368472,0.00091020187,0.0014870452,0.19420196,0.062925436,0.09625588,0.007673734,0.63220984],"study_design_scores_gemma":[0.0001026618,0.00018525108,0.0011239041,0.00008679837,0.00007836024,0.0005882326,0.00018671186,0.83444774,0.060333956,0.05249614,0.05031033,0.00006006536],"about_ca_topic_score_codex":0.001772044,"about_ca_topic_score_gemma":0.0028922958,"teacher_disagreement_score":0.003466705,"about_ca_system_score_codex":0.0008237796,"about_ca_system_score_gemma":0.0018154372,"threshold_uncertainty_score":0.011597276},"labels":[],"label_agreement":null},{"id":"W1996010464","doi":"10.1002/spe.440","title":"Taming access control security: extending capabilities using the views relationship","year":2002,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Security and Verification in Computing","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Pontifícia Universidade Católica do Rio de Janeiro; University of Waterloo","keywords":"Abstraction; Computer science; Access control; Object (grammar); Domain (mathematical analysis); Computer security model; Control (management); Role-based access control; Security policy; Order (exchange); Computer security; Interface (matter); Distributed computing; Operating system; Artificial intelligence; Business","score_opus":0.1084530335172283,"score_gpt":0.3575995005652543,"score_spread":0.249146467048026,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1996010464","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07187255,0.0007546735,0.9081844,0.00154733,0.000098190074,0.00006486379,0.000025158013,0.0011163962,0.01633644],"genre_scores_gemma":[0.8643766,0.00083032344,0.13203764,0.00037658398,0.000101514655,0.000094400515,0.00003598257,0.00023556274,0.0019114566],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99245,0.0042057005,0.0004274427,0.00049444166,0.0018823001,0.0005400814],"domain_scores_gemma":[0.98029274,0.010493526,0.00147636,0.0060227616,0.0011210212,0.00059358345],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0065557254,0.00057131756,0.0004406449,0.0009826532,0.00087733613,0.0042147213,0.0013207803,0.0013362571,0.0016582885],"category_scores_gemma":[0.012024751,0.0006807743,0.0011383806,0.00060930697,0.0057194307,0.01301124,0.0057912427,0.0034648883,0.00031809567],"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.00008792725,0.000070315706,0.0018673888,0.00009719896,0.000052129955,0.00064521225,0.0023795152,0.0098126745,0.009320077,0.9289007,0.0009780793,0.045788713],"study_design_scores_gemma":[0.00010485774,0.00038917232,0.00087037426,0.00036913357,0.00022431219,0.001755614,0.0013129925,0.13525239,0.044154078,0.736433,0.07899561,0.00013844259],"about_ca_topic_score_codex":0.0014824958,"about_ca_topic_score_gemma":0.0008672407,"teacher_disagreement_score":0.0065557254,"about_ca_system_score_codex":0.00090051227,"about_ca_system_score_gemma":0.0013855961,"threshold_uncertainty_score":0.034670353},"labels":[],"label_agreement":null},{"id":"W2008830761","doi":"10.1002/spe.774","title":"<i>Ablego</i>: a function outlining and partial inlining framework","year":2006,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":18,"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; IBM (Canada)","funders":"","keywords":"Computer science; Compiler; Partial evaluation; Host (biology); Programming language; Function (biology); Code (set theory); Optimizing compiler; Program transformation; Heuristics; Transformation (genetics); Set (abstract data type); Syntax; Operating system; Artificial intelligence","score_opus":0.013066999549225349,"score_gpt":0.28133394778908777,"score_spread":0.2682669482398624,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2008830761","genre_codex":"methods","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0060456647,0.00040867084,0.9680351,0.0002717615,0.00003973838,0.000059109636,0.00016843426,0.020997275,0.0039741453],"genre_scores_gemma":[0.11832496,0.0007161434,0.85888755,0.00039379604,0.00006325059,0.00015406824,0.00076736143,0.009196349,0.011496417],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99931383,0.00016588057,0.000030003692,0.00012739055,0.00024585682,0.00011701413],"domain_scores_gemma":[0.99888617,0.00047329892,0.000108670494,0.0003343688,0.00013747145,0.000060036327],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012385366,0.0012801187,0.00079522014,0.0011973287,0.0006545768,0.002209895,0.0023121785,0.0013172369,0.007404598],"category_scores_gemma":[0.0029608717,0.00096915115,0.0015367672,0.00071590586,0.0023616091,0.0028451653,0.002359992,0.0021516748,0.0023014892],"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.0008419713,0.00014555051,0.0037060964,0.0011642508,0.00013327741,0.00077530387,0.0017283027,0.12793016,0.06582896,0.34631702,0.036353443,0.41507563],"study_design_scores_gemma":[0.00013009222,0.00032906848,0.0017827215,0.00037516988,0.00012744442,0.0010465966,0.00023327395,0.46100923,0.07009001,0.13171355,0.33294785,0.00021497768],"about_ca_topic_score_codex":0.0036290283,"about_ca_topic_score_gemma":0.0048683947,"teacher_disagreement_score":0.007404598,"about_ca_system_score_codex":0.0011250441,"about_ca_system_score_gemma":0.0014353038,"threshold_uncertainty_score":0.024770856},"labels":[],"label_agreement":null},{"id":"W2014113335","doi":"10.1002/spe.582","title":"GLU<sup>♮</sup> embedded in C++: a marriage between multidimensional and object‐oriented programming","year":2004,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Logic, programming, and type systems","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 Toronto","funders":"","keywords":"Programming language; Computer science; First-generation programming language; Embedding; Programming domain; Syntax; Semantics (computer science); Programming paradigm; Object-oriented programming; Functional logic programming; Programming language specification; Functional programming; Very high-level programming language; Theoretical computer science; Inductive programming; Artificial intelligence","score_opus":0.017772649189498273,"score_gpt":0.28368663290685936,"score_spread":0.2659139837173611,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2014113335","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014260185,0.00028693664,0.9746975,0.0009480398,0.00008766224,0.000037924987,0.00003744378,0.002572521,0.0070718606],"genre_scores_gemma":[0.28666425,0.00047320547,0.706226,0.0007134043,0.000084372994,0.000100915786,0.000082806044,0.00082476175,0.0048302896],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99800974,0.000696506,0.00021981467,0.00027090524,0.0006168871,0.00018616719],"domain_scores_gemma":[0.99792165,0.0007676944,0.00030198108,0.0005502997,0.00027074112,0.00018768145],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038448058,0.00054822,0.00050707464,0.0007100154,0.0007751066,0.0049846508,0.0014553762,0.0008134193,0.0020711392],"category_scores_gemma":[0.0036190846,0.0006417478,0.00072964205,0.0007896801,0.0057105892,0.0056574885,0.004190746,0.0020183146,0.00067471375],"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.000072954565,0.000014739047,0.000435068,0.00007938258,0.000010820505,0.00015279521,0.00090577867,0.004034579,0.0035186359,0.9584067,0.001940801,0.030427763],"study_design_scores_gemma":[0.00006309789,0.000124953,0.0006064602,0.00021261325,0.000056556964,0.00081690133,0.0005421811,0.09197331,0.014391327,0.7585495,0.13254878,0.00011424048],"about_ca_topic_score_codex":0.0016790321,"about_ca_topic_score_gemma":0.0011338827,"teacher_disagreement_score":0.0049846508,"about_ca_system_score_codex":0.0015646912,"about_ca_system_score_gemma":0.0013448116,"threshold_uncertainty_score":0.020333529},"labels":[],"label_agreement":null},{"id":"W2018646099","doi":"10.1002/spe.396","title":"Object‐oriented design of the subsumption architecture","year":2001,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Modular Robots and Swarm Intelligence","field":"Engineering","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":"Concordia University","funders":"","keywords":"Computer science; Architecture; Layer (electronics); Object (grammar); Set (abstract data type); Object-oriented programming; Robot; Software architecture; Software engineering; Computer architecture; Artificial intelligence; Software; Programming language","score_opus":0.01759626783191229,"score_gpt":0.25259390703948503,"score_spread":0.23499763920757274,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2018646099","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021617977,0.00017017887,0.9680176,0.0002313702,0.000029163555,0.000091372174,0.000020583919,0.0010073005,0.008814501],"genre_scores_gemma":[0.29420745,0.0003214325,0.69500524,0.00021775186,0.000027852653,0.00022283112,0.00014752177,0.00027166144,0.009578302],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990074,0.00036632974,0.000072759976,0.00012253477,0.0003359488,0.00009502296],"domain_scores_gemma":[0.99914956,0.00022220009,0.000078603385,0.00022480947,0.00025379195,0.000070963295],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020334995,0.0003566546,0.00021991835,0.00058770145,0.0006750453,0.001964035,0.0010839842,0.0006393962,0.0023671528],"category_scores_gemma":[0.0020723497,0.00043246636,0.00043452735,0.000442354,0.0013834764,0.0021025364,0.0013707106,0.00077874615,0.00047654018],"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.0000810273,0.000085616826,0.0013878937,0.00013646645,0.000058545844,0.00038890395,0.0014586229,0.04232308,0.017095406,0.81531465,0.0026151794,0.119054645],"study_design_scores_gemma":[0.0000757299,0.00013220054,0.0009328801,0.000116782685,0.00015379411,0.0004367291,0.00039588046,0.39871454,0.027460933,0.41675118,0.15478097,0.00004835545],"about_ca_topic_score_codex":0.0028586807,"about_ca_topic_score_gemma":0.0032864003,"teacher_disagreement_score":0.0028586807,"about_ca_system_score_codex":0.000920115,"about_ca_system_score_gemma":0.0010859314,"threshold_uncertainty_score":0.010754287},"labels":[],"label_agreement":null},{"id":"W2051221173","doi":"10.1002/(sici)1097-024x(200006)30:7<825::aid-spe322>3.0.co;2-1","title":"Software product lines: a case study","year":2000,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Advanced Software Engineering Methodologies","field":"Computer Science","cited_by":60,"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 Victoria","funders":"","keywords":"Computer science; Software product line; Software engineering; Exploit; Time to market; Abstraction; Product (mathematics); Domain (mathematical analysis); Java; Documentation; Domain analysis; Domain engineering; Software; New product development; Process (computing); Software development; Programming language; Software construction; Computer security","score_opus":0.03995879755292413,"score_gpt":0.3447755813809009,"score_spread":0.3048167838279768,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2051221173","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9739865,0.0006755172,0.008982513,0.0011231579,0.000024817766,0.0002742965,0.00024216996,0.00014101314,0.014550021],"genre_scores_gemma":[0.9761688,0.0010360699,0.014876549,0.00029231247,0.000019806816,0.00021273225,0.00040302283,0.00007152708,0.0069193197],"study_design_codex":"case_report","study_design_gemma":"qualitative","domain_scores_codex":[0.99732757,0.0014461894,0.0001389488,0.00019294462,0.00066378916,0.00023059285],"domain_scores_gemma":[0.99074227,0.006295234,0.0008028138,0.0005453758,0.00084880844,0.00076555257],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020536233,0.00072782114,0.00031989088,0.0017583048,0.0030538233,0.0017469167,0.0015586695,0.0036339832,0.0028018167],"category_scores_gemma":[0.0067195003,0.00038134333,0.0005573008,0.0027186354,0.0017731232,0.0016924081,0.0014363404,0.001484803,0.0007554495],"study_design_candidate":"qualitative","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.0017406414,0.014547716,0.12902145,0.0021905373,0.0002071726,0.34158298,0.08843916,0.043366518,0.019094424,0.03941218,0.028219724,0.29217756],"study_design_scores_gemma":[0.0014291983,0.009114838,0.11802914,0.0016476546,0.00035017484,0.14349957,0.16493025,0.094831295,0.039980266,0.018773222,0.40702063,0.00039385597],"about_ca_topic_score_codex":0.008085321,"about_ca_topic_score_gemma":0.013692794,"teacher_disagreement_score":0.008085321,"about_ca_system_score_codex":0.0018790424,"about_ca_system_score_gemma":0.0009871809,"threshold_uncertainty_score":0.016076505},"labels":[],"label_agreement":null},{"id":"W2051230890","doi":"10.1002/spe.398","title":"G<scp>EN</scp>E<scp>X</scp>: a tool for testing in ILP","year":2001,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":1,"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 Ottawa","funders":"","keywords":"Inductive logic programming; Programming language; Variety (cybernetics); Logic program; Computer science; Generator (circuit theory); Field (mathematics); Logic programming; Software engineering; Artificial intelligence; Mathematics","score_opus":0.027810246710578333,"score_gpt":0.29305896350348737,"score_spread":0.265248716792909,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2051230890","genre_codex":"methods","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011842961,0.00007607248,0.8729793,0.00043651872,0.00007582404,0.00021133057,0.0012288346,0.10322324,0.009925967],"genre_scores_gemma":[0.17862587,0.00015311761,0.7899957,0.0005208608,0.000057717654,0.0006788928,0.004405546,0.015631236,0.009930991],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9984273,0.0007137625,0.00015763166,0.00023746917,0.00039112035,0.00007284738],"domain_scores_gemma":[0.98606306,0.01104504,0.00043404233,0.0013662217,0.00081407855,0.00027758288],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003423519,0.0011958714,0.00058555644,0.0017246619,0.00060753804,0.0020233027,0.0021831838,0.0016527646,0.03327161],"category_scores_gemma":[0.015925705,0.0006817573,0.0008056632,0.0008733248,0.0018767911,0.0035377734,0.002121707,0.0016504759,0.0074045495],"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.0014843774,0.0007026161,0.00613695,0.0011201239,0.00015093865,0.0021472613,0.0010901474,0.06831513,0.01830357,0.13949724,0.20778005,0.55327165],"study_design_scores_gemma":[0.0005403147,0.00040803655,0.0016872964,0.00035316055,0.000047301815,0.0016525724,0.00019277075,0.68412465,0.05909492,0.14335497,0.10842682,0.00011725435],"about_ca_topic_score_codex":0.0014375212,"about_ca_topic_score_gemma":0.0010501246,"teacher_disagreement_score":0.03327161,"about_ca_system_score_codex":0.0003977248,"about_ca_system_score_gemma":0.0006821306,"threshold_uncertainty_score":0.11130464},"labels":[],"label_agreement":null},{"id":"W2054300598","doi":"10.1002/spe.982","title":"Post BWT stages of the Burrows–Wheeler compression algorithm","year":2010,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Lossless compression; Algorithm; Computer science; Data compression; Entropy encoding; Context (archaeology); Compression (physics); Permutation (music); Entropy (arrow of time); Image compression; Speech recognition; Artificial intelligence; Image (mathematics); History; Image processing","score_opus":0.008361186106803337,"score_gpt":0.2719656815834479,"score_spread":0.26360449547664455,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2054300598","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14700805,0.0015190915,0.8329725,0.0005965053,0.00046819609,0.00058522285,0.00064376474,0.0070956503,0.009111069],"genre_scores_gemma":[0.24169478,0.0005767254,0.7400907,0.00022097467,0.0001931324,0.00027768646,0.0020835237,0.00079899107,0.0140635045],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991198,0.00010544376,0.00009038818,0.00013701664,0.0004484953,0.000098833116],"domain_scores_gemma":[0.998206,0.00058446,0.00015326966,0.0004624319,0.000541692,0.000052191004],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008554787,0.0010167578,0.0006195194,0.001499902,0.0005653441,0.0014159591,0.0010579862,0.00078941975,0.009927828],"category_scores_gemma":[0.0043175304,0.00034573654,0.0005057985,0.0014093322,0.00069180917,0.0016212534,0.0011685704,0.001271703,0.004215594],"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.00086717977,0.0001357385,0.0011756083,0.00023499252,0.00004418007,0.00023904735,0.00023592912,0.013069123,0.12345698,0.008608414,0.0061161174,0.84581673],"study_design_scores_gemma":[0.0001845113,0.0006504997,0.0071456716,0.00008779725,0.00012318561,0.0011114728,0.00024023672,0.31332168,0.6325947,0.007937992,0.036498155,0.00010401819],"about_ca_topic_score_codex":0.0036700042,"about_ca_topic_score_gemma":0.0052001146,"teacher_disagreement_score":0.009927828,"about_ca_system_score_codex":0.0004439276,"about_ca_system_score_gemma":0.0010752518,"threshold_uncertainty_score":0.033211946},"labels":[],"label_agreement":null},{"id":"W2063760213","doi":"10.1002/spe.578","title":"Agents in object‐oriented software engineering","year":2004,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Service-Oriented Architecture and Web Services","field":"Computer Science","cited_by":51,"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":"","keywords":"Computer science; Software engineering; Software development; Object-oriented programming; Component-based software engineering; Adaptation (eye); Reuse; Separation of concerns; Software system; Social software engineering; Agent-oriented software engineering; Aspect-oriented programming; Software design pattern; Software; Software construction; Programming language; Engineering","score_opus":0.011011028446275288,"score_gpt":0.2641600578188855,"score_spread":0.25314902937261025,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2063760213","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011810357,0.028810453,0.89705354,0.008042953,0.0010074374,0.00021703776,0.000040737235,0.0010371073,0.051980354],"genre_scores_gemma":[0.23896186,0.028718416,0.6947494,0.0015752217,0.0014359404,0.0005300843,0.00024630883,0.00038868884,0.03339405],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9960931,0.0020091247,0.00037127556,0.00030220233,0.0010929913,0.00013125587],"domain_scores_gemma":[0.993835,0.0038258529,0.0006027255,0.0006778127,0.0007381029,0.00032057372],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0065389643,0.0008418498,0.00079059415,0.0024502934,0.0014538815,0.005918951,0.0012712665,0.0028655354,0.002509134],"category_scores_gemma":[0.00830507,0.0008611604,0.0006506928,0.002557419,0.0056097256,0.006016169,0.0031134114,0.002968147,0.0012886991],"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.000013084572,0.000036684378,0.00045320054,0.00024760602,0.000025251957,0.00022085756,0.0012672489,0.0069462727,0.00051629497,0.9370394,0.0034407587,0.049793325],"study_design_scores_gemma":[0.000028033814,0.000033725155,0.00016385174,0.000246554,0.000022864673,0.00022729153,0.00024485373,0.020782856,0.0005680801,0.8381302,0.13952866,0.00002291569],"about_ca_topic_score_codex":0.0022506842,"about_ca_topic_score_gemma":0.0014810798,"teacher_disagreement_score":0.0065389643,"about_ca_system_score_codex":0.0016389567,"about_ca_system_score_gemma":0.0019421874,"threshold_uncertainty_score":0.03458172},"labels":[],"label_agreement":null},{"id":"W2080670657","doi":"10.1002/spe.686","title":"Fast dynamic casting","year":2005,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Software Testing and Debugging Techniques","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lockheed Martin (Canada)","funders":"","keywords":"Pointer (user interface); C dynamic memory allocation; Computer science; Modulo; Integer (computer science); Class (philosophy); Arithmetic; Predictability; Base (topology); Theoretical computer science; Algorithm; Programming language; Discrete mathematics; Mathematics; Artificial intelligence; Memory management","score_opus":0.014209689347191417,"score_gpt":0.3035970456289335,"score_spread":0.2893873562817421,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2080670657","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015695177,0.00025050473,0.9438696,0.0002453662,0.00029671847,0.00034628567,0.00030565914,0.019345097,0.019645475],"genre_scores_gemma":[0.33125502,0.0004971081,0.62006134,0.00042138153,0.0001515357,0.0006241308,0.0011029036,0.0072826776,0.038603812],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963744,0.00054797553,0.0002781023,0.00042036222,0.0018146319,0.00056445587],"domain_scores_gemma":[0.99245983,0.0015126392,0.0003344224,0.00454462,0.0009272898,0.00022107767],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002489152,0.001086455,0.0013778107,0.0014714047,0.001669324,0.003308318,0.0027562827,0.0015629526,0.021205643],"category_scores_gemma":[0.0081204055,0.0011484327,0.0010529311,0.0010774406,0.0021508632,0.0039353645,0.0076898276,0.0030822868,0.0054733977],"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.001138235,0.00028916865,0.0024152643,0.0004366612,0.00009396531,0.0007350207,0.001363035,0.023650248,0.062364694,0.3893758,0.03066379,0.48747408],"study_design_scores_gemma":[0.00028819797,0.00029977623,0.0009837297,0.0002672247,0.00011996225,0.0011473271,0.00023988273,0.20399165,0.18875995,0.20122871,0.40241423,0.00025930535],"about_ca_topic_score_codex":0.0014123282,"about_ca_topic_score_gemma":0.0015636137,"teacher_disagreement_score":0.021205643,"about_ca_system_score_codex":0.0011508579,"about_ca_system_score_gemma":0.0016698971,"threshold_uncertainty_score":0.0709399},"labels":[],"label_agreement":null},{"id":"W2087413773","doi":"10.1002/spe.724","title":"Declarative generation of synthetic XML data","year":2006,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Advanced Database Systems and Queries","field":"Computer Science","cited_by":8,"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 Toronto; University of Calgary","funders":"","keywords":"Computer science; XML; Benchmarking; XML Schema (W3C); Programming language; Schema (genetic algorithms); Synthetic data; Generator (circuit theory); Software engineering; XML validation; Information retrieval; Artificial intelligence; World Wide Web; Document type definition","score_opus":0.05494910959855257,"score_gpt":0.31884425796099464,"score_spread":0.26389514836244204,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2087413773","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06975999,0.000072485826,0.9070699,0.00041268877,0.00011429142,0.00064061047,0.0047410466,0.011978324,0.0052107116],"genre_scores_gemma":[0.36403987,0.00016222261,0.60951954,0.00029458487,0.00003243001,0.0012354876,0.019368608,0.002141758,0.0032055676],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99695253,0.0011887032,0.00031304525,0.00032088635,0.0011062089,0.000118575874],"domain_scores_gemma":[0.9845674,0.009473197,0.00067439384,0.0029408091,0.00209332,0.00025093323],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005199251,0.0004927017,0.0003774639,0.00079952495,0.00041900313,0.0018435812,0.0019217164,0.00096470705,0.0028794473],"category_scores_gemma":[0.018570714,0.00047695462,0.0005718387,0.0009604544,0.00095720316,0.0013001665,0.0014731459,0.0009778161,0.0007478401],"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.00079202,0.000695057,0.012469981,0.0010454959,0.00015361105,0.0024830478,0.0023558466,0.5390909,0.03880213,0.18155588,0.04096158,0.1795944],"study_design_scores_gemma":[0.000121593,0.00017061445,0.00076230883,0.000072636,0.00002272188,0.00045051047,0.0002967685,0.8721011,0.050308403,0.031319402,0.044321954,0.000051999796],"about_ca_topic_score_codex":0.0014685113,"about_ca_topic_score_gemma":0.0011530004,"teacher_disagreement_score":0.005199251,"about_ca_system_score_codex":0.00067097176,"about_ca_system_score_gemma":0.0011648546,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W2093127601","doi":"10.1002/spe.1013","title":"Spotting the difference","year":2010,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Software Engineering Research","field":"Computer Science","cited_by":8,"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 Ottawa","funders":"","keywords":"Computer science; Readability; Usability; Interface (matter); Space (punctuation); Human–computer interaction; Software; User interface; Granularity; World Wide Web; Multimedia; Information retrieval; Programming language; Operating system","score_opus":0.014185157614998764,"score_gpt":0.2935626608430459,"score_spread":0.2793775032280471,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2093127601","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5864549,0.0023401328,0.3236363,0.007930331,0.004077278,0.0006901518,0.0011786756,0.019035108,0.05465706],"genre_scores_gemma":[0.7964247,0.00039183896,0.1858863,0.0016694149,0.00037344813,0.00022946509,0.00058704364,0.0014105416,0.013027368],"study_design_codex":"design_other","study_design_gemma":"design_other","domain_scores_codex":[0.9966742,0.0013847593,0.00025585882,0.0005203052,0.0010102042,0.000154827],"domain_scores_gemma":[0.97919047,0.013180901,0.0014738642,0.0027938264,0.0026662832,0.0006947457],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028165916,0.0008867342,0.0005832198,0.0014148585,0.00068984024,0.0021266635,0.0012189698,0.0016492617,0.02200908],"category_scores_gemma":[0.03293397,0.00024193533,0.0003336539,0.00074707833,0.0009369204,0.0044393674,0.0030793124,0.0012046592,0.004271393],"study_design_candidate":"design_other","study_design_consensus":"design_other","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.0026872011,0.00030999834,0.010110662,0.0012698531,0.000072658884,0.0019160901,0.015562015,0.00072661275,0.091151655,0.022510031,0.06699837,0.7866849],"study_design_scores_gemma":[0.00061746006,0.0038206093,0.05002577,0.0015381931,0.00038533573,0.013528293,0.021905314,0.052376177,0.19587804,0.07507806,0.5842727,0.0005740735],"about_ca_topic_score_codex":0.00020228619,"about_ca_topic_score_gemma":0.00021039402,"teacher_disagreement_score":0.02200908,"about_ca_system_score_codex":0.0003785484,"about_ca_system_score_gemma":0.00031952662,"threshold_uncertainty_score":0.07362771},"labels":[],"label_agreement":null},{"id":"W2098046929","doi":"10.1002/spe.1053","title":"Prioritizing the creation of unit tests in legacy software systems","year":2011,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Software Engineering Research","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Blackberry (Canada); Queen's University","funders":"","keywords":"Unit testing; Test-driven development; Computer science; Software engineering; Legacy system; Adaptation (eye); Software development; Development testing; Heuristics; Software; Software development process; Systems engineering; Engineering; Operating system","score_opus":0.045011511546345535,"score_gpt":0.3163417384664236,"score_spread":0.2713302269200781,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2098046929","genre_codex":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8520335,0.0010004711,0.13714598,0.00088666804,0.0000657261,0.00049764354,0.00009836611,0.0035680367,0.004703625],"genre_scores_gemma":[0.78748167,0.00025895934,0.21032223,0.00016068928,0.000030524352,0.00013684305,0.0002754377,0.00033130948,0.0010023789],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99255425,0.004291069,0.0006072571,0.0006283553,0.0015801234,0.00033906958],"domain_scores_gemma":[0.9260782,0.052133963,0.007034401,0.005183284,0.007465438,0.0021047387],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008150267,0.0006879695,0.0005132334,0.0025981637,0.0006389734,0.0020441583,0.0017128697,0.00062884245,0.0014493695],"category_scores_gemma":[0.0499706,0.0006889839,0.0004082618,0.0010660365,0.00048010473,0.0014471186,0.0012833611,0.00091080734,0.00049583503],"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.00073826505,0.0007812963,0.06846925,0.00058979087,0.000074936805,0.0007935425,0.0017070005,0.036252405,0.03279301,0.0025676435,0.0033889888,0.85184395],"study_design_scores_gemma":[0.00057572144,0.0038381226,0.109691866,0.0005839913,0.00038117042,0.0033551862,0.0027408462,0.6874912,0.14561006,0.01867835,0.026771715,0.00028176862],"about_ca_topic_score_codex":0.0026120935,"about_ca_topic_score_gemma":0.0046614376,"teacher_disagreement_score":0.008150267,"about_ca_system_score_codex":0.0012896426,"about_ca_system_score_gemma":0.0024630385,"threshold_uncertainty_score":0.043103218},"labels":[],"label_agreement":null},{"id":"W2098214931","doi":"10.1002/spe.565","title":"The design and implementation of a modular and extensible Java Virtual Machine","year":2004,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Operating system; Java; Modular design; Scalability; Virtual machine; Real time Java","score_opus":0.013676508410170783,"score_gpt":0.30438655216779303,"score_spread":0.29071004375762227,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2098214931","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17659515,0.00038330464,0.79146105,0.0002751367,0.0002089336,0.001154567,0.00022043179,0.02299033,0.0067110513],"genre_scores_gemma":[0.45054346,0.00020349491,0.542387,0.00019752185,0.000044082917,0.00061729876,0.0009660566,0.0013295737,0.0037114955],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9980844,0.00038853282,0.00017843889,0.00040124543,0.00067632756,0.00027110358],"domain_scores_gemma":[0.99743843,0.00045248665,0.0003085142,0.0009009557,0.00059820904,0.00030135398],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028935694,0.0005327163,0.0004307605,0.00046444585,0.00033569176,0.0015320326,0.004015317,0.00075762573,0.0018520508],"category_scores_gemma":[0.0053253383,0.00071090815,0.00051089085,0.00031392995,0.0007504852,0.0017683947,0.0014155013,0.0012764522,0.0007663198],"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.0017599491,0.0013767679,0.011916703,0.0008376856,0.00027468093,0.0010575665,0.0010448083,0.0875147,0.42132595,0.039728034,0.0111287385,0.42203435],"study_design_scores_gemma":[0.0010804733,0.0039535305,0.009701677,0.00017116712,0.00038650862,0.00083889585,0.00020060956,0.57204545,0.29494828,0.008939881,0.10751894,0.00021457358],"about_ca_topic_score_codex":0.0012375354,"about_ca_topic_score_gemma":0.0005535244,"teacher_disagreement_score":0.004015317,"about_ca_system_score_codex":0.00059266534,"about_ca_system_score_gemma":0.0011762595,"threshold_uncertainty_score":0.015302837},"labels":[],"label_agreement":null},{"id":"W2100568614","doi":"10.1002/spe.1001","title":"The use of search‐based optimization techniques to schedule and staff software projects: an approach and an empirical study","year":2011,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Software Engineering Research","field":"Computer Science","cited_by":69,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Staffing; Computer science; Schedule; Software project management; Software; Queueing theory; Task (project management); Scheduling (production processes); Fragmentation (computing); Operations research; Project management; Project planning; Operations management; Software development; Systems engineering; Software construction; Engineering","score_opus":0.12405668412549276,"score_gpt":0.3731303624344601,"score_spread":0.24907367830896737,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2100568614","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.89625317,0.00059046625,0.09851631,0.00024844284,0.000010767941,0.0002848449,0.00009297275,0.00018173883,0.0038212093],"genre_scores_gemma":[0.940183,0.0002395304,0.058673177,0.000018389013,0.0000051489105,0.00023552352,0.00010950104,0.000024049277,0.0005116306],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.9965938,0.0026340915,0.00013942191,0.00013659883,0.00042278165,0.0000732262],"domain_scores_gemma":[0.9549844,0.041761257,0.0011563374,0.000827001,0.0010809967,0.00019000426],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005622545,0.00053032703,0.0004666467,0.0015028829,0.00039946224,0.0006856593,0.00080076244,0.0006847519,0.0016230257],"category_scores_gemma":[0.029028542,0.00036264208,0.00039027596,0.00205936,0.00083394407,0.0013262989,0.00050227134,0.00066663494,0.0002140022],"study_design_candidate":"observational","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.0012516316,0.0042098234,0.04240977,0.00088905025,0.00022237895,0.00020595013,0.002654239,0.638743,0.0040191263,0.012944435,0.0020906725,0.2903599],"study_design_scores_gemma":[0.00017921087,0.0012930486,0.013754257,0.00005112524,0.000056526995,0.00013672003,0.0007474102,0.97844625,0.0018537282,0.002298921,0.0011494424,0.00003336197],"about_ca_topic_score_codex":0.005895086,"about_ca_topic_score_gemma":0.00409968,"teacher_disagreement_score":0.005895086,"about_ca_system_score_codex":0.0009450494,"about_ca_system_score_gemma":0.0012428404,"threshold_uncertainty_score":0.029735267},"labels":[],"label_agreement":null},{"id":"W2104541214","doi":"10.1002/spe.500","title":"DrawCAD: using deductive object‐relational databases in CAD","year":2003,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Advanced Database Systems and Queries","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Relational database; Database; Reuse; Database design; Object (grammar); CAD; Data model (GIS); View; Relational database management system; Object-relational mapping; Database model; Engineering drawing; Artificial intelligence; Engineering","score_opus":0.04430888468270976,"score_gpt":0.33100777486243793,"score_spread":0.28669889017972816,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2104541214","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006980439,0.001920412,0.93984646,0.0008227011,0.00018575888,0.00034604056,0.001281663,0.03774299,0.0108735785],"genre_scores_gemma":[0.08977704,0.0026428024,0.89430624,0.00050783873,0.00015489949,0.0003157999,0.0055913194,0.0014581614,0.005245835],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99543566,0.0012831652,0.0005937719,0.00053298566,0.0020245227,0.00012987718],"domain_scores_gemma":[0.9945298,0.0025051746,0.00037916415,0.0016161485,0.00077153806,0.0001981825],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004781526,0.0007553765,0.0008055519,0.0027128172,0.00071773253,0.007728887,0.0032238201,0.0013960646,0.007577019],"category_scores_gemma":[0.014386812,0.0009944257,0.0009918464,0.0036747712,0.001104838,0.0065466044,0.0029736324,0.0013862592,0.0036692112],"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.0006025888,0.00028266414,0.003361942,0.0012351379,0.000240555,0.0022394913,0.0018107636,0.027671367,0.011522694,0.19475359,0.06930397,0.68697524],"study_design_scores_gemma":[0.0005413956,0.00018469892,0.0015388862,0.0004844267,0.0003080922,0.0024106298,0.0005972569,0.32407105,0.034497634,0.15173756,0.4833919,0.00023650988],"about_ca_topic_score_codex":0.0038027235,"about_ca_topic_score_gemma":0.0029606167,"teacher_disagreement_score":0.007728887,"about_ca_system_score_codex":0.0008393744,"about_ca_system_score_gemma":0.0012613353,"threshold_uncertainty_score":0.02534771},"labels":[],"label_agreement":null},{"id":"W2104838677","doi":"10.1002/spe.1017","title":"Grammar‐based test generation with YouGen","year":2010,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Software Testing and Debugging Techniques","field":"Computer Science","cited_by":23,"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 Victoria","funders":"","keywords":"Computer science; Parsing; Grammar; Natural language processing; Compiler; Rule-based machine translation; Programming language; Artificial intelligence; Generator (circuit theory); Context (archaeology); Linguistics; Power (physics)","score_opus":0.01713707136432013,"score_gpt":0.2785418352168769,"score_spread":0.2614047638525568,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2104838677","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019812109,0.0002365904,0.8868251,0.0003430107,0.00012887926,0.0003167787,0.00060233165,0.08440581,0.0073293275],"genre_scores_gemma":[0.28606814,0.00026188986,0.6842024,0.0005747865,0.000055428576,0.00064948463,0.004531194,0.015517992,0.008138744],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99607253,0.0016057957,0.00031772247,0.0005254254,0.0011951752,0.0002833322],"domain_scores_gemma":[0.9897114,0.006586017,0.0004634949,0.0019921998,0.0010689696,0.00017803677],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038172945,0.001073451,0.00062333245,0.001677669,0.00032516077,0.0016645645,0.0018742194,0.0012928803,0.012419],"category_scores_gemma":[0.014654715,0.0008426496,0.0012579586,0.00078971434,0.0015309637,0.002557138,0.0031391212,0.0014989411,0.0037372625],"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.00089829403,0.0005167669,0.009568476,0.0012888056,0.00027071033,0.0026925162,0.001588453,0.14177714,0.024153072,0.12758212,0.06982379,0.61983985],"study_design_scores_gemma":[0.0004317187,0.00038524586,0.0015941423,0.0003337938,0.00011980978,0.0018856077,0.00030227797,0.67609185,0.080462575,0.118291,0.11992852,0.00017345505],"about_ca_topic_score_codex":0.0008262607,"about_ca_topic_score_gemma":0.000977336,"teacher_disagreement_score":0.012419,"about_ca_system_score_codex":0.0005846895,"about_ca_system_score_gemma":0.0009894656,"threshold_uncertainty_score":0.04154575},"labels":[],"label_agreement":null},{"id":"W2108165346","doi":"10.1002/spe.432","title":"A taxonomy and survey of grid resource management systems for distributed computing","year":2001,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Distributed and Parallel Computing Systems","field":"Computer Science","cited_by":851,"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 Manitoba","funders":"","keywords":"Computer science; Taxonomy (biology); Grid computing; Grid; Resource management (computing); Variety (cybernetics); Resource (disambiguation); Component (thermodynamics); Data science; Distributed computing; Knowledge management; Artificial intelligence; Computer network; Ecology","score_opus":0.042601096864532416,"score_gpt":0.28793733573637653,"score_spread":0.2453362388718441,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2108165346","genre_codex":"methods","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035305154,0.28430787,0.54628927,0.015688762,0.0014409076,0.0011943761,0.0012570122,0.002162416,0.11235415],"genre_scores_gemma":[0.11664072,0.23405248,0.62506527,0.0029354973,0.0007941633,0.0013866903,0.0040378687,0.0004255801,0.0146617135],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9933676,0.0017851095,0.0013678577,0.0005984214,0.0024309228,0.0004501466],"domain_scores_gemma":[0.9944002,0.0022331418,0.000539652,0.0005514448,0.0019045925,0.00037105306],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005053967,0.0010068379,0.0014396639,0.012101593,0.0025787104,0.007472011,0.002766722,0.0029796842,0.0022986631],"category_scores_gemma":[0.008278129,0.0010640281,0.0010589961,0.025220891,0.0034431529,0.013216055,0.0024552366,0.002545088,0.0012218137],"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.000050323488,0.00012633284,0.0034905798,0.0030372643,0.000045142686,0.00039696725,0.0042863614,0.006517752,0.0019119467,0.6665267,0.025837393,0.28777334],"study_design_scores_gemma":[0.000019156014,0.00012063052,0.0027148896,0.0026868146,0.000028118018,0.0014347126,0.00242697,0.014590609,0.00070755766,0.18996696,0.7852155,0.00008805609],"about_ca_topic_score_codex":0.0069707534,"about_ca_topic_score_gemma":0.0037801208,"teacher_disagreement_score":0.012101593,"about_ca_system_score_codex":0.004428603,"about_ca_system_score_gemma":0.0053557465,"threshold_uncertainty_score":0.03213197},"labels":[],"label_agreement":null},{"id":"W2113595474","doi":"10.1002/spe.460","title":"Enterprise frameworks: issues and research directions","year":2002,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Service-Oriented Architecture and Web Services","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Computer science; Enterprise architecture; Domain (mathematical analysis); Function (biology); Focus (optics); Enterprise architecture framework; Software engineering; Knowledge management; Architecture; Process management; Software architecture; Engineering; Software","score_opus":0.02715606036322757,"score_gpt":0.34181649077641374,"score_spread":0.31466043041318614,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2113595474","genre_codex":"review","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008880992,0.66166586,0.055156462,0.20658353,0.0031909766,0.000100766585,0.00011365094,0.00052880734,0.06377889],"genre_scores_gemma":[0.22558145,0.6576406,0.076240465,0.017001225,0.0069687064,0.00035188656,0.0003700034,0.00031300512,0.015532668],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98798996,0.006515797,0.0005655567,0.0013655555,0.0022220688,0.0013409924],"domain_scores_gemma":[0.9392475,0.043472223,0.0016248584,0.0035031599,0.008797492,0.0033547594],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.036969014,0.0013522364,0.0016408314,0.0048722606,0.0035014001,0.017068366,0.0053476267,0.012900487,0.009488482],"category_scores_gemma":[0.024168309,0.0012202907,0.0015073925,0.011584797,0.016736712,0.045118794,0.0055506616,0.008846937,0.0021540823],"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.000052496256,0.00019101585,0.0006904153,0.00084156566,0.000025380446,0.00012768245,0.0013346538,0.0017110396,0.00014344063,0.853071,0.020856444,0.12095481],"study_design_scores_gemma":[0.000034516277,0.00009850473,0.00059047685,0.0025204276,0.000018227174,0.00039422416,0.0057618716,0.006431671,0.00026278174,0.689142,0.29467994,0.000065300796],"about_ca_topic_score_codex":0.010642229,"about_ca_topic_score_gemma":0.005809859,"teacher_disagreement_score":0.036969014,"about_ca_system_score_codex":0.0076038507,"about_ca_system_score_gemma":0.010167571,"threshold_uncertainty_score":0.19551319},"labels":[],"label_agreement":null},{"id":"W2114732850","doi":"10.1002/spe.1091","title":"Autonomous role discovery for collaborating agents","year":2011,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Multi-Agent Systems and Negotiation","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Nipissing University","funders":"","keywords":"Dynamism; Computer science; Java; Class (philosophy); Multi-agent system; Object (grammar); Distributed computing; Knowledge management; Artificial intelligence; Programming language","score_opus":0.04114290412059249,"score_gpt":0.2971613008906793,"score_spread":0.25601839677008686,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2114732850","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031005422,0.00066874776,0.936354,0.0016685427,0.00032471167,0.0002574827,0.000115621384,0.0020077333,0.027597688],"genre_scores_gemma":[0.43524036,0.0004308793,0.54169333,0.00029625426,0.00009635283,0.00022861469,0.0003805228,0.00022580424,0.021407897],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959637,0.0013630185,0.000394943,0.000733121,0.0011488483,0.0003964005],"domain_scores_gemma":[0.9934285,0.0026414075,0.00041566472,0.0018592573,0.0009804684,0.00067468075],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039218194,0.0004612801,0.0007933495,0.001021184,0.0020617435,0.003188037,0.0021193125,0.0014957223,0.004793204],"category_scores_gemma":[0.0079897065,0.00059290376,0.0012558617,0.0005586828,0.0016912733,0.005516424,0.0046659377,0.001998983,0.0017435455],"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.00048713342,0.00023925606,0.0047718915,0.00044100912,0.00007336027,0.0013332648,0.0046368768,0.02278856,0.022647206,0.67837924,0.013321798,0.25088036],"study_design_scores_gemma":[0.00016019412,0.00022044052,0.0013516549,0.00018718805,0.00010793868,0.0021679413,0.0023131387,0.37447116,0.031749528,0.31750765,0.26959273,0.00017047844],"about_ca_topic_score_codex":0.0017535791,"about_ca_topic_score_gemma":0.0021133097,"teacher_disagreement_score":0.004793204,"about_ca_system_score_codex":0.0010366322,"about_ca_system_score_gemma":0.0013989254,"threshold_uncertainty_score":0.020740807},"labels":[],"label_agreement":null},{"id":"W2118462286","doi":"10.1002/spe.1066","title":"Towards a goal‐driven approach to action selection in self‐adaptive software","year":2011,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Advanced Software Engineering Methodologies","field":"Computer Science","cited_by":57,"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":"","keywords":"Computer science; Adaptation (eye); Flexibility (engineering); Action (physics); Scalability; Context (archaeology); Action selection; Tracing; Process (computing); Software; Set (abstract data type); Machine learning; Data mining; Software engineering; Industrial engineering; Artificial intelligence; Engineering; Programming language; Perception","score_opus":0.08119668894281527,"score_gpt":0.3262686356536028,"score_spread":0.24507194671078752,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2118462286","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020449338,0.000089448906,0.97532076,0.00035875983,0.000016875741,0.0001505667,0.000032602165,0.00039640337,0.0031853623],"genre_scores_gemma":[0.45727012,0.000108819084,0.5401088,0.00015625865,0.00001617857,0.0003557175,0.00009143635,0.00008360255,0.0018091134],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996555,0.0017298709,0.00021282249,0.0005075861,0.00079391716,0.00020083289],"domain_scores_gemma":[0.9955409,0.0025641199,0.00039784503,0.0005164455,0.00073798985,0.00024279108],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004775012,0.0007347363,0.0005527491,0.0012050598,0.00059347786,0.0021527624,0.0021809258,0.0013392199,0.0028476003],"category_scores_gemma":[0.0064493553,0.00061800913,0.0012069995,0.0006127137,0.0018209734,0.0020313573,0.0018327483,0.0016747828,0.00046521527],"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.0002571542,0.00062667445,0.006180742,0.00048665557,0.00022478767,0.00034224318,0.0022504549,0.59357965,0.016310615,0.19868106,0.0019170925,0.17914285],"study_design_scores_gemma":[0.000028610697,0.000105089435,0.0005328371,0.00004403398,0.00003576054,0.000051011866,0.0001712469,0.93460655,0.0025379276,0.059383024,0.0024789579,0.000024910229],"about_ca_topic_score_codex":0.0043328884,"about_ca_topic_score_gemma":0.0039766035,"teacher_disagreement_score":0.004775012,"about_ca_system_score_codex":0.0014348392,"about_ca_system_score_gemma":0.0021677404,"threshold_uncertainty_score":0.025252998},"labels":[],"label_agreement":null},{"id":"W2119582290","doi":"10.1002/spe.520","title":"Investigating the use of analysis contracts to improve the testability of object‐oriented code","year":2003,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Software Testing and Debugging Techniques","field":"Computer Science","cited_by":75,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Testability; Precondition; Software engineering; Reuse; Isolation (microbiology); Design by contract; Programming language; Coding (social sciences); Software; Reliability engineering; Software system; Software construction; Engineering","score_opus":0.04497579318473231,"score_gpt":0.31088651099809034,"score_spread":0.265910717813358,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2119582290","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.77237654,0.00019960021,0.22135358,0.0008130477,0.000012822801,0.00020736935,0.000031846554,0.001509692,0.0034955423],"genre_scores_gemma":[0.883152,0.00009851744,0.115971826,0.000076593424,0.0000071045947,0.00009116364,0.0000526977,0.00012736562,0.00042266288],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9829012,0.0119570745,0.0006655231,0.00053553685,0.0033021327,0.00063848856],"domain_scores_gemma":[0.8122732,0.14835998,0.015177111,0.015331079,0.0079312995,0.0009273283],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.022436243,0.00050748757,0.00033672526,0.0011034876,0.00069243443,0.0014131247,0.0014016905,0.0011243257,0.0010335861],"category_scores_gemma":[0.094804965,0.00048533693,0.00030419714,0.0009876809,0.0020905542,0.0037869231,0.0019140118,0.0011003935,0.00015598771],"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.0014045106,0.0023404728,0.122245684,0.00055376586,0.0001302594,0.0010724317,0.01099294,0.1443644,0.069315635,0.07199991,0.0021720007,0.573408],"study_design_scores_gemma":[0.00025976406,0.0023529602,0.035006717,0.00026142417,0.00016970655,0.0008781907,0.0020358774,0.81400406,0.104332164,0.028070979,0.012521769,0.000106317486],"about_ca_topic_score_codex":0.0023475338,"about_ca_topic_score_gemma":0.0013877889,"teacher_disagreement_score":0.022436243,"about_ca_system_score_codex":0.0012765683,"about_ca_system_score_gemma":0.0020214482,"threshold_uncertainty_score":0.11865562},"labels":[],"label_agreement":null},{"id":"W2131009004","doi":"10.1002/spe.452","title":"A framework for table driven testing of Java classes","year":2002,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Software Testing and Debugging Techniques","field":"Computer Science","cited_by":19,"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 Victoria","funders":"","keywords":"Computer science; Unit testing; Java; Software portability; Tuple; Class (philosophy); Table (database); Programming language; Integration testing; Interface (matter); Standardization; Software engineering; Class hierarchy; Reuse; Object-oriented programming; Data mining; Operating system; Artificial intelligence; Software; Engineering","score_opus":0.06962558702449549,"score_gpt":0.33178758210427484,"score_spread":0.26216199507977933,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2131009004","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015201241,0.00009219826,0.9884802,0.0000856334,0.000020832047,0.00015354386,0.000084062274,0.008691867,0.00087154936],"genre_scores_gemma":[0.05885888,0.00016305529,0.9375095,0.000111791065,0.00003551068,0.00043700158,0.0005030078,0.0012130061,0.0011682601],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9935967,0.0021967,0.00064998755,0.00088107056,0.0023042366,0.00037122695],"domain_scores_gemma":[0.99109757,0.005203645,0.00059962826,0.0017520505,0.0010543669,0.0002928001],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008710796,0.0011855271,0.0011315811,0.0024535288,0.0007352319,0.0037343556,0.0047042244,0.0017929944,0.0053165285],"category_scores_gemma":[0.01594419,0.001253704,0.0024274543,0.0009930851,0.002427772,0.0035597817,0.0022037548,0.0024123301,0.0014295882],"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.00028122347,0.00032103594,0.0030466842,0.000824962,0.00019810637,0.0014525488,0.0012684033,0.2132815,0.016694756,0.37351754,0.01241464,0.37669858],"study_design_scores_gemma":[0.000105868705,0.0001729066,0.00048342047,0.00032746978,0.00006364781,0.00076500006,0.00009021967,0.77076757,0.012960126,0.15716328,0.057000037,0.00010044786],"about_ca_topic_score_codex":0.00508022,"about_ca_topic_score_gemma":0.003999047,"teacher_disagreement_score":0.008710796,"about_ca_system_score_codex":0.0015803387,"about_ca_system_score_gemma":0.0018850035,"threshold_uncertainty_score":0.046067655},"labels":[],"label_agreement":null},{"id":"W2134092469","doi":"10.1002/spe.386","title":"Shimba—an environment for reverse engineering Java software systems","year":2001,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Software Engineering Research","field":"Computer Science","cited_by":138,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Academy of Finland; Association of Canadian Universities for Research in Astronomy; Nokia","keywords":"Computer science; Reverse engineering; Java; Sequence diagram; Software; Programming language; Abstraction; TRACE (psycholinguistics); Sequence (biology); Software system; Software engineering; Unified Modeling Language","score_opus":0.02269407837112575,"score_gpt":0.2825363977862558,"score_spread":0.25984231941513003,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2134092469","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007883008,0.00015389644,0.88193446,0.00010156831,0.00004283955,0.0002494379,0.00036813715,0.10671577,0.002550802],"genre_scores_gemma":[0.054418646,0.0004306491,0.92540425,0.00011105187,0.000025039233,0.0006815664,0.001877555,0.013054864,0.003996366],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979741,0.0007581191,0.00019252308,0.00026737113,0.0006476573,0.00016028664],"domain_scores_gemma":[0.9917589,0.004766831,0.0006190759,0.0018950677,0.00067323924,0.00028704663],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004525552,0.0012820527,0.0008012364,0.0013064332,0.0006540711,0.001802105,0.0029454387,0.0010920765,0.012076816],"category_scores_gemma":[0.009567131,0.0019275115,0.0011826989,0.0007235177,0.00080209656,0.004321361,0.0035736046,0.002747303,0.004916313],"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.001909926,0.0010457085,0.004200649,0.0023559583,0.00023215183,0.0021902495,0.0034361803,0.061883576,0.102001645,0.07965827,0.06101375,0.6800719],"study_design_scores_gemma":[0.0013628653,0.00087878393,0.0032285443,0.00075482554,0.00016602069,0.0019337119,0.0005374445,0.46645328,0.1097339,0.05479305,0.35975024,0.0004072827],"about_ca_topic_score_codex":0.0011626801,"about_ca_topic_score_gemma":0.0015392723,"teacher_disagreement_score":0.012076816,"about_ca_system_score_codex":0.0004689948,"about_ca_system_score_gemma":0.0015187047,"threshold_uncertainty_score":0.040400982},"labels":[],"label_agreement":null},{"id":"W2135023474","doi":"10.1002/spe.378","title":"The Relationlog system prototype","year":2001,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Advanced Database Systems and Queries","field":"Computer Science","cited_by":2,"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 Regina","funders":"","keywords":"Datalog; Computer science; Tuple; Programming language; SQL; Relational database; Data definition language; Data model (GIS); Object (grammar); Relational database management system; Relational model; Extension (predicate logic); Database model; Database design; Query language; Data manipulation language; Database; Artificial intelligence; Mathematics","score_opus":0.013209794887491856,"score_gpt":0.2793283712477387,"score_spread":0.26611857636024683,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2135023474","genre_codex":"methods","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0644968,0.002404332,0.6149466,0.003140456,0.0008167539,0.0015752383,0.007168694,0.2081755,0.09727573],"genre_scores_gemma":[0.3415909,0.0024863393,0.5519817,0.0021416768,0.00043428846,0.0009593937,0.020508897,0.009152177,0.07074468],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99867415,0.0004101019,0.00011554411,0.00027546176,0.0004225884,0.00010212167],"domain_scores_gemma":[0.9977937,0.0008444417,0.0000846043,0.00062862894,0.0004313904,0.00021721977],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002729462,0.00036935578,0.00037741568,0.000848082,0.0007690562,0.0028501237,0.0021371087,0.00097659,0.02440167],"category_scores_gemma":[0.005265059,0.0005516909,0.0004992394,0.0007503075,0.000916157,0.00650967,0.0020002534,0.0011777803,0.009116479],"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.002017231,0.0013894032,0.0043377015,0.0015669421,0.00010636017,0.0021330083,0.0030315365,0.009806501,0.03599456,0.15146036,0.1772105,0.6109459],"study_design_scores_gemma":[0.0007827287,0.0006358259,0.0014539722,0.0002638844,0.00012170832,0.002034602,0.00056398753,0.06693664,0.024783092,0.06007966,0.8421924,0.00015149893],"about_ca_topic_score_codex":0.003409127,"about_ca_topic_score_gemma":0.0026577283,"teacher_disagreement_score":0.02440167,"about_ca_system_score_codex":0.00081840256,"about_ca_system_score_gemma":0.0021562427,"threshold_uncertainty_score":0.08163172},"labels":[],"label_agreement":null},{"id":"W2145195191","doi":"10.1002/spe.2325","title":"Better bitmap performance with Roaring bitmaps","year":2015,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":159,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Saint John Regional Hospital; Université TÉLUQ; Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Bitmap; Computer science; Encoding (memory); Compression (physics); Oracle; Data compression; Compression ratio; Parallel computing; Algorithm; Computer graphics (images); Artificial intelligence; Engineering; Programming language","score_opus":0.0231628126247053,"score_gpt":0.26177811216115016,"score_spread":0.23861529953644486,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2145195191","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7573051,0.0069330903,0.16183986,0.0024527756,0.0009619512,0.00022684259,0.003112277,0.035937913,0.031230144],"genre_scores_gemma":[0.8389448,0.0011397052,0.14444908,0.0006381925,0.00016193303,0.00013438477,0.0061305435,0.0014668009,0.0069346232],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986644,0.00017993517,0.0001445132,0.0001904346,0.0006330838,0.00018763477],"domain_scores_gemma":[0.99312395,0.0026136818,0.00038608524,0.0021854683,0.001509833,0.00018097385],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010910279,0.000593595,0.0006722545,0.0016605154,0.00044179545,0.0021021762,0.0013541547,0.00083776546,0.010858149],"category_scores_gemma":[0.010731952,0.0002486899,0.00033334296,0.00448532,0.00064031576,0.0058713807,0.001306755,0.00091405964,0.002738688],"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.0035749401,0.0005969531,0.005478791,0.0007147207,0.00014831343,0.0005448783,0.00075226167,0.077881806,0.100626156,0.026060494,0.048181117,0.7354396],"study_design_scores_gemma":[0.00033564577,0.0016859956,0.005172495,0.00023381194,0.00010705426,0.0012721989,0.0009000192,0.5373897,0.36215636,0.020674372,0.06979262,0.00027972215],"about_ca_topic_score_codex":0.0021717895,"about_ca_topic_score_gemma":0.0014920158,"teacher_disagreement_score":0.010858149,"about_ca_system_score_codex":0.00067155715,"about_ca_system_score_gemma":0.0006412764,"threshold_uncertainty_score":0.036324143},"labels":[],"label_agreement":null},{"id":"W2145399249","doi":"10.1002/spe.2155","title":"A rule-based approach for availability of service by automated service substitution","year":2012,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Service-Oriented Architecture and Web Services","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 Ontario Institute of Technology","funders":"","keywords":"Computer science; Web service; Unavailability; Software system; Component-based software engineering; Software engineering; Database; Service (business); Distributed computing; Software; World Wide Web; Operating system; Reliability engineering; Engineering","score_opus":0.017513001416637714,"score_gpt":0.27988527792985163,"score_spread":0.26237227651321393,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2145399249","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024741867,0.00006509627,0.9948107,0.00008707678,0.000037899663,0.00015158202,0.00003074986,0.0007918288,0.0015509274],"genre_scores_gemma":[0.059385303,0.000120858254,0.9381293,0.000117465825,0.00003843119,0.00018649419,0.00012979808,0.00014788739,0.0017444266],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9913016,0.0020878823,0.0008959562,0.0017398213,0.0035561335,0.00041859294],"domain_scores_gemma":[0.9892302,0.0046875793,0.0006953362,0.0031003223,0.002090362,0.0001962821],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0061371,0.0009384401,0.0016841671,0.0027530224,0.0015064204,0.003023195,0.004866186,0.0020733816,0.0025979732],"category_scores_gemma":[0.013024738,0.000854778,0.0030223024,0.0017971247,0.003321326,0.0025184278,0.0026165596,0.0028071029,0.0020920646],"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.00037602798,0.0005630289,0.0037181892,0.00061832945,0.0003831389,0.0025257114,0.0016227919,0.22375828,0.04138498,0.30182832,0.004511901,0.41870922],"study_design_scores_gemma":[0.000058025496,0.0001892384,0.00036821835,0.0001234415,0.00021631354,0.001102763,0.00015529494,0.8504757,0.022418264,0.09910866,0.025673619,0.00011047952],"about_ca_topic_score_codex":0.005092585,"about_ca_topic_score_gemma":0.004078475,"teacher_disagreement_score":0.0061371,"about_ca_system_score_codex":0.001309067,"about_ca_system_score_gemma":0.0033609185,"threshold_uncertainty_score":0.032456517},"labels":[],"label_agreement":null},{"id":"W2146909240","doi":"10.1002/spe.482","title":"CD++: a toolkit to develop DEVS models","year":2002,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Simulation Techniques and Applications","field":"Decision Sciences","cited_by":256,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"DEVS; Formalism (music); Computer science; Variety (cybernetics); Software engineering; Software; Formal methods; Modeling and simulation; Programming language; Simulation; Artificial intelligence","score_opus":0.20332006786259638,"score_gpt":0.4336497242096695,"score_spread":0.23032965634707314,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2146909240","genre_codex":"methods","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026160975,0.000173806,0.954073,0.00023709431,0.00010011306,0.00021774974,0.002042239,0.031824797,0.008715113],"genre_scores_gemma":[0.040523034,0.0006213742,0.93418163,0.00016441944,0.00003574033,0.0010389688,0.0053450246,0.0084913885,0.009598454],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.99904937,0.00030536196,0.00013118409,0.00012270082,0.00030720394,0.00008427612],"domain_scores_gemma":[0.99761117,0.0015027254,0.00011778283,0.00032160737,0.0002882078,0.0001586691],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023072867,0.0010041336,0.00082061574,0.0012844922,0.00072240015,0.00244464,0.0033679134,0.0014446905,0.021604797],"category_scores_gemma":[0.005646367,0.0013378353,0.0013873351,0.00082417537,0.00085197826,0.002089469,0.0028810797,0.0024990162,0.0054248413],"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.0003212645,0.00020897425,0.002301302,0.0018274288,0.00018886263,0.00075898325,0.0009473725,0.37938297,0.01001102,0.33794028,0.084423535,0.181688],"study_design_scores_gemma":[0.00017622426,0.000043684213,0.00021861654,0.00023050817,0.000034494595,0.00029229056,0.0000729019,0.56710047,0.006815723,0.06859385,0.3563443,0.000076928256],"about_ca_topic_score_codex":0.0037267597,"about_ca_topic_score_gemma":0.0047798497,"teacher_disagreement_score":0.021604797,"about_ca_system_score_codex":0.0009227599,"about_ca_system_score_gemma":0.0018884832,"threshold_uncertainty_score":0.07227528},"labels":[],"label_agreement":null},{"id":"W2150310088","doi":"10.1002/spe.609","title":"Performance evaluation for VBR Continuous Media File Server admission control","year":2004,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Multimedia Communication and Technology","field":"Social Sciences","cited_by":2,"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 British Columbia; University of Saskatchewan","funders":"","keywords":"Computer science; Control (management); Variable bitrate; Operating system; World Wide Web; Computer network; Database; Bit rate","score_opus":0.035375187398940855,"score_gpt":0.36600419869729195,"score_spread":0.3306290112983511,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2150310088","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94937456,0.000298418,0.046112325,0.0001677094,0.00005138119,0.00012020987,0.0000475791,0.0015284421,0.0022993253],"genre_scores_gemma":[0.99585235,0.00002625011,0.003836821,0.000013538738,0.0000053645986,0.000009755085,0.000022306582,0.000011580816,0.00022193899],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99767023,0.00087866874,0.00013176707,0.00020202364,0.00082865567,0.00028862042],"domain_scores_gemma":[0.99280715,0.0042220885,0.00046533102,0.0005595143,0.0015091327,0.0004367251],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034264845,0.00055699784,0.00063594116,0.00072385557,0.00063004316,0.0011701259,0.0010427892,0.0007462121,0.0011431283],"category_scores_gemma":[0.012685304,0.00014786482,0.00020467232,0.0005770167,0.0007214847,0.0006813886,0.0006129211,0.0005855438,0.0002051547],"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.0059151244,0.0015740793,0.019112302,0.00027287114,0.00021374806,0.0004380769,0.0006453192,0.6912403,0.07964317,0.005490661,0.0018929003,0.19356151],"study_design_scores_gemma":[0.0001150181,0.0007405966,0.0024394735,0.000009649616,0.00003173724,0.0000889885,0.00008813244,0.9687048,0.027042475,0.0004021964,0.00030718793,0.000029705365],"about_ca_topic_score_codex":0.008419639,"about_ca_topic_score_gemma":0.0025859345,"teacher_disagreement_score":0.008419639,"about_ca_system_score_codex":0.0018423243,"about_ca_system_score_gemma":0.0008084837,"threshold_uncertainty_score":0.018121183},"labels":[],"label_agreement":null},{"id":"W2164687814","doi":"10.1002/spe.1029","title":"The CoreASM modeling framework","year":2011,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Distributed and Parallel Computing Systems","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; Defence Research and Development Canada","funders":"","keywords":"Computer science; Key (lock); Software engineering; Systems engineering; Set (abstract data type); Data science; Management science; Engineering; Programming language; Computer security","score_opus":0.042284565170632164,"score_gpt":0.2829391912181352,"score_spread":0.24065462604750304,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2164687814","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023662122,0.00018917264,0.9600089,0.001221804,0.00007645307,0.00021815102,0.000561621,0.0031172526,0.03224045],"genre_scores_gemma":[0.11006314,0.0007167173,0.8625296,0.0007387113,0.00013832956,0.0013586645,0.0022058957,0.0012763481,0.020972563],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99753004,0.0010539779,0.00014991286,0.000266484,0.0008032078,0.0001964203],"domain_scores_gemma":[0.9978085,0.0006123192,0.00015598563,0.00057266233,0.00071968656,0.0001309156],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004789886,0.0009997835,0.0006965031,0.0015704302,0.0011204163,0.004504166,0.004611671,0.0019141866,0.009993297],"category_scores_gemma":[0.0057518417,0.0008812702,0.0015740994,0.0011058237,0.0016011297,0.004464246,0.0044697886,0.0024442028,0.0036146187],"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.000021736476,0.000023664692,0.00037703916,0.0001416865,0.000017072027,0.00008535118,0.00029208526,0.020712923,0.00057172624,0.945132,0.008371158,0.024253458],"study_design_scores_gemma":[0.00004456453,0.00004424894,0.00020396913,0.00032113693,0.000028520588,0.00016581893,0.00020637485,0.21455695,0.0017850759,0.41949317,0.36311516,0.00003497723],"about_ca_topic_score_codex":0.0064068255,"about_ca_topic_score_gemma":0.0066492683,"teacher_disagreement_score":0.009993297,"about_ca_system_score_codex":0.002206661,"about_ca_system_score_gemma":0.0056553264,"threshold_uncertainty_score":0.033430874},"labels":[],"label_agreement":null},{"id":"W2269410433","doi":"10.1002/spe.2393","title":"Register allocation and spilling using the expected distance heuristic","year":2016,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"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 Victoria","funders":"","keywords":"Allocator; Register allocation; Computer science; Profiling (computer programming); Compiler; Parallel computing; Operating system","score_opus":0.026264379434039448,"score_gpt":0.30093789960287226,"score_spread":0.27467352016883284,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2269410433","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33772215,0.0014869196,0.6443861,0.0005550064,0.00011197776,0.00013033673,0.00021285505,0.0061406284,0.009254051],"genre_scores_gemma":[0.7497641,0.00017227467,0.24701545,0.00009934236,0.000028082117,0.000051195715,0.00024360047,0.0003680482,0.0022578973],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998689,0.0003643112,0.00009136637,0.00019940021,0.0004173488,0.00023858526],"domain_scores_gemma":[0.99794096,0.0009878502,0.00031820283,0.00032453763,0.00031890007,0.00010947115],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012046334,0.0007724105,0.00090177875,0.001868399,0.0006714176,0.0012793654,0.0012465827,0.0006467834,0.002310018],"category_scores_gemma":[0.003891313,0.0004262107,0.0006925767,0.0014888239,0.0006997245,0.0013938906,0.00095765194,0.0007098114,0.0004871963],"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.00046561527,0.00016040518,0.0052652275,0.00010113571,0.00007467798,0.000137763,0.00011325905,0.7685713,0.008747322,0.010921959,0.0031834904,0.2022578],"study_design_scores_gemma":[0.000021675032,0.000053692485,0.00042591765,0.000008640095,0.000015972337,0.000036489913,0.000021511092,0.9913202,0.003975435,0.0033575078,0.00075107557,0.000011771492],"about_ca_topic_score_codex":0.0054482697,"about_ca_topic_score_gemma":0.0074720467,"teacher_disagreement_score":0.0054482697,"about_ca_system_score_codex":0.0020839742,"about_ca_system_score_gemma":0.0028295738,"threshold_uncertainty_score":0.0151203275},"labels":[],"label_agreement":null},{"id":"W2269942371","doi":"10.1002/spe.2388","title":"SafeType: detecting type violations for type‐basedalias analysis of C","year":2015,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Security and Verification in Computing","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta; IBM (Canada)","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Alias; Computer science; Compiler; Programming language; Memory safety; Type inference; Static analysis; Benchmark (surveying); Type safety; Spec#; Context (archaeology); Java; Compile time; Database; Inference; Artificial intelligence","score_opus":0.1252414425623855,"score_gpt":0.39617073386537743,"score_spread":0.2709292913029919,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2269942371","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.076306045,0.00040098716,0.801333,0.00047172917,0.00013808327,0.00020169033,0.00088604307,0.11193498,0.0083274795],"genre_scores_gemma":[0.58788997,0.0002291821,0.3975489,0.0005485517,0.000101352794,0.00019701733,0.0014616775,0.007917655,0.0041056573],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9938877,0.0013182915,0.00043201665,0.00094323326,0.0028628383,0.00055590767],"domain_scores_gemma":[0.9850612,0.006398286,0.001977998,0.003676747,0.002660904,0.00022480186],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003722863,0.0016301638,0.0007226811,0.003015147,0.0014272287,0.0023331472,0.0024443935,0.0013985303,0.004583688],"category_scores_gemma":[0.018119205,0.0010168594,0.0014146746,0.0012279097,0.0022907767,0.003354435,0.0026223762,0.0018706868,0.0018558758],"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.002429144,0.00038858427,0.049650043,0.0012144608,0.00040942564,0.0012319576,0.001449843,0.10629147,0.0938781,0.09959884,0.061813515,0.58164465],"study_design_scores_gemma":[0.00012343602,0.0003247722,0.0053718453,0.00022271751,0.00011496815,0.00063738244,0.00018411744,0.7076536,0.19824095,0.054192066,0.032725748,0.00020834625],"about_ca_topic_score_codex":0.0060440577,"about_ca_topic_score_gemma":0.0043745977,"teacher_disagreement_score":0.0060440577,"about_ca_system_score_codex":0.0015209304,"about_ca_system_score_gemma":0.003694613,"threshold_uncertainty_score":0.019688606},"labels":[],"label_agreement":null},{"id":"W2281407436","doi":"10.1002/spe.2382","title":"DataMill: a distributed heterogeneous infrastructure forrobust experimentation","year":2015,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Parallel Computing and Optimization Techniques","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 Waterloo","funders":"","keywords":"Benchmarking; Dilemma; Computer science; Competition (biology); Empirical research; Compiler; Process (computing); Data science; Operating system","score_opus":0.026376792835969862,"score_gpt":0.31034585328382025,"score_spread":0.28396906044785036,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2281407436","genre_codex":"methods","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019378528,0.0004791552,0.6320801,0.0018013162,0.0005343584,0.0017134873,0.008119203,0.31960666,0.016287168],"genre_scores_gemma":[0.24370672,0.0006018791,0.6372669,0.0013653669,0.00023009605,0.005433973,0.03278997,0.069589496,0.0090156635],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9746056,0.009724885,0.0019687882,0.004317257,0.008043054,0.0013403931],"domain_scores_gemma":[0.9521503,0.015293757,0.002110322,0.023613168,0.004622922,0.0022094736],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.024618147,0.0021297743,0.0021115055,0.0025374289,0.001213106,0.0045878147,0.008815679,0.0016319645,0.020288523],"category_scores_gemma":[0.043336473,0.001770196,0.0016983473,0.002843902,0.0025657888,0.007911494,0.008558767,0.00561823,0.010608913],"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.007374956,0.0026825273,0.012483485,0.0030142807,0.0009760521,0.0013699428,0.0026181533,0.09623821,0.057157133,0.08694759,0.35475874,0.37437892],"study_design_scores_gemma":[0.002006329,0.0010177891,0.005725706,0.00043897497,0.00018283316,0.00034986308,0.0004528443,0.5195968,0.06289583,0.10459156,0.3023066,0.00043480453],"about_ca_topic_score_codex":0.001961838,"about_ca_topic_score_gemma":0.0015354824,"teacher_disagreement_score":0.024618147,"about_ca_system_score_codex":0.0016748026,"about_ca_system_score_gemma":0.0035985867,"threshold_uncertainty_score":0.13019478},"labels":[],"label_agreement":null},{"id":"W2297699084","doi":"10.1002/spe.2389","title":"Runtime latency detection and analysis","year":2016,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Cloud Computing and Resource Management","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Latency (audio); Tracing; Stateful firewall; Scalability; Linux kernel; Real-time computing; Distributed computing; Operating system; Embedded system; Computer network; Network packet","score_opus":0.008521217669435751,"score_gpt":0.2468136966010594,"score_spread":0.23829247893162364,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2297699084","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16585204,0.0011173481,0.7015722,0.0004549626,0.00029534596,0.00070862786,0.0055631925,0.1094601,0.014976209],"genre_scores_gemma":[0.7231316,0.00041200707,0.2587086,0.00014494752,0.00013143312,0.0003693616,0.0050242012,0.004782448,0.007295346],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9942123,0.0005144481,0.00046313467,0.0011168248,0.0030505299,0.00064264936],"domain_scores_gemma":[0.9854093,0.0032253596,0.0019923123,0.0045191753,0.004318866,0.0005349555],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002349205,0.0015504644,0.00082169625,0.004220489,0.0006792509,0.002852499,0.0019709882,0.00055196334,0.004131272],"category_scores_gemma":[0.013951224,0.0005367591,0.00083051895,0.0019415867,0.0005521991,0.0021652807,0.0016226433,0.0017918907,0.0021622777],"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.0010043198,0.00049282354,0.072671905,0.0010118787,0.00025460133,0.0006356698,0.0012996306,0.06699008,0.10939719,0.021755546,0.030289898,0.6941965],"study_design_scores_gemma":[0.00007834974,0.00050778186,0.031220233,0.00015619572,0.00017999856,0.0005996571,0.00036083045,0.73407,0.17054689,0.016536748,0.045547098,0.00019622389],"about_ca_topic_score_codex":0.00454458,"about_ca_topic_score_gemma":0.0032850138,"teacher_disagreement_score":0.00454458,"about_ca_system_score_codex":0.0012979828,"about_ca_system_score_gemma":0.0027809476,"threshold_uncertainty_score":0.01382041},"labels":[],"label_agreement":null},{"id":"W2476849799","doi":"10.1002/spe.2426","title":"Resource requests prediction in the cloud computing environment with a deep belief network","year":2016,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Cloud Computing and Resource Management","field":"Computer Science","cited_by":62,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"Natural Science Foundation of Shandong Province; National Natural Science Foundation of China","keywords":"Cloud computing; Computer science; Deep belief network; Variance (accounting); Artificial intelligence; Set (abstract data type); Data mining; Resource (disambiguation); Machine learning; Scheduling (production processes); Deep learning; Mean squared error; Mathematical optimization; Statistics; Mathematics","score_opus":0.008643884133305817,"score_gpt":0.22546533838124636,"score_spread":0.21682145424794053,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2476849799","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.78945243,0.00023659109,0.20670971,0.0007774761,0.000038564136,0.000033758515,0.00013251929,0.00044091782,0.0021779991],"genre_scores_gemma":[0.99046636,0.000032231685,0.009131035,0.000028444525,0.000005817707,0.000007737714,0.00004886419,0.0000057622633,0.00027381102],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99966025,0.00009999308,0.00001408629,0.0000698689,0.000078280056,0.00007749219],"domain_scores_gemma":[0.99869883,0.0007645795,0.00012365067,0.00007536761,0.00025649695,0.00008106905],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00094948534,0.00045320342,0.0004420261,0.00039388673,0.00031052495,0.00062228035,0.0006224586,0.00050951843,0.0004808671],"category_scores_gemma":[0.0027231406,0.0003264725,0.00028158698,0.00039605587,0.00039215895,0.00091765134,0.00055797526,0.0009399098,0.00009646747],"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.00009033541,0.0000446893,0.0027106414,0.000007892035,0.000011486184,0.000017571003,0.000013408195,0.98609877,0.00063280296,0.00040321526,0.0001909942,0.009778203],"study_design_scores_gemma":[4.9634235e-7,0.0000025531942,0.0000898772,2.5666543e-7,4.1847113e-7,3.9877895e-7,9.051303e-7,0.99975306,0.00006574848,0.000081193575,0.000004648207,5.0851315e-7],"about_ca_topic_score_codex":0.036317516,"about_ca_topic_score_gemma":0.01999887,"teacher_disagreement_score":0.036317516,"about_ca_system_score_codex":0.0012916513,"about_ca_system_score_gemma":0.0010495101,"threshold_uncertainty_score":0.07221228},"labels":[],"label_agreement":null},{"id":"W2527845150","doi":"10.1002/spe.2461","title":"Regular and almost universal hashing: an efficient implementation","year":2016,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université TÉLUQ","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Hash function; Double hashing; SHA-2; Linear hashing; Merkle tree; Byte; Hash table; Hash chain","score_opus":0.015278382765730496,"score_gpt":0.3191347859469394,"score_spread":0.3038564031812089,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2527845150","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03964302,0.00049785856,0.93987554,0.00038781733,0.00008697418,0.0001296025,0.00015560965,0.010321414,0.008902079],"genre_scores_gemma":[0.62039995,0.00026757218,0.37094337,0.0002576045,0.000105538,0.00020627443,0.00040655147,0.0008373521,0.006575872],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99807954,0.0003919137,0.00017290618,0.000305813,0.0007600051,0.00028980922],"domain_scores_gemma":[0.99716395,0.000579479,0.00015693661,0.0016768875,0.00033921338,0.00008353558],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013387697,0.0004886462,0.0006997925,0.0006200496,0.0004997591,0.0014203822,0.002286205,0.0007389009,0.0076026423],"category_scores_gemma":[0.0052248375,0.00059734646,0.0006976115,0.0008757772,0.0011896618,0.0024400628,0.0025644263,0.0010439861,0.0035002537],"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.00093423773,0.00018668188,0.002363947,0.00042009156,0.000097932156,0.00030003957,0.00039047876,0.07870269,0.043790173,0.32390118,0.019708505,0.5292041],"study_design_scores_gemma":[0.0001509885,0.00026983925,0.00058003614,0.000081734885,0.000062647814,0.00041416663,0.00008424366,0.6940715,0.04323624,0.23870535,0.022260625,0.00008267256],"about_ca_topic_score_codex":0.0006580132,"about_ca_topic_score_gemma":0.00067070546,"teacher_disagreement_score":0.0076026423,"about_ca_system_score_codex":0.000850291,"about_ca_system_score_gemma":0.0011749516,"threshold_uncertainty_score":0.025433362},"labels":[],"label_agreement":null},{"id":"W2528870978","doi":"10.1002/spe.2441","title":"Toward cost‐effective replica placements in cloud storage systems with QoS‐awareness","year":2016,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Distributed and Parallel Computing Systems","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Crandall University; University of New Brunswick","funders":"Science and Technology Planning Project of Guangdong Province; Korea Institute for Advancement of Technology; National Key Research and Development Program of China; National University of Singapore","keywords":"Replica; Computer science; Quality of service; Distributed computing; Cloud computing; Greedy algorithm; Cloud storage; Workflow; Set (abstract data type); Replication (statistics); Computer network; Database; Algorithm; Operating system; Mathematics","score_opus":0.021881245941772896,"score_gpt":0.28936705119004014,"score_spread":0.26748580524826726,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2528870978","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15309912,0.0004819364,0.840648,0.00078817655,0.000059487393,0.00009065314,0.000072323244,0.0005142859,0.004245939],"genre_scores_gemma":[0.91628325,0.00021928918,0.08249516,0.00004619627,0.000013354484,0.000058333495,0.000035970454,0.00004083655,0.0008076675],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99928325,0.0003341395,0.000029411694,0.00006990545,0.00019501266,0.00008832976],"domain_scores_gemma":[0.9986337,0.00073446234,0.00015370734,0.00018805356,0.00021639856,0.00007363103],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012412588,0.0004865454,0.00067878666,0.0004160824,0.0005914081,0.0011877408,0.0011751284,0.000726111,0.0010807357],"category_scores_gemma":[0.0038716816,0.00045866825,0.0004117743,0.0005587438,0.000738024,0.001084056,0.000867306,0.0006259457,0.00018248873],"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.00003069088,0.000011594403,0.0002228226,0.000014609669,0.000006103211,0.000021919457,0.000015864818,0.988629,0.0016021966,0.0061871028,0.00016865904,0.0030894135],"study_design_scores_gemma":[0.0000039139777,0.000005010706,0.00002307881,0.0000011259879,0.0000013829323,0.0000050433487,0.0000057736265,0.9978661,0.00033338382,0.001616919,0.00013678796,0.0000014336457],"about_ca_topic_score_codex":0.007628083,"about_ca_topic_score_gemma":0.0040256293,"teacher_disagreement_score":0.007628083,"about_ca_system_score_codex":0.0014688295,"about_ca_system_score_gemma":0.001726658,"threshold_uncertainty_score":0.015167356},"labels":[],"label_agreement":null},{"id":"W2553786604","doi":"10.1002/spe.2463","title":"Modelling a family of systems for crisis management with concern‐oriented reuse","year":2016,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Advanced Software Engineering Methodologies","field":"Computer Science","cited_by":4,"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; Trent University","funders":"","keywords":"Reuse; Rotation formalisms in three dimensions; Abstraction; Computer science; Software engineering; Domain (mathematical analysis); Core (optical fiber); Risk analysis (engineering); Systems engineering; Engineering; Business","score_opus":0.0580529944815453,"score_gpt":0.3168435371305206,"score_spread":0.2587905426489753,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2553786604","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15587907,0.0002734895,0.82804644,0.000746574,0.000025087153,0.00034852079,0.00014939456,0.0011890136,0.013342501],"genre_scores_gemma":[0.6742131,0.00032130978,0.31682184,0.00009357574,0.000018414421,0.00045710968,0.0002820182,0.00026376022,0.007528925],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99864084,0.0005616116,0.00010972316,0.00022431753,0.00032426606,0.00013919428],"domain_scores_gemma":[0.99800235,0.0008101971,0.00029575353,0.00045136572,0.0003137813,0.00012660549],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018544199,0.0005001978,0.00030504924,0.00089509954,0.0010600181,0.002126452,0.0010255118,0.001286793,0.0027853767],"category_scores_gemma":[0.0041569998,0.0005259995,0.0013539812,0.0005926503,0.0018464862,0.0025094359,0.002096278,0.0010826029,0.0005160794],"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.00021781896,0.00018384156,0.011238508,0.00032134488,0.0001237544,0.0029827228,0.0105437655,0.41648132,0.0163574,0.479102,0.0033061106,0.059141476],"study_design_scores_gemma":[0.000071523005,0.0002178174,0.0023406637,0.00015563503,0.00009380717,0.0012270571,0.0014044921,0.817138,0.007569079,0.09659581,0.07312406,0.00006206955],"about_ca_topic_score_codex":0.0061316607,"about_ca_topic_score_gemma":0.0036053844,"teacher_disagreement_score":0.0061316607,"about_ca_system_score_codex":0.0020226818,"about_ca_system_score_gemma":0.001635173,"threshold_uncertainty_score":0.014675677},"labels":[],"label_agreement":null},{"id":"W2590572719","doi":"10.1002/spe.2486","title":"Naplus: a software distributed shared memory for virtual clusters in the cloud","year":2017,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Cloud Computing and Resource Management","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"Natural Science Foundation of Hubei Province; Atlantic Canada Opportunities Agency; National Natural Science Foundation of China; Science and Technology Planning Project of Guangdong Province; New Brunswick Innovation Foundation; Natural Sciences and Engineering Research Council of Canada; Fulbright Canada","keywords":"Computer science; Data diffusion machine; Shared memory; Distributed shared memory; Virtual machine; Cloud computing; Distributed computing; Distributed memory; Virtual memory; Host (biology); Synchronization (alternating current); Cluster (spacecraft); Operating system; Memory management; Uniform memory access; Computer network; Overlay; Channel (broadcasting)","score_opus":0.022316413634216554,"score_gpt":0.29381939373783467,"score_spread":0.2715029801036181,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2590572719","genre_codex":"methods","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19602756,0.0014799841,0.6713044,0.0009108817,0.00043666005,0.0009448084,0.00079218816,0.10578356,0.022319904],"genre_scores_gemma":[0.7378246,0.00030276558,0.2483827,0.00032146793,0.000070450114,0.00058284926,0.0014479619,0.0022949018,0.008772262],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99902976,0.00020925434,0.00007842834,0.00013014178,0.0003766194,0.00017577111],"domain_scores_gemma":[0.9985563,0.00025450092,0.00015504661,0.00045928106,0.00031644138,0.00025836678],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009182246,0.00069718016,0.00042088964,0.00073531107,0.000678037,0.0014288287,0.0037389619,0.0005124923,0.0055862367],"category_scores_gemma":[0.0023689102,0.0004269624,0.00041466026,0.00057187764,0.0007825113,0.0021792587,0.0024790731,0.0010632586,0.0011912958],"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.0040235133,0.0010632331,0.013824993,0.0011115671,0.00031817,0.0011278266,0.001329198,0.16653292,0.098099776,0.08888512,0.123480506,0.5002032],"study_design_scores_gemma":[0.0005570327,0.0010003141,0.003091629,0.00010211614,0.00012539446,0.00038339724,0.00022869474,0.8353297,0.055314407,0.015075036,0.08860959,0.00018266428],"about_ca_topic_score_codex":0.003843933,"about_ca_topic_score_gemma":0.0028285095,"teacher_disagreement_score":0.0055862367,"about_ca_system_score_codex":0.0011164503,"about_ca_system_score_gemma":0.0015140445,"threshold_uncertainty_score":0.018687844},"labels":[],"label_agreement":null},{"id":"W2599234488","doi":"10.1002/spe.1097","title":"Editorial","year":2011,"lang":"en","type":"editorial","venue":"Software Practice and Experience","topic":"Advanced Software Engineering Methodologies","field":"Computer Science","cited_by":1,"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 Calgary","funders":"","keywords":"Political science","score_opus":0.02280397231607757,"score_gpt":0.31885556526118386,"score_spread":0.2960515929451063,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2599234488","genre_codex":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003452353,0.017831307,0.00071108394,0.077784956,0.825387,0.000081625556,0.0010114872,0.00045133667,0.07639597],"genre_scores_gemma":[0.0062334337,0.023070863,0.0010320562,0.073419526,0.5313567,0.00014270132,0.0023669635,0.00070526724,0.3616725],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99579865,0.00055787043,0.00039317005,0.0010370176,0.0017928835,0.00042043114],"domain_scores_gemma":[0.98272735,0.0031004886,0.0009787717,0.0012086368,0.008589649,0.0033949693],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003507293,0.0013566919,0.0012652394,0.0028653925,0.0020929778,0.007677614,0.0025075579,0.004638558,0.25170115],"category_scores_gemma":[0.023464838,0.00046001704,0.0011764275,0.0016371562,0.0014962592,0.0054271184,0.0028305561,0.0065002623,0.13320282],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025896123,0.000008177801,0.00005021885,0.00017211663,0.0000042993124,0.00009324067,0.000031513755,0.00001781127,0.00006801859,0.0017146132,0.97443944,0.023374826],"study_design_scores_gemma":[0.000005536675,0.0000070450196,0.000078304285,0.00013485801,0.0000030501662,0.00013602074,0.00003655764,0.000014632828,0.0000445782,0.00060986116,0.998926,0.0000035870814],"about_ca_topic_score_codex":0.0012118396,"about_ca_topic_score_gemma":0.001769048,"teacher_disagreement_score":0.25170115,"about_ca_system_score_codex":0.0026167561,"about_ca_system_score_gemma":0.0035649543,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W2605244930","doi":"10.1002/spe.2487","title":"Deep learning and SVM‐based emotion recognition from Chinese speech for smart affective services","year":2017,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Emotion and Mood Recognition","field":"Psychology","cited_by":50,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"Natural Science Foundation of Shandong Province; Ministry of Science and Technology of the People's Republic of China; National Natural Science Foundation of China","keywords":"Support vector machine; Deep belief network; Computer science; Artificial intelligence; Mel-frequency cepstrum; Sadness; Surprise; Anger; Feature (linguistics); Speech recognition; Emotion recognition; Emotion classification; Cepstrum; Machine learning; Formant; Pattern recognition (psychology); Deep learning; Feature extraction; Psychology","score_opus":0.026445955772793624,"score_gpt":0.3585577752525215,"score_spread":0.3321118194797279,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2605244930","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.80550665,0.0006232832,0.18890983,0.00039579053,0.00019746312,0.00006495423,0.00037087643,0.0008980099,0.0030331733],"genre_scores_gemma":[0.96279705,0.00018095586,0.03360309,0.00004771547,0.000026081174,0.000032923504,0.00049064413,0.000024634071,0.002796957],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99975806,0.00005183718,0.000022883341,0.0000535336,0.0000701917,0.000043427895],"domain_scores_gemma":[0.99973756,0.000083123596,0.000021102314,0.000021326478,0.000116439674,0.000020480387],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005047089,0.00034923828,0.00029024636,0.00045021428,0.00020042906,0.00033627424,0.0002386402,0.00026975627,0.0015065897],"category_scores_gemma":[0.0010839377,0.00011334056,0.00041114847,0.0002968133,0.00013456326,0.0003496137,0.00039315244,0.00040633033,0.0004799336],"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.00092894793,0.000271431,0.012100667,0.00016460406,0.00009042321,0.00028546032,0.00032381996,0.055159707,0.13528,0.0012343138,0.0049378583,0.78922266],"study_design_scores_gemma":[0.000009904946,0.000088083354,0.012756151,0.000007733219,0.000031876647,0.000043004406,0.00009691424,0.96478903,0.02096162,0.0003603185,0.0008404283,0.000014943588],"about_ca_topic_score_codex":0.00498283,"about_ca_topic_score_gemma":0.0036166213,"teacher_disagreement_score":0.00498283,"about_ca_system_score_codex":0.00032455093,"about_ca_system_score_gemma":0.0003164541,"threshold_uncertainty_score":0.009907663},"labels":[],"label_agreement":null},{"id":"W2759878005","doi":"10.1002/spe.2560","title":"Roaring bitmaps: Implementation of an optimized software library","year":2018,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Advanced Database Systems and Queries","field":"Computer Science","cited_by":48,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick; Université TÉLUQ; Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Bitmap; Oracle; Microsoft Visual Studio; Software; Benchmark (surveying); Visual Basic for Applications; Index (typography)","score_opus":0.015491083339612195,"score_gpt":0.32155551221457046,"score_spread":0.30606442887495827,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2759878005","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018535636,0.000384354,0.49391332,0.00023331633,0.0001143575,0.00030211624,0.0025669911,0.4703999,0.013549967],"genre_scores_gemma":[0.214784,0.00059071544,0.66779894,0.0006177231,0.000119688004,0.0009752933,0.018410128,0.07489552,0.021807978],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99760485,0.00028883968,0.00023105962,0.0004144481,0.0011010651,0.00035960067],"domain_scores_gemma":[0.9970483,0.00076594215,0.00020229205,0.0007958866,0.0010045494,0.00018300994],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015004599,0.001687872,0.0008735271,0.001960703,0.00073531736,0.002471064,0.0040878346,0.0008213064,0.025096506],"category_scores_gemma":[0.0057207784,0.0013209424,0.0010164576,0.0027359556,0.0008849145,0.0033801605,0.0022517294,0.0014903871,0.015282793],"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.0020036635,0.00052566774,0.005239822,0.00077604165,0.00022878987,0.00041045705,0.00067784317,0.040756084,0.03302092,0.026920198,0.23094594,0.65849465],"study_design_scores_gemma":[0.0006800354,0.00038407382,0.003621538,0.00018479646,0.00012982354,0.0005056568,0.00023333398,0.58786005,0.15513366,0.021120597,0.22974479,0.00040163242],"about_ca_topic_score_codex":0.007964541,"about_ca_topic_score_gemma":0.0056774667,"teacher_disagreement_score":0.025096506,"about_ca_system_score_codex":0.0015439654,"about_ca_system_score_gemma":0.0029298298,"threshold_uncertainty_score":0.08395618},"labels":[],"label_agreement":null},{"id":"W2790464890","doi":"10.1002/spe.2566","title":"Recovering disk storage metrics from low‐level trace events","year":2018,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Advanced Data Storage Technologies","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Tracing; TRACE (psycholinguistics); Computer data storage; Block (permutation group theory); Stateful firewall; Page fault; Key (lock); Object storage; Distributed computing; Virtual memory; Operating system; Memory management","score_opus":0.03428704090859698,"score_gpt":0.30703009444557244,"score_spread":0.2727430535369755,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2790464890","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5295669,0.0002490144,0.43956974,0.00018932638,0.000052879666,0.00009898649,0.0015153112,0.026510468,0.002247315],"genre_scores_gemma":[0.9311028,0.00008905393,0.066529,0.00001277614,0.000009662495,0.000050058974,0.0012083132,0.00045361876,0.000544725],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99945265,0.0000785051,0.000038322774,0.00007924466,0.00029969268,0.000051639305],"domain_scores_gemma":[0.9978016,0.0006369713,0.000270068,0.0005327003,0.0006221954,0.0001365013],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005642801,0.00090229016,0.000495978,0.0029273985,0.00035721067,0.0013464374,0.00077566,0.00043806082,0.001064775],"category_scores_gemma":[0.0049103284,0.00020289136,0.00026973957,0.0014140806,0.00032878073,0.0009007019,0.0007784931,0.0006447109,0.0005654856],"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.00073132804,0.00037470608,0.072748706,0.00038791157,0.00010704409,0.0006165304,0.001061572,0.36188647,0.118502125,0.012070352,0.009166469,0.4223468],"study_design_scores_gemma":[0.000010148868,0.000081428414,0.010360937,0.000014923647,0.000011993786,0.00009321641,0.00013319212,0.939859,0.04355427,0.0040387604,0.001815561,0.000026680118],"about_ca_topic_score_codex":0.005357507,"about_ca_topic_score_gemma":0.0028019117,"teacher_disagreement_score":0.005357507,"about_ca_system_score_codex":0.0007659898,"about_ca_system_score_gemma":0.0006809468,"threshold_uncertainty_score":0.010652661},"labels":[],"label_agreement":null},{"id":"W2792146644","doi":"10.1002/spe.2567","title":"Hardware trace reconstruction of runtime compiled code","year":2018,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Software System Performance and Reliability","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; TRACE (psycholinguistics); Executable; Tracing; Code (set theory); Kernel (algebra); Software; Linux kernel; Operating system; Granularity; Overhead (engineering); Source code; Just-in-time compilation; Parallel computing; Embedded system; Programming language; Virtual machine","score_opus":0.015052674962690808,"score_gpt":0.28359402150777546,"score_spread":0.26854134654508466,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2792146644","genre_codex":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5647747,0.00026234242,0.3929462,0.00017747514,0.0001034399,0.000051116593,0.00046684686,0.035244215,0.0059736595],"genre_scores_gemma":[0.92061114,0.000060240098,0.075268716,0.00003482103,0.000012167587,0.00002103959,0.00041483773,0.0010949263,0.002482074],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99961287,0.0000339046,0.000013930379,0.00006801856,0.00021823347,0.0000530789],"domain_scores_gemma":[0.998621,0.00027598848,0.00017117993,0.00060449063,0.00027814726,0.00004925583],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025455703,0.00041213265,0.00023736242,0.0008567562,0.00023434151,0.00042948435,0.00058101636,0.0002449032,0.0020345324],"category_scores_gemma":[0.0018105988,0.00021488713,0.00020151018,0.00042679862,0.0003956293,0.00052804785,0.00042954902,0.00055482803,0.00046309418],"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.0009455113,0.00015697548,0.022356462,0.00025194703,0.000063012776,0.0008507618,0.00092641555,0.12507151,0.290569,0.010394128,0.0061581978,0.542256],"study_design_scores_gemma":[0.000018915342,0.00022879282,0.009035897,0.000032867316,0.000021263479,0.00044826526,0.00010189975,0.5953456,0.38258067,0.003177275,0.008954817,0.00005372326],"about_ca_topic_score_codex":0.001700113,"about_ca_topic_score_gemma":0.0016753012,"teacher_disagreement_score":0.0020345324,"about_ca_system_score_codex":0.00043161627,"about_ca_system_score_gemma":0.00054466573,"threshold_uncertainty_score":0.0068062544},"labels":[],"label_agreement":null},{"id":"W2803024722","doi":"10.1002/spe.2581","title":"Ontology‐based model‐driven development of a destination management portal: Experience and lessons learned","year":2018,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Semantic Web and Ontologies","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":"Université du Québec à Montréal","funders":"","keywords":"Computer science; Model-driven architecture; Unified Modeling Language; Code generation; Software engineering; Ontology; Context (archaeology); Process (computing); Domain (mathematical analysis); Flexibility (engineering); Process management; Metamodeling; Code (set theory); Knowledge management; Key (lock); Programming language; Engineering; Software; Computer security","score_opus":0.07106454758414069,"score_gpt":0.3608715101640578,"score_spread":0.2898069625799171,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2803024722","genre_codex":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.65668863,0.00037633526,0.3008806,0.0044963756,0.000114918104,0.0005304686,0.00014254349,0.0015365847,0.035233572],"genre_scores_gemma":[0.71395177,0.0006180826,0.27436456,0.00035420322,0.000020656737,0.00017498081,0.0003617882,0.0006489377,0.009504909],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99537873,0.0030162884,0.0001795042,0.00023260739,0.00092863716,0.00026420134],"domain_scores_gemma":[0.9921496,0.0047194157,0.00024037728,0.0012553402,0.001098896,0.0005364693],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009550045,0.00051376474,0.00028310413,0.0005621502,0.00141381,0.0028564811,0.0017034083,0.0016178224,0.0018106884],"category_scores_gemma":[0.014444281,0.0004875524,0.0006787343,0.00062199007,0.0020611284,0.003889153,0.002609522,0.0023055112,0.0005096972],"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.00041670285,0.005601377,0.027009815,0.0016021758,0.00014465213,0.011626178,0.20944823,0.1262606,0.053736925,0.11825899,0.016712468,0.42918184],"study_design_scores_gemma":[0.00042652446,0.0021388235,0.008559179,0.0010555611,0.00015608313,0.006922899,0.06308954,0.37969732,0.075575784,0.042153638,0.41979662,0.0004280083],"about_ca_topic_score_codex":0.005857925,"about_ca_topic_score_gemma":0.0061183926,"teacher_disagreement_score":0.009550045,"about_ca_system_score_codex":0.0019019409,"about_ca_system_score_gemma":0.0027517749,"threshold_uncertainty_score":0.050506115},"labels":[],"label_agreement":null},{"id":"W2888095436","doi":"10.1002/spe.2624","title":"C: Adding modern programming language features to C","year":2018,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"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","keywords":"Computer science; Programming language; Garbage collection; Software engineering; Third-generation programming language; Programming paradigm; Second-generation programming language; Garbage; Fifth-generation programming language","score_opus":0.018081320056256157,"score_gpt":0.30714334969980167,"score_spread":0.2890620296435455,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2888095436","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006698588,0.00078756246,0.8919229,0.0017126696,0.00072458154,0.00030949552,0.0008150789,0.068962775,0.028066318],"genre_scores_gemma":[0.058064505,0.0013789701,0.90488577,0.0017403454,0.00057510927,0.00039926567,0.0023367517,0.0153980935,0.01522116],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9965647,0.00048090008,0.00031305986,0.00047701434,0.0018776142,0.00028677977],"domain_scores_gemma":[0.9929594,0.002072713,0.00042885894,0.0022321446,0.0019427418,0.00036427643],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021225712,0.0013171511,0.00051658315,0.0019881716,0.0010781843,0.0033363982,0.0026749896,0.001202693,0.021208834],"category_scores_gemma":[0.012310702,0.00084171107,0.0012573556,0.001899718,0.001361678,0.0048769424,0.0030125682,0.0037699488,0.0110509405],"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.000536774,0.00018125905,0.001981049,0.0010761998,0.000101843354,0.0006220233,0.00064547523,0.0094541535,0.023279972,0.13760471,0.2169552,0.60756123],"study_design_scores_gemma":[0.00016862253,0.000185214,0.0011509926,0.0003964983,0.000091341615,0.0013946681,0.000099347264,0.043109566,0.027155861,0.083691485,0.8423184,0.0002380037],"about_ca_topic_score_codex":0.0033983237,"about_ca_topic_score_gemma":0.0024796794,"teacher_disagreement_score":0.021208834,"about_ca_system_score_codex":0.001134264,"about_ca_system_score_gemma":0.0022940428,"threshold_uncertainty_score":0.07095057},"labels":[],"label_agreement":null},{"id":"W2895482093","doi":"10.1002/spe.2639","title":"A systematic literature review on the detection of smells and their evolution in object‐oriented and service‐oriented systems","year":2018,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Software Engineering Research","field":"Computer Science","cited_by":38,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal; Concordia University","funders":"","keywords":"Code smell; Computer science; Software engineering; Source code; Identification (biology); Suite; Service (business); Data science; Information retrieval; Software; Software development; Programming language; Software quality","score_opus":0.010999122528343468,"score_gpt":0.2692355839895828,"score_spread":0.25823646146123935,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2895482093","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019102466,0.9956535,0.0004945248,0.00049061555,0.00013951493,0.00029096074,0.0004183438,0.000015611622,0.00058669],"genre_scores_gemma":[0.013944297,0.9822204,0.002167456,0.0004931736,0.00007111276,0.00053389143,0.0003867217,0.000011486313,0.0001714083],"study_design_codex":"systematic_review","study_design_gemma":"systematic_review","domain_scores_codex":[0.98754996,0.003802289,0.0049388036,0.0008685314,0.0025160254,0.00032441155],"domain_scores_gemma":[0.93960327,0.04218437,0.008446821,0.001031864,0.008229154,0.00050451735],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011849892,0.001587537,0.0044027558,0.028357241,0.0009526205,0.0031454964,0.0017166917,0.0017503627,0.003489849],"category_scores_gemma":[0.05951915,0.0011166597,0.005490303,0.022053018,0.0011691923,0.0042982125,0.0021782937,0.0012795139,0.0004713327],"study_design_candidate":"systematic_review","study_design_consensus":"systematic_review","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.00010435878,0.000030102343,0.00151305,0.87028146,0.0019205175,0.00022435017,0.0010448586,0.00017704198,0.00041180532,0.0008232498,0.0033835438,0.12008568],"study_design_scores_gemma":[0.000043163403,0.00016224473,0.0047529787,0.94056195,0.0099706445,0.00048795866,0.0011322134,0.000097199205,0.0003233664,0.000561664,0.041860603,0.000045952856],"about_ca_topic_score_codex":0.00873784,"about_ca_topic_score_gemma":0.025843568,"teacher_disagreement_score":0.028357241,"about_ca_system_score_codex":0.003915984,"about_ca_system_score_gemma":0.018516947,"threshold_uncertainty_score":0.06266898},"labels":[],"label_agreement":null},{"id":"W2901051931","doi":"10.1002/spe.2668","title":"Cloud‐aided online EEG classification system for brain healthcare: A case study of depression evaluation with a lightweight CNN","year":2018,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"EEG and Brain-Computer Interfaces","field":"Neuroscience","cited_by":85,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Artificial Intelligence in Medicine (Canada)","funders":"National Natural Science Foundation of China","keywords":"Computer science; Convolutional neural network; Cloud computing; Electroencephalography; Artificial intelligence; Classifier (UML); Deep learning; Brain–computer interface; Machine learning; Pattern recognition (psychology); Medicine; Operating system","score_opus":0.08535133327897979,"score_gpt":0.39370193943768994,"score_spread":0.3083506061587101,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2901051931","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9580143,0.0005042733,0.034910463,0.000952652,0.00016353412,0.00020931698,0.00030605448,0.0012314285,0.003707958],"genre_scores_gemma":[0.9886669,0.00012744102,0.009130719,0.00018436232,0.000016518117,0.000043630902,0.00019061883,0.000025780091,0.0016140247],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99969006,0.00006127075,0.000028844053,0.000058687856,0.00009196339,0.000069163136],"domain_scores_gemma":[0.99967575,0.00008316619,0.0000249845,0.00004832276,0.00012154134,0.000046149802],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056515745,0.0004492769,0.00035864086,0.0002517464,0.00021086294,0.00037196034,0.0007020898,0.0004503643,0.0011509652],"category_scores_gemma":[0.0011478611,0.00013522957,0.0002914406,0.00021218356,0.00023241388,0.0003471548,0.00034223194,0.0003265092,0.00037970114],"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.004861983,0.0015689704,0.080321796,0.0008026779,0.00048257937,0.020312687,0.0007629913,0.0938294,0.17600606,0.0026266102,0.027474985,0.59094936],"study_design_scores_gemma":[0.0002617009,0.0013895154,0.039812922,0.00007003763,0.00018980517,0.0024752181,0.00040774996,0.8471356,0.100015275,0.0009286088,0.0072470224,0.000066500026],"about_ca_topic_score_codex":0.00787354,"about_ca_topic_score_gemma":0.008183899,"teacher_disagreement_score":0.00787354,"about_ca_system_score_codex":0.0006700043,"about_ca_system_score_gemma":0.00041108715,"threshold_uncertainty_score":0.015655398},"labels":[],"label_agreement":null},{"id":"W2905833213","doi":"10.1002/spe.2674","title":"Generic input template for cloud simulators: A case study of CloudSim","year":2018,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Cloud Computing and Resource Management","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Cloud computing; Software portability; Computer science; Interoperability; CloudSim; Cloud testing; Provisioning; Distributed computing; Orchestration; Service provider; Cloud computing security; Cloud management; Software deployment; Service (business); Software engineering; Operating system","score_opus":0.03160463196324759,"score_gpt":0.31930235934950624,"score_spread":0.28769772738625865,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2905833213","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26729324,0.00040292114,0.64272857,0.00216015,0.0002797146,0.002457365,0.003944828,0.017580057,0.06315316],"genre_scores_gemma":[0.60543966,0.00040875375,0.35802525,0.00036801118,0.000037816,0.0011283911,0.005542548,0.0045575127,0.024492096],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99781275,0.0008178314,0.00021611678,0.0001937798,0.0007480066,0.00021158288],"domain_scores_gemma":[0.99528414,0.0024330209,0.00022243004,0.0011338324,0.0006960787,0.00023039574],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029010023,0.00067172456,0.00038322966,0.0011337602,0.0009029153,0.002415635,0.0019406732,0.0018020073,0.0054033063],"category_scores_gemma":[0.0085476395,0.0005172399,0.0009991656,0.0009775725,0.0010402744,0.0017628394,0.002085874,0.0013397072,0.0014410397],"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.0011638806,0.0017691969,0.037673343,0.0024162044,0.0001618645,0.02235565,0.021528047,0.24788344,0.051952146,0.272628,0.053244483,0.2872237],"study_design_scores_gemma":[0.00018523217,0.00052046916,0.0068952176,0.0007340229,0.00012701127,0.004253958,0.0033597397,0.3970679,0.060724072,0.024205623,0.50176704,0.00015960787],"about_ca_topic_score_codex":0.0058358097,"about_ca_topic_score_gemma":0.005397408,"teacher_disagreement_score":0.0058358097,"about_ca_system_score_codex":0.0019367731,"about_ca_system_score_gemma":0.0018712841,"threshold_uncertainty_score":0.018075883},"labels":[],"label_agreement":null},{"id":"W2912170833","doi":"10.1002/spe.404","title":"Exploiting exceptions","year":2001,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Software Testing and Debugging Techniques","field":"Computer Science","cited_by":1,"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 Victoria","funders":"Purdue University","keywords":"Bytecode; Java bytecode; Programming language; Computer science; Java; Compiler; Program optimization; Interpretation (philosophy); Optimizing compiler; Abstract interpretation; Code (set theory); Parallel computing; Operating system; Real time Java; Java annotation","score_opus":0.0296799226284058,"score_gpt":0.3130142890524758,"score_spread":0.28333436642407,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2912170833","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07944697,0.0010351072,0.8818221,0.00081471127,0.00027958254,0.00015842474,0.00021175729,0.020073744,0.01615763],"genre_scores_gemma":[0.6968661,0.0005989452,0.28274488,0.0007258921,0.0002010028,0.00013893982,0.00053532905,0.004160653,0.0140281515],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99575484,0.00096603704,0.000321295,0.0006133318,0.0018093203,0.0005352461],"domain_scores_gemma":[0.99245787,0.0028118105,0.00089749927,0.0026029684,0.0010544119,0.0001754749],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013665265,0.0011918491,0.00096188165,0.0009914511,0.000695202,0.0024317768,0.002106135,0.0008164856,0.004104174],"category_scores_gemma":[0.0074797673,0.00061775884,0.0008745177,0.00074895914,0.0017998043,0.0041073207,0.0024156154,0.0018540262,0.0015595566],"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.0011727038,0.00029283253,0.0091408035,0.0009840198,0.00016623421,0.002040548,0.0012489143,0.052275896,0.13904105,0.16068155,0.020095542,0.61285996],"study_design_scores_gemma":[0.00020014627,0.0005477981,0.0023108746,0.00034382104,0.0004910836,0.0023755326,0.00026219038,0.31080863,0.3318938,0.21481064,0.13573135,0.00022415725],"about_ca_topic_score_codex":0.0012696038,"about_ca_topic_score_gemma":0.0012612441,"teacher_disagreement_score":0.004104174,"about_ca_system_score_codex":0.0005836678,"about_ca_system_score_gemma":0.0014660932,"threshold_uncertainty_score":0.013729811},"labels":[],"label_agreement":null},{"id":"W2912431218","doi":"10.1002/spe.2689","title":"Faster remainder by direct computation: Applications to compilers and software libraries","year":2019,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick; Université TÉLUQ; Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Remainder; Divisibility rule; Divisor (algebraic geometry); Multiplication (music); Mathematics; Integer (computer science); Arithmetic; Inverse; Greatest common divisor; Quotient; Multiple; Division (mathematics); Compiler; Subtraction; Discrete mathematics; Computer science; Combinatorics","score_opus":0.016278115832119504,"score_gpt":0.3049469259117814,"score_spread":0.2886688100796619,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2912431218","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010862378,0.00075113657,0.9496766,0.00039388734,0.0001667936,0.00007388459,0.00016635738,0.030384501,0.007524493],"genre_scores_gemma":[0.1255172,0.000521151,0.85869426,0.00025871134,0.00016821026,0.00017222897,0.0006410603,0.0079579605,0.0060691503],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99770254,0.0006573417,0.00019942109,0.0003477589,0.0008804444,0.00021246696],"domain_scores_gemma":[0.98909676,0.004959156,0.0008785901,0.0025968438,0.0022699083,0.00019875963],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023632061,0.001976297,0.0010648784,0.002508245,0.0007586389,0.0027160365,0.0022431263,0.0008280914,0.016259864],"category_scores_gemma":[0.013175676,0.0010630647,0.0011814417,0.002340423,0.0013158965,0.0043374305,0.001984568,0.0015857823,0.0069223377],"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.00053267647,0.00017358699,0.002678915,0.0005027879,0.00007240372,0.0001875749,0.0002971586,0.09059318,0.015309199,0.11215748,0.037388127,0.74010694],"study_design_scores_gemma":[0.00022098681,0.00019319366,0.0006416261,0.0002776261,0.000052556537,0.00023157605,0.00007221895,0.7725239,0.04719203,0.12454826,0.053929865,0.00011612415],"about_ca_topic_score_codex":0.003073458,"about_ca_topic_score_gemma":0.0034299593,"teacher_disagreement_score":0.016259864,"about_ca_system_score_codex":0.0014698879,"about_ca_system_score_gemma":0.002156764,"threshold_uncertainty_score":0.054394722},"labels":[],"label_agreement":null},{"id":"W2916588339","doi":"10.1002/spe.2683","title":"Micro‐ and macro‐optimizations of S<scp>aa</scp>T search","year":2019,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Information Retrieval and Search Behavior","field":"Computer Science","cited_by":13,"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":"","keywords":"Macro; Computer science; Search engine; Parallel computing; Baseline (sea); Programming language; Information retrieval","score_opus":0.014912944305161342,"score_gpt":0.28949614186202943,"score_spread":0.2745831975568681,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2916588339","genre_codex":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6645696,0.0015190003,0.20020053,0.0014821092,0.0005178321,0.00046004943,0.0028988959,0.08907215,0.039279778],"genre_scores_gemma":[0.7659085,0.00021453448,0.22011012,0.00039711938,0.00007945395,0.00016285923,0.0024997767,0.0038664336,0.0067612096],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984365,0.00033197334,0.00017434191,0.00024377702,0.00049803976,0.000315359],"domain_scores_gemma":[0.995871,0.0018509624,0.0002183741,0.0011456244,0.0007097975,0.00020420422],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00093037856,0.0009813799,0.00072659727,0.00090723543,0.0006545565,0.0012883757,0.0019963556,0.0006065065,0.011177794],"category_scores_gemma":[0.0044922642,0.000388449,0.00076911924,0.0016588485,0.0007334519,0.002120407,0.0010425374,0.0012341277,0.0028806524],"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.003963821,0.0012502454,0.012130282,0.0008376921,0.00034496438,0.00040165414,0.00033255105,0.15837574,0.098757856,0.01175945,0.07318748,0.6386583],"study_design_scores_gemma":[0.00054029917,0.0010649196,0.006289408,0.00003890035,0.00018144606,0.00023594042,0.00030330705,0.85629,0.109433725,0.007122827,0.018382829,0.00011648795],"about_ca_topic_score_codex":0.016729409,"about_ca_topic_score_gemma":0.029184109,"teacher_disagreement_score":0.016729409,"about_ca_system_score_codex":0.0010843462,"about_ca_system_score_gemma":0.0024027217,"threshold_uncertainty_score":0.03739351},"labels":[],"label_agreement":null},{"id":"W2940449632","doi":"10.1002/spe.2695","title":"Developing applications in large scale, dynamic fog computing: A case study","year":2019,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"IoT and Edge/Fog Computing","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; Horizon 2020 Framework Programme; National Natural Science Foundation of China","keywords":"Computer science; Scalability; Distributed computing; Edge computing; Context (archaeology); Key (lock); Enhanced Data Rates for GSM Evolution; Scale (ratio); Class (philosophy); Cloud computing; Edge device; Node (physics); Computer security; Operating system; Telecommunications; Engineering; Artificial intelligence","score_opus":0.016475729029714635,"score_gpt":0.3292993104882954,"score_spread":0.3128235814585808,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2940449632","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9275307,0.0002997971,0.04874578,0.0015643394,0.00006586604,0.0004313547,0.00015454796,0.00066246826,0.020545065],"genre_scores_gemma":[0.95136863,0.00023913135,0.045354974,0.00015685383,0.00001604779,0.00010767747,0.00012884111,0.000096863485,0.0025310325],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.99899715,0.00047010885,0.000044224867,0.00009867841,0.00024216675,0.000147808],"domain_scores_gemma":[0.99778146,0.0011053974,0.00013465545,0.00036602377,0.0002523129,0.00036024538],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015779772,0.00033249203,0.00023016238,0.00036313664,0.0013677061,0.0012733818,0.0012501224,0.0013367491,0.0008411943],"category_scores_gemma":[0.0025802942,0.00020687074,0.0003973934,0.0005777496,0.0011098492,0.0014063783,0.0012592366,0.0009004046,0.00025092205],"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.0014387349,0.0055216704,0.058295105,0.0017713313,0.0002721238,0.04563795,0.02280041,0.39623424,0.067864,0.092981525,0.03470219,0.27248073],"study_design_scores_gemma":[0.00045040058,0.0019035845,0.028087324,0.0002904914,0.0001623932,0.008145779,0.015467653,0.715018,0.051866557,0.023679415,0.15475614,0.00017227007],"about_ca_topic_score_codex":0.0055439537,"about_ca_topic_score_gemma":0.008539965,"teacher_disagreement_score":0.0055439537,"about_ca_system_score_codex":0.0010281609,"about_ca_system_score_gemma":0.0008665824,"threshold_uncertainty_score":0.011023343},"labels":[],"label_agreement":null},{"id":"W2949366051","doi":"10.1002/spe.2402","title":"Consistently faster and smaller compressed bitmaps with Roaring","year":2016,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":56,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Saint John Regional Hospital; Université TÉLUQ","funders":"","keywords":"Bitmap; Uncompressed video; Computer science; SPARK (programming language); Computer graphics (images); Data compression; Compression (physics); Algorithm; Artificial intelligence; Materials science","score_opus":0.014158067012897405,"score_gpt":0.2441551405037744,"score_spread":0.229997073490877,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949366051","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11063614,0.0040844535,0.8159954,0.0013877555,0.0008378996,0.00029639294,0.0017404039,0.04341338,0.02160822],"genre_scores_gemma":[0.3288226,0.0011797633,0.64630085,0.0009753216,0.00026260127,0.00036816925,0.004595901,0.0038021028,0.013692774],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99838877,0.0001583648,0.00019678372,0.00022628164,0.0008997459,0.00013010952],"domain_scores_gemma":[0.9950659,0.0013401654,0.0003260611,0.001848737,0.0012891121,0.0001299413],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00091919623,0.0007923039,0.00074316695,0.0014838765,0.0005417644,0.0022366885,0.0018098422,0.0007863112,0.007435939],"category_scores_gemma":[0.007661787,0.00040653316,0.00054696685,0.0037925886,0.00079435855,0.0051552244,0.0019312449,0.0012539959,0.003797281],"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.00104944,0.00022246515,0.0022913755,0.00063790975,0.00011752039,0.00037101773,0.0008289182,0.024196604,0.0931358,0.032871455,0.038442623,0.8058347],"study_design_scores_gemma":[0.0002336895,0.0006896112,0.0034779776,0.0002738435,0.0001522546,0.0016775462,0.00072650873,0.33032694,0.44171757,0.045993574,0.17438942,0.00034107885],"about_ca_topic_score_codex":0.0012553995,"about_ca_topic_score_gemma":0.0013744372,"teacher_disagreement_score":0.007435939,"about_ca_system_score_codex":0.0005910945,"about_ca_system_score_gemma":0.00065381645,"threshold_uncertainty_score":0.0248757},"labels":[],"label_agreement":null},{"id":"W2951870329","doi":"10.1002/spe.2326","title":"SIMD compression and the intersection of sorted integers","year":2015,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":66,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université TÉLUQ","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"SIMD; Intersection (aeronautics); Integer (computer science); Data compression; Compression (physics); Scheme (mathematics); Speedup; Compression ratio","score_opus":0.021093375553375936,"score_gpt":0.28754013740270334,"score_spread":0.2664467618493274,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951870329","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35906196,0.0027890783,0.5968573,0.000699364,0.00020801512,0.00022445428,0.0011439077,0.017456366,0.021559559],"genre_scores_gemma":[0.66970766,0.00067504833,0.32181045,0.00026960325,0.00009869085,0.00021272506,0.0015527813,0.0006662424,0.005006771],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982401,0.00025909368,0.00018570438,0.00020988329,0.0009653766,0.00013978414],"domain_scores_gemma":[0.99782073,0.000886974,0.00019700968,0.0006214216,0.0004294461,0.000044517627],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00088068173,0.0006062363,0.0005884049,0.0016576295,0.0004963211,0.0011702742,0.0012086246,0.00037509642,0.0031988886],"category_scores_gemma":[0.004723119,0.00029297062,0.0003726306,0.0032630416,0.00094015576,0.0022227247,0.0014458162,0.00048811856,0.0010131935],"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.0020961028,0.0002176537,0.005346581,0.0003721555,0.00008334036,0.000508,0.000786301,0.060751736,0.087666154,0.06089571,0.016041523,0.76523465],"study_design_scores_gemma":[0.00025222023,0.0008431763,0.003207616,0.00010912323,0.00008881358,0.00089895586,0.0005434606,0.54494625,0.3570169,0.05054672,0.041447893,0.00009889688],"about_ca_topic_score_codex":0.00208135,"about_ca_topic_score_gemma":0.002044203,"teacher_disagreement_score":0.0031988886,"about_ca_system_score_codex":0.00087513577,"about_ca_system_score_gemma":0.0009165149,"threshold_uncertainty_score":0.010701358},"labels":[],"label_agreement":null},{"id":"W2952658091","doi":"10.1002/spe.2289","title":"Compressed bitmap indexes: beyond unions and intersections","year":2014,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université TÉLUQ; Université du Québec à Montréal; University of New Brunswick","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Bitmap; Computer science; Computer graphics (images)","score_opus":0.009517417444694493,"score_gpt":0.2661045583367833,"score_spread":0.25658714089208884,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952658091","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.048479978,0.010499384,0.90386194,0.004247711,0.0010986712,0.00020126294,0.0017664793,0.009430941,0.020413684],"genre_scores_gemma":[0.31945848,0.008364722,0.64741707,0.0015908239,0.00148925,0.00042100291,0.004874927,0.0027236263,0.013660094],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99748504,0.00034724388,0.00025087455,0.0002766891,0.0014984799,0.00014154961],"domain_scores_gemma":[0.9916333,0.0027623787,0.0005347029,0.0028670046,0.0019728965,0.00022974423],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016469761,0.0007524567,0.0010381577,0.003000726,0.00091801514,0.0046237693,0.0018215968,0.0007962973,0.010257162],"category_scores_gemma":[0.0123446025,0.00042216547,0.0005174791,0.008080705,0.0018087839,0.011189811,0.0029795251,0.0015921829,0.0038949857],"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.0007089782,0.000101228776,0.0018100059,0.0005045352,0.000054476033,0.00027730456,0.0005867012,0.021805264,0.011965392,0.2664252,0.0636277,0.6321333],"study_design_scores_gemma":[0.00008657598,0.00020990636,0.0009870108,0.00038388063,0.00008371248,0.0011111202,0.00043371212,0.22631967,0.04349887,0.5311812,0.19558305,0.00012118825],"about_ca_topic_score_codex":0.0017752368,"about_ca_topic_score_gemma":0.001207597,"teacher_disagreement_score":0.010257162,"about_ca_system_score_codex":0.00088898325,"about_ca_system_score_gemma":0.0012784055,"threshold_uncertainty_score":0.03431362},"labels":[],"label_agreement":null},{"id":"W2971398112","doi":"10.1002/spe.2746","title":"Fast and flexible tracepoints in x86","year":2019,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; Google","keywords":"Thread (computing); Computer science; Jump; Tracing; x86; Parallel computing; Offset (computer science); Operating system; Embedded system; Software","score_opus":0.01072286284567254,"score_gpt":0.28202385039854405,"score_spread":0.2713009875528715,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2971398112","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39868078,0.0014079189,0.5579057,0.00033558847,0.00014658243,0.00013169924,0.0003068396,0.026697155,0.014387755],"genre_scores_gemma":[0.8570782,0.00045086278,0.1307123,0.00007752054,0.000033660977,0.00009684756,0.00038326898,0.0016858956,0.009481517],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989297,0.00015422195,0.000066585075,0.00013439552,0.00053727283,0.00017783846],"domain_scores_gemma":[0.99845874,0.00039808027,0.00012442975,0.0007022709,0.00024771522,0.00006883351],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006465646,0.0006842196,0.0002805363,0.0010060271,0.0005976691,0.00082461216,0.0013322745,0.00046321028,0.0035765858],"category_scores_gemma":[0.0022512828,0.00045165754,0.00030324128,0.0011774786,0.00067215867,0.001674425,0.0012806961,0.0010727814,0.0010459248],"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.002004198,0.00028491294,0.01089727,0.00029347272,0.000064379914,0.00085928425,0.0012916668,0.106047116,0.10575502,0.060728114,0.010195216,0.70157933],"study_design_scores_gemma":[0.00034060483,0.0011356473,0.006658793,0.00016152005,0.00007205061,0.0007297974,0.000355883,0.5936769,0.26763237,0.054947007,0.07413546,0.00015396131],"about_ca_topic_score_codex":0.0025108473,"about_ca_topic_score_gemma":0.0025355455,"teacher_disagreement_score":0.0035765858,"about_ca_system_score_codex":0.00048705464,"about_ca_system_score_gemma":0.0008234968,"threshold_uncertainty_score":0.011964858},"labels":[],"label_agreement":null},{"id":"W2974083459","doi":"10.1002/spe.960","title":"A survey of practical algorithms for suffix tree construction in external memory","year":2010,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":11,"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 Victoria","funders":"","keywords":"Suffix; Suffix tree; Computer science; Auxiliary memory; Scalability; Generalized suffix tree; Trie; Algorithm; Tree (set theory); Theoretical computer science; Data structure; Mathematics; Programming language; Database; Operating system","score_opus":0.03567803922419386,"score_gpt":0.34467880862528155,"score_spread":0.30900076940108767,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2974083459","genre_codex":"methods","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010595705,0.0076607284,0.96889603,0.00030661866,0.00009741176,0.00015521882,0.0002239557,0.006380686,0.0056835767],"genre_scores_gemma":[0.06437167,0.007670895,0.92203325,0.00021563974,0.00019284416,0.00034060594,0.0014471315,0.0009883292,0.0027396102],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99689215,0.0007501087,0.00039237848,0.0005491477,0.001166286,0.0002498821],"domain_scores_gemma":[0.99213713,0.0040151477,0.00051099603,0.0021239847,0.0010939584,0.00011869297],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025255338,0.001622149,0.0016111004,0.0031048807,0.0011336694,0.0031309817,0.00394144,0.0017283659,0.006407551],"category_scores_gemma":[0.012408273,0.0011434898,0.0013648226,0.0068911747,0.0012407611,0.0058132973,0.0025395174,0.0019029151,0.0047347643],"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.00024355178,0.00016059593,0.0010441873,0.0011768587,0.000065019674,0.00008456138,0.00023112936,0.025268152,0.008642182,0.04593757,0.0104337605,0.90671235],"study_design_scores_gemma":[0.00030790738,0.00066495355,0.0016813788,0.0007955412,0.0001660491,0.00222967,0.00040107523,0.61721957,0.06854552,0.19274971,0.11506093,0.00017768928],"about_ca_topic_score_codex":0.00094329077,"about_ca_topic_score_gemma":0.0010273198,"teacher_disagreement_score":0.006407551,"about_ca_system_score_codex":0.0011794234,"about_ca_system_score_gemma":0.0019192905,"threshold_uncertainty_score":0.02143544},"labels":[],"label_agreement":null},{"id":"W2990393348","doi":"10.1002/spe.2777","title":"Base64 encoding and decoding at almost the speed of a memory copy","year":2019,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université TÉLUQ; Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; SIMD; JSON; Encoding (memory); Executable; ENCODE; Porting; Decoding methods; XML; Parallel computing; Operating system; Programming language; Artificial intelligence; Software","score_opus":0.01497585577914075,"score_gpt":0.2824211651749347,"score_spread":0.267445309395794,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2990393348","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10310868,0.00068568514,0.7343373,0.0006934162,0.00088834466,0.0003146879,0.0015369258,0.086223714,0.072211325],"genre_scores_gemma":[0.42691928,0.00065796543,0.48823974,0.0006553959,0.00024062945,0.00039806459,0.0041027963,0.008973629,0.06981248],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99941874,0.00004914656,0.000047574278,0.00008538336,0.000302939,0.000096196956],"domain_scores_gemma":[0.9988257,0.00021256704,0.00007972389,0.00038825558,0.00044389747,0.00004978276],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032535364,0.0010761761,0.000410819,0.0009000006,0.00048125547,0.0014591389,0.0014132089,0.00067129644,0.017353632],"category_scores_gemma":[0.0026408515,0.000372729,0.0003821465,0.0010420752,0.00047596046,0.0015178893,0.0009587392,0.0010020941,0.0106188785],"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.00094419386,0.00023115255,0.0030020517,0.00031116276,0.00006451523,0.0006428618,0.00040347336,0.022084577,0.111091316,0.053039744,0.09540941,0.7127756],"study_design_scores_gemma":[0.00021610028,0.00028715067,0.0016131738,0.00016922457,0.00008383977,0.00080807396,0.00021285254,0.19745374,0.50407964,0.038448405,0.25650084,0.00012703086],"about_ca_topic_score_codex":0.0021614127,"about_ca_topic_score_gemma":0.0020270352,"teacher_disagreement_score":0.017353632,"about_ca_system_score_codex":0.00069715054,"about_ca_system_score_gemma":0.0011958726,"threshold_uncertainty_score":0.058053672},"labels":[],"label_agreement":null},{"id":"W3018182837","doi":"10.1002/spe.2831","title":"Designing real‐time systems using imprecise discrete‐event system specifications","year":2020,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; DEVS; Scalability; Set (abstract data type); Event (particle physics); Transient (computer programming); Formal methods; Distributed computing; Software; Formal verification; Theoretical computer science; Programming language; Modeling and simulation; Simulation","score_opus":0.053565307091369786,"score_gpt":0.2985414029193482,"score_spread":0.24497609582797844,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3018182837","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006292454,0.000059842645,0.9916174,0.00014176084,0.000019319532,0.00005069778,0.000046368048,0.0003962754,0.0013758743],"genre_scores_gemma":[0.29668334,0.0004982673,0.69880605,0.00013596381,0.000032035583,0.00039615278,0.00036697485,0.00021924818,0.0028619948],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9961153,0.0015048702,0.00040554092,0.00029153994,0.0014396086,0.0002431864],"domain_scores_gemma":[0.9931593,0.0040473905,0.0006079597,0.0012826395,0.00076914823,0.00013345745],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005378774,0.0007898784,0.00054727687,0.0006883974,0.00047198505,0.0024078828,0.0013110721,0.00087449304,0.001931188],"category_scores_gemma":[0.008851412,0.0008850992,0.0013017631,0.00039017177,0.0018425365,0.0022252072,0.0012980439,0.0024006858,0.00046878407],"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.00008141146,0.0000473421,0.0010866348,0.00030350432,0.000051700277,0.00034110277,0.0007847634,0.7119992,0.011804239,0.2431539,0.00084486895,0.029501341],"study_design_scores_gemma":[0.000046696907,0.00008072458,0.00021009051,0.0001435962,0.000042841435,0.00013900961,0.00017350189,0.90472984,0.017188724,0.052176382,0.025028713,0.000039881157],"about_ca_topic_score_codex":0.0027496063,"about_ca_topic_score_gemma":0.0031782386,"teacher_disagreement_score":0.005378774,"about_ca_system_score_codex":0.0012365934,"about_ca_system_score_gemma":0.0018766196,"threshold_uncertainty_score":0.02844596},"labels":[],"label_agreement":null},{"id":"W3019290077","doi":"10.1002/spe.2830","title":"Vocabulary and time based bug‐assignment: A recommender system for open‐source projects","year":2020,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Software Engineering Research","field":"Computer Science","cited_by":17,"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":"","keywords":"Computer science; Vocabulary; Relevance (law); Key (lock); Intuition; Ranking (information retrieval); Task (project management); Information retrieval; World Wide Web; Software engineering; Data science; Artificial intelligence; Computer security","score_opus":0.04127924435912676,"score_gpt":0.30250029074955476,"score_spread":0.261221046390428,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3019290077","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46547922,0.015241418,0.43850055,0.0035195302,0.0012315675,0.0015142018,0.023667471,0.03746926,0.013376682],"genre_scores_gemma":[0.599873,0.0021966903,0.35909012,0.0006133405,0.00049717125,0.0005473901,0.028910179,0.00050646893,0.0077656573],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969317,0.0006934058,0.00036445478,0.0009926258,0.00084199046,0.0001758126],"domain_scores_gemma":[0.98926896,0.0050668507,0.0011093442,0.0011508905,0.00279148,0.0006123673],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037356704,0.0013431695,0.0016577803,0.009380295,0.0009826636,0.0016879974,0.0022420548,0.0016806233,0.0020380362],"category_scores_gemma":[0.019551031,0.0006572977,0.001159089,0.0049700937,0.0002661785,0.003038537,0.0015926076,0.0014582576,0.0027713478],"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.0007232324,0.0009130163,0.10070902,0.0015093135,0.00065538025,0.0007777232,0.0012727543,0.01678901,0.012032712,0.0028458377,0.09094586,0.7708262],"study_design_scores_gemma":[0.0003275654,0.000855008,0.057354107,0.00032800602,0.0006412792,0.0012603349,0.00083571445,0.8726486,0.0071745287,0.007798792,0.050498985,0.00027703814],"about_ca_topic_score_codex":0.024505695,"about_ca_topic_score_gemma":0.045139927,"teacher_disagreement_score":0.024505695,"about_ca_system_score_codex":0.0009719598,"about_ca_system_score_gemma":0.0014460628,"threshold_uncertainty_score":0.04872614},"labels":[],"label_agreement":null},{"id":"W3030953462","doi":"10.1002/spe.2853","title":"<scp>Senti‐eSystem</scp>: A sentiment‐based <scp>eSystem</scp>‐using hybridized fuzzy and deep neural network for measuring customer satisfaction","year":2020,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Sentiment Analysis and Opinion Mining","field":"Computer Science","cited_by":81,"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 Northern British Columbia","funders":"","keywords":"Customer satisfaction; Computer science; Artificial neural network; Fuzzy logic; Lexicon; Artificial intelligence; Polarity (international relations); Sentiment analysis; Data mining; Business; Marketing; Chemistry","score_opus":0.04259811995502385,"score_gpt":0.28623527109359637,"score_spread":0.2436371511385725,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3030953462","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32141113,0.0006063317,0.60206187,0.001804713,0.00063860137,0.00068545394,0.007950062,0.03229287,0.03254899],"genre_scores_gemma":[0.8115838,0.00023769749,0.16619249,0.0005350019,0.00012789329,0.00024745282,0.0058583925,0.0003465249,0.014870807],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998373,0.000023275934,0.000013342824,0.00003466983,0.000075908734,0.000015507763],"domain_scores_gemma":[0.9997695,0.00003600738,0.00002208518,0.000024471445,0.00013259426,0.000015347436],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037680147,0.00052434887,0.00028050848,0.0006591675,0.0002669343,0.0004824276,0.00057617144,0.0004807672,0.0061397273],"category_scores_gemma":[0.00078017457,0.00015602788,0.0003564449,0.00045415893,0.00020132256,0.0008172083,0.00052571134,0.00048007845,0.0016044413],"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.0007699228,0.00034389432,0.012523085,0.000365344,0.00023157346,0.00064045796,0.00025049498,0.035190556,0.11623711,0.00471204,0.07204878,0.75668675],"study_design_scores_gemma":[0.00003099791,0.00021881745,0.013513223,0.000028730867,0.000060424267,0.00019937965,0.00009858456,0.9240335,0.045791026,0.004113465,0.011848359,0.00006349068],"about_ca_topic_score_codex":0.0043697096,"about_ca_topic_score_gemma":0.0054427898,"teacher_disagreement_score":0.0061397273,"about_ca_system_score_codex":0.00038592744,"about_ca_system_score_gemma":0.00030879345,"threshold_uncertainty_score":0.020539403},"labels":[],"label_agreement":null},{"id":"W3036156748","doi":"10.1002/spe.2847","title":"Service offloading oriented edge server placement in smart farming","year":2020,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"IoT and Edge/Fog Computing","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brandon University","funders":"National Key Research and Development Program of China; National Natural Science Foundation of China","keywords":"Computer science; Service (business); Automation; Enhanced Data Rates for GSM Evolution; Server; Agriculture; Edge computing; Distributed computing; Computer network; Telecommunications; Engineering; Business","score_opus":0.027791462395549887,"score_gpt":0.2791383117747547,"score_spread":0.2513468493792048,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3036156748","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29503107,0.00055566174,0.68926054,0.00040505212,0.00022685924,0.00015291153,0.00012843315,0.0022677067,0.011971818],"genre_scores_gemma":[0.9175865,0.00015502998,0.07893563,0.00010352892,0.00002711237,0.000026166774,0.000115160496,0.00006050975,0.002990341],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996699,0.00005948654,0.000014616936,0.00008626745,0.00007200158,0.00009769427],"domain_scores_gemma":[0.9996922,0.00007584866,0.000026197426,0.00007988,0.00007386748,0.000052020463],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028498736,0.00052536296,0.00043870628,0.00032448475,0.0007303624,0.0007279689,0.0007695485,0.00069660635,0.0020963298],"category_scores_gemma":[0.0006063487,0.0001789155,0.00022111533,0.00054397027,0.00036930238,0.0010196281,0.0006710943,0.00034309126,0.000616814],"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.0006821804,0.00038236668,0.0039749206,0.00020023434,0.00005481157,0.0013943741,0.00037591413,0.5254986,0.13698979,0.019457398,0.010779721,0.30020958],"study_design_scores_gemma":[0.00002198633,0.00011141562,0.0010045194,0.000005924729,0.000010658442,0.00018172833,0.00017454359,0.9768737,0.011956874,0.0057408432,0.0039027159,0.00001501239],"about_ca_topic_score_codex":0.0024698114,"about_ca_topic_score_gemma":0.0032596688,"teacher_disagreement_score":0.0024698114,"about_ca_system_score_codex":0.0004905641,"about_ca_system_score_gemma":0.000572685,"threshold_uncertainty_score":0.0070129037},"labels":[],"label_agreement":null},{"id":"W3083808844","doi":"10.1002/spe.2890","title":"<scp>HEART</scp>: Unrelated parallel machines problem with precedence constraints for task scheduling in cloud computing using heuristic and <scp>meta‐heuristic</scp> algorithms","year":2020,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Cloud Computing and Resource Management","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Job shop scheduling; Cloud computing; Scheduling (production processes); Mathematical optimization; Integer programming; Distributed computing; Minification; Algorithm; Heuristic; Mathematics; Schedule; Artificial intelligence","score_opus":0.03263300013686179,"score_gpt":0.2857722644351643,"score_spread":0.2531392642983025,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3083808844","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.049891423,0.0010458085,0.938588,0.00084941776,0.00019203972,0.00026104777,0.00020415304,0.00023038857,0.0087376535],"genre_scores_gemma":[0.6137877,0.0010092107,0.37947053,0.0002023855,0.00012948262,0.0003508397,0.00032687606,0.000107468295,0.0046154126],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99957114,0.00018594864,0.000018494682,0.000047692476,0.00009980135,0.00007683413],"domain_scores_gemma":[0.99930596,0.00042386513,0.00008258867,0.00003309192,0.00009835737,0.00005606971],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001121663,0.0006916493,0.0007284654,0.0008517839,0.0006944802,0.0012151737,0.0009115213,0.00091541355,0.0020132535],"category_scores_gemma":[0.0014544548,0.00036961996,0.0008257527,0.0012664475,0.00048604823,0.00062288763,0.0004708132,0.0008495107,0.00018085816],"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.000036629142,0.000032067368,0.0001881276,0.00006856812,0.000019735533,0.00006776451,0.000015757754,0.9794601,0.00076380034,0.0053946874,0.0013695656,0.012583197],"study_design_scores_gemma":[0.000006937641,0.000012776457,0.000052613424,0.000008232856,0.000004316134,0.000011262428,0.0000127135945,0.9969357,0.00034682322,0.0021038079,0.0005017764,0.0000029464848],"about_ca_topic_score_codex":0.014063972,"about_ca_topic_score_gemma":0.008915044,"teacher_disagreement_score":0.014063972,"about_ca_system_score_codex":0.0011906594,"about_ca_system_score_gemma":0.0029119514,"threshold_uncertainty_score":0.027964234},"labels":[],"label_agreement":null},{"id":"W3083878797","doi":"10.1002/spe.2889","title":"Performance analysis of distributed storage clusters based on kernel and userspace traces","year":2020,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Advanced Data Storage Technologies","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Tracing; Distributed computing; Scalability; Debugging; Replication (statistics); Queue; Parallel computing; Operating system; Computer network","score_opus":0.018964038167925034,"score_gpt":0.2719575905685418,"score_spread":0.2529935524006168,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3083878797","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97453463,0.000071444934,0.022222066,0.000052076186,0.0000075446032,0.00002150262,0.00014617432,0.0016681688,0.0012762378],"genre_scores_gemma":[0.9963857,0.000014200814,0.003279146,0.000002254244,0.0000018521415,0.0000074428553,0.000113345435,0.000039744682,0.00015621932],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.99924576,0.00017226468,0.000041264622,0.00012319846,0.000308319,0.00010927079],"domain_scores_gemma":[0.9957272,0.0019270456,0.00040837048,0.00081733626,0.0009072524,0.00021294037],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00120324,0.0005066927,0.00038872662,0.0015513942,0.00043884426,0.0009327857,0.00071641634,0.00037797267,0.00087927026],"category_scores_gemma":[0.004467714,0.00021793183,0.00033231458,0.0013899726,0.0005597427,0.00080026354,0.0005907583,0.00053699274,0.00014132333],"study_design_candidate":"observational","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.0012465792,0.0003503203,0.071763456,0.00012515004,0.00013437861,0.00031008763,0.0007942229,0.8216031,0.03791507,0.0064268652,0.0012811949,0.058049623],"study_design_scores_gemma":[0.000008193092,0.000090602865,0.0063195284,0.0000032197904,0.000010009155,0.00003247296,0.00006510141,0.9847051,0.007857107,0.0006739693,0.0002251084,0.000009545865],"about_ca_topic_score_codex":0.00717396,"about_ca_topic_score_gemma":0.00239416,"teacher_disagreement_score":0.00717396,"about_ca_system_score_codex":0.0012397493,"about_ca_system_score_gemma":0.00075415085,"threshold_uncertainty_score":0.014264405},"labels":[],"label_agreement":null},{"id":"W3091953753","doi":"10.1002/spe.2920","title":"Validating UTF‐8 in less than one instruction per byte","year":2020,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Digital Filter Design and Implementation","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université TÉLUQ; Université du Québec à Montréal","funders":"National Research Council Canada","keywords":"Byte; Open source; Work (physics); Lazy evaluation","score_opus":0.072257944177949,"score_gpt":0.3111429900828187,"score_spread":0.2388850459048697,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3091953753","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.048810683,0.0007739745,0.50869787,0.00053103204,0.0009617528,0.0003060634,0.0024765825,0.42620295,0.011239027],"genre_scores_gemma":[0.45132285,0.00043529345,0.42694786,0.0015745165,0.00030506763,0.00079941866,0.010929991,0.07570694,0.03197799],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9940288,0.00090897665,0.0007254012,0.00089980545,0.002774612,0.0006623057],"domain_scores_gemma":[0.97944653,0.007449494,0.0012616252,0.0063279797,0.0052252533,0.000289174],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004201851,0.0020617093,0.00094489276,0.0020713825,0.00122583,0.002770673,0.0029632472,0.0017019276,0.044195767],"category_scores_gemma":[0.029348355,0.0010065531,0.0008994738,0.0011977365,0.001455801,0.0041470155,0.002340168,0.0017491233,0.030450122],"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.0037606289,0.00037219716,0.011858617,0.0013133128,0.00018823329,0.00087208435,0.0013451227,0.006347082,0.14203362,0.01593733,0.13504547,0.6809263],"study_design_scores_gemma":[0.00030318735,0.0004975133,0.004039049,0.0004835372,0.00011178206,0.001045632,0.00027889354,0.04958464,0.7135363,0.009070492,0.22076756,0.00028138317],"about_ca_topic_score_codex":0.00296512,"about_ca_topic_score_gemma":0.002393772,"teacher_disagreement_score":0.044195767,"about_ca_system_score_codex":0.0013682579,"about_ca_system_score_gemma":0.0023471364,"threshold_uncertainty_score":0.14784956},"labels":[],"label_agreement":null},{"id":"W3092300773","doi":"10.1002/spe.2907","title":"Practical dynamic reconstruction of control flow graphs","year":2020,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":25,"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":"Fundação de Amparo à Pesquisa do Estado de Minas Gerais; Conselho Nacional de Desenvolvimento Científico e Tecnológico","keywords":"Executable; Computer science; Debugging; Spec#; Programming language; Control flow graph; Dataflow; Control flow; Symbolic execution; Static analysis; Machine code; Scripting language; Binary number; Data-flow analysis; Control flow analysis; Code (set theory); Theoretical computer science; Compiler; Data flow diagram; Software; Arithmetic; Programming paradigm; Declarative programming","score_opus":0.01764990418475308,"score_gpt":0.2980036989792894,"score_spread":0.2803537947945363,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3092300773","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.058485243,0.0001972951,0.9193943,0.000238987,0.000041018448,0.00005786873,0.00036481483,0.016203297,0.005017003],"genre_scores_gemma":[0.58221155,0.00016498202,0.40840814,0.00012407488,0.000026065063,0.00007781012,0.0014634625,0.0022201932,0.0053036823],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988248,0.00022447722,0.000048658494,0.00024334351,0.00052430783,0.00013444756],"domain_scores_gemma":[0.9971654,0.0012203078,0.000221977,0.0008859089,0.00045371358,0.000052753985],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007173824,0.0007831051,0.0004220033,0.0015112378,0.0005155103,0.0009434543,0.00093772734,0.0006081353,0.005474156],"category_scores_gemma":[0.0048743677,0.00062277814,0.0005451893,0.0009855992,0.0009828124,0.0017301299,0.0013560454,0.0011730432,0.0011384571],"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.00056485966,0.000115753646,0.003971618,0.00033018243,0.00004611833,0.00036937048,0.00047422413,0.2134232,0.050223753,0.052788597,0.008984525,0.66870785],"study_design_scores_gemma":[0.00003650347,0.00006307384,0.00084371027,0.0000439365,0.00001742612,0.00021704567,0.00014868232,0.88727355,0.066109635,0.033409398,0.011804155,0.000032813685],"about_ca_topic_score_codex":0.0032664943,"about_ca_topic_score_gemma":0.0031399003,"teacher_disagreement_score":0.005474156,"about_ca_system_score_codex":0.0007970918,"about_ca_system_score_gemma":0.000924919,"threshold_uncertainty_score":0.018312871},"labels":[],"label_agreement":null},{"id":"W3093207174","doi":"10.1002/spe.2914","title":"Evaluating system architectures for driving range estimation and charge planning for electric vehicles","year":2020,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Electric Vehicles and Infrastructure","field":"Engineering","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Canadian Institute of Steel Construction","keywords":"Software deployment; Computer science; Range (aeronautics); Software; Latency (audio); Real-time computing; Cloud computing; Process (computing); Simulation; Embedded system; Engineering; Telecommunications","score_opus":0.024306582828284063,"score_gpt":0.3061994892382636,"score_spread":0.28189290640997955,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3093207174","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91382307,0.000497911,0.078811064,0.00014613045,0.00006744272,0.00019422421,0.000121331504,0.0018466826,0.004492132],"genre_scores_gemma":[0.9917972,0.00004972166,0.007573013,0.0000098211785,0.0000030505855,0.000027249485,0.000044141492,0.000014418612,0.00048133513],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99958783,0.00012790873,0.00002130511,0.00007299719,0.0001132328,0.00007678414],"domain_scores_gemma":[0.9989213,0.0003883844,0.000119906545,0.00011571652,0.00038432682,0.00007049944],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064292445,0.00074482884,0.0003204183,0.00056833995,0.00034166846,0.00059734646,0.0009119983,0.00037207542,0.0025925918],"category_scores_gemma":[0.0018451279,0.00020012297,0.00023163737,0.00038372338,0.00023621057,0.0007229411,0.00039547356,0.00030441413,0.00028164606],"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.0008627264,0.00035062642,0.008699482,0.00027837558,0.000082088816,0.00016495647,0.00010785648,0.8725736,0.02193864,0.0014276215,0.0011472988,0.092366666],"study_design_scores_gemma":[0.000043681197,0.000715312,0.0030577737,0.000011328024,0.00005603371,0.00003556964,0.00008182464,0.9843711,0.010509609,0.00036195252,0.00074537966,0.00001049389],"about_ca_topic_score_codex":0.006642683,"about_ca_topic_score_gemma":0.0049547,"teacher_disagreement_score":0.006642683,"about_ca_system_score_codex":0.0012929314,"about_ca_system_score_gemma":0.00078511244,"threshold_uncertainty_score":0.013208032},"labels":[],"label_agreement":null},{"id":"W3095846505","doi":"10.1002/spe.3039","title":"Quantum computing: A taxonomy, systematic review and future directions","year":2021,"lang":"en","type":"preprint","venue":"Software Practice and Experience","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":44,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Seneca Polytechnic","funders":"","keywords":"Quantum computer; Computer science; Quantum technology; Theoretical computer science; Quantum algorithm; Quantum information science; Quantum network; Qubit; Quantum information; Quantum entanglement; Quantum; Computational science; Computer engineering; Open quantum system; Physics; Quantum mechanics","score_opus":0.018336070322545223,"score_gpt":0.2798761817055284,"score_spread":0.26154011138298316,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3095846505","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00015931344,0.99729866,0.00039272683,0.0013582143,0.00020693592,0.00001778498,0.000046449593,0.000008925758,0.00051106134],"genre_scores_gemma":[0.0017281604,0.9966853,0.0005203916,0.00070525816,0.00018618701,0.000030150704,0.000052719286,0.000003732705,0.000088016895],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9974886,0.00071770826,0.00060438365,0.00031264237,0.00072570867,0.00015087516],"domain_scores_gemma":[0.9816118,0.013734161,0.0013784076,0.0003335772,0.002704457,0.00023748036],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0051285755,0.0009829627,0.002371014,0.014922545,0.0010331327,0.0034647041,0.0015847771,0.0017338399,0.0041216346],"category_scores_gemma":[0.016786631,0.000578146,0.0019940075,0.015687348,0.0023513574,0.0057438216,0.0018271732,0.0023059368,0.0006627761],"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.00008683842,0.00007170647,0.0013729081,0.19796816,0.00048732365,0.00028338478,0.0012462494,0.00088748656,0.00042016894,0.04624122,0.041115087,0.70981944],"study_design_scores_gemma":[0.000034084518,0.00012745743,0.0031212752,0.26550192,0.0011197374,0.0013456469,0.001613681,0.00071801175,0.0003568542,0.038982935,0.68697447,0.000103896644],"about_ca_topic_score_codex":0.006138211,"about_ca_topic_score_gemma":0.008299695,"teacher_disagreement_score":0.014922545,"about_ca_system_score_codex":0.0036044028,"about_ca_system_score_gemma":0.012240047,"threshold_uncertainty_score":0.027122855},"labels":[],"label_agreement":null},{"id":"W3096465442","doi":"10.1002/spe.2929","title":"Root causing, detecting, and fixing flaky tests: State of the art and future roadmap","year":2020,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Software Testing and Debugging Techniques","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brandon University; University of Guelph; University of Guelph-Humber","funders":"","keywords":"Pace; Root cause; Software deployment; Test (biology); Field (mathematics); Computer science; Root (linguistics); Engineering; Data science; Software; Engineering management; Software engineering; Operations management","score_opus":0.016750706809614355,"score_gpt":0.2725751747409247,"score_spread":0.2558244679313103,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3096465442","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021416496,0.97667706,0.011913887,0.005028501,0.00047131753,0.00010237458,0.000104464445,0.0002280186,0.003332792],"genre_scores_gemma":[0.030990623,0.93528235,0.028969929,0.002194962,0.00075502135,0.00018437843,0.0004171135,0.00007140089,0.0011342815],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99255365,0.0023103775,0.000916176,0.0012380532,0.002572442,0.000409303],"domain_scores_gemma":[0.92818105,0.04969717,0.0043386663,0.0018842074,0.014790902,0.0011079168],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01412195,0.0016826863,0.0017715236,0.009353181,0.0007912846,0.004579197,0.0035757448,0.0035283642,0.005459324],"category_scores_gemma":[0.025605418,0.00077619904,0.0019500157,0.0055131237,0.002280566,0.009019743,0.0018547882,0.002737615,0.0017489251],"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.000119121185,0.00022339761,0.0028308204,0.018246338,0.000105010055,0.000091527654,0.00037396883,0.0015105571,0.0011932233,0.01000656,0.008221201,0.9570782],"study_design_scores_gemma":[0.0001109489,0.002025121,0.0121989,0.10729045,0.0020738433,0.0020928294,0.0063292817,0.019268775,0.008748109,0.060534377,0.77890533,0.0004219422],"about_ca_topic_score_codex":0.0050029587,"about_ca_topic_score_gemma":0.0038488663,"teacher_disagreement_score":0.01412195,"about_ca_system_score_codex":0.0021289142,"about_ca_system_score_gemma":0.0076879645,"threshold_uncertainty_score":0.07468492},"labels":[],"label_agreement":null},{"id":"W3096794928","doi":"10.1002/spe.2915","title":"A graph‐based convolutional neural network stock price prediction with leading indicators","year":2020,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Stock Market Forecasting Methods","field":"Decision Sciences","cited_by":63,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brandon University","funders":"","keywords":"Computer science; Stock market; Convolutional neural network; Stock (firearms); Artificial neural network; Futures contract; Trading strategy; Machine learning; Artificial intelligence; Finance; Economics; Engineering","score_opus":0.09107486337675993,"score_gpt":0.3796336706920618,"score_spread":0.2885588073153018,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3096794928","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4722148,0.0018184265,0.51493675,0.0008520331,0.00035306445,0.00011956626,0.00077129464,0.0026844312,0.0062495964],"genre_scores_gemma":[0.95751476,0.0002947615,0.037250027,0.00012924912,0.000038716906,0.000039081013,0.0007316591,0.000024189265,0.003977599],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998404,0.00001866821,0.000009712993,0.000051193227,0.000040614177,0.000039380644],"domain_scores_gemma":[0.99972624,0.00008599598,0.00002448061,0.000021901416,0.000121178615,0.000020223073],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044514437,0.0007001104,0.00049562263,0.0007330142,0.00029174003,0.00043855573,0.00085378124,0.0006575866,0.001187802],"category_scores_gemma":[0.0009907618,0.00027834234,0.0005056156,0.0006943392,0.00020908394,0.00059685024,0.00038214546,0.00064454164,0.00021399811],"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.0002534786,0.00017773203,0.006163446,0.000055041808,0.00010526599,0.00011759845,0.000029645431,0.77791846,0.005913205,0.0016786018,0.0033024377,0.2042851],"study_design_scores_gemma":[0.000001906852,0.000008061375,0.00024273478,0.0000011632244,0.000004980532,0.000002532991,0.0000010837865,0.9991598,0.00039190336,0.00012305999,0.00006147237,0.0000013789742],"about_ca_topic_score_codex":0.04553818,"about_ca_topic_score_gemma":0.030517502,"teacher_disagreement_score":0.04553818,"about_ca_system_score_codex":0.0009904408,"about_ca_system_score_gemma":0.0010054058,"threshold_uncertainty_score":0.09054625},"labels":[],"label_agreement":null},{"id":"W3107081217","doi":"10.1002/spe.2925","title":"Advanced control‐flow and concurrency in C∀","year":2020,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"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","keywords":"Computer science; Concurrency; POSIX Threads; Mutual exclusion; Programming language; Control flow; Concurrency control; Compiler; Synchronization (alternating current); Programmer; Concurrent object-oriented programming; Concurrent computing; Deadlock; Exception handling; Non-lock concurrency control; Distributed computing; Reactive programming; Distributed concurrency control; Programming paradigm; Thread (computing); Inductive programming","score_opus":0.01409728627202044,"score_gpt":0.2831058411201934,"score_spread":0.26900855484817293,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3107081217","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0539321,0.00030573184,0.9231024,0.00033991155,0.000083494175,0.0000677676,0.000072381496,0.0035118584,0.018584307],"genre_scores_gemma":[0.5979586,0.00052510586,0.3860929,0.000374182,0.00015886378,0.00012658129,0.0001852374,0.0012292742,0.0133491475],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99850464,0.00027136676,0.00010809594,0.00023964277,0.00067867676,0.00019757176],"domain_scores_gemma":[0.99714124,0.0011912457,0.0003021573,0.00070633314,0.0005383969,0.00012070955],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017742333,0.00046128433,0.00027373235,0.00062990264,0.00064300623,0.0019615663,0.0010302966,0.0003968089,0.0024784235],"category_scores_gemma":[0.0028278036,0.00043227308,0.00045594436,0.0006298732,0.0017741674,0.00143378,0.0010280326,0.0013651638,0.0005180518],"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.00056712906,0.00014172157,0.004023868,0.00036778816,0.000038158254,0.00071969064,0.0010126699,0.07046196,0.05237624,0.62828153,0.008012663,0.23399651],"study_design_scores_gemma":[0.00019941224,0.00039626026,0.0031987214,0.00022523606,0.00012486524,0.0013257989,0.00016230658,0.33823454,0.14638355,0.30940598,0.20012546,0.00021798722],"about_ca_topic_score_codex":0.0049285847,"about_ca_topic_score_gemma":0.0033567792,"teacher_disagreement_score":0.0049285847,"about_ca_system_score_codex":0.00085920474,"about_ca_system_score_gemma":0.001663602,"threshold_uncertainty_score":0.009799778},"labels":[],"label_agreement":null},{"id":"W3113266938","doi":"10.1002/spe.2936","title":"ThingsMigrate: Platform‐independent migration of stateful JavaScript Internet of Things applications","year":2020,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"IoT and Edge/Fog Computing","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure; University of British Columbia","funders":"Institute for Computing, Information and Cognitive Systems; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada; Intel Corporation","keywords":"Computer science; JavaScript; JSON; Operating system; Cloud computing; Overhead (engineering); Embedded system; Distributed computing; World Wide Web","score_opus":0.021830159478925956,"score_gpt":0.2654130381755257,"score_spread":0.24358287869659973,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3113266938","genre_codex":"methods","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29082766,0.00067926454,0.3795223,0.00062755146,0.00085549866,0.000681151,0.00069581333,0.315416,0.010694724],"genre_scores_gemma":[0.78471476,0.00030180783,0.18249856,0.00070605124,0.00010289079,0.00031455874,0.0027711203,0.018386183,0.010204128],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9989876,0.00015905571,0.00008003424,0.00021300983,0.0004081966,0.00015209484],"domain_scores_gemma":[0.9976451,0.000514239,0.00024639256,0.0009749234,0.00038723013,0.00023209612],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010669626,0.001208609,0.0003383197,0.0005273935,0.00036965747,0.0010003309,0.0021152627,0.0009307687,0.0024264788],"category_scores_gemma":[0.0038034967,0.0007121673,0.00066847133,0.00033847473,0.0006688735,0.0015060604,0.0019234355,0.0018856693,0.0011090317],"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.004310695,0.002131333,0.023149552,0.0009494687,0.0005688905,0.0028580127,0.0026649875,0.07558492,0.40558586,0.011472905,0.0815169,0.38920653],"study_design_scores_gemma":[0.00068788195,0.0009780825,0.013839563,0.00016542469,0.00012169429,0.0008968105,0.0003443097,0.64102775,0.2542888,0.0052923965,0.082037374,0.00032000468],"about_ca_topic_score_codex":0.0013349393,"about_ca_topic_score_gemma":0.0012067282,"teacher_disagreement_score":0.0024264788,"about_ca_system_score_codex":0.0003778448,"about_ca_system_score_gemma":0.0006258923,"threshold_uncertainty_score":0.008117378},"labels":[],"label_agreement":null},{"id":"W3125503078","doi":"10.1002/spe.2984","title":"Number parsing at a gigabyte per second","year":2021,"lang":"en","type":"preprint","venue":"Software Practice and Experience","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université TÉLUQ; Université du Québec à Montréal","funders":"","keywords":"Decimal; Computer science; Parsing; Arithmetic; IEEE floating point; Bottleneck; Floating point; Binary number; Software; Algorithm; Mathematics; Operating system; Programming language; Embedded system","score_opus":0.027065916225519984,"score_gpt":0.33769450273096907,"score_spread":0.3106285865054491,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3125503078","genre_codex":"methods","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020426968,0.0010785701,0.6439728,0.0015034406,0.0019562594,0.00027035267,0.00977477,0.26651123,0.054505628],"genre_scores_gemma":[0.2151141,0.00091463694,0.65269774,0.0011994287,0.0005282,0.00047624766,0.031998783,0.026073134,0.0709977],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99796295,0.00021489614,0.00020637624,0.00047393554,0.0009303216,0.00021150094],"domain_scores_gemma":[0.996653,0.00077112817,0.00017260094,0.0010924434,0.0011648657,0.00014599289],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010689975,0.0016534509,0.0010947682,0.0027099447,0.0010695782,0.004232982,0.0018485519,0.0012743294,0.055063438],"category_scores_gemma":[0.009635409,0.00081368943,0.00070984056,0.002913242,0.00065834785,0.0040582833,0.0022098739,0.0016442005,0.042464126],"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.0009165793,0.000114832364,0.0021595387,0.00042116124,0.00007647982,0.000627008,0.0004019707,0.007908079,0.025823232,0.0567649,0.37433085,0.53045547],"study_design_scores_gemma":[0.00017603216,0.00011586781,0.002420478,0.0002486511,0.00005229988,0.00073541165,0.00028790376,0.15226826,0.10755589,0.11814623,0.6178109,0.00018208896],"about_ca_topic_score_codex":0.002561329,"about_ca_topic_score_gemma":0.0018867942,"teacher_disagreement_score":0.055063438,"about_ca_system_score_codex":0.0010497615,"about_ca_system_score_gemma":0.001564969,"threshold_uncertainty_score":0.18420559},"labels":[],"label_agreement":null},{"id":"W3174187495","doi":"10.1002/spe.3005","title":"Benchmarking and learning garbage collection delays for resource‐restricted graphical user interfaces","year":2021,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":2,"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 New Brunswick; IBM (Canada)","funders":"","keywords":"Computer science; Garbage collection; Benchmarking; Graphical user interface; Benchmark (surveying); Operating system; Resource (disambiguation); Cloud computing; Java; Interface (matter); Database; Garbage; Embedded system; Programming language","score_opus":0.01363180698335234,"score_gpt":0.2815275982120186,"score_spread":0.26789579122866625,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3174187495","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9537938,0.0018508782,0.020860385,0.00041137627,0.00031087216,0.00016175075,0.0032641708,0.01632186,0.0030249357],"genre_scores_gemma":[0.94701344,0.00038279602,0.042078175,0.00013393661,0.0000682257,0.0001726368,0.008282091,0.0011486522,0.000720098],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9951197,0.0013656905,0.00048633406,0.0014088695,0.0011025862,0.0005167417],"domain_scores_gemma":[0.97395384,0.016153371,0.0016941071,0.0044473126,0.0029453477,0.00080608716],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0044442825,0.0025189153,0.0011461388,0.0031964537,0.0009253381,0.0018029647,0.0034577635,0.001228837,0.0010369483],"category_scores_gemma":[0.02903516,0.00080815906,0.0010694009,0.0033012095,0.0015213318,0.0031616027,0.0013838203,0.002026551,0.00065673166],"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.006939045,0.003314317,0.06756416,0.0023652394,0.00065981835,0.0003928218,0.0009886469,0.55042034,0.025089918,0.0064883567,0.043459374,0.29231793],"study_design_scores_gemma":[0.00028778982,0.0008571578,0.017306553,0.000081251455,0.00009924111,0.00011400935,0.00033481963,0.9472979,0.02394104,0.004602728,0.004994132,0.000083322695],"about_ca_topic_score_codex":0.014975392,"about_ca_topic_score_gemma":0.0161411,"teacher_disagreement_score":0.014975392,"about_ca_system_score_codex":0.002610504,"about_ca_system_score_gemma":0.0023146935,"threshold_uncertainty_score":0.029776454},"labels":[],"label_agreement":null},{"id":"W3201160209","doi":"10.1002/spe.3036","title":"Transcoding billions of Unicode characters per second with SIMD instructions","year":2021,"lang":"en","type":"preprint","venue":"Software Practice and Experience","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université TÉLUQ; Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Transcoding; Computer science; SIMD; Unicode; Software; Operating system; Artificial intelligence","score_opus":0.017942660879024883,"score_gpt":0.2716954210409309,"score_spread":0.253752760161906,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3201160209","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09833076,0.001847837,0.842979,0.000860233,0.0018437426,0.00023864851,0.0018057782,0.02907062,0.023023354],"genre_scores_gemma":[0.3538951,0.0010620729,0.61263394,0.00053269335,0.00039948037,0.00031325582,0.0043319105,0.002898053,0.02393346],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994099,0.000051969728,0.00006338788,0.000088787,0.00035067913,0.00003534405],"domain_scores_gemma":[0.99798065,0.0005324446,0.00009412211,0.0005542192,0.0007771972,0.000061363586],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000463704,0.0009337136,0.00045110783,0.0016962336,0.00039175112,0.0010102345,0.00079871924,0.0005296963,0.012158847],"category_scores_gemma":[0.0046336576,0.0002502087,0.00034479695,0.001756345,0.0005825909,0.0011866145,0.0011526006,0.00076892093,0.0052587166],"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.0007774851,0.0001299958,0.0017587114,0.00043812202,0.00010064599,0.0007074779,0.00054864347,0.020155352,0.124866,0.019795833,0.043090016,0.7876318],"study_design_scores_gemma":[0.00012701016,0.0002838195,0.0020176487,0.00017694494,0.00009029589,0.0017107873,0.00034895516,0.4198053,0.41465262,0.027840912,0.13285382,0.00009194625],"about_ca_topic_score_codex":0.0011394705,"about_ca_topic_score_gemma":0.0010606347,"teacher_disagreement_score":0.012158847,"about_ca_system_score_codex":0.00039949216,"about_ca_system_score_gemma":0.00036389404,"threshold_uncertainty_score":0.0406754},"labels":[],"label_agreement":null},{"id":"W4205562962","doi":"10.1002/spe.2989","title":"Issue Information","year":2022,"lang":"en","type":"paratext","venue":"Software Practice and Experience","topic":"Software Engineering Techniques and Practices","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 Victoria","funders":"","keywords":"Citation; Computer science; Information retrieval; World Wide Web","score_opus":0.010732839598805057,"score_gpt":0.2886052044643847,"score_spread":0.27787236486557965,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4205562962","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00020166571,0.00047599323,0.0007688588,0.0013370916,0.004894578,0.00020433926,0.0124532385,0.0019171421,0.97774714],"genre_scores_gemma":[0.0004939338,0.0003097898,0.00027150873,0.00046188448,0.00063109305,0.000060279337,0.0048875627,0.0005257113,0.99235815],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99893874,0.000111187204,0.00007271489,0.00017422443,0.00060124835,0.000101836784],"domain_scores_gemma":[0.99652416,0.000606757,0.00018480477,0.000516993,0.0013831876,0.0007840675],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0010847114,0.0017107724,0.0017127254,0.0069600805,0.0017389156,0.008828308,0.0019542323,0.002912584,0.9359226],"category_scores_gemma":[0.0068824734,0.00092569535,0.00088931876,0.0066790534,0.0005937331,0.0041516772,0.0024363026,0.0020517304,0.91039795],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021501457,0.000033790624,0.00005351266,0.00017232026,0.0000020844905,0.000018089888,0.000013919397,0.000039110506,0.00016131709,0.0019296332,0.96124595,0.036308784],"study_design_scores_gemma":[0.000016326981,0.000017827124,0.0002682908,0.000097081334,0.0000029111527,0.000024249071,0.000030082312,0.00007559346,0.00010637507,0.0012545724,0.99810046,0.000006212141],"about_ca_topic_score_codex":0.0020548003,"about_ca_topic_score_gemma":0.004100118,"teacher_disagreement_score":0.06407738,"about_ca_system_score_codex":0.0011031686,"about_ca_system_score_gemma":0.0020952306,"threshold_uncertainty_score":0.09139854},"labels":[],"label_agreement":null},{"id":"W4220683907","doi":"10.1002/spe.2991","title":"Issue Information","year":2022,"lang":"en","type":"paratext","venue":"Software Practice and Experience","topic":"Smart Cities and Technologies","field":"Engineering","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 Victoria","funders":"","keywords":"Citation; Computer science; World Wide Web; Software; Information retrieval; Programming language","score_opus":0.009063548545613724,"score_gpt":0.25087173156979325,"score_spread":0.24180818302417953,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4220683907","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00018247162,0.00031214938,0.0005841802,0.001209476,0.0034356187,0.00016935714,0.019280428,0.0015651865,0.97326106],"genre_scores_gemma":[0.0005653798,0.00025457953,0.000256597,0.00047795748,0.00048761797,0.00007314632,0.007053401,0.0005513979,0.99027985],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99889934,0.00010647961,0.000071929346,0.00017199406,0.00063566753,0.00011461066],"domain_scores_gemma":[0.9960641,0.0007313945,0.00019618255,0.0005153257,0.0016839883,0.0008090351],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0011949815,0.0015114292,0.0014004282,0.0074472306,0.0017806938,0.0083945915,0.0017617497,0.0029182448,0.93493783],"category_scores_gemma":[0.008095755,0.0008467432,0.00093266444,0.0071745417,0.000583097,0.0043647685,0.0023779857,0.0020507767,0.89689773],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001757887,0.000029336772,0.00007027881,0.00013946346,0.0000015874728,0.000016842032,0.000020361804,0.000028210503,0.00009637457,0.0023664604,0.97096664,0.026246948],"study_design_scores_gemma":[0.000013988979,0.000012536518,0.00031730038,0.00009120454,0.0000024418894,0.000019472758,0.000042308537,0.00006382539,0.00007637975,0.0013834905,0.99797136,0.000005728328],"about_ca_topic_score_codex":0.00331579,"about_ca_topic_score_gemma":0.006678924,"teacher_disagreement_score":0.065062165,"about_ca_system_score_codex":0.0013640722,"about_ca_system_score_gemma":0.0024091683,"threshold_uncertainty_score":0.09280318},"labels":[],"label_agreement":null},{"id":"W4229542741","doi":"10.1002/spe.915","title":"Scopira: an open source C++ framework for biomedical data analysis applications","year":2008,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Scientific Computing and Data Management","field":"Decision Sciences","cited_by":6,"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 Manitoba; National Research Council Institute for Biodiagnostics","funders":"","keywords":"Porting; Computer science; Visualization; Extensibility; Programming language; Interface (matter); Software engineering; Object-oriented programming; Graphical user interface; Software framework; Open source; Software; Generic programming; Data visualization; User interface; Software development; Data mining; Operating system; Component-based software engineering","score_opus":0.32599287043697356,"score_gpt":0.5155856000035914,"score_spread":0.18959272956661788,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4229542741","genre_codex":"methods","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019710308,0.00034968258,0.88219315,0.00024619812,0.000111154164,0.0005250158,0.0016513183,0.10845229,0.004500092],"genre_scores_gemma":[0.023564052,0.00075823604,0.938269,0.0004847181,0.00011392565,0.001937437,0.0061617414,0.021400144,0.0073107583],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99803597,0.00032600915,0.00022777499,0.00035146673,0.0009033449,0.00015546258],"domain_scores_gemma":[0.9963522,0.0014522083,0.00031703463,0.0004822468,0.0011210308,0.00027539796],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032078489,0.002086142,0.0010237922,0.0018883251,0.00083580596,0.0023937537,0.004805794,0.0014245503,0.015490182],"category_scores_gemma":[0.010167603,0.0011812375,0.0014824428,0.001691337,0.0010058982,0.0016693758,0.002560744,0.002999866,0.010095541],"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.00093281316,0.00026749208,0.0016121563,0.0021081346,0.00033380053,0.0011368343,0.00070771016,0.06804687,0.03452558,0.041673798,0.23806463,0.6105902],"study_design_scores_gemma":[0.00064975297,0.00026409866,0.0026849038,0.0007338474,0.00014391243,0.0012438417,0.00008403822,0.4368424,0.0412475,0.045874007,0.46980506,0.0004266456],"about_ca_topic_score_codex":0.0050142393,"about_ca_topic_score_gemma":0.004144598,"teacher_disagreement_score":0.015490182,"about_ca_system_score_codex":0.00067838666,"about_ca_system_score_gemma":0.0037360128,"threshold_uncertainty_score":0.0518198},"labels":[],"label_agreement":null},{"id":"W4231080752","doi":"10.1002/spe.989","title":"WSB: a broker‐centric framework for quality‐driven web service discovery","year":2010,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Service-Oriented Architecture and Web Services","field":"Computer Science","cited_by":10,"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 Guelph","funders":"","keywords":"Web service; Computer science; World Wide Web; Web crawler; Web modeling; WS-Policy; Web standards; Data Web; Service (business); Web development; Web application security; Business","score_opus":0.015344414172173406,"score_gpt":0.3178846629302645,"score_spread":0.3025402487580911,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4231080752","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001278008,0.00024620333,0.98756117,0.00039377037,0.00008869484,0.00029477134,0.00016181679,0.008604072,0.0013714555],"genre_scores_gemma":[0.06904945,0.0008672254,0.9222658,0.00031489204,0.0001354667,0.00084381655,0.0014786121,0.001443114,0.0036016044],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9952152,0.0014156125,0.0005741712,0.00044696248,0.0020486906,0.000299325],"domain_scores_gemma":[0.99668854,0.0009600401,0.00033228807,0.00083881203,0.0006286109,0.0005516133],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011905207,0.0011083875,0.0019633053,0.0029498613,0.0018511183,0.0069670016,0.0049893972,0.0029835664,0.0043948167],"category_scores_gemma":[0.00972246,0.0017094479,0.0015956773,0.002906094,0.0026822789,0.0056848396,0.0050163614,0.0030999137,0.0030862498],"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.00068390457,0.0004080639,0.0017691974,0.0008360297,0.0004491127,0.0010004153,0.0009764493,0.17421557,0.017141027,0.5320044,0.059496615,0.21101925],"study_design_scores_gemma":[0.00020897965,0.00007083732,0.00019419544,0.00009291945,0.00006405602,0.00019415932,0.0000718774,0.8094554,0.0048042433,0.11031368,0.07442482,0.00010485474],"about_ca_topic_score_codex":0.012918307,"about_ca_topic_score_gemma":0.009077172,"teacher_disagreement_score":0.012918307,"about_ca_system_score_codex":0.0021658991,"about_ca_system_score_gemma":0.0044146692,"threshold_uncertainty_score":0.06296152},"labels":[],"label_agreement":null},{"id":"W4234559128","doi":"10.1002/spe.885","title":"Kwyjibo: automatic domain name generation","year":2008,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"User Authentication and Security Systems","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Domain (mathematical analysis); Natural language processing; Word (group theory); Artificial intelligence; Syllable; Quality (philosophy); Categorization; Information retrieval; Speech recognition; Linguistics; Mathematics","score_opus":0.030043723686563013,"score_gpt":0.2833711744353633,"score_spread":0.2533274507488003,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4234559128","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042154215,0.0005215621,0.8014436,0.00036972977,0.0005946727,0.0004573833,0.0019995323,0.14026392,0.012195399],"genre_scores_gemma":[0.2783327,0.00025966146,0.685356,0.00034240403,0.00013831333,0.00031292456,0.008872633,0.009481374,0.016903989],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99890554,0.00030718607,0.00009389101,0.00025792554,0.0003394787,0.000096020834],"domain_scores_gemma":[0.99793774,0.0006914123,0.00016583945,0.00060797506,0.00046181935,0.00013524672],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010071194,0.0008211022,0.00076111144,0.0015473239,0.0006177871,0.001470691,0.0013551726,0.00061692775,0.0232626],"category_scores_gemma":[0.0050658495,0.00045464758,0.0005533063,0.0011258267,0.0005355804,0.0022999966,0.0017721697,0.0009990633,0.0095127355],"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.0010973193,0.0002909776,0.0029755484,0.0007452853,0.00009105885,0.0007008445,0.00042912792,0.007467195,0.059938777,0.017985003,0.06736028,0.84091854],"study_design_scores_gemma":[0.00056532584,0.00039829314,0.003486401,0.000108957196,0.00013642762,0.0015234799,0.0004895642,0.6302413,0.19889192,0.040652912,0.12329622,0.0002091608],"about_ca_topic_score_codex":0.0009967795,"about_ca_topic_score_gemma":0.001094338,"teacher_disagreement_score":0.0232626,"about_ca_system_score_codex":0.00034602164,"about_ca_system_score_gemma":0.000594259,"threshold_uncertainty_score":0.077821136},"labels":[],"label_agreement":null},{"id":"W4237670884","doi":"10.1002/spe.809","title":"Developing a software toolkit for urban traffic modeling","year":2007,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Traffic control and management","field":"Engineering","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Parsing; Truck; Graphics; Software; Focus (optics); DEVS; Set (abstract data type); Traffic flow (computer networking); Section (typography); Software engineering; Simulation; Programming language; Computer graphics (images); Modeling and simulation; Operating system; Engineering","score_opus":0.02093312014426578,"score_gpt":0.2699426571657598,"score_spread":0.24900953702149403,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4237670884","genre_codex":"methods","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0041494677,0.000072387666,0.9155881,0.00008899515,0.000043008735,0.00019501067,0.00067338056,0.07596221,0.0032274292],"genre_scores_gemma":[0.07052151,0.00046399035,0.89833516,0.00008997719,0.000026315585,0.0008573808,0.0066280114,0.016094552,0.006983135],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99893194,0.00022778237,0.00015395338,0.00016193741,0.000441459,0.00008286048],"domain_scores_gemma":[0.99778855,0.0010266204,0.00012607237,0.00033256822,0.00055798684,0.00016814933],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021171384,0.0012408852,0.00096536166,0.0016091341,0.0007675056,0.0020286303,0.003118991,0.0007975875,0.010176563],"category_scores_gemma":[0.0060070255,0.0015486121,0.0016900413,0.0014196044,0.0007398718,0.0024693627,0.0034125228,0.001868352,0.0045718304],"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.0003377799,0.0003197057,0.0059984024,0.0016651554,0.0004057439,0.001728049,0.0020022963,0.35229287,0.021418279,0.10850519,0.09543766,0.4098889],"study_design_scores_gemma":[0.00015074009,0.0000841723,0.00089284364,0.0002150678,0.00008699533,0.0005942481,0.00020487086,0.7834874,0.013663133,0.033726897,0.16677144,0.000122313],"about_ca_topic_score_codex":0.0051052016,"about_ca_topic_score_gemma":0.004788977,"teacher_disagreement_score":0.010176563,"about_ca_system_score_codex":0.00084637624,"about_ca_system_score_gemma":0.0023279628,"threshold_uncertainty_score":0.034044027},"labels":[],"label_agreement":null},{"id":"W4238014149","doi":"10.1002/(issn)1097-024x","title":"Software: Practice and Experience","year":2006,"lang":"en","type":"paratext","venue":"Software Practice and Experience","topic":"Software Engineering Research","field":"Computer Science","cited_by":1222,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Software engineering; Computer science; Coding (social sciences); Software; Software development; World Wide Web; Data science; Operating system","score_opus":0.01775938229433564,"score_gpt":0.3186743183254481,"score_spread":0.30091493603111247,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4238014149","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0076748454,0.13384725,0.016411474,0.053793106,0.011981161,0.000083623636,0.00024829377,0.0012849203,0.7746753],"genre_scores_gemma":[0.04798666,0.074476615,0.0037458758,0.005221722,0.006726811,0.00014077664,0.00035337044,0.000927415,0.8604208],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9970475,0.000959662,0.00022855746,0.0004523738,0.0010343678,0.00027750857],"domain_scores_gemma":[0.99444443,0.0016855774,0.00021689071,0.000512054,0.0015961741,0.0015448586],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040483256,0.0018110013,0.0017967613,0.003886318,0.0033278326,0.017241081,0.0013046395,0.005066013,0.1405759],"category_scores_gemma":[0.008018508,0.0007542745,0.00057856966,0.0058601443,0.0047776136,0.015606838,0.008240465,0.004804713,0.075075716],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034376717,0.00009499649,0.00053493783,0.0009079705,0.000009736002,0.00023246536,0.0069256416,0.0002917197,0.0013395911,0.06535807,0.5847165,0.339554],"study_design_scores_gemma":[0.0000051285706,0.000030561965,0.0005031182,0.0006710716,0.0000034177108,0.00024291083,0.002029678,0.00012791775,0.00009376842,0.0075402227,0.9887416,0.000010558007],"about_ca_topic_score_codex":0.00078414194,"about_ca_topic_score_gemma":0.0018232368,"teacher_disagreement_score":0.1405759,"about_ca_system_score_codex":0.0017492283,"about_ca_system_score_gemma":0.002470998,"threshold_uncertainty_score":0.47027326},"labels":[],"label_agreement":null},{"id":"W4241301293","doi":"10.1002/spe.2780","title":"Introduction to the special issue on software engineering in practice","year":2019,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Software Engineering Techniques and Practices","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Kelowna General Hospital","funders":"","keywords":"Theme (computing); Software engineering; Software; Software development; Computer science; Engineering management; Engineering ethics; Engineering; World Wide Web","score_opus":0.007081510641552685,"score_gpt":0.26375310148477377,"score_spread":0.2566715908432211,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4241301293","genre_codex":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00045345322,0.03522535,0.0043280963,0.067891285,0.803205,0.00023194075,0.00075151306,0.00065163226,0.087261684],"genre_scores_gemma":[0.0031585444,0.03620171,0.0025503759,0.025679056,0.8002421,0.00033603937,0.0012078518,0.0009782988,0.129646],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9949215,0.0007707666,0.00062016526,0.0008632682,0.002411635,0.00041264485],"domain_scores_gemma":[0.97933125,0.009006126,0.0012739783,0.001554629,0.005429936,0.0034040487],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036038272,0.0026020552,0.0024842103,0.0056490074,0.003100208,0.013880935,0.002284086,0.006135303,0.15047453],"category_scores_gemma":[0.020005373,0.0009768268,0.0020505122,0.003828528,0.0026973921,0.008731865,0.005824768,0.00999939,0.08480057],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009155064,0.000021669139,0.000060466555,0.00019063488,0.0000043722443,0.000036180543,0.000082089,0.000045139885,0.00010181204,0.0027440612,0.96731323,0.029391196],"study_design_scores_gemma":[0.0000045092897,0.000024885749,0.00022523015,0.0003749587,0.0000035227267,0.00013228304,0.00006328201,0.000049286053,0.000032001906,0.0029448688,0.9961358,0.0000093666895],"about_ca_topic_score_codex":0.00089476525,"about_ca_topic_score_gemma":0.001675128,"teacher_disagreement_score":0.15047453,"about_ca_system_score_codex":0.002730385,"about_ca_system_score_gemma":0.003848983,"threshold_uncertainty_score":0.50338745},"labels":[],"label_agreement":null},{"id":"W4241491475","doi":"10.1002/spe.764","title":"Marking musical dictations using the edit distance algorithm","year":2006,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Music and Audio Processing","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Edit distance; Computer science; String searching algorithm; Parsing; Musical; Natural language processing; Musical notation; Domain (mathematical analysis); String (physics); Heuristics; Key (lock); Representation (politics); Context (archaeology); Approximate string matching; XML; Information retrieval; Artificial intelligence; Pattern matching; World Wide Web","score_opus":0.015043399693532265,"score_gpt":0.2822741897144808,"score_spread":0.26723079002094857,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4241491475","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033493236,0.00018794328,0.9559739,0.00010059985,0.000114273964,0.00019007892,0.0002603957,0.006352966,0.0033265774],"genre_scores_gemma":[0.14820778,0.000077039454,0.84716916,0.000048779086,0.000029367138,0.00008735035,0.0008773384,0.0003638942,0.0031393885],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9957125,0.000813589,0.0005808661,0.0010867786,0.0016179248,0.00018819497],"domain_scores_gemma":[0.9941791,0.0023075454,0.0004909029,0.0010054741,0.0018089896,0.0002080117],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015665225,0.0011585315,0.0010411638,0.0037866444,0.0009572191,0.0019261177,0.0025251014,0.0015373982,0.0063634017],"category_scores_gemma":[0.009468206,0.000396703,0.0007708362,0.0017861743,0.00069037074,0.0016436857,0.0015570244,0.0012809663,0.0031974304],"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.0003561022,0.000264533,0.0026068042,0.00025791346,0.00010604692,0.00041691208,0.00031898794,0.05923216,0.034346346,0.008725262,0.008639254,0.8847297],"study_design_scores_gemma":[0.00006864017,0.0002635981,0.0017182061,0.000039576065,0.000036588543,0.00070019247,0.00024489174,0.90015084,0.06887423,0.012483025,0.01534628,0.000073974916],"about_ca_topic_score_codex":0.0028630064,"about_ca_topic_score_gemma":0.002718312,"teacher_disagreement_score":0.0063634017,"about_ca_system_score_codex":0.0006507678,"about_ca_system_score_gemma":0.0009137779,"threshold_uncertainty_score":0.02128768},"labels":[],"label_agreement":null},{"id":"W4242553329","doi":"10.1002/spe.771","title":"Reliable user‐level rollback recovery implementation for multithreaded processes on windows","year":2006,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":2,"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 Regina","funders":"","keywords":"Thread (computing); Computer science; Rollback; Parallel computing; Operating system; Multithreading; Distributed computing; Programming language","score_opus":0.026561367234756005,"score_gpt":0.31544919085542117,"score_spread":0.2888878236206652,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4242553329","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4746748,0.0005649138,0.48203155,0.0003194569,0.0002073323,0.0002726361,0.000087882574,0.03761344,0.004228],"genre_scores_gemma":[0.9374042,0.0001102444,0.05798731,0.000043183198,0.000030026105,0.00006117619,0.00007110273,0.00045130186,0.0038413925],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994469,0.00008866421,0.00006699877,0.00007425189,0.00021429837,0.000108892964],"domain_scores_gemma":[0.9981237,0.00032010057,0.00019702344,0.0007312885,0.00041167947,0.00021612889],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010579147,0.00034088842,0.00048812205,0.00047517847,0.00049391,0.0013191315,0.0018673119,0.0005175664,0.00277584],"category_scores_gemma":[0.0028680558,0.00027501967,0.00022990532,0.00026534742,0.0005591987,0.0013448566,0.0012504315,0.00096043426,0.00056294247],"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.0065613436,0.00074017915,0.01150925,0.00045199625,0.0001414861,0.0020484223,0.0030461953,0.042584423,0.34361446,0.049053963,0.012015453,0.52823293],"study_design_scores_gemma":[0.0005767204,0.0008435502,0.0033956484,0.00007357765,0.00012737398,0.00045970356,0.00027789583,0.64810556,0.31483766,0.009227724,0.021963893,0.00011066464],"about_ca_topic_score_codex":0.002007666,"about_ca_topic_score_gemma":0.001344927,"teacher_disagreement_score":0.00277584,"about_ca_system_score_codex":0.00053384725,"about_ca_system_score_gemma":0.00064662314,"threshold_uncertainty_score":0.009286165},"labels":[],"label_agreement":null},{"id":"W4244983080","doi":"10.1002/spe.992","title":"A survey on statistical disclosure control and micro‐aggregation techniques for secure statistical databases","year":2010,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Privacy-Preserving Technologies in Data","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Field (mathematics); Perspective (graphical); Data aggregator; Data science; Control (management); Domain (mathematical analysis); Focus (optics); Database; Artificial intelligence; Wireless sensor network; Mathematics","score_opus":0.02898615087461885,"score_gpt":0.3419858605408235,"score_spread":0.31299970966620466,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4244983080","genre_codex":"methods","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009423014,0.19135787,0.7805118,0.004102184,0.00045224014,0.00018261798,0.00023919146,0.0005530222,0.013178091],"genre_scores_gemma":[0.32511127,0.23394585,0.43013567,0.0017767563,0.0035994332,0.00047534294,0.0006597246,0.00023260184,0.0040633795],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.97997665,0.007960553,0.0016810057,0.0015252488,0.008453163,0.00040349484],"domain_scores_gemma":[0.9647629,0.024094306,0.0027399827,0.0049273903,0.0031705764,0.00030488733],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.014861345,0.00088893453,0.0019555814,0.0052560857,0.0008887855,0.004983272,0.002452209,0.001984231,0.0022470506],"category_scores_gemma":[0.031873215,0.0007877883,0.0014216548,0.010372655,0.0025106957,0.0063425866,0.0021947015,0.002725076,0.00073057297],"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.00012298382,0.0001423054,0.0031934904,0.001939412,0.00021449517,0.00014732213,0.0003952043,0.018866561,0.0017369903,0.24421723,0.0083742095,0.72064984],"study_design_scores_gemma":[0.00008297269,0.0007251623,0.00517944,0.002659943,0.00027721154,0.003935323,0.00069233484,0.26036894,0.014751933,0.47639224,0.23468123,0.0002532614],"about_ca_topic_score_codex":0.0006985305,"about_ca_topic_score_gemma":0.00028753697,"teacher_disagreement_score":0.014861345,"about_ca_system_score_codex":0.0015693547,"about_ca_system_score_gemma":0.001837452,"threshold_uncertainty_score":0.07859522},"labels":[],"label_agreement":null},{"id":"W4245712643","doi":"10.1002/spe.751","title":"Compiler optimizations for processors with SIMD instructions","year":2006,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":5,"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 Victoria","funders":"Christian Doppler Forschungsgesellschaft","keywords":"SIMD; Computer science; Compiler; Pointer (user interface); Parallel computing; Programming language; Vectorization (mathematics); Computer hardware","score_opus":0.010510307612428589,"score_gpt":0.27195807063305705,"score_spread":0.26144776302062844,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4245712643","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10238481,0.00066044054,0.87706834,0.00033174234,0.00011983071,0.00012277073,0.00026085842,0.013209902,0.005841286],"genre_scores_gemma":[0.30053332,0.00023052236,0.69504905,0.000200958,0.000057646255,0.00014663364,0.00047776892,0.001160393,0.0021437854],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988285,0.00037794662,0.000094559226,0.00014401053,0.0004318153,0.00012315687],"domain_scores_gemma":[0.9978326,0.000855642,0.00030095284,0.0004480743,0.0005239049,0.000038872182],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009935182,0.00072757155,0.0006362789,0.0013825695,0.0007746812,0.0008438713,0.0008198383,0.0003498743,0.0028683587],"category_scores_gemma":[0.0029574893,0.00054011965,0.00070520496,0.001824328,0.00076053507,0.0010247725,0.00089803775,0.00071758375,0.0009500174],"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.0012127053,0.00018778109,0.0048418157,0.0005167249,0.00014002578,0.00068015803,0.0004038887,0.30167085,0.08669146,0.058355596,0.01645627,0.5288428],"study_design_scores_gemma":[0.00012001473,0.00017150019,0.00075772847,0.000047482208,0.000054858363,0.0001930952,0.00008215888,0.8567291,0.09776448,0.029012924,0.015033739,0.000033033684],"about_ca_topic_score_codex":0.00096927944,"about_ca_topic_score_gemma":0.002004076,"teacher_disagreement_score":0.0028683587,"about_ca_system_score_codex":0.0007894013,"about_ca_system_score_gemma":0.0011859179,"threshold_uncertainty_score":0.009595573},"labels":[],"label_agreement":null},{"id":"W4246053451","doi":"10.1002/spe.938","title":"Bridging concrete and abstract syntaxes in model‐driven engineering: a case of rule languages","year":2009,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Model-Driven Software Engineering Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Athabasca University","funders":"Athabasca University","keywords":"Computer science; Bridging (networking); Leverage (statistics); Programming language; Syntax; Context (archaeology); Software engineering; Natural language processing; Artificial intelligence","score_opus":0.010353935927396942,"score_gpt":0.27911964523147503,"score_spread":0.2687657093040781,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4246053451","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24435373,0.0003873088,0.74699295,0.0025454264,0.000043911932,0.00020606257,0.000061724575,0.000499088,0.0049098902],"genre_scores_gemma":[0.58829165,0.00017561414,0.41000655,0.0002895244,0.000015781898,0.0001866629,0.00008240452,0.00013430728,0.00081751123],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9587134,0.029791541,0.0022244635,0.0015588597,0.0070395647,0.00067218964],"domain_scores_gemma":[0.8259178,0.15143138,0.004283844,0.012276422,0.0050580297,0.0010325128],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.03335434,0.0005262523,0.0009864804,0.0014001597,0.0019366817,0.0063167405,0.0021497286,0.00347405,0.0014481222],"category_scores_gemma":[0.076340444,0.0009349915,0.00083147315,0.0020161518,0.0075285267,0.011894711,0.004575443,0.0045774,0.00024420905],"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.00068094453,0.0010342196,0.009414881,0.00089404517,0.00010421387,0.003989419,0.037874483,0.10386822,0.016558185,0.63633996,0.0020066556,0.18723479],"study_design_scores_gemma":[0.00024138596,0.00047672927,0.0020450351,0.00060419197,0.00009495067,0.0020932404,0.0079068765,0.50939757,0.03579946,0.40380728,0.037313227,0.00022008835],"about_ca_topic_score_codex":0.0023046953,"about_ca_topic_score_gemma":0.0020712377,"teacher_disagreement_score":0.03335434,"about_ca_system_score_codex":0.001805401,"about_ca_system_score_gemma":0.0019952385,"threshold_uncertainty_score":0.17639673},"labels":[],"label_agreement":null},{"id":"W4247213193","doi":"10.1002/spe.763","title":"Incremental frequency count—a post BWT‐stage for the Burrows–Wheeler compression algorithm","year":2006,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Stage (stratigraphy); Algorithm; Context (archaeology); Entropy (arrow of time); Data compression; Entropy encoding; Compression (physics); Computer science; Coding (social sciences); Mathematics; Statistics; Physics; Biology","score_opus":0.012877545573040378,"score_gpt":0.2808044728283498,"score_spread":0.2679269272553094,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4247213193","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.047900274,0.0004112665,0.939219,0.00024412415,0.00018096907,0.0003132184,0.00033315478,0.0055762976,0.0058216793],"genre_scores_gemma":[0.11832797,0.00020573582,0.86878175,0.00011574539,0.00012878218,0.00017234996,0.0011514861,0.0009469179,0.0101693515],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991584,0.000100132165,0.00006552271,0.00013883585,0.00045289722,0.000084326006],"domain_scores_gemma":[0.9981667,0.0006152499,0.00014508396,0.00047650433,0.00053253694,0.00006398301],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008136856,0.0007801928,0.0005056339,0.0019008694,0.0005425885,0.0015687526,0.0013589743,0.00074381806,0.012654918],"category_scores_gemma":[0.00419919,0.00040216208,0.00047272936,0.0014767935,0.00083427306,0.0019812617,0.001033652,0.0013807038,0.005537971],"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.00057614286,0.00011706715,0.0010757403,0.00013416173,0.000029362565,0.00021657383,0.0001984681,0.0056493,0.10246091,0.017719585,0.0077066775,0.86411595],"study_design_scores_gemma":[0.00022602521,0.0008499173,0.007943677,0.000107016094,0.00011340857,0.0015162413,0.0002501012,0.38110927,0.5135723,0.020575829,0.073571324,0.00016490168],"about_ca_topic_score_codex":0.002770092,"about_ca_topic_score_gemma":0.004490808,"teacher_disagreement_score":0.012654918,"about_ca_system_score_codex":0.0005287799,"about_ca_system_score_gemma":0.00084415,"threshold_uncertainty_score":0.042334974},"labels":[],"label_agreement":null},{"id":"W4248501463","doi":"10.1002/spe.839","title":"Oto, a generic and extensible tool for marking programming assignments","year":2007,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Software Testing and Debugging Techniques","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"Université du Québec à Montréal","keywords":"Computer science; Extensibility; Workload; Task (project management); Programming language; Automation; Process (computing); Software engineering; Source code; Code (set theory); Operating system; Engineering; Systems engineering","score_opus":0.028268078525108157,"score_gpt":0.32067617705254514,"score_spread":0.292408098527437,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4248501463","genre_codex":"methods","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016965512,0.00022893731,0.8483173,0.00021111016,0.00025586024,0.0010396406,0.0014843297,0.1247445,0.006752818],"genre_scores_gemma":[0.10959487,0.0005623594,0.8510106,0.00028257363,0.00015533928,0.0013329141,0.0065647704,0.016010223,0.014486388],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9967894,0.00059673924,0.000625644,0.00049013336,0.0012417907,0.00025631825],"domain_scores_gemma":[0.9866519,0.006301859,0.0015565845,0.0028116275,0.0015298541,0.0011482548],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038036972,0.0016987232,0.0010854081,0.003966409,0.000683181,0.0026700317,0.0029226507,0.0012541274,0.014624656],"category_scores_gemma":[0.024133924,0.0011285299,0.0009022567,0.0021019022,0.0010154558,0.003903323,0.0036398652,0.0014729019,0.0045234733],"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.0011217903,0.0007291697,0.0059064804,0.0014905066,0.00008183363,0.0015700524,0.0018569187,0.008382333,0.03824449,0.013462896,0.053350642,0.87380296],"study_design_scores_gemma":[0.001410539,0.0014496592,0.01615257,0.00175217,0.00028987156,0.006858051,0.0010575496,0.19091573,0.11013869,0.048338637,0.62073314,0.0009034106],"about_ca_topic_score_codex":0.0011897604,"about_ca_topic_score_gemma":0.0010782342,"teacher_disagreement_score":0.014624656,"about_ca_system_score_codex":0.0006017946,"about_ca_system_score_gemma":0.0018126899,"threshold_uncertainty_score":0.048924327},"labels":[],"label_agreement":null},{"id":"W4254434605","doi":"10.1002/spe.991","title":"Synchronization for fast and reentrant operating system kernel tracing","year":2010,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Computer science; Tracing; Interrupt; Kernel (algebra); Debugging; Linux kernel; Thread (computing); Synchronization (alternating current); Semaphore; Operating system; TRACE (psycholinguistics); Parallel computing; Real-time computing; Distributed computing; Embedded system; Computer network; Microcontroller","score_opus":0.010428097089244892,"score_gpt":0.275977691069655,"score_spread":0.26554959398041006,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4254434605","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04926009,0.00018881157,0.9429445,0.00010760775,0.000041119143,0.00006648592,0.000021423626,0.005582388,0.0017875485],"genre_scores_gemma":[0.61500895,0.00009315761,0.3817499,0.00004209134,0.000026758966,0.00007283406,0.00007640257,0.00073933887,0.0021905708],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9984341,0.00045511607,0.000120500175,0.00024769377,0.0005466015,0.00019605666],"domain_scores_gemma":[0.9967861,0.0011081437,0.00046771666,0.00097220106,0.0005051689,0.00016073346],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019341257,0.0005936462,0.0005882784,0.0010212642,0.0007719741,0.0013702614,0.0017625702,0.0005268862,0.0031221341],"category_scores_gemma":[0.0072652437,0.0005181155,0.00033105005,0.00060765416,0.00078866864,0.0014807464,0.0016623915,0.0011783475,0.0007772075],"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.0016016216,0.00027959025,0.0063393107,0.00027513728,0.0000695453,0.00033684814,0.0011796869,0.11308096,0.13781446,0.1662702,0.0060954965,0.5666571],"study_design_scores_gemma":[0.00013994705,0.00022849966,0.0007267253,0.00003410743,0.000037258735,0.00010776599,0.000072140865,0.894386,0.078107655,0.017273137,0.008847903,0.000038819067],"about_ca_topic_score_codex":0.002636398,"about_ca_topic_score_gemma":0.0020292955,"teacher_disagreement_score":0.0031221341,"about_ca_system_score_codex":0.0011675268,"about_ca_system_score_gemma":0.0020838086,"threshold_uncertainty_score":0.010444522},"labels":[],"label_agreement":null},{"id":"W4254604099","doi":"10.1002/spe.895","title":"Using XBDDs and ZBDDs in points‐to analysis","year":2008,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":4,"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; University of Waterloo","funders":"National Science Council","keywords":"Binary decision diagram; Computer science; Context (archaeology); Overhead (engineering); Model checking; Compiler; Metric (unit); Domain (mathematical analysis); Algorithm; Programming language; Theoretical computer science; Mathematics","score_opus":0.07586281004245486,"score_gpt":0.3804970797183182,"score_spread":0.3046342696758633,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4254604099","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026174258,0.0004124401,0.9702786,0.0001504879,0.000029444423,0.0000731645,0.00010697417,0.000978661,0.0017959347],"genre_scores_gemma":[0.25167993,0.0007980179,0.74450845,0.00015930826,0.000026668058,0.0002614506,0.00031206812,0.00033266176,0.0019214841],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9938525,0.002741208,0.00052354584,0.00054660364,0.002147322,0.0001888657],"domain_scores_gemma":[0.9842929,0.010523647,0.0015100046,0.0022655309,0.0012748723,0.00013297009],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041614557,0.0009985432,0.00068160455,0.0024374712,0.0006055889,0.0021574518,0.0012748252,0.0008139423,0.0031185194],"category_scores_gemma":[0.014485447,0.0006608895,0.0013535989,0.0018805732,0.0026153093,0.0047879866,0.002088015,0.0014838983,0.00044987793],"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.0009229416,0.00009974748,0.0036712706,0.0006753415,0.00014691113,0.00024850623,0.0005978768,0.26664,0.020898532,0.46051025,0.0020099396,0.2435786],"study_design_scores_gemma":[0.00028058156,0.00036885354,0.0007652767,0.00031432483,0.00019673191,0.00030298167,0.00020635307,0.5435672,0.077719405,0.34956384,0.02661935,0.00009516609],"about_ca_topic_score_codex":0.0038408467,"about_ca_topic_score_gemma":0.0033845922,"teacher_disagreement_score":0.0041614557,"about_ca_system_score_codex":0.0013009364,"about_ca_system_score_gemma":0.00133396,"threshold_uncertainty_score":0.02200818},"labels":[],"label_agreement":null},{"id":"W4288067616","doi":"10.1002/spe.3120","title":"Collaborative experience between scientific software projects using Agile Scrum development","year":2022,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Scientific Computing and Data Management","field":"Decision Sciences","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"British Columbia Institute of Technology; University of Sudbury; TRIUMF; Laurentian University","funders":"Office of Advanced Cyberinfrastructure; Division of Physics; Science and Technology Facilities Council; National Science Foundation","keywords":"Scrum; Agile software development; Software engineering; Software development; Computer science; Engineering management; Software; Engineering; Systems engineering; Process management; Operating system","score_opus":0.15709575075115986,"score_gpt":0.4174369574121704,"score_spread":0.26034120666101057,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4288067616","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":"methods","model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":"methods","domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8427302,0.0006158446,0.12426528,0.003371793,0.0003450262,0.00052922714,0.000079250705,0.0010036001,0.027059795],"genre_scores_gemma":[0.9345796,0.00034355215,0.056847602,0.00041568704,0.000050852486,0.00033093485,0.00011558138,0.000295584,0.007020632],"study_design_codex":"qualitative","study_design_gemma":"qualitative","domain_scores_codex":[0.971007,0.020554729,0.0008574615,0.001504782,0.00474719,0.0013288612],"domain_scores_gemma":[0.9522146,0.024117606,0.0041464446,0.005206128,0.0070552365,0.007260028],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.021063166,0.00097014336,0.0006747809,0.0019314776,0.006000671,0.0062934645,0.002598077,0.0021304179,0.0037511666],"category_scores_gemma":[0.04433477,0.00082697795,0.00093681284,0.0014040713,0.0044290847,0.005174462,0.009662492,0.0029206977,0.0012743936],"study_design_candidate":"qualitative","study_design_consensus":"qualitative","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.00048120006,0.0013624409,0.017199593,0.0008682422,0.00020694034,0.011405891,0.7405723,0.009097647,0.022114879,0.017348997,0.013179847,0.16616209],"study_design_scores_gemma":[0.00048206522,0.004066559,0.017716095,0.0017316103,0.00023001402,0.009422931,0.4772752,0.067065604,0.017565608,0.040030245,0.36359656,0.0008174884],"about_ca_topic_score_codex":0.001225362,"about_ca_topic_score_gemma":0.0018563404,"teacher_disagreement_score":0.97893685,"about_ca_system_score_codex":0.0020824573,"about_ca_system_score_gemma":0.0042566056,"threshold_uncertainty_score":0.11139399},"labels":[],"label_agreement":null},{"id":"W4307920660","doi":"10.1002/spe.3160","title":"NFVLearn: A multi‐resource, long short‐term memory‐based virtual network function resource usage prediction architecture","year":2022,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Software-Defined Networks and 5G","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ericsson (Canada); École de Technologie Supérieure; Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Resource (disambiguation); Distributed computing; Data mining; Computer network","score_opus":0.014930874909745586,"score_gpt":0.2476033009739559,"score_spread":0.2326724260642103,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4307920660","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15509279,0.00092192757,0.82319,0.0005258882,0.00015396395,0.00008606025,0.00063823035,0.015988208,0.0034030029],"genre_scores_gemma":[0.8994918,0.0002102327,0.09653682,0.0002055882,0.00002696674,0.00008575547,0.00070474995,0.00013272848,0.002605491],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997806,0.000035750403,0.00001456284,0.0000773247,0.00005324377,0.000038486123],"domain_scores_gemma":[0.9996978,0.000086526765,0.000043079363,0.000039026825,0.000105577434,0.0000280821],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061013305,0.00066777156,0.00051817036,0.000509584,0.0003068978,0.0006989397,0.0017077592,0.000500245,0.0017931031],"category_scores_gemma":[0.0012695254,0.00028935613,0.00041443814,0.0003717682,0.0002591565,0.0014000975,0.00061647134,0.00081183034,0.00038545372],"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.00042874913,0.00028006374,0.0046645696,0.000078185636,0.00012531283,0.0001222055,0.00007560463,0.7452925,0.008338369,0.0024158575,0.00710193,0.2310767],"study_design_scores_gemma":[0.0000033563579,0.000020074103,0.00015318768,0.0000025754293,0.000005143778,0.000005797507,0.0000037191198,0.99831176,0.0008751397,0.00039561122,0.00021936742,0.0000041976728],"about_ca_topic_score_codex":0.020154702,"about_ca_topic_score_gemma":0.019488208,"teacher_disagreement_score":0.020154702,"about_ca_system_score_codex":0.0010568222,"about_ca_system_score_gemma":0.0010807064,"threshold_uncertainty_score":0.040074825},"labels":[],"label_agreement":null},{"id":"W4308862143","doi":"10.1002/spe.3163","title":"A large‐scale empirical study of low‐level function use in Ethereum smart contracts and automated replacement","year":2022,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Blockchain Technology Applications and Security","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Solidity; Smart contract; Computer science; Documentation; Compiler; Exploit; Function (biology); Computer security; Blockchain; Programming language","score_opus":0.029377424434281808,"score_gpt":0.3131432746414825,"score_spread":0.2837658502072007,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4308862143","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9951976,0.0003219207,0.00069710356,0.00025935724,0.000007808574,0.000021254386,0.0022652391,0.00007581561,0.0011539082],"genre_scores_gemma":[0.9892168,0.00019523586,0.0016384395,0.00012658596,0.000014977699,0.00003738935,0.0079176165,0.000068023466,0.00078490854],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9933222,0.0026882086,0.0005364678,0.0010019891,0.0020470754,0.0004040464],"domain_scores_gemma":[0.91099334,0.06124229,0.014433353,0.0076094125,0.004422713,0.0012988977],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006976671,0.00042085876,0.00046948486,0.0021113688,0.0007058878,0.0018125139,0.0014202894,0.0014916521,0.0027991722],"category_scores_gemma":[0.05023837,0.00042983226,0.00045039994,0.003895298,0.0013583759,0.004208364,0.0013875338,0.002266082,0.001564519],"study_design_candidate":"observational","study_design_consensus":"observational","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.00063569745,0.0013490946,0.9217183,0.00031122885,0.00020020819,0.00062016636,0.0016656822,0.0065633375,0.0011112107,0.0027082472,0.015066335,0.048050426],"study_design_scores_gemma":[0.00014525473,0.0005405807,0.8937423,0.00024898275,0.00010724834,0.0013482851,0.0041118115,0.06486255,0.00356097,0.0024230545,0.028798293,0.00011064991],"about_ca_topic_score_codex":0.004034815,"about_ca_topic_score_gemma":0.004712269,"teacher_disagreement_score":0.006976671,"about_ca_system_score_codex":0.00070517435,"about_ca_system_score_gemma":0.00062358147,"threshold_uncertainty_score":0.036896586},"labels":[],"label_agreement":null},{"id":"W4308932920","doi":"10.1002/spe.3167","title":"Training industrial end‐user programmers with interactive tutorials","year":2022,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Teaching and Learning Programming","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"National Science Foundation of Sri Lanka; Natural Sciences and Engineering Research Council of Canada; ABB Corporate Research","keywords":"Computer science; Block (permutation group theory); Multimedia; End user; Software; Robot; Robotics; Human–computer interaction; Training (meteorology); Software engineering; Programming by demonstration; Artificial intelligence; World Wide Web; Programming language","score_opus":0.04558590685991021,"score_gpt":0.30725975175717263,"score_spread":0.2616738448972624,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4308932920","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9719393,0.00014072345,0.018519238,0.00013157963,0.00002486685,0.00046722245,0.00011760823,0.0015479515,0.007111344],"genre_scores_gemma":[0.953071,0.00019606295,0.038709123,0.00018938212,0.000019332107,0.0005937571,0.00036451413,0.0001579434,0.0066987975],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99817264,0.0009488187,0.00008907969,0.0002610506,0.0002670489,0.00026128796],"domain_scores_gemma":[0.986917,0.0076764394,0.00085714855,0.0010308486,0.0015343115,0.0019842878],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024676449,0.0008422807,0.00046694398,0.00071173004,0.00045912052,0.00084604596,0.0013431452,0.0006806718,0.011009354],"category_scores_gemma":[0.016817644,0.00029073432,0.00023074067,0.00040907756,0.000373729,0.0009993935,0.0020266878,0.0007965075,0.003108385],"study_design_candidate":"observational","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.0023060779,0.025394779,0.071411856,0.0019095079,0.00007264289,0.0015805674,0.036949094,0.007203731,0.057970047,0.0010077098,0.023701303,0.77049273],"study_design_scores_gemma":[0.0023513497,0.055927854,0.41358745,0.0020433536,0.000425247,0.010381663,0.05505732,0.067387946,0.14223172,0.0050238483,0.24495047,0.00063185097],"about_ca_topic_score_codex":0.00066424627,"about_ca_topic_score_gemma":0.0013940703,"teacher_disagreement_score":0.011009354,"about_ca_system_score_codex":0.00041040345,"about_ca_system_score_gemma":0.00062655355,"threshold_uncertainty_score":0.036830008},"labels":[],"label_agreement":null},{"id":"W4310081629","doi":"10.1002/spe.3168","title":"xDEVS: A toolkit for interoperable modeling and simulation of formal discrete event systems","year":2022,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Simulation Techniques and Applications","field":"Decision Sciences","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; DEVS; Interoperability; Executable; Rotation formalisms in three dimensions; Programming language; Python (programming language); Maintainability; Implementation; Software engineering; Discrete event simulation; Generic programming; Interfacing; Systems modeling; Distributed computing; Modeling and simulation; Operating system; Simulation","score_opus":0.09789883491073663,"score_gpt":0.4390665999825627,"score_spread":0.34116776507182606,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4310081629","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021290395,0.00017684551,0.9582557,0.00015717959,0.00009353436,0.0001646226,0.0013473954,0.033928365,0.0037474046],"genre_scores_gemma":[0.10462802,0.0011613594,0.863271,0.00030950742,0.00007978652,0.0015987816,0.009471569,0.01107768,0.008402339],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99886715,0.00040056277,0.0001640622,0.00012531513,0.00034841214,0.000094495816],"domain_scores_gemma":[0.9982229,0.0011227361,0.00010483536,0.00025879015,0.00017787302,0.00011286927],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029044335,0.0011121358,0.0010214687,0.0013038532,0.0006494002,0.002238524,0.0030720439,0.0015232487,0.017513644],"category_scores_gemma":[0.0053118276,0.0011326812,0.0022041583,0.000803123,0.0011857988,0.0018478085,0.003805499,0.002862138,0.0032560488],"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.0002507821,0.0001932821,0.0029829305,0.0012417374,0.0002676609,0.00082731264,0.00069201144,0.6206225,0.0066559864,0.24710327,0.034401346,0.08476105],"study_design_scores_gemma":[0.00013431886,0.00003975596,0.00030706104,0.00017354525,0.000026640815,0.00013247022,0.00005094709,0.85880184,0.0032384235,0.048372824,0.08866892,0.000053293395],"about_ca_topic_score_codex":0.0045739966,"about_ca_topic_score_gemma":0.0047023115,"teacher_disagreement_score":0.017513644,"about_ca_system_score_codex":0.0009648426,"about_ca_system_score_gemma":0.0019327584,"threshold_uncertainty_score":0.058588922},"labels":[],"label_agreement":null},{"id":"W4312106113","doi":"10.1002/spe.3182","title":"Implementing scripted conversations by means of smart assistants","year":2022,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"AI in Service Interactions","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"Ministerio de Asuntos Económicos y Transformación Digital, Gobierno de España; Universidade de Vigo; Ministerio de Economía y Competitividad; Ministerio de Ciencia, Innovación y Universidades","keywords":"Computer science; Phone; Portfolio; Interface (matter); Smart phone; Home automation; Work (physics); Automation; Human–computer interaction; World Wide Web; Telecommunications; Engineering; Business","score_opus":0.01735422263379653,"score_gpt":0.2971705479812456,"score_spread":0.27981632534744905,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312106113","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19050102,0.00011511286,0.78144777,0.000165291,0.0001460379,0.0012083766,0.00011393071,0.014028675,0.012273766],"genre_scores_gemma":[0.56367344,0.00007134093,0.4257446,0.00012927502,0.000033220433,0.00068949634,0.00016234511,0.00046770932,0.009028588],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99747545,0.0010817939,0.000232267,0.00033956728,0.00057798385,0.00029293948],"domain_scores_gemma":[0.9938246,0.0026852177,0.0005267946,0.0013113235,0.0010052872,0.00064679654],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022942699,0.0007517235,0.00032484782,0.0003207744,0.0004148839,0.0014520336,0.0018897563,0.00074050494,0.005953786],"category_scores_gemma":[0.008442282,0.0003399604,0.00040036484,0.00014470679,0.0008954732,0.0013205361,0.0020316155,0.0007445933,0.0020446475],"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.0015131616,0.0020241668,0.007600854,0.0010058166,0.00014784651,0.0023855371,0.013641446,0.0136006465,0.30589992,0.02427856,0.006340799,0.62156117],"study_design_scores_gemma":[0.0006695749,0.004167572,0.009117791,0.00046425636,0.00028362757,0.00271543,0.0035047939,0.26165345,0.4820591,0.014894194,0.22003955,0.00043064888],"about_ca_topic_score_codex":0.0011987905,"about_ca_topic_score_gemma":0.000878954,"teacher_disagreement_score":0.005953786,"about_ca_system_score_codex":0.00039596413,"about_ca_system_score_gemma":0.00096178864,"threshold_uncertainty_score":0.019917428},"labels":[],"label_agreement":null},{"id":"W4323074617","doi":"10.1002/spe.3198","title":"Fast number parsing without fallback","year":2023,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université TÉLUQ; Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Correctness; Computer science; String (physics); Parsing; Rust (programming language); Point (geometry); Algorithm; Function (biology); Binary number; Floating point; Arithmetic; Theoretical computer science; Programming language; Mathematics","score_opus":0.02836546243983597,"score_gpt":0.3547149455127382,"score_spread":0.32634948307290224,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4323074617","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0067942077,0.0007330135,0.88918364,0.001187906,0.0008524093,0.00011499539,0.0014912522,0.06951277,0.030129801],"genre_scores_gemma":[0.12286081,0.0005707139,0.81510717,0.0014014932,0.0004114616,0.00023776828,0.0065121036,0.016760454,0.036137935],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9972844,0.0005361463,0.00029035236,0.00065988133,0.0010342282,0.00019500028],"domain_scores_gemma":[0.9941017,0.0016561865,0.00020933953,0.0019182935,0.001981795,0.00013277149],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014009519,0.0013679406,0.0008486005,0.0017874382,0.0010619011,0.0026439317,0.0021088568,0.0010326707,0.036948513],"category_scores_gemma":[0.011670323,0.00066383113,0.00080214324,0.0018255702,0.00085665536,0.0043616197,0.0022955483,0.0019078564,0.025925007],"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.00058840436,0.0000922538,0.0014336527,0.00052021793,0.000046019188,0.00040006667,0.00040830913,0.009172691,0.016879736,0.121352375,0.17829612,0.67081016],"study_design_scores_gemma":[0.00017051469,0.00011842495,0.0014173388,0.0004504188,0.00006947199,0.0009068175,0.00013040566,0.13687095,0.08060749,0.1840709,0.5950036,0.00018375578],"about_ca_topic_score_codex":0.001693963,"about_ca_topic_score_gemma":0.0014735627,"teacher_disagreement_score":0.036948513,"about_ca_system_score_codex":0.001099642,"about_ca_system_score_gemma":0.0013857629,"threshold_uncertainty_score":0.12360507},"labels":[],"label_agreement":null},{"id":"W4353085171","doi":"10.1002/spe.3202","title":"Reproducibility as a service","year":2023,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Scientific Computing and Data Management","field":"Decision Sciences","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Reproducibility; Computer science; Mathematics; Statistics","score_opus":0.17424086479071627,"score_gpt":0.4582500712121293,"score_spread":0.28400920642141303,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4353085171","genre_codex":"software","genre_gemma":"methods","domain_codex":null,"domain_gemma":"reproducibility","model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":"reproducibility","domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0039070696,0.0012119282,0.430448,0.009826685,0.0034736549,0.0018137586,0.006194751,0.5173787,0.02574545],"genre_scores_gemma":[0.13691615,0.0026995225,0.4800081,0.013858214,0.006255555,0.0066409134,0.037883926,0.2727566,0.04298108],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.82778907,0.07862364,0.026704859,0.018389456,0.043380737,0.0051122378],"domain_scores_gemma":[0.2752139,0.17907225,0.024144499,0.42236078,0.08254308,0.01666547],"candidate_categories":["metaresearch","open_science"],"consensus_categories":["metaresearch"],"category_scores_codex":[0.18917365,0.003702506,0.0042283237,0.009216482,0.005356979,0.023114402,0.0120886825,0.0065995026,0.044641413],"category_scores_gemma":[0.45729858,0.003265524,0.005427651,0.008502326,0.0078765275,0.026213422,0.032550417,0.009861964,0.06768964],"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.0024795164,0.0003966846,0.011963454,0.0032774985,0.00080837455,0.001584919,0.008049931,0.003811175,0.008965427,0.11656625,0.4983288,0.34376797],"study_design_scores_gemma":[0.00035636217,0.0002869867,0.0023187527,0.0009259884,0.0001697906,0.0009196861,0.00100422,0.014968957,0.01226933,0.085914694,0.8803852,0.00047991885],"about_ca_topic_score_codex":0.004392378,"about_ca_topic_score_gemma":0.0016691032,"teacher_disagreement_score":0.98791134,"about_ca_system_score_codex":0.0049055503,"about_ca_system_score_gemma":0.024147524,"threshold_uncertainty_score":0.99989325},"labels":[],"label_agreement":null},{"id":"W4362721046","doi":"10.1002/spe.3206","title":"EdgeAuth: An intelligent token‐based collaborative authentication scheme","year":2023,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"User Authentication and Security Systems","field":"Computer Science","cited_by":8,"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":"National Key Research and Development Program of China; College of Engineering and Applied Science, University of Wyoming; University of Colorado Boulder; National Natural Science Foundation of China","keywords":"Server; Computer science; Cloud computing; Security token; Computer network; Edge computing; Authentication (law); Enhanced Data Rates for GSM Evolution; Authentication server; The Internet; Computer security; Operating system; Telecommunications","score_opus":0.03183611125330991,"score_gpt":0.3350754871527458,"score_spread":0.3032393758994359,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4362721046","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10848292,0.00044997176,0.8782577,0.00031878302,0.00031276242,0.00038976586,0.00020694821,0.005142143,0.0064390507],"genre_scores_gemma":[0.93247133,0.000099274475,0.06239133,0.0001056854,0.00005059132,0.00009143936,0.0001500161,0.000034586003,0.0046057976],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9984074,0.00035952998,0.00019056944,0.00026050236,0.00043215658,0.00034983206],"domain_scores_gemma":[0.99758065,0.00039808042,0.00042087998,0.0008950832,0.0004993914,0.00020592962],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011633565,0.00055007136,0.0007095829,0.0008381723,0.0012350914,0.0010219369,0.0020217896,0.0009246169,0.0027990364],"category_scores_gemma":[0.0023736705,0.00022814312,0.0003967098,0.00073954614,0.0008763775,0.0024911927,0.0026505813,0.0009238793,0.0010331593],"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.007398932,0.00095400016,0.006227119,0.00045023396,0.00025236723,0.0021652973,0.0007887826,0.11247723,0.20691529,0.16553265,0.024028696,0.47280946],"study_design_scores_gemma":[0.00032154404,0.0009708211,0.0013328317,0.0000328823,0.000101199934,0.0012589114,0.00012630463,0.86666065,0.08325832,0.02326187,0.022480857,0.00019380318],"about_ca_topic_score_codex":0.0011802196,"about_ca_topic_score_gemma":0.00081411446,"teacher_disagreement_score":0.0027990364,"about_ca_system_score_codex":0.0007541904,"about_ca_system_score_gemma":0.0011250323,"threshold_uncertainty_score":0.009363711},"labels":[],"label_agreement":null},{"id":"W4362722749","doi":"10.1002/spe.3208","title":"Detection of microservice‐based software anomalies based on OpenTracing in cloud","year":2023,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Software System Performance and Reliability","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Microservices; DevOps; Computer science; Anomaly detection; Cloud computing; Scalability; Flexibility (engineering); Software; Distributed computing; Software architecture; Architecture; Software deployment; Data mining; Software engineering; Real-time computing; Database; Operating system","score_opus":0.015413194559834285,"score_gpt":0.28289239610846423,"score_spread":0.2674792015486299,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4362722749","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9744819,0.0002540426,0.020611027,0.00020282147,0.000046758283,0.00005126262,0.0012992631,0.0023384583,0.00071446213],"genre_scores_gemma":[0.98927164,0.00007031757,0.008482355,0.00002402655,0.000010762476,0.00001737987,0.0018404888,0.00003231036,0.00025080165],"study_design_codex":"observational","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99890304,0.000120328885,0.000082562925,0.00034073254,0.00037461985,0.0001787512],"domain_scores_gemma":[0.9960521,0.0013224173,0.0007004302,0.0005355251,0.0010900296,0.00029955842],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010852576,0.0006580273,0.0006690597,0.0028488867,0.0004446859,0.0007795997,0.0012775273,0.0006429762,0.0003024885],"category_scores_gemma":[0.0050246553,0.00018388186,0.00051413535,0.0019807157,0.0003307964,0.00090448465,0.0006565508,0.0007058453,0.000176962],"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.0009070237,0.00057520915,0.57865775,0.0002130628,0.0002323089,0.0013893704,0.00030879595,0.26071465,0.012182026,0.0018779429,0.007227746,0.13571408],"study_design_scores_gemma":[0.00000845855,0.000056163124,0.031087007,0.000008345825,0.000018901253,0.00012446806,0.0000612653,0.9627399,0.0045227394,0.0007406389,0.0006173824,0.000014709449],"about_ca_topic_score_codex":0.023833947,"about_ca_topic_score_gemma":0.023135833,"teacher_disagreement_score":0.023833947,"about_ca_system_score_codex":0.0012770991,"about_ca_system_score_gemma":0.0008962158,"threshold_uncertainty_score":0.04739046},"labels":[],"label_agreement":null},{"id":"W4365998865","doi":"10.1002/spe.3209","title":"A blockchain‐based privacy‐preserving advertising attribution architecture: Requirements, design, and a prototype implementation","year":2023,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Blockchain Technology Applications and Security","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 Calgary","funders":"National Key Research and Development Program of China; Peng Cheng Laboratory; Tencent","keywords":"Attribution; Computer science; Architecture; Blockchain; Computer security; Intersection (aeronautics); Set (abstract data type); Internet privacy; Advertising; Business; Engineering","score_opus":0.03236558568730539,"score_gpt":0.3337952147060385,"score_spread":0.3014296290187331,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4365998865","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27261448,0.00042504125,0.69305605,0.001401624,0.00019474565,0.0022424774,0.00034247283,0.01065609,0.019067101],"genre_scores_gemma":[0.8998355,0.00018523032,0.09114639,0.00012559586,0.000022207247,0.00044466797,0.00026017567,0.00010618599,0.007873972],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9989774,0.00024079953,0.000078983256,0.0001355075,0.00037810285,0.00018925572],"domain_scores_gemma":[0.9981415,0.00039065882,0.00012628945,0.00051114365,0.00056481885,0.0002655964],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001323311,0.00034270668,0.00042879357,0.00040555443,0.0008613048,0.0016078178,0.0020022297,0.0013432738,0.006986552],"category_scores_gemma":[0.002174338,0.0003347624,0.00026165866,0.00051838276,0.000882926,0.0025399425,0.001656171,0.0012787496,0.0013387277],"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.00421539,0.0035008106,0.016929219,0.0015053388,0.00030627573,0.0027698658,0.0025506432,0.22024618,0.1817216,0.12269182,0.01837736,0.42518553],"study_design_scores_gemma":[0.00053919916,0.0009915225,0.0015183877,0.0000776125,0.00009271663,0.0004458286,0.0002439124,0.89761186,0.06413658,0.012203404,0.022061529,0.00007756411],"about_ca_topic_score_codex":0.0036819603,"about_ca_topic_score_gemma":0.0022067619,"teacher_disagreement_score":0.006986552,"about_ca_system_score_codex":0.0009846424,"about_ca_system_score_gemma":0.002007074,"threshold_uncertainty_score":0.023372352},"labels":[],"label_agreement":null},{"id":"W4368376429","doi":"10.1002/spe.3210","title":"Distributed computation of the critical path from execution traces","year":2023,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Software System Performance and Reliability","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; Telefonaktiebolaget LM Ericsson; Advanced Micro Devices","keywords":"Tracing; Computer science; Scalability; Distributed computing; TRACE (psycholinguistics); Computation; Path tracing; Path (computing); Parallel computing; Algorithm; Computer network; Artificial intelligence","score_opus":0.01588971179918067,"score_gpt":0.3036955461113921,"score_spread":0.2878058343122114,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4368376429","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05767863,0.000099913224,0.9383027,0.00009598477,0.000026341393,0.00005524735,0.00008881111,0.0024092284,0.0012432144],"genre_scores_gemma":[0.71402204,0.00011046044,0.28356138,0.000024662713,0.000021844851,0.00010699639,0.00028535718,0.00026044672,0.0016067646],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993253,0.00013144502,0.000034582717,0.00015303043,0.00027642027,0.00007933437],"domain_scores_gemma":[0.99665713,0.0018152636,0.00030213365,0.00035944773,0.0007237703,0.00014223967],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00087732245,0.0007498537,0.0005663173,0.0021923147,0.00061961217,0.0010381868,0.0010090423,0.00052140217,0.0028359634],"category_scores_gemma":[0.0069563207,0.00036193078,0.00035835346,0.0009665709,0.00080690207,0.0011081996,0.0010458536,0.00085442496,0.00040194055],"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.00031826072,0.00009716276,0.0049777753,0.00014048623,0.000050216222,0.00020388335,0.0003672687,0.81491035,0.013447964,0.028809702,0.001842362,0.13483454],"study_design_scores_gemma":[0.000010417467,0.00001726464,0.00022867581,0.000006216011,0.0000037484895,0.000018291665,0.000024371158,0.9899725,0.002485435,0.0067421845,0.00048682623,0.0000040275913],"about_ca_topic_score_codex":0.009055418,"about_ca_topic_score_gemma":0.0069653788,"teacher_disagreement_score":0.009055418,"about_ca_system_score_codex":0.0014041362,"about_ca_system_score_gemma":0.001965246,"threshold_uncertainty_score":0.018005371},"labels":[],"label_agreement":null},{"id":"W4376562663","doi":"10.1002/spe.3214","title":"Fast matrix multiplication via compiler‐only layered data reorganization and intrinsic lowering","year":2023,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"IBM (Canada); University of Alberta","funders":"","keywords":"Computer science; Compiler; Parallel computing; Kernel (algebra); Matrix multiplication; Supercomputer; Code (set theory); Performance improvement; Matrix (chemical analysis); Code generation; Computational science; Programming language; Operating system","score_opus":0.026453969927901524,"score_gpt":0.3220810229898587,"score_spread":0.2956270530619572,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4376562663","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.082499966,0.00015470508,0.89013857,0.00022762324,0.00015739059,0.000070699294,0.00014647027,0.018687567,0.007917021],"genre_scores_gemma":[0.46190864,0.00007977261,0.52895916,0.00017186983,0.000056699737,0.00013142727,0.00062392355,0.0018308024,0.006237704],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99943656,0.00008032251,0.000050183837,0.000101998274,0.00022532463,0.00010560381],"domain_scores_gemma":[0.9987023,0.0003125759,0.00012611541,0.0004819642,0.0003105397,0.000066591],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042077716,0.00071335403,0.0004767812,0.0006415986,0.0005679073,0.001296952,0.0011043904,0.00037427843,0.0034330576],"category_scores_gemma":[0.0018654766,0.0003454786,0.00054363697,0.0007828138,0.000742268,0.0011513338,0.0017427772,0.0009931172,0.0019396879],"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.0007455936,0.0003773792,0.004791588,0.00030686273,0.000101045334,0.00052888005,0.00065326964,0.17977926,0.19603695,0.098487735,0.024286535,0.49390483],"study_design_scores_gemma":[0.00007613314,0.00019835785,0.00073801045,0.00002873299,0.00002372757,0.0001582358,0.000058949296,0.8668053,0.09441093,0.020818299,0.01663453,0.000048920298],"about_ca_topic_score_codex":0.002002524,"about_ca_topic_score_gemma":0.0025606882,"teacher_disagreement_score":0.0034330576,"about_ca_system_score_codex":0.0006194778,"about_ca_system_score_gemma":0.001359766,"threshold_uncertainty_score":0.011484683},"labels":[],"label_agreement":null},{"id":"W4386629830","doi":"10.1002/spe.3261","title":"Transcoding unicode characters with AVX‐512 instructions","year":2023,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université TÉLUQ; Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Transcoding; JavaScript; Unicode; Parallel computing; Set (abstract data type); Programming language; Operating system; Artificial intelligence","score_opus":0.019453521533190816,"score_gpt":0.28394922999200695,"score_spread":0.26449570845881615,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386629830","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12980229,0.0017080881,0.7246721,0.00081083586,0.0029974922,0.00033818695,0.004221672,0.091683425,0.04376593],"genre_scores_gemma":[0.3528541,0.00077227404,0.5687709,0.00063887023,0.00031405158,0.00037280697,0.008891321,0.014489789,0.052895945],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9996406,0.000023580818,0.000045437308,0.00007844292,0.00016519931,0.00004682888],"domain_scores_gemma":[0.99900645,0.00018134248,0.000054394648,0.00028506684,0.00043022426,0.00004250196],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022701717,0.0011012177,0.00046451227,0.00096541457,0.0004390495,0.0010179534,0.0009067579,0.00050340634,0.01649878],"category_scores_gemma":[0.0028249358,0.00025932732,0.00042975417,0.00095331913,0.000432463,0.0010871637,0.0011033524,0.0008378888,0.008034681],"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.00076551375,0.00011906909,0.0017269364,0.0004927912,0.00005469111,0.00076372904,0.0005124545,0.006123736,0.1694373,0.014446471,0.08026539,0.72529185],"study_design_scores_gemma":[0.0001271181,0.00029150367,0.0023904839,0.00017325577,0.000085646774,0.0012000087,0.00031814535,0.10213032,0.6312284,0.01969215,0.24225543,0.00010752648],"about_ca_topic_score_codex":0.0015034296,"about_ca_topic_score_gemma":0.0018413757,"teacher_disagreement_score":0.01649878,"about_ca_system_score_codex":0.00036653786,"about_ca_system_score_gemma":0.00041266964,"threshold_uncertainty_score":0.0551939},"labels":[],"label_agreement":null},{"id":"W4386803560","doi":"10.1002/spe.3262","title":"High‐performance extended actors","year":2023,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"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","keywords":"Computer science; Scalability; Concurrency; Debugging; Robustness (evolution); Distributed computing; Shared memory; TRACE (psycholinguistics); Decoupling (probability); Ask price; Parallel computing; Operating system","score_opus":0.01786703427267446,"score_gpt":0.29321950444199985,"score_spread":0.2753524701693254,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386803560","genre_codex":"methods","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.056409,0.00054115563,0.86443174,0.00078491477,0.0003778996,0.00019076084,0.00035157733,0.019427085,0.05748588],"genre_scores_gemma":[0.60192037,0.0006281012,0.32997802,0.0003625027,0.00023917893,0.00038149452,0.000981252,0.002568995,0.06294009],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99846894,0.00041759442,0.00012496831,0.0002477154,0.0005065126,0.0002342383],"domain_scores_gemma":[0.9963552,0.0008786896,0.00025219505,0.0014397068,0.0007790459,0.00029525923],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018946148,0.0005813653,0.00038738988,0.0004973483,0.0008237412,0.0028250068,0.0018311205,0.00078525685,0.014752403],"category_scores_gemma":[0.004289933,0.00042277883,0.0005192116,0.00064336084,0.0013348878,0.0039615026,0.0031916667,0.001718352,0.0029411076],"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.0017891297,0.00019660918,0.0032229316,0.0005347915,0.00007879754,0.0009146072,0.0012818049,0.097927555,0.03511595,0.69179887,0.02866881,0.13847013],"study_design_scores_gemma":[0.0002747436,0.00031513916,0.000782768,0.00015987673,0.000094853,0.0005183777,0.00020755829,0.37556896,0.041316573,0.16632472,0.41432092,0.0001156433],"about_ca_topic_score_codex":0.001661042,"about_ca_topic_score_gemma":0.0014399684,"teacher_disagreement_score":0.014752403,"about_ca_system_score_codex":0.0010024097,"about_ca_system_score_gemma":0.0010352999,"threshold_uncertainty_score":0.04935175},"labels":[],"label_agreement":null},{"id":"W4389509223","doi":"10.1002/spe.3296","title":"Parsing millions of URLs per second","year":2023,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Spam and Phishing Detection","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université TÉLUQ; Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Parsing; Node (physics); Programming language; Parser combinator; Operating system; Artificial intelligence; Physics","score_opus":0.021643628339891214,"score_gpt":0.29291798777982925,"score_spread":0.27127435943993805,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389509223","genre_codex":"software","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11369845,0.0016927611,0.30880505,0.0015329247,0.0013285201,0.0005690275,0.04976307,0.50323105,0.019379217],"genre_scores_gemma":[0.41303113,0.0009564856,0.4599541,0.00089888764,0.00047761764,0.000526642,0.07844322,0.021811258,0.023900649],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99636686,0.00033988807,0.00038265166,0.0008968044,0.0017691744,0.00024460725],"domain_scores_gemma":[0.99004424,0.003081344,0.00059035217,0.001942913,0.0040526493,0.00028847792],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019200789,0.0014978396,0.0010080722,0.005424144,0.0007295409,0.0021211498,0.0012669077,0.0012822261,0.013602743],"category_scores_gemma":[0.01590993,0.0010295357,0.0007131936,0.0039629894,0.00046452464,0.002592425,0.0013326699,0.0012512202,0.01421665],"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.00071886595,0.00023002636,0.021512313,0.0005862932,0.00018038247,0.0007382947,0.000731327,0.009979249,0.036489695,0.0072641745,0.3245692,0.59700024],"study_design_scores_gemma":[0.00016329194,0.00025587346,0.04034897,0.0003044798,0.00016115783,0.0017563377,0.0006854638,0.47276065,0.15397769,0.031242844,0.2980189,0.00032429933],"about_ca_topic_score_codex":0.0075185467,"about_ca_topic_score_gemma":0.004302392,"teacher_disagreement_score":0.013602743,"about_ca_system_score_codex":0.00086014793,"about_ca_system_score_gemma":0.0010812676,"threshold_uncertainty_score":0.045505702},"labels":[],"label_agreement":null},{"id":"W4391033034","doi":"10.1002/spe.3313","title":"On‐demand JSON: A better way to parse documents?","year":2024,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université TÉLUQ; Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"JSON; Computer science; Serialization; Parsing; JavaScript; Programming language; Bottleneck; Data structure; Operating system; Ajax; Database; Web application; Embedded system","score_opus":0.013481323830376661,"score_gpt":0.3095773286200742,"score_spread":0.29609600478969755,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391033034","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031334687,0.0020776489,0.7946133,0.0083993375,0.0016869329,0.00018559651,0.0026894636,0.12984702,0.029166043],"genre_scores_gemma":[0.12807527,0.0021790406,0.74811697,0.0031972558,0.0007164918,0.0002551185,0.013112404,0.07209416,0.032253258],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9975318,0.00052600517,0.00019202598,0.0003969286,0.001104002,0.0002491983],"domain_scores_gemma":[0.99127614,0.0021648454,0.00034639475,0.0034448337,0.0021976558,0.00057008286],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003207492,0.0014303944,0.0008572,0.00127668,0.00072826765,0.004456921,0.0029529934,0.0011137011,0.026041353],"category_scores_gemma":[0.008787586,0.00074515434,0.0008738047,0.0017840117,0.0009946176,0.009299543,0.0025981884,0.0022549157,0.011666408],"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.0013097313,0.00031774322,0.0036411048,0.0007657319,0.0001339508,0.00034728096,0.0010887741,0.00711966,0.039710578,0.062397413,0.405649,0.47751895],"study_design_scores_gemma":[0.00031078255,0.00017202001,0.0018671101,0.00045002069,0.000108566586,0.00041903977,0.0004751888,0.07688085,0.09081614,0.075582765,0.752664,0.0002534456],"about_ca_topic_score_codex":0.0026907327,"about_ca_topic_score_gemma":0.0022419665,"teacher_disagreement_score":0.026041353,"about_ca_system_score_codex":0.00097152096,"about_ca_system_score_gemma":0.0012640674,"threshold_uncertainty_score":0.08711702},"labels":[],"label_agreement":null},{"id":"W4396557969","doi":"10.1002/spe.3338","title":"Dynamic hierarchical intrusion detection task offloading in IoT edge networks","year":2024,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Network Security and Intrusion Detection","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"","keywords":"Computer science; Inference; Edge device; Exploit; Cloud computing; Enhanced Data Rates for GSM Evolution; Intrusion detection system; Edge computing; Task (project management); Inference engine; Distributed computing; Range (aeronautics); Data mining; Artificial intelligence; Computer security","score_opus":0.007705413725137718,"score_gpt":0.2663588571658311,"score_spread":0.25865344344069335,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396557969","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3037861,0.00076108304,0.68151194,0.00049004826,0.00030457633,0.00025333796,0.00030456966,0.0070687146,0.0055196173],"genre_scores_gemma":[0.94612956,0.000078564444,0.051252153,0.00023125095,0.000038661132,0.0000828231,0.00035736323,0.00007315306,0.0017564505],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993747,0.00007797371,0.000042416217,0.00020848664,0.0001265211,0.00016990531],"domain_scores_gemma":[0.9991387,0.00027068434,0.00007878377,0.00016507575,0.00022006649,0.00012671882],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077403,0.00084684003,0.0009034963,0.0007682845,0.0006128816,0.00078670355,0.0013157881,0.000600715,0.0015150439],"category_scores_gemma":[0.0020878362,0.0002716991,0.00041685117,0.00039987985,0.0004230346,0.0014405396,0.001409724,0.0008393667,0.00038540113],"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.0014907528,0.0008701075,0.012057997,0.00017043343,0.00012648433,0.00066999573,0.0002777611,0.5044903,0.029656548,0.005722967,0.0105347745,0.43393192],"study_design_scores_gemma":[0.00000766492,0.000043487977,0.0005261223,0.0000030464216,0.0000063522434,0.000026817013,0.000019979238,0.9946614,0.0031723275,0.001003074,0.00052453065,0.0000052003966],"about_ca_topic_score_codex":0.0032640812,"about_ca_topic_score_gemma":0.0034530296,"teacher_disagreement_score":0.0032640812,"about_ca_system_score_codex":0.00061585475,"about_ca_system_score_gemma":0.0008487566,"threshold_uncertainty_score":0.0064901114},"labels":[],"label_agreement":null},{"id":"W4400738953","doi":"10.1002/spe.3364","title":"A Framework and Taxonomy for Characterizing the Applicability of Software Architecture Recovery Approaches: A Tertiary‐Mapping Study","year":2024,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Software System Performance and Reliability","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Huawei Technologies (Canada)","funders":"European Regional Development Fund; Science Foundation Ireland; Irish Research eLibrary","keywords":"Taxonomy (biology); Computer science; Software engineering; Architecture; Geography; Biology; Ecology; Archaeology","score_opus":0.04772466582929957,"score_gpt":0.28686317050891363,"score_spread":0.23913850467961406,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400738953","genre_codex":"methods","genre_gemma":"review","domain_codex":null,"domain_gemma":"methods","model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":"methods","domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20811515,0.07294587,0.5408112,0.018846331,0.0005282245,0.008365027,0.0071908855,0.0011968231,0.14200059],"genre_scores_gemma":[0.51214033,0.016494744,0.45564178,0.0012215088,0.00012154743,0.006853498,0.0043543316,0.00016093208,0.0030113447],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"systematic_review","domain_scores_codex":[0.97008395,0.013366094,0.0062232134,0.0020491178,0.006504126,0.0017734736],"domain_scores_gemma":[0.884077,0.07513469,0.011707013,0.005939361,0.020930879,0.002210967],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.037015047,0.0016360048,0.0015726179,0.08415004,0.005645323,0.016205182,0.003491402,0.0031895512,0.0055014757],"category_scores_gemma":[0.06023791,0.0007631388,0.0040039276,0.062220737,0.0077376575,0.01812913,0.0068782577,0.0029249599,0.0011287867],"study_design_candidate":"systematic_review","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.00016348314,0.00044244423,0.08094037,0.010978702,0.0004844501,0.00084850384,0.045898806,0.0041492954,0.003367852,0.46132472,0.011305778,0.3800956],"study_design_scores_gemma":[0.00013763891,0.0007543436,0.09895725,0.030912621,0.0009953215,0.002543761,0.18953481,0.03442927,0.0041342108,0.42149597,0.21575487,0.00034986803],"about_ca_topic_score_codex":0.014961942,"about_ca_topic_score_gemma":0.011627025,"teacher_disagreement_score":0.962985,"about_ca_system_score_codex":0.014590145,"about_ca_system_score_gemma":0.01663573,"threshold_uncertainty_score":0.19575661},"labels":[],"label_agreement":null},{"id":"W4401890088","doi":"10.1002/spe.3369","title":"Batched ranged random integer generation","year":2024,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Chaos-based Image/Signal Encryption","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université TÉLUQ; Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Shuffling; Pseudorandom number generator; Random seed; Random number generation; Binary number; Integer (computer science); Word (group theory); Division (mathematics); Computer science; Algorithm; Value (mathematics); Bounded function; Mathematics; Arithmetic; Discrete mathematics; Statistics","score_opus":0.020145443921326382,"score_gpt":0.2966167090827762,"score_spread":0.2764712651614498,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401890088","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02393762,0.00020607164,0.9610039,0.0001777289,0.00019912573,0.0003271522,0.0005011009,0.0038059705,0.00984139],"genre_scores_gemma":[0.36222473,0.00013041895,0.6190687,0.00020703308,0.00008099001,0.000626478,0.0011728418,0.0006072041,0.015881626],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987,0.00034314123,0.000102202845,0.0002804994,0.00046907683,0.00010506706],"domain_scores_gemma":[0.9976834,0.0008277985,0.00012239805,0.0007853638,0.00048722833,0.00009378348],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011280548,0.0003675668,0.0004915822,0.00055417477,0.00045505146,0.00073312945,0.0012243142,0.00046628522,0.01042006],"category_scores_gemma":[0.0037241315,0.0002859849,0.000384911,0.00048161298,0.00054013333,0.0010426741,0.0008416685,0.0008330569,0.0042217756],"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.0015132492,0.00023643066,0.0029038566,0.00038395703,0.00010005091,0.0006693357,0.0003141065,0.16161755,0.1685274,0.16997772,0.024489677,0.4692666],"study_design_scores_gemma":[0.00023217763,0.0004036593,0.00082820305,0.000053385673,0.00003794948,0.00063846685,0.000041329527,0.7667382,0.1331881,0.054401435,0.043323718,0.000113440445],"about_ca_topic_score_codex":0.00033739736,"about_ca_topic_score_gemma":0.0005259271,"teacher_disagreement_score":0.01042006,"about_ca_system_score_codex":0.00047866098,"about_ca_system_score_gemma":0.0005818667,"threshold_uncertainty_score":0.034858525},"labels":[],"label_agreement":null},{"id":"W4405244595","doi":"10.1002/spe.3396","title":"Parsing Millions of DNS Records Per Second","year":2024,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"IPv6, Mobility, Handover, Networks, Security","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université TÉLUQ; Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Parsing; Daemon; SIMD; Parallel computing; Operating system; Programming language","score_opus":0.010207565588996693,"score_gpt":0.2646817869432221,"score_spread":0.25447422135422537,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405244595","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23171201,0.0010431001,0.4528311,0.0024736729,0.0011103384,0.0007783731,0.029847968,0.24147151,0.038731933],"genre_scores_gemma":[0.5364831,0.0007195925,0.39646187,0.0007435423,0.0002357088,0.0003961684,0.037933778,0.0051247794,0.021901453],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9978536,0.0002557276,0.00025597156,0.00051909115,0.0009453173,0.00017023145],"domain_scores_gemma":[0.99525946,0.0013208156,0.00024342995,0.0014270544,0.0015934387,0.00015582339],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012853073,0.00095412566,0.0006467371,0.002902036,0.0008984781,0.0020643205,0.0010950029,0.0007157421,0.0114408005],"category_scores_gemma":[0.0066053043,0.00064098253,0.0004725302,0.0026810865,0.0004011264,0.002137542,0.0013936363,0.0009433657,0.007022853],"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.001242546,0.00032017275,0.024096603,0.00053663144,0.00025050843,0.0010212895,0.00073634635,0.025009211,0.060962968,0.017497484,0.1745239,0.6938024],"study_design_scores_gemma":[0.00018751794,0.00022664588,0.025166916,0.00017530996,0.00014850537,0.001310941,0.0015757674,0.5171732,0.23280099,0.026398644,0.19460025,0.00023531327],"about_ca_topic_score_codex":0.0061198426,"about_ca_topic_score_gemma":0.0051034195,"teacher_disagreement_score":0.0114408005,"about_ca_system_score_codex":0.0010625032,"about_ca_system_score_gemma":0.0016425741,"threshold_uncertainty_score":0.038273335},"labels":[],"label_agreement":null},{"id":"W4405868299","doi":"10.1002/spe.3401","title":"Android Source Code Smells: A Systematic Literature Review","year":2024,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Software Engineering Research","field":"Computer Science","cited_by":4,"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 New Brunswick","funders":"","keywords":"Code smell; Code refactoring; Android (operating system); Computer science; Software engineering; Software quality; Code review; Software; Data science; World Wide Web; Software development; Programming language; Operating system","score_opus":0.014181815966298993,"score_gpt":0.3108355000391105,"score_spread":0.2966536840728115,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405868299","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004833652,0.9906668,0.000747829,0.00074064167,0.0001574895,0.00083307934,0.0010218814,0.000033023116,0.00096565555],"genre_scores_gemma":[0.03382388,0.96005857,0.002648619,0.00058054767,0.00008266486,0.0015584007,0.0009492703,0.000027402946,0.00027058637],"study_design_codex":"systematic_review","study_design_gemma":"systematic_review","domain_scores_codex":[0.9821191,0.005519872,0.0064387065,0.0013687015,0.004160201,0.0003933859],"domain_scores_gemma":[0.8474994,0.110371694,0.01878622,0.0025315494,0.019911723,0.0008994949],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.016820615,0.00154505,0.0042091976,0.03572023,0.00092916266,0.002759006,0.0022236493,0.0016742861,0.0031520952],"category_scores_gemma":[0.08716566,0.0012524418,0.0041014575,0.021911558,0.0015933007,0.0035411608,0.0025771398,0.001106467,0.0005838917],"study_design_candidate":"systematic_review","study_design_consensus":"systematic_review","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.00014164239,0.000028535525,0.0024059133,0.8385756,0.00196264,0.00044074433,0.0015023936,0.0001359802,0.00042533746,0.0004459259,0.0039889654,0.14994636],"study_design_scores_gemma":[0.00007925973,0.00020831675,0.010098664,0.9399859,0.011155392,0.0008376052,0.0019055506,0.00012436825,0.00047622327,0.00037713413,0.034693576,0.000057889632],"about_ca_topic_score_codex":0.010235242,"about_ca_topic_score_gemma":0.030151887,"teacher_disagreement_score":0.03572023,"about_ca_system_score_codex":0.0047953036,"about_ca_system_score_gemma":0.021713652,"threshold_uncertainty_score":0.08895695},"labels":[],"label_agreement":null},{"id":"W4408500266","doi":"10.1002/spe.3420","title":"Scanning HTML at Tens of Gigabytes Per Second on ARM Processors","year":2025,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Web Data Mining and Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université TÉLUQ; Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Operating system","score_opus":0.012210890309218783,"score_gpt":0.2917902655946673,"score_spread":0.2795793752854485,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408500266","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4717845,0.0030878638,0.34512487,0.0011072544,0.000312504,0.00030736614,0.004191886,0.1257685,0.048315156],"genre_scores_gemma":[0.780702,0.00091505033,0.20126796,0.00029951372,0.000081124424,0.00016889459,0.004258581,0.0011289244,0.011178032],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99924314,0.000085206906,0.00007271789,0.00019012493,0.00031999475,0.000088956585],"domain_scores_gemma":[0.9984877,0.00049895886,0.00012845677,0.00030450162,0.0005035986,0.00007673044],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059085456,0.0007571623,0.0003610369,0.0012715457,0.0003909056,0.0010942088,0.0008885073,0.0004237787,0.009923591],"category_scores_gemma":[0.0023599975,0.00032563042,0.00024999218,0.00188707,0.0002527565,0.0011075267,0.00055786496,0.0004742113,0.0033091279],"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.002469267,0.00032517343,0.013804741,0.0005463376,0.00016793769,0.00052569667,0.00042220214,0.02616298,0.113857634,0.006671849,0.048632037,0.7864142],"study_design_scores_gemma":[0.00029525356,0.0008036352,0.022796791,0.00021444223,0.00015173072,0.0006790904,0.00046639558,0.5909233,0.2870277,0.012159563,0.08435827,0.00012381173],"about_ca_topic_score_codex":0.0029037972,"about_ca_topic_score_gemma":0.0029225063,"teacher_disagreement_score":0.009923591,"about_ca_system_score_codex":0.0006421559,"about_ca_system_score_gemma":0.0006791548,"threshold_uncertainty_score":0.0331977},"labels":[],"label_agreement":null},{"id":"W4412636227","doi":"10.1002/spe.70010","title":"Leveraging the Power of Images: Image Recommendation to Enhance Issue Reports","year":2025,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Data Visualization and Analytics","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Image (mathematics); Data science; Power (physics); Computer vision; Information retrieval; Artificial intelligence","score_opus":0.012337132147721657,"score_gpt":0.3599018589456765,"score_spread":0.34756472679795486,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412636227","genre_codex":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8151729,0.004138985,0.14321308,0.002765086,0.0002643599,0.00054413016,0.0027769,0.016626587,0.014497946],"genre_scores_gemma":[0.8847392,0.0006615765,0.109298915,0.00018271792,0.00013748398,0.00009015593,0.0016724014,0.00031847006,0.002899049],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9984937,0.00054567284,0.00010468933,0.00030908015,0.00045982195,0.000087009954],"domain_scores_gemma":[0.9819588,0.010350691,0.0026829925,0.001855713,0.002611694,0.0005400716],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022193338,0.0008628844,0.00043272926,0.0040189377,0.00036934853,0.0018741917,0.0008382166,0.0006967388,0.0019070692],"category_scores_gemma":[0.022923907,0.00024858583,0.00039128642,0.0017265897,0.0003653111,0.0027362222,0.0008009097,0.0007519073,0.0008648394],"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.0005137886,0.0007236676,0.11074279,0.0011062372,0.0001658156,0.00028747634,0.0019638927,0.005346532,0.019051017,0.0010185898,0.023710215,0.83536994],"study_design_scores_gemma":[0.00019704807,0.0025051946,0.24967381,0.00076666276,0.0007730583,0.0024234948,0.004091011,0.5328576,0.1016447,0.009367624,0.095334865,0.00036500584],"about_ca_topic_score_codex":0.0033836865,"about_ca_topic_score_gemma":0.0066920933,"teacher_disagreement_score":0.0040189377,"about_ca_system_score_codex":0.0004947862,"about_ca_system_score_gemma":0.0006689749,"threshold_uncertainty_score":0.011737108},"labels":[],"label_agreement":null},{"id":"W4414586197","doi":"10.1002/spe.70024","title":"Project Templating and Onboarding With Cookiecutter: Foundations, Uses, and Guidelines","year":2025,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Advanced Software Engineering Methodologies","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Telus (Canada); Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs","keywords":"Onboarding; Context (archaeology); Python (programming language); Web application; Software; Quality (philosophy); Metadata","score_opus":0.060368696277296664,"score_gpt":0.3940579685862917,"score_spread":0.33368927230899503,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414586197","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038783003,0.0013041074,0.86217505,0.0045571374,0.00018073071,0.0012524303,0.00070671405,0.045950547,0.045090318],"genre_scores_gemma":[0.118204914,0.001101485,0.85110694,0.0007531365,0.00007502901,0.0011883706,0.0014776117,0.012021431,0.014071027],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.97939837,0.008996656,0.0028152221,0.0019891374,0.005622077,0.0011784945],"domain_scores_gemma":[0.914752,0.04192128,0.0048701228,0.024226747,0.010318569,0.003911269],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.027891897,0.0011451391,0.0005549862,0.004268575,0.00200534,0.007763871,0.003929888,0.0018326236,0.008571024],"category_scores_gemma":[0.09481941,0.00181279,0.00095399056,0.0029051683,0.006346919,0.0128059415,0.0075488198,0.003312259,0.0058414117],"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.0004097661,0.00041500633,0.020088565,0.002569964,0.00006928447,0.0008909757,0.031317562,0.0068363757,0.014612574,0.22324224,0.07205747,0.62749016],"study_design_scores_gemma":[0.00010481476,0.00034275363,0.011269309,0.0041532638,0.0000723476,0.0027992856,0.008095164,0.036220733,0.033915035,0.12491557,0.7775561,0.0005556447],"about_ca_topic_score_codex":0.0045479075,"about_ca_topic_score_gemma":0.009518498,"teacher_disagreement_score":0.027891897,"about_ca_system_score_codex":0.0024088556,"about_ca_system_score_gemma":0.0058120163,"threshold_uncertainty_score":0.14750814},"labels":[],"label_agreement":null},{"id":"W4416127924","doi":"10.1002/spe.70030","title":"Exploring the Impacts of Antipatterns on Object‐Oriented, Service‐Oriented, and Mobile‐Oriented Systems","year":2025,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Software Engineering Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Chicoutimi; Concordia University","funders":"","keywords":"Coding (social sciences); Software quality; Program comprehension; Comprehension; Source code; Software; Quality (philosophy); Software maintenance","score_opus":0.031122302989594865,"score_gpt":0.3096959911286585,"score_spread":0.27857368813906364,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416127924","genre_codex":"review","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46262127,0.50649345,0.013497348,0.0041592107,0.00033687116,0.00090811163,0.0020074837,0.00009256662,0.009883756],"genre_scores_gemma":[0.88318706,0.10495205,0.009539747,0.00084318133,0.0000874383,0.0005861575,0.00047037806,0.000030520838,0.00030348595],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9428074,0.027002294,0.0127876,0.0032178035,0.013430154,0.00075487717],"domain_scores_gemma":[0.57190704,0.31819674,0.07149438,0.0072003934,0.030090187,0.0011112576],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.042632088,0.00050673494,0.0012151228,0.011143247,0.0006150098,0.0033891874,0.0008833496,0.00072981033,0.0015135155],"category_scores_gemma":[0.18185897,0.00054404,0.003021139,0.014414505,0.001890196,0.004519496,0.0025386154,0.0010013675,0.00013683343],"study_design_candidate":"observational","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.0005370266,0.00016506246,0.24585153,0.15951096,0.009595732,0.00047676617,0.012923104,0.0013452547,0.0014286579,0.006013943,0.0018465582,0.5603054],"study_design_scores_gemma":[0.00025521807,0.002586259,0.54481566,0.31528538,0.028145326,0.0020730037,0.022567078,0.002441674,0.005534023,0.01098613,0.065141276,0.00016898739],"about_ca_topic_score_codex":0.005354525,"about_ca_topic_score_gemma":0.0125993015,"teacher_disagreement_score":0.042632088,"about_ca_system_score_codex":0.002651629,"about_ca_system_score_gemma":0.0077503026,"threshold_uncertainty_score":0.22546273},"labels":[],"label_agreement":null},{"id":"W99937609","doi":"","title":"Automating the analysis of design component contracts: Research Articles","year":2006,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Advanced Software Engineering Methodologies","field":"Computer Science","cited_by":1,"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":"","keywords":"Computer science; Component (thermodynamics); Software engineering; Structural pattern; Component-based software engineering; Software design pattern; Reuse; Software system; Context (archaeology); Software; Object-oriented design; Key (lock); Software design; Distributed computing; Software development; Systems engineering; Programming language; Operating system; Engineering","score_opus":0.10941659591340971,"score_gpt":0.3914585033118165,"score_spread":0.28204190739840673,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W99937609","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01329089,0.0019109626,0.9784839,0.0006472217,0.00009357794,0.0001855972,0.000053485284,0.00090994075,0.004424375],"genre_scores_gemma":[0.088225886,0.0027573043,0.9027112,0.00011862609,0.00007748102,0.00016765646,0.0002982171,0.0005065086,0.005137176],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9910062,0.0034384099,0.0006156028,0.0010010257,0.003530373,0.00040833472],"domain_scores_gemma":[0.98551,0.0074368548,0.0008300325,0.0033380964,0.0026422336,0.00024269134],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0071891677,0.0009379458,0.0007501063,0.0021519822,0.001322722,0.003638736,0.0016346828,0.0017312684,0.0061485115],"category_scores_gemma":[0.020695483,0.0011406373,0.0011849073,0.0031385482,0.0021214585,0.0038468975,0.0015598424,0.0016749599,0.0015946992],"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.00013482025,0.00032317956,0.003558194,0.0009870402,0.00009089611,0.00028447533,0.0011425117,0.059165698,0.011263016,0.14486498,0.0072847176,0.77090037],"study_design_scores_gemma":[0.00015428786,0.0002432563,0.0026320936,0.00058456307,0.00012749396,0.00091411575,0.0006689475,0.550387,0.038404897,0.20683521,0.1989417,0.000106523665],"about_ca_topic_score_codex":0.005863209,"about_ca_topic_score_gemma":0.0029923525,"teacher_disagreement_score":0.0071891677,"about_ca_system_score_codex":0.0019407165,"about_ca_system_score_gemma":0.0045741834,"threshold_uncertainty_score":0.038020432},"labels":[],"label_agreement":null}]}