{"meta":{"query_hash":"0ac3632425aa","filters":{"venue":"Computing"},"cohort_total":45,"direct_labels_cover":0,"predictions_cover":45,"exported":45,"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/0ac3632425aa","api":"https://metacan.xera.ac/api/v1/cohort?venue=Computing"},"results":[{"id":"W1977066728","doi":"10.1007/s00607-013-0334-0","title":"Energy efficiency on location based applications in mobile cloud computing: a survey","year":2013,"lang":"en","type":"article","venue":"Computing","topic":"IoT and Edge/Fog Computing","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Cloud computing; Computer science; Mobile cloud computing; Efficient energy use; Mobile device; Systems engineering; Energy (signal processing); Global Positioning System; Distributed computing; Data science; Real-time computing; Telecommunications; Engineering; World Wide Web; Electrical engineering; Operating system","score_opus":0.02022659973194987,"score_gpt":0.25448156252793486,"score_spread":0.23425496279598498,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1977066728","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.073217504,0.64384264,0.21335945,0.0027722502,0.0008999715,0.00012516316,0.00046132007,0.00032814662,0.06499352],"genre_scores_gemma":[0.61237967,0.32860267,0.046089325,0.00067547825,0.0019771955,0.0001003136,0.00058869924,0.00025516545,0.009331517],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986186,0.00025895075,0.00011120523,0.00023768641,0.0005843818,0.00018913344],"domain_scores_gemma":[0.9974753,0.0015711676,0.00015493638,0.00020114148,0.0005510764,0.000046370318],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011700017,0.0009815763,0.001779256,0.0021536434,0.0005131703,0.003019927,0.0017834726,0.0010395314,0.003389577],"category_scores_gemma":[0.003212275,0.00046010892,0.0007423925,0.008384619,0.0005675331,0.0036008186,0.0008716916,0.00076529663,0.0009260751],"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.00028837938,0.00040529825,0.008203143,0.0032280625,0.00021290872,0.00017562299,0.00013581062,0.058968335,0.0053327354,0.064456634,0.009410041,0.84918296],"study_design_scores_gemma":[0.000062173465,0.0007526317,0.022826489,0.0024778529,0.00069065654,0.0028502005,0.0014364165,0.5459565,0.029728394,0.1122333,0.28079852,0.00018689156],"about_ca_topic_score_codex":0.0014662176,"about_ca_topic_score_gemma":0.0014708472,"teacher_disagreement_score":0.003389577,"about_ca_system_score_codex":0.0011407916,"about_ca_system_score_gemma":0.00078866107,"threshold_uncertainty_score":0.011339247},"labels":[],"label_agreement":null},{"id":"W1977292054","doi":"10.1007/s00607-008-0001-z","title":"A new local stabilized nonconforming finite element method for the Stokes equations","year":2008,"lang":"en","type":"article","venue":"Computing","topic":"Advanced Numerical Methods in Computational Mathematics","field":"Engineering","cited_by":60,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"CMG Reservoir Simulation Foundation; National Science Foundation","keywords":"Finite element method; Mathematics; Mixed finite element method; Gauss; Stability (learning theory); Extended finite element method; Mathematical analysis; Applied mathematics; Order (exchange); Finite element limit analysis; Physics; Computer science","score_opus":0.0670170312128948,"score_gpt":0.35834435376723295,"score_spread":0.29132732255433813,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1977292054","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.009595048,0.000097665616,0.98618144,0.0000960521,0.00014863678,0.00004585731,0.000049979233,0.00022234536,0.0035630772],"genre_scores_gemma":[0.18583357,0.00026430388,0.7967427,0.00034735625,0.00017712684,0.00033101565,0.00032041644,0.0004934988,0.015489965],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996811,0.00007192395,0.00001351902,0.000041780462,0.0001704767,0.000021211526],"domain_scores_gemma":[0.99962986,0.00009486279,0.000026872767,0.000047073663,0.00015457973,0.000046672514],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005887059,0.00061170256,0.0009414205,0.00051914674,0.00047469133,0.0006860897,0.0016781403,0.0012823849,0.004952376],"category_scores_gemma":[0.0011274295,0.0002589434,0.0005198722,0.0004594811,0.0006928272,0.000840482,0.001393197,0.0012514027,0.0011386231],"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.0003522476,0.00026918197,0.001081088,0.00038838465,0.00007021965,0.0002609388,0.00028023883,0.39973152,0.09600532,0.20971529,0.008778512,0.28306705],"study_design_scores_gemma":[0.000015713533,0.000041001498,0.00006455623,0.000008498491,0.0000061835863,0.000032135307,0.00000808026,0.9898761,0.0026028052,0.0036946973,0.0036379436,0.000012273956],"about_ca_topic_score_codex":0.0017999747,"about_ca_topic_score_gemma":0.0026282256,"teacher_disagreement_score":0.004952376,"about_ca_system_score_codex":0.00039585095,"about_ca_system_score_gemma":0.0009637199,"threshold_uncertainty_score":0.01656735},"labels":[],"label_agreement":null},{"id":"W1979595178","doi":"10.1007/s00607-009-0032-0","title":"Discrete logarithms for finite groups","year":2009,"lang":"en","type":"article","venue":"Computing","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":5,"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 Calgary","funders":"","keywords":"Discrete logarithm; Multiset; Mathematics; Generalization; Cryptography; Logarithm; Abelian group; Prime (order theory); Cryptographic primitive; Group (periodic table); Finite group; Discrete mathematics; Cryptographic protocol; Finite field; Algebra over a field; Pure mathematics; Combinatorics; Computer science; Algorithm; Public-key cryptography; Encryption; Mathematical analysis","score_opus":0.016501538301748064,"score_gpt":0.25995526874435926,"score_spread":0.2434537304426112,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1979595178","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.15961404,0.041526772,0.42761725,0.06141252,0.005477074,0.00021816933,0.0017840636,0.0016808592,0.30066922],"genre_scores_gemma":[0.91751724,0.00830023,0.029189263,0.00224796,0.004546776,0.00028963492,0.0007480269,0.00023961732,0.036921237],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99761176,0.000752348,0.00011481015,0.00037165196,0.00085911126,0.00029032357],"domain_scores_gemma":[0.99465585,0.0034624296,0.00037442482,0.0007786036,0.0003927608,0.0003359493],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023485369,0.0012900543,0.0018482165,0.0029377649,0.0026838675,0.0065070433,0.0015891773,0.0017229683,0.0082913],"category_scores_gemma":[0.0097840885,0.0007196097,0.0008575517,0.004504615,0.0065492936,0.011985478,0.003423763,0.008615865,0.0016612784],"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.000029275026,0.000015863683,0.00006475392,0.000040652023,0.000004840486,0.000024299285,0.00014465023,0.00067556166,0.000102076054,0.9909729,0.0026318233,0.0052932985],"study_design_scores_gemma":[0.000012497126,0.0000044164512,0.0000314821,0.000011138933,0.00000294173,0.000019061676,0.000018275716,0.001591272,0.000067410605,0.9955786,0.002657453,0.0000054209218],"about_ca_topic_score_codex":0.0016328559,"about_ca_topic_score_gemma":0.0009637259,"teacher_disagreement_score":0.0082913,"about_ca_system_score_codex":0.004719041,"about_ca_system_score_gemma":0.0017941572,"threshold_uncertainty_score":0.034239173},"labels":[],"label_agreement":null},{"id":"W1984058114","doi":"10.1007/s00607-013-0329-x","title":"An integrated fine-grain runtime system for MPI","year":2013,"lang":"en","type":"article","venue":"Computing","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Vice Chancellor for Research and Technology, Kerman University of Medical Sciences","keywords":"Computer science; Parallel computing; Computational science","score_opus":0.015965434546085056,"score_gpt":0.26291138819052345,"score_spread":0.2469459536444384,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1984058114","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.039867423,0.00059307204,0.63091725,0.0004038168,0.00054139516,0.00033409652,0.002598186,0.29806432,0.026680391],"genre_scores_gemma":[0.22934078,0.00041932735,0.7067633,0.0005275131,0.00023105639,0.00057928526,0.010879388,0.023021273,0.028238071],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993655,0.00007859489,0.0000427848,0.0001225462,0.00028637744,0.00010414514],"domain_scores_gemma":[0.9992537,0.00010098326,0.000027874596,0.0003065868,0.00019281846,0.000117958305],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063621457,0.0009083079,0.0011101036,0.00065083604,0.00085258007,0.0013775962,0.0030271758,0.00076857454,0.016911076],"category_scores_gemma":[0.0016194244,0.00074013876,0.000778557,0.000982511,0.00036771956,0.0012749267,0.001997957,0.0019929989,0.007835767],"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.0034200428,0.0009076785,0.0056591933,0.0006484195,0.0005489343,0.0005788459,0.0004616186,0.06975383,0.11630545,0.024979712,0.19950797,0.57722837],"study_design_scores_gemma":[0.00093068666,0.00035922442,0.0044627627,0.00004910336,0.00021101588,0.0002826473,0.00006282961,0.7786613,0.06545609,0.01687125,0.1324568,0.00019619253],"about_ca_topic_score_codex":0.0043727728,"about_ca_topic_score_gemma":0.0061418163,"teacher_disagreement_score":0.016911076,"about_ca_system_score_codex":0.000627108,"about_ca_system_score_gemma":0.0018108409,"threshold_uncertainty_score":0.056573212},"labels":[],"label_agreement":null},{"id":"W1988420580","doi":"10.1007/s006070070013","title":"Output-Sensitive Algorithm for Computing β-Skeletons","year":2000,"lang":"en","type":"article","venue":"Computing","topic":"Digital Image Processing Techniques","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 Windsor","funders":"","keywords":"Intersection (aeronautics); Mathematics; Combinatorics; Planar; Algorithm; Graph; Measure (data warehouse); Skeleton (computer programming); RADIUS; Discrete mathematics; Computer science","score_opus":0.020301539706283823,"score_gpt":0.28330157766687813,"score_spread":0.2630000379605943,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1988420580","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.006611673,0.000046795067,0.9910676,0.000027511447,0.000022659216,0.00002890826,0.00005946753,0.0012110233,0.0009244793],"genre_scores_gemma":[0.07310946,0.00007132248,0.9224783,0.000056885692,0.00002507401,0.00007730237,0.00034910577,0.00031101576,0.0035214545],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999225,0.000084276886,0.000054957134,0.00015096898,0.0004189094,0.00006585277],"domain_scores_gemma":[0.9987214,0.00025611848,0.000083912484,0.00030036466,0.00056987396,0.000068181864],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009354936,0.00088243064,0.00078060734,0.0016212751,0.00063356303,0.0014502413,0.0015922982,0.00092068105,0.008912201],"category_scores_gemma":[0.0032298,0.0004573713,0.00064289995,0.0013129121,0.0006209411,0.0012512422,0.0017046154,0.0013114711,0.0032188732],"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.0005638453,0.0001387366,0.0012266096,0.00018042937,0.00006495612,0.00011955066,0.0001327065,0.03419307,0.07530193,0.03166522,0.0054031643,0.8510097],"study_design_scores_gemma":[0.00007166989,0.00018036859,0.001337494,0.000036113266,0.000054208245,0.00030747257,0.000072276525,0.86315143,0.09735895,0.026812794,0.01057728,0.000040021383],"about_ca_topic_score_codex":0.0010980227,"about_ca_topic_score_gemma":0.00213578,"teacher_disagreement_score":0.008912201,"about_ca_system_score_codex":0.0005712964,"about_ca_system_score_gemma":0.0010177715,"threshold_uncertainty_score":0.029814303},"labels":[],"label_agreement":null},{"id":"W1997660235","doi":"10.1007/s00607-013-0372-7","title":"System on chip failure rate assessment using the executable model of a system","year":2013,"lang":"en","type":"article","venue":"Computing","topic":"Radiation Effects in Electronics","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Executable; Workload; Computer science; Reliability engineering; Reliability (semiconductor); Transient (computer programming); Failure rate; Embedded system; Fault (geology); Fault injection; System on a chip; Real-time computing; Engineering; Operating system; Software","score_opus":0.011072706899412777,"score_gpt":0.22652878767592977,"score_spread":0.21545608077651698,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1997660235","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.7802008,0.00015271595,0.2084148,0.00015976862,0.000036482063,0.00015035862,0.00082139194,0.0028910763,0.007172577],"genre_scores_gemma":[0.9837352,0.00004604855,0.014620718,0.00001312316,0.0000044262565,0.00004628498,0.00025450985,0.00010024087,0.0011794344],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996289,0.000112190166,0.000015056368,0.000052097595,0.00013404578,0.00005768466],"domain_scores_gemma":[0.9984409,0.00081891025,0.00012622918,0.00024456283,0.0003355605,0.000033793618],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006019225,0.00079253153,0.0005993787,0.00062599697,0.0002681283,0.0006482812,0.000997514,0.00064926775,0.0034437336],"category_scores_gemma":[0.002964156,0.0002976646,0.0006601838,0.0003072283,0.0003644874,0.00084876426,0.00034327921,0.0005205364,0.00033679462],"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.000052335243,0.000028596482,0.0016746032,0.00003211107,0.000017524593,0.000044076744,0.000024157107,0.99078923,0.0017618596,0.0007647034,0.00019714756,0.0046136365],"study_design_scores_gemma":[0.0000036990245,0.00003712619,0.00043146886,0.0000019932222,0.000008160311,0.000011539214,0.000006243346,0.99802715,0.0010909294,0.00028709354,0.000091709255,0.0000029041785],"about_ca_topic_score_codex":0.010189347,"about_ca_topic_score_gemma":0.0069851624,"teacher_disagreement_score":0.010189347,"about_ca_system_score_codex":0.0006949767,"about_ca_system_score_gemma":0.0011569561,"threshold_uncertainty_score":0.020260096},"labels":[],"label_agreement":null},{"id":"W1999144075","doi":"10.1007/s00607-012-0196-x","title":"Load balancing in peer-to-peer systems using a diffusive approach","year":2012,"lang":"en","type":"article","venue":"Computing","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Workload; Convergence (economics); Computer science; Upper and lower bounds; Overlay; Overlay network; Load balancing (electrical power); Distributed computing; Node (physics); Peer-to-peer; Mathematical optimization; Mathematics; Engineering","score_opus":0.03449987351668637,"score_gpt":0.28006286485362714,"score_spread":0.24556299133694076,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1999144075","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.059958197,0.00090200343,0.9338943,0.0006979052,0.00016224073,0.00018126398,0.000041481235,0.00063197664,0.0035306728],"genre_scores_gemma":[0.8839696,0.0007613534,0.110049,0.00015854934,0.00018465157,0.00021586535,0.00006512874,0.00013031396,0.004465531],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983816,0.0005276899,0.00010365398,0.00027492893,0.00056652963,0.00014555597],"domain_scores_gemma":[0.9960717,0.002281182,0.00022920473,0.00045163892,0.00070504413,0.00026124477],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023663638,0.0006377037,0.0015275744,0.001269902,0.002902886,0.002642476,0.0029569846,0.0015192407,0.0016384162],"category_scores_gemma":[0.0077375695,0.00073740963,0.0005247726,0.001223626,0.0014206094,0.003068432,0.0022990631,0.0012495297,0.00042893013],"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.00073311036,0.0003164585,0.002160471,0.0005838603,0.00025094952,0.00054878055,0.0014260726,0.67881376,0.043480664,0.15892588,0.0051261364,0.10763388],"study_design_scores_gemma":[0.000054380813,0.00008259827,0.0002072524,0.000014252639,0.000044380053,0.00009912151,0.00010564722,0.96827143,0.0026344953,0.026271109,0.002187662,0.000027631806],"about_ca_topic_score_codex":0.002742414,"about_ca_topic_score_gemma":0.0032097402,"teacher_disagreement_score":0.0029569846,"about_ca_system_score_codex":0.0015118093,"about_ca_system_score_gemma":0.001314063,"threshold_uncertainty_score":0.012514651},"labels":[],"label_agreement":null},{"id":"W2004663077","doi":"10.1007/s00607-009-0064-5","title":"Performance of several stabilized finite element methods for the Stokes equations based on the lowest equal-order pairs","year":2009,"lang":"en","type":"article","venue":"Computing","topic":"Advanced Numerical Methods in Computational Mathematics","field":"Engineering","cited_by":31,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Gauss; Finite element method; Mathematics; Convergence (economics); Order (exchange); Element (criminal law); Mathematical analysis; Gauss–Seidel method; Polynomial; Applied mathematics; Mixed finite element method; Mathematical optimization; Physics; Iterative method; Law","score_opus":0.0601805366785815,"score_gpt":0.3685665198685561,"score_spread":0.30838598318997457,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2004663077","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.735737,0.0010186819,0.25120273,0.00038488346,0.00035121723,0.00012280427,0.00024293644,0.0016592946,0.009280416],"genre_scores_gemma":[0.9359336,0.00017385489,0.061287846,0.000087131826,0.000040144656,0.00011892167,0.0002979097,0.00023396984,0.0018267063],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994073,0.0002630562,0.000036669273,0.00006850422,0.00015694178,0.00006756422],"domain_scores_gemma":[0.99563026,0.0025991765,0.00023272586,0.00034491552,0.00091244385,0.00028047158],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010750511,0.0011610471,0.0012161824,0.0009237027,0.00080201286,0.0008426415,0.0016367867,0.002146126,0.0027617693],"category_scores_gemma":[0.004392203,0.000419077,0.000706547,0.00053553167,0.0009786004,0.0008762952,0.0010028649,0.00090331945,0.0004116934],"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.0024113536,0.0005645795,0.0052173105,0.00052972476,0.00026529608,0.00017059388,0.00044058604,0.83023566,0.057103254,0.016488014,0.0021591706,0.08441449],"study_design_scores_gemma":[0.000027778546,0.00015126061,0.0003375024,0.000011658594,0.000012386777,0.000010665115,0.000024886756,0.98869157,0.009915109,0.0005735738,0.00022841674,0.000015253762],"about_ca_topic_score_codex":0.0024408102,"about_ca_topic_score_gemma":0.0021473353,"teacher_disagreement_score":0.0027617693,"about_ca_system_score_codex":0.00056308793,"about_ca_system_score_gemma":0.000955137,"threshold_uncertainty_score":0.009239078},"labels":[],"label_agreement":null},{"id":"W2011727948","doi":"10.1007/s00607-013-0361-x","title":"Comparing redundancy models for high availability middleware","year":2013,"lang":"en","type":"article","venue":"Computing","topic":"Software System Performance and Reliability","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University; Ericsson (Canada)","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Redundancy (engineering); Computer science; Provisioning; High availability; Fault tolerance; Distributed computing; Component (thermodynamics); Middleware (distributed applications); Single point of failure; Reliability engineering; Context (archaeology); Operating system; Engineering","score_opus":0.038419832611046874,"score_gpt":0.24587086504130357,"score_spread":0.2074510324302567,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2011727948","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.6662725,0.0032495055,0.3138949,0.0015787128,0.00023676606,0.0001349107,0.00039794523,0.00093023916,0.013304487],"genre_scores_gemma":[0.9810962,0.00038889472,0.01710065,0.00006714854,0.000059727194,0.000047402587,0.000115347844,0.00013454007,0.0009900075],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99602664,0.0022409623,0.00016684725,0.00026936375,0.0008790821,0.00041714942],"domain_scores_gemma":[0.9485838,0.043379433,0.0019633574,0.0034838053,0.0021417034,0.00044789523],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008276904,0.00085019215,0.0010017133,0.0023475573,0.00065327616,0.0017119696,0.0025890332,0.001352785,0.0035973813],"category_scores_gemma":[0.036407292,0.0005114517,0.0013677034,0.001486306,0.0011060465,0.0035110747,0.0010522186,0.0011661408,0.0003570688],"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.0013125935,0.00019447961,0.0033290552,0.00031278364,0.0001868388,0.000083740255,0.00032436877,0.8994556,0.001262307,0.057311416,0.0016676077,0.034559317],"study_design_scores_gemma":[0.00006904642,0.0003081012,0.0014091886,0.000034895183,0.0001370176,0.00005231837,0.00014608516,0.9605659,0.0006665,0.035978105,0.0006033653,0.000029511795],"about_ca_topic_score_codex":0.005872126,"about_ca_topic_score_gemma":0.0045754756,"teacher_disagreement_score":0.008276904,"about_ca_system_score_codex":0.0031076518,"about_ca_system_score_gemma":0.0014869778,"threshold_uncertainty_score":0.043772995},"labels":[],"label_agreement":null},{"id":"W2017161972","doi":"10.1007/s00607-013-0332-2","title":"Privacy preserving and transactional advertising for mobile services","year":2013,"lang":"en","type":"article","venue":"Computing","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Computer science; Encryption; Upload; Computer security; Scalability; Cryptography; Cloud computing; Context (archaeology); Server; Internet privacy; Homomorphic encryption; Client-side encryption; Transaction data; World Wide Web; Database transaction; Database; On-the-fly encryption","score_opus":0.008173638724672866,"score_gpt":0.24075835658924624,"score_spread":0.23258471786457338,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2017161972","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.1751975,0.002848646,0.7696937,0.0052439407,0.0004360752,0.00024127626,0.0005003827,0.0010017948,0.044836793],"genre_scores_gemma":[0.9483039,0.0007158128,0.037086334,0.00020280355,0.00028786916,0.00005102452,0.00016166626,0.00009345521,0.013097297],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966125,0.0010727188,0.0002046371,0.0003916356,0.0011667485,0.00055180717],"domain_scores_gemma":[0.9922921,0.0029420399,0.0005235945,0.0032493349,0.00074343086,0.00024954352],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002408552,0.0006053125,0.0010312889,0.0007608286,0.0018154659,0.0050081336,0.0015778781,0.0017245773,0.00521431],"category_scores_gemma":[0.010207526,0.00059078896,0.0008209892,0.0016395124,0.0023275,0.00868852,0.0018872819,0.0028303042,0.0011603638],"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.00094596983,0.00026236914,0.0011708828,0.000118588134,0.00004161946,0.00032580947,0.00041316453,0.03485534,0.0068166167,0.87363905,0.005686655,0.07572401],"study_design_scores_gemma":[0.000049461967,0.00013737667,0.000451375,0.000027140843,0.000041941654,0.000575378,0.00017158187,0.28257456,0.005865579,0.70092124,0.009147932,0.000036410707],"about_ca_topic_score_codex":0.0014126383,"about_ca_topic_score_gemma":0.0013526356,"teacher_disagreement_score":0.00521431,"about_ca_system_score_codex":0.0017771001,"about_ca_system_score_gemma":0.0017903049,"threshold_uncertainty_score":0.017443597},"labels":[],"label_agreement":null},{"id":"W2025042589","doi":"10.1007/s00607-013-0375-4","title":"TurboLock: increasing associativity of lock table in transactional memory","year":2013,"lang":"en","type":"article","venue":"Computing","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Transactional memory; Software transactional memory; Lock (firearm); Parallel computing; Overhead (engineering); Concurrency; Exploit; Table (database); Distributed computing; Operating system; Programming language; Computer security; Database transaction; Data mining","score_opus":0.008302495638667196,"score_gpt":0.2172443057043419,"score_spread":0.2089418100656747,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2025042589","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.12073345,0.0025156774,0.86327535,0.0004773038,0.0005555908,0.00009373498,0.00022832006,0.006363705,0.0057568615],"genre_scores_gemma":[0.75530577,0.0009374144,0.23723042,0.00040156677,0.00039928238,0.00017886279,0.00023073831,0.00063242926,0.0046834634],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979273,0.00051031075,0.00019398991,0.0003375757,0.00065294694,0.00037775404],"domain_scores_gemma":[0.9866541,0.0046451767,0.0008233596,0.0052264174,0.0018644156,0.0007866726],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023737848,0.0005775617,0.001108093,0.0014841118,0.0013609637,0.0024179674,0.0032892677,0.000798154,0.0057437425],"category_scores_gemma":[0.012421884,0.00060383166,0.00061075704,0.0030795292,0.0018344842,0.0063003064,0.0034462465,0.0018119024,0.0010866817],"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.004020177,0.00052331004,0.008366383,0.0007952851,0.00015035509,0.0004313063,0.0009721473,0.06909783,0.059038065,0.26827824,0.014402264,0.5739246],"study_design_scores_gemma":[0.00051424163,0.0013459494,0.0013136856,0.00015305646,0.00042558849,0.0011455667,0.0004006236,0.633199,0.090145886,0.2420456,0.029129066,0.00018178522],"about_ca_topic_score_codex":0.0010700801,"about_ca_topic_score_gemma":0.0014226564,"teacher_disagreement_score":0.0057437425,"about_ca_system_score_codex":0.0007546681,"about_ca_system_score_gemma":0.0022867804,"threshold_uncertainty_score":0.01921475},"labels":[],"label_agreement":null},{"id":"W2025944808","doi":"10.1007/s006070050007","title":"Finite Volume Element Approximations of Nonlocal in Time One-Dimensional Flows in Porous Media","year":2000,"lang":"en","type":"article","venue":"Computing","topic":"Advanced Numerical Methods in Computational Mathematics","field":"Engineering","cited_by":44,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; Texas A and M University; Lawrence Livermore National Laboratory; U.S. Department of Energy; National Science Foundation","keywords":"Finite element method; Finite volume method; Mathematics; Norm (philosophy); Volume (thermodynamics); Approximations of π; Mathematical analysis; Applied mathematics; Porous medium; Mixed finite element method; hp-FEM; Partial differential equation; Representative elementary volume; Finite element limit analysis; Mechanics; Porosity; Physics; Materials science","score_opus":0.020461392545174515,"score_gpt":0.26807967768122914,"score_spread":0.24761828513605463,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2025944808","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.08397622,0.00062003225,0.9094251,0.00035064731,0.00018579072,0.000041338026,0.000047877096,0.00021161749,0.0051413244],"genre_scores_gemma":[0.7503889,0.0008719722,0.23065561,0.00017098594,0.00014744521,0.00016818983,0.0001858839,0.00026411744,0.017146993],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99966073,0.000120232304,0.000021068157,0.000039101225,0.00011873233,0.00004015075],"domain_scores_gemma":[0.9987637,0.0007402154,0.00010958846,0.00010190044,0.00020328503,0.000081410726],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011851595,0.0004843407,0.0009345212,0.0007123265,0.00047866668,0.0013283608,0.0013557792,0.0016928593,0.0010065386],"category_scores_gemma":[0.004011082,0.00041744905,0.0005100746,0.00056272466,0.001871139,0.0015836819,0.0011846811,0.001311689,0.00030599005],"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.00007018899,0.000092610506,0.00044449035,0.00010819719,0.000018520033,0.000058038684,0.00013716346,0.92980707,0.004130346,0.053912893,0.00041026608,0.010810154],"study_design_scores_gemma":[0.0000028587947,0.0000046279692,0.00002385613,0.0000036369786,0.0000013667798,0.000004401051,0.0000075270377,0.9969963,0.00047880074,0.0022235748,0.00025055325,0.0000026000546],"about_ca_topic_score_codex":0.0042974064,"about_ca_topic_score_gemma":0.005088129,"teacher_disagreement_score":0.0042974064,"about_ca_system_score_codex":0.00090805703,"about_ca_system_score_gemma":0.0010763397,"threshold_uncertainty_score":0.008544803},"labels":[],"label_agreement":null},{"id":"W2038514592","doi":"10.1007/s00607-015-0445-x","title":"Specification, verification, and quantification of security in model-based systems","year":2015,"lang":"en","type":"article","venue":"Computing","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Systems Modeling Language; Correctness; Unified Modeling Language; Software security assurance; Software engineering; Modeling language; Computer security model; Computer security; Security testing; Software; Systems engineering; Security information and event management; Information security; Programming language; Security service; Cloud computing security; Engineering; Operating system","score_opus":0.0877375456571489,"score_gpt":0.32004104581729464,"score_spread":0.23230350016014573,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2038514592","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.015445062,0.00026706708,0.98021746,0.0010685179,0.00006011362,0.000115806644,0.00011993186,0.0007744088,0.001931676],"genre_scores_gemma":[0.5931837,0.0007096902,0.40276912,0.00035988234,0.00018494634,0.00060052704,0.00033961993,0.00035185646,0.0015007452],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.97021806,0.013738659,0.0026971442,0.0024393892,0.009164785,0.0017419303],"domain_scores_gemma":[0.94651765,0.034162313,0.003399115,0.01153448,0.0037745675,0.0006120006],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.020278456,0.001591911,0.0019094805,0.0023950143,0.0020038967,0.008277534,0.0036732054,0.0028751134,0.0020442505],"category_scores_gemma":[0.056214053,0.002106106,0.003999995,0.0017006132,0.011374105,0.014066258,0.0054666535,0.0068450808,0.00047475583],"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.0001300033,0.000089781395,0.00087935914,0.00024102346,0.00007150342,0.00008757216,0.00046595905,0.05400701,0.0023464854,0.9247304,0.00079198607,0.01615902],"study_design_scores_gemma":[0.000070088456,0.00005635253,0.00020289801,0.00010297748,0.00008564223,0.000053680804,0.000077891695,0.20092607,0.007866472,0.7877764,0.0027311884,0.000050308987],"about_ca_topic_score_codex":0.0061932425,"about_ca_topic_score_gemma":0.0045053144,"teacher_disagreement_score":0.020278456,"about_ca_system_score_codex":0.005071188,"about_ca_system_score_gemma":0.009009805,"threshold_uncertainty_score":0.107244015},"labels":[],"label_agreement":null},{"id":"W2039888183","doi":"10.1007/s00607-011-0165-9","title":"Towards a better way of computing: a return from bits to atoms via physics and biology","year":2011,"lang":"en","type":"article","venue":"Computing","topic":"Modular Robots and Swarm Intelligence","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":"Impact","funders":"","keywords":"Computer science; Parallels; Human–computer interaction; Data science; Task (project management); Metaverse; Software; Virtual reality; Systems engineering; Engineering","score_opus":0.04812683119579398,"score_gpt":0.25089175365588795,"score_spread":0.20276492246009398,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2039888183","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.016768359,0.081371814,0.59610265,0.167948,0.010047645,0.000104823994,0.0002857616,0.0017562978,0.12561467],"genre_scores_gemma":[0.47777873,0.049917,0.37686253,0.030208163,0.009099543,0.00044658926,0.00032577108,0.0012975448,0.05406406],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99851483,0.0006221398,0.000061948,0.00022627374,0.00043657934,0.00013828276],"domain_scores_gemma":[0.9965842,0.0015496081,0.00013495205,0.0009181623,0.000495258,0.0003177799],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033613145,0.0014063342,0.0020387706,0.0017474714,0.002392186,0.009181484,0.0019608857,0.005978329,0.008560718],"category_scores_gemma":[0.007458299,0.0006867615,0.0012769536,0.001008504,0.022213332,0.034301993,0.007108618,0.00921835,0.0035629189],"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.000026573365,0.000024336256,0.00010074244,0.00017407812,0.000023685789,0.000020580002,0.0003287968,0.0010471871,0.00058851804,0.9758076,0.008679032,0.013178887],"study_design_scores_gemma":[0.000012452436,0.000020267968,0.00004030567,0.000074049174,0.0000074691998,0.00004151208,0.00013263624,0.0020973566,0.000368486,0.95353,0.043652188,0.000023274288],"about_ca_topic_score_codex":0.0009792093,"about_ca_topic_score_gemma":0.000714654,"teacher_disagreement_score":0.009181484,"about_ca_system_score_codex":0.0023640199,"about_ca_system_score_gemma":0.0019851075,"threshold_uncertainty_score":0.028638422},"labels":[],"label_agreement":null},{"id":"W2043734742","doi":"10.1007/s00607-003-0022-6","title":"Stability of solutions of delay functional integro-differential equations and their discretizations","year":2003,"lang":"en","type":"article","venue":"Computing","topic":"Numerical methods for differential equations","field":"Mathematics","cited_by":23,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Collocation (remote sensing); Mathematics; Runge–Kutta methods; Stability (learning theory); Basis (linear algebra); Collocation method; Differential equation; Applied mathematics; Delay differential equation; Numerical stability; Mathematical analysis; Class (philosophy); Numerical analysis; Ordinary differential equation; Computer science; Geometry","score_opus":0.1409085499038111,"score_gpt":0.33158253388014447,"score_spread":0.19067398397633337,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2043734742","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.5125519,0.004002843,0.45057693,0.0027997151,0.0005084365,0.00009472366,0.00022740856,0.00023080465,0.029007288],"genre_scores_gemma":[0.9687998,0.0009338467,0.020158261,0.00014916659,0.00009726971,0.00007537266,0.00011603576,0.00008601953,0.009584264],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99975127,0.00009289291,0.000017076032,0.000036636655,0.00006700429,0.000035128316],"domain_scores_gemma":[0.99793786,0.0012865077,0.00026297622,0.000097713615,0.00028176443,0.00013316989],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011423782,0.0006533945,0.00055549055,0.0013329294,0.000821663,0.0019890792,0.0008688871,0.000927868,0.0018774047],"category_scores_gemma":[0.006146519,0.0003225229,0.0005132672,0.00057364366,0.002458793,0.0015808766,0.0013704984,0.0011751849,0.00016635477],"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.00030065601,0.000075665725,0.001764307,0.00012617552,0.000042945238,0.00012744486,0.00038349384,0.18161768,0.009027973,0.7944341,0.0011214223,0.010978171],"study_design_scores_gemma":[0.000022788277,0.000018517077,0.0002822987,0.000022383945,0.0000063096963,0.000027637843,0.000064012136,0.81438184,0.00093765825,0.18342061,0.0007996845,0.000016153668],"about_ca_topic_score_codex":0.004001232,"about_ca_topic_score_gemma":0.001843891,"teacher_disagreement_score":0.004001232,"about_ca_system_score_codex":0.0015194294,"about_ca_system_score_gemma":0.00097215764,"threshold_uncertainty_score":0.011024237},"labels":[],"label_agreement":null},{"id":"W2067222153","doi":"10.1007/s006070070001","title":"Simulated Annealing for Fitting Linear Combinations of Gaussians to Data","year":2000,"lang":"en","type":"article","venue":"Computing","topic":"Scientific Research and Discoveries","field":"Physics and Astronomy","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Maxima and minima; Gaussian; Simulated annealing; Algorithm; Computer science; Gradient descent; Gaussian function; Convergence (economics); Mixture model; Mathematical optimization; Applied mathematics; Mathematics; Artificial intelligence; Artificial neural network; Physics","score_opus":0.06808277752787258,"score_gpt":0.38755941518681464,"score_spread":0.3194766376589421,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2067222153","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.013537172,0.00034343192,0.9838628,0.00020112336,0.000044454224,0.00009552453,0.00007338634,0.0012701972,0.00057190063],"genre_scores_gemma":[0.21340565,0.00022462956,0.78279525,0.00016022747,0.000059008675,0.00057630206,0.0004730142,0.0007487877,0.0015571014],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969216,0.0020678716,0.00017097796,0.0003725449,0.00033053212,0.00013638729],"domain_scores_gemma":[0.98943806,0.008522817,0.00032993656,0.0008973354,0.00061340135,0.0001984677],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004340269,0.0011646986,0.001883565,0.0013626337,0.0016197074,0.0012963272,0.0025892388,0.002333751,0.0023529418],"category_scores_gemma":[0.021472,0.0020808904,0.0023483336,0.0020874983,0.0019028444,0.0017736305,0.0018646482,0.0036160287,0.0007710948],"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.00015241615,0.000045875055,0.00060240837,0.000056151144,0.00012245722,0.000028013455,0.0001109527,0.961231,0.0007645559,0.007243683,0.0007797499,0.02886279],"study_design_scores_gemma":[0.000011137877,0.000008199315,0.00006317003,0.0000033880929,0.0000074773675,0.0000050057583,0.0000056844574,0.9945088,0.00023235776,0.0049267113,0.00022376124,0.00000428371],"about_ca_topic_score_codex":0.016486822,"about_ca_topic_score_gemma":0.016591653,"teacher_disagreement_score":0.016486822,"about_ca_system_score_codex":0.0021871845,"about_ca_system_score_gemma":0.0023330983,"threshold_uncertainty_score":0.03278172},"labels":[],"label_agreement":null},{"id":"W2084095496","doi":"10.1007/s00607-008-0009-4","title":"On the numerical solution of nonlinear systems of Volterra integro-differential equations with delay arguments","year":2008,"lang":"en","type":"article","venue":"Computing","topic":"Mathematical and Theoretical Epidemiology and Ecology Models","field":"Medicine","cited_by":60,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Memorial University of Newfoundland","keywords":"Superconvergence; Piecewise; Nonlinear system; Mathematics; Collocation method; Convergence (economics); Polynomial; Differential equation; Applied mathematics; Collocation (remote sensing); Volterra integral equation; Numerical analysis; Mathematical analysis; Computer science; Ordinary differential equation; Finite element method; Integral equation","score_opus":0.05106779509966347,"score_gpt":0.29030405803498355,"score_spread":0.23923626293532008,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2084095496","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.03283785,0.0023619137,0.9498129,0.0019136153,0.00049815705,0.00007255846,0.00004820909,0.00014945742,0.0123052765],"genre_scores_gemma":[0.67635286,0.0029252481,0.30608392,0.0004607245,0.0004757742,0.00023166463,0.000120158744,0.0002156088,0.0131339915],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994585,0.00026965616,0.000037488197,0.000052612224,0.0001374495,0.000044168264],"domain_scores_gemma":[0.9941918,0.004872285,0.00022996057,0.0001790571,0.00040038425,0.00012660184],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002228308,0.00094989245,0.0010254659,0.00090014044,0.0008359477,0.0017577058,0.0011395409,0.002080522,0.0022757289],"category_scores_gemma":[0.013451249,0.00045328058,0.0005812498,0.00087419566,0.0032823076,0.002117744,0.0025026798,0.0018960265,0.00033900436],"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.0001370523,0.00006030109,0.00065646536,0.00019764726,0.000042118707,0.000079963174,0.00020042667,0.7413329,0.0018985348,0.22812417,0.001063551,0.026206942],"study_design_scores_gemma":[0.0000104710925,0.000009383022,0.00004085591,0.000013249306,0.0000036067643,0.0000071298045,0.000010154662,0.9694294,0.0002399857,0.029469999,0.0007598379,0.0000059503727],"about_ca_topic_score_codex":0.006270613,"about_ca_topic_score_gemma":0.0026390322,"teacher_disagreement_score":0.006270613,"about_ca_system_score_codex":0.0011106445,"about_ca_system_score_gemma":0.0011197105,"threshold_uncertainty_score":0.012468219},"labels":[],"label_agreement":null},{"id":"W2098548175","doi":"10.1007/s00607-005-0137-z","title":"A Numerical Study of the Xu Polynomial Interpolation Formula in Two Variables","year":2005,"lang":"en","type":"article","venue":"Computing","topic":"Mathematical functions and polynomials","field":"Mathematics","cited_by":23,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Università degli Studi di Padova","keywords":"Interpolation (computer graphics); Mathematics; Lagrange polynomial; Polynomial interpolation; Chebyshev nodes; Trigonometric interpolation; Birkhoff interpolation; Applied mathematics; Polynomial; Linear interpolation; Chebyshev polynomials; Chebyshev filter; Variable (mathematics); Stability (learning theory); Mathematical analysis; Computer science","score_opus":0.042951203238913896,"score_gpt":0.34581327033634857,"score_spread":0.3028620670974347,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2098548175","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.6997547,0.0022005215,0.2262324,0.0019344923,0.0005571845,0.00011656533,0.00015125312,0.00044043057,0.06861251],"genre_scores_gemma":[0.9386255,0.0002977451,0.056699175,0.000126642,0.000053266453,0.000042183874,0.000050430994,0.000101146674,0.0040038275],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99973327,0.000110006615,0.000009150191,0.000021078247,0.00009053766,0.000035931233],"domain_scores_gemma":[0.996976,0.0021935205,0.00016708086,0.00021136393,0.00035467217,0.00009741223],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013126251,0.00028864498,0.0007323236,0.0008610689,0.00082267984,0.0008899842,0.0009792369,0.0008781742,0.005155075],"category_scores_gemma":[0.009262909,0.00017892505,0.0003100265,0.0015395252,0.0012430802,0.001500442,0.0008192678,0.0010444422,0.00019895857],"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.00046513122,0.00020435768,0.003261479,0.00035326125,0.000043904405,0.00035244605,0.0004355574,0.2875737,0.0049545574,0.660944,0.002644624,0.038766943],"study_design_scores_gemma":[0.00003111375,0.000039108058,0.00041993774,0.000020783824,0.0000080440095,0.000055424323,0.000069414935,0.9768,0.0009968142,0.02064004,0.00090767816,0.000011651734],"about_ca_topic_score_codex":0.0027102747,"about_ca_topic_score_gemma":0.0020551893,"teacher_disagreement_score":0.005155075,"about_ca_system_score_codex":0.00057982415,"about_ca_system_score_gemma":0.00074295094,"threshold_uncertainty_score":0.017245471},"labels":[],"label_agreement":null},{"id":"W2105143665","doi":"10.1007/s00607-014-0409-6","title":"ACS: an effective admission control scheme with deadlock resolutions for workflow scheduling in clouds","year":2014,"lang":"en","type":"article","venue":"Computing","topic":"Distributed and Parallel Computing Systems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Computer science; Distributed computing; Cloud computing; Provisioning; Workflow; Scheduling (production processes); Workflow management system; Virtual machine; Benchmark (surveying); Workflow technology; Deadlock prevention algorithms; Deadlock; Computer network; Database; Operating system; Engineering","score_opus":0.012774922078309913,"score_gpt":0.26326635956201466,"score_spread":0.2504914374837047,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2105143665","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.05030383,0.00055198284,0.9358253,0.0008902181,0.00097589084,0.00040154348,0.00020961199,0.007010016,0.003831579],"genre_scores_gemma":[0.8395825,0.00015619575,0.15674597,0.00036481238,0.00029271122,0.00017773788,0.00018129013,0.0002062645,0.0022925078],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964593,0.000992043,0.0003153423,0.00044299845,0.001056693,0.00073348935],"domain_scores_gemma":[0.9943725,0.00154184,0.00041086588,0.0014128642,0.0013426446,0.0009192429],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004594513,0.00091219816,0.0016305293,0.0012932541,0.002347707,0.0030509953,0.0036341161,0.001188815,0.003027642],"category_scores_gemma":[0.008329151,0.00048346157,0.00076053,0.001594473,0.0018689682,0.002500632,0.0039815023,0.0027022234,0.00058365223],"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.0057208035,0.00089583755,0.00311258,0.0004086425,0.00024775614,0.00042472855,0.0007392006,0.3722757,0.040044844,0.1412397,0.029935967,0.40495417],"study_design_scores_gemma":[0.00014357823,0.00013784219,0.00023079425,0.000011956052,0.00004713524,0.00006828931,0.000066484274,0.97097206,0.006196407,0.018565796,0.0035093587,0.00005027948],"about_ca_topic_score_codex":0.008378143,"about_ca_topic_score_gemma":0.006510108,"teacher_disagreement_score":0.008378143,"about_ca_system_score_codex":0.002254216,"about_ca_system_score_gemma":0.006305664,"threshold_uncertainty_score":0.02429843},"labels":[],"label_agreement":null},{"id":"W2115333632","doi":"10.1007/s00607-012-0215-y","title":"Monitoring and recovery for web service applications","year":2012,"lang":"en","type":"article","venue":"Computing","topic":"Service-Oriented Architecture and Web Services","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Correctness; Business Process Execution Language; Computer science; Web service; Automaton; Finite-state machine; Service (business); Distributed computing; Software engineering; Web application; Adaptation (eye); Service-oriented architecture; Programming language; World Wide Web; Theoretical computer science","score_opus":0.017972692974113077,"score_gpt":0.2640509283156918,"score_spread":0.24607823534157874,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2115333632","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.2934766,0.0016758614,0.68641686,0.0014408295,0.00023401027,0.00028325128,0.00014521301,0.0105379075,0.0057893908],"genre_scores_gemma":[0.96066904,0.00024545414,0.03631667,0.00008722515,0.0000392368,0.000054868757,0.00010560275,0.00010231144,0.0023796768],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9983917,0.00031686842,0.00011456247,0.00022787966,0.00075034803,0.00019855953],"domain_scores_gemma":[0.9971259,0.001035687,0.0004915374,0.00066081673,0.00053412747,0.00015186759],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018784514,0.0005526725,0.0006822788,0.0012448267,0.0009661295,0.0013756106,0.0013624291,0.0008675853,0.0010682432],"category_scores_gemma":[0.007079243,0.0003824235,0.00033452982,0.0006638476,0.0007853381,0.001886189,0.00095831964,0.0011688153,0.00030973816],"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.0026486393,0.00091353257,0.019069167,0.0004738773,0.00015459227,0.0010541569,0.0010214087,0.19403297,0.08865109,0.042991105,0.0126138395,0.6363756],"study_design_scores_gemma":[0.000032078482,0.0001034224,0.0025368195,0.000028835893,0.00005078029,0.00020883195,0.000113040376,0.9488295,0.030743903,0.014312679,0.003016984,0.000023219221],"about_ca_topic_score_codex":0.00500539,"about_ca_topic_score_gemma":0.003631745,"teacher_disagreement_score":0.00500539,"about_ca_system_score_codex":0.0010175103,"about_ca_system_score_gemma":0.0011755163,"threshold_uncertainty_score":0.009952486},"labels":[],"label_agreement":null},{"id":"W2131771497","doi":"10.1007/s00607-004-0056-9","title":"Robust Spherical Parameterization of Triangular Meshes","year":2004,"lang":"en","type":"article","venue":"Computing","topic":"3D Shape Modeling and Analysis","field":"Engineering","cited_by":77,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Polygon mesh; Morphing; Triangle mesh; Volume mesh; Triangulation; Mathematics; Unit sphere; Computer science; Spherical trigonometry; Position (finance); Computer graphics; Domain (mathematical analysis); Mesh generation; Geometry; Computer graphics (images); Combinatorics; Finite element method; Mathematical analysis; Physics","score_opus":0.02487536545239894,"score_gpt":0.20891234347659537,"score_spread":0.18403697802419644,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2131771497","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.005078965,0.000042186926,0.99319345,0.000038551458,0.00001820646,0.000018264162,0.00005681713,0.00040036626,0.0011531664],"genre_scores_gemma":[0.44112584,0.00029546767,0.5516514,0.000117655756,0.00006769695,0.00015259671,0.000992067,0.0013394527,0.0042578033],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99856085,0.00033193143,0.000095671756,0.00021897563,0.00069833006,0.00009430346],"domain_scores_gemma":[0.9980413,0.00049458165,0.00018136071,0.00072268903,0.00048905745,0.00007100955],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008700893,0.0007175051,0.0010292493,0.0013868846,0.00039811042,0.001711015,0.0016743722,0.0009590996,0.0043390803],"category_scores_gemma":[0.006688712,0.0006011675,0.0010613783,0.0013666311,0.0009497314,0.001573479,0.0021615413,0.0014430734,0.0015705416],"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.00024958598,0.000043976197,0.00059229485,0.0001515161,0.000060577164,0.000096275966,0.00023390901,0.5636423,0.034501147,0.09357732,0.0052507604,0.3016004],"study_design_scores_gemma":[0.000006887036,0.000030394966,0.0001284329,0.000009562285,0.000006706429,0.000045775258,0.000033467546,0.96974754,0.005957684,0.020469645,0.0035498738,0.000014154748],"about_ca_topic_score_codex":0.0024568124,"about_ca_topic_score_gemma":0.002893842,"teacher_disagreement_score":0.0043390803,"about_ca_system_score_codex":0.0006966418,"about_ca_system_score_gemma":0.0007279727,"threshold_uncertainty_score":0.014515638},"labels":[],"label_agreement":null},{"id":"W2146228093","doi":"10.1007/s00607-005-0141-3","title":"Adaptive Techniques for Spline Collocation","year":2005,"lang":"en","type":"article","venue":"Computing","topic":"Advanced Numerical Analysis Techniques","field":"Engineering","cited_by":24,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; China Scholarship Council","keywords":"Piecewise; Mathematics; Collocation method; Estimator; Hermite spline; Collocation (remote sensing); Spline (mechanical); Applied mathematics; Grid; Boundary value problem; Quadratic equation; Mathematical optimization; Smoothing spline; Algorithm; Mathematical analysis; Spline interpolation; Computer science; Geometry; Differential equation; Bilinear interpolation; Ordinary differential equation","score_opus":0.011937958552365622,"score_gpt":0.26677117930548816,"score_spread":0.25483322075312254,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2146228093","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.0018416336,0.00046112973,0.9958144,0.000074256706,0.00010834612,0.000009540821,0.000014207677,0.00016676782,0.0015096845],"genre_scores_gemma":[0.1685869,0.0017895943,0.81469387,0.00012195886,0.00039515388,0.00017456361,0.00017634191,0.0004491038,0.01361253],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992605,0.00028423683,0.00003359149,0.000068364614,0.00031126852,0.00004200522],"domain_scores_gemma":[0.9982974,0.0008860966,0.000077921606,0.00028425068,0.00040498975,0.00004931261],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00082937983,0.0005856887,0.00075548224,0.0008996525,0.0005305796,0.000857662,0.0012856158,0.0009772112,0.0051715444],"category_scores_gemma":[0.006267879,0.0004608496,0.00064774725,0.001452147,0.0010647152,0.0009490769,0.0014451776,0.0026081223,0.0019867632],"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.00018242894,0.00006456282,0.00061752566,0.00026486765,0.000079843594,0.00008810471,0.00023400894,0.26758844,0.011031773,0.28623116,0.009609918,0.4240074],"study_design_scores_gemma":[0.00001393861,0.00001661834,0.00012454951,0.000021443126,0.000008295636,0.000025956208,0.000014353981,0.93619376,0.0012701803,0.05167848,0.010620317,0.000012086665],"about_ca_topic_score_codex":0.002983806,"about_ca_topic_score_gemma":0.0034680662,"teacher_disagreement_score":0.0051715444,"about_ca_system_score_codex":0.00038996522,"about_ca_system_score_gemma":0.0005994141,"threshold_uncertainty_score":0.017300487},"labels":[],"label_agreement":null},{"id":"W2165372370","doi":"10.1007/s00607-005-0140-4","title":"Optimal Quadratic and Cubic Spline Collocation on Nonuniform Partitions","year":2005,"lang":"en","type":"article","venue":"Computing","topic":"Advanced Numerical Analysis Techniques","field":"Engineering","cited_by":26,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; China Scholarship Council","keywords":"Mathematics; Collocation method; Collocation (remote sensing); Orthogonal collocation; Spline (mechanical); Applied mathematics; Boundary value problem; Quadratic equation; Uniqueness; Mathematical analysis; Nonlinear system; Ordinary differential equation; Geometry; Differential equation; Computer science","score_opus":0.007540692905724686,"score_gpt":0.24516778160595393,"score_spread":0.23762708870022925,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2165372370","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.06594218,0.0003016382,0.92958945,0.00015294038,0.00008507918,0.000022414064,0.000052340234,0.00013771509,0.0037162139],"genre_scores_gemma":[0.6771378,0.00024042882,0.31720686,0.00004945175,0.00004960465,0.00006663262,0.000113387105,0.00017233746,0.0049633496],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993181,0.00030407,0.00002689112,0.0000604981,0.00022062613,0.00006977255],"domain_scores_gemma":[0.997569,0.0015696961,0.00010391977,0.00030928376,0.00034889107,0.000099075005],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012878359,0.00045093606,0.0010946342,0.00055988994,0.0004572972,0.0007651031,0.0008473667,0.00080764556,0.0026409542],"category_scores_gemma":[0.0081620915,0.000398293,0.00032312982,0.0008354568,0.001160754,0.000964634,0.0015940359,0.00075824826,0.00029065204],"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.00055388117,0.00004846234,0.0006452126,0.00011155724,0.000015210718,0.00004505726,0.00013065642,0.8723898,0.0047453693,0.06118858,0.0016706742,0.058455635],"study_design_scores_gemma":[0.0000081211165,0.00001196412,0.00006137572,0.000003204934,0.0000017075353,0.0000048354264,0.000010033263,0.99374336,0.00041680245,0.0054515977,0.00028404733,0.0000029779771],"about_ca_topic_score_codex":0.0051741996,"about_ca_topic_score_gemma":0.008309296,"teacher_disagreement_score":0.0051741996,"about_ca_system_score_codex":0.00066325755,"about_ca_system_score_gemma":0.0008529652,"threshold_uncertainty_score":0.010288119},"labels":[],"label_agreement":null},{"id":"W2623963253","doi":"10.1007/s00607-017-0560-y","title":"Performance impacts of hybrid cloud storage","year":2017,"lang":"en","type":"article","venue":"Computing","topic":"Advanced Data Storage Technologies","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Cloud computing; Computer science; Cloud storage; Operating system","score_opus":0.023440478562033733,"score_gpt":0.2770958936438562,"score_spread":0.25365541508182243,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2623963253","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.986304,0.0007417765,0.0019621046,0.00043610265,0.00009719335,0.000023590768,0.0007208363,0.0005268616,0.009187416],"genre_scores_gemma":[0.9979297,0.00008142432,0.0004978114,0.000034330664,0.000019075957,0.0000063175107,0.00030848227,0.00003053112,0.0010923031],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99885356,0.000185649,0.000056565234,0.00016140452,0.0002654578,0.00047736545],"domain_scores_gemma":[0.99579346,0.0018734265,0.00020909033,0.00050131284,0.0011182213,0.00050454604],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011076819,0.0006358503,0.0005846524,0.00072829047,0.0009757055,0.0021060028,0.0013612458,0.00071970106,0.013011994],"category_scores_gemma":[0.0028389264,0.00021784706,0.00034293052,0.0018581669,0.00077126164,0.0028237887,0.0010608258,0.0004791029,0.0010664648],"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.03663756,0.001735044,0.047114015,0.0009919249,0.00058583065,0.0017272301,0.00043455558,0.5366115,0.16936222,0.031610426,0.02540167,0.14778797],"study_design_scores_gemma":[0.0007524007,0.004182846,0.058118146,0.00008912822,0.000489312,0.0010783231,0.0017905554,0.772534,0.13305554,0.018101325,0.009619026,0.00018935684],"about_ca_topic_score_codex":0.005625689,"about_ca_topic_score_gemma":0.0048504802,"teacher_disagreement_score":0.013011994,"about_ca_system_score_codex":0.0014419216,"about_ca_system_score_gemma":0.0008970214,"threshold_uncertainty_score":0.04352945},"labels":[],"label_agreement":null},{"id":"W2807971989","doi":"10.1007/s00607-018-0631-8","title":"On personalized cloud service provisioning for mobile users using adaptive and context-aware service composition","year":2018,"lang":"en","type":"article","venue":"Computing","topic":"Context-Aware Activity Recognition Systems","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":"McGill University","funders":"","keywords":"Computer science; Provisioning; Personalization; Cloud computing; Context (archaeology); World Wide Web; Service provider; Service (business); Service delivery framework; Mobile computing; Mobile QoS; Computer network; Business","score_opus":0.055359060092074815,"score_gpt":0.30339243517674586,"score_spread":0.24803337508467105,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2807971989","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.0537194,0.001178057,0.9359628,0.00061937585,0.00008544913,0.00026211145,0.000042870906,0.00043992113,0.0076900222],"genre_scores_gemma":[0.6196248,0.0014913044,0.37440044,0.00019218276,0.00009063996,0.00013624068,0.00012642972,0.00008810061,0.0038498275],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988219,0.00031718976,0.000086746695,0.00020223661,0.00040753497,0.00016421804],"domain_scores_gemma":[0.99955684,0.00014572298,0.000037000285,0.0000886392,0.00011206851,0.00005960656],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009970061,0.0005797324,0.0006566484,0.00092137215,0.0014349492,0.0017292695,0.0010002261,0.00078741374,0.0010532265],"category_scores_gemma":[0.0017803132,0.00027151807,0.0007766733,0.0014213022,0.00074429525,0.0017419585,0.0014885241,0.0008144784,0.00037523624],"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.00053563167,0.0005667666,0.007036406,0.00043220565,0.0001995831,0.0012291251,0.0012369768,0.31850564,0.053518888,0.13547106,0.0044385167,0.47682914],"study_design_scores_gemma":[0.000017208422,0.00009407678,0.00093400106,0.000045858895,0.0000647546,0.0004210844,0.0002575739,0.9588364,0.009790833,0.019241773,0.0102629075,0.00003356939],"about_ca_topic_score_codex":0.008226646,"about_ca_topic_score_gemma":0.007676303,"teacher_disagreement_score":0.008226646,"about_ca_system_score_codex":0.0010347285,"about_ca_system_score_gemma":0.0015630018,"threshold_uncertainty_score":0.016357481},"labels":[],"label_agreement":null},{"id":"W2888674064","doi":"10.1007/s00607-018-0655-0","title":"Policy expressions and the bottom-up design of computing policies","year":2018,"lang":"en","type":"article","venue":"Computing","topic":"Network Packet Processing and Optimization","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 Alberta","funders":"National Science Foundation","keywords":"Equivalence (formal languages); Computer science; Set (abstract data type); Generalization; Predicate (mathematical logic); Policy analysis; Expression (computer science); Representation (politics); Theoretical computer science; Mathematics; Discrete mathematics; Law; Programming language; Political science","score_opus":0.026249889761590837,"score_gpt":0.28960667376180615,"score_spread":0.26335678400021534,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2888674064","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.005120698,0.00014658256,0.99070436,0.00041934696,0.00006496725,0.000070322094,0.00004566329,0.00043485104,0.0029932186],"genre_scores_gemma":[0.34688085,0.00050072174,0.64675516,0.0004722855,0.00013935551,0.0003831632,0.00021347954,0.00040026347,0.0042547323],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99368083,0.0027293924,0.0004875838,0.00066249986,0.0015751757,0.0008644477],"domain_scores_gemma":[0.9921996,0.0047861286,0.00036341636,0.0011484332,0.0011819941,0.00032042578],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007041869,0.0011039365,0.0012625139,0.0009268134,0.0013919644,0.004836102,0.0023583116,0.0013864309,0.0035537686],"category_scores_gemma":[0.018147137,0.0011239767,0.0012160375,0.0010649884,0.003028588,0.0048261154,0.0030370757,0.0037422888,0.00092436135],"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.00021003757,0.000088577886,0.00032199651,0.00017640612,0.00003598024,0.00009100678,0.00026212752,0.19953752,0.0028927568,0.73735625,0.002633517,0.056393843],"study_design_scores_gemma":[0.000031175834,0.000036373447,0.00002934354,0.000048699745,0.0000280013,0.00002199512,0.00003678708,0.59112227,0.004031422,0.39996642,0.00463068,0.000016854436],"about_ca_topic_score_codex":0.0017892127,"about_ca_topic_score_gemma":0.002003894,"teacher_disagreement_score":0.007041869,"about_ca_system_score_codex":0.0027761764,"about_ca_system_score_gemma":0.003718494,"threshold_uncertainty_score":0.0372414},"labels":[],"label_agreement":null},{"id":"W2900493992","doi":"10.1007/s00607-018-0678-6","title":"An end-to-end joint learning framework of artery-specific coronary calcium scoring in non-contrast cardiac CT","year":2018,"lang":"en","type":"article","venue":"Computing","topic":"Advanced X-ray and CT Imaging","field":"Engineering","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Calcification; Medicine; Coronary artery disease; Radiology; Artery; Contrast (vision); Internal medicine; Cardiology; Artificial intelligence; Computer science","score_opus":0.014306880084942249,"score_gpt":0.25176855067769227,"score_spread":0.23746167059275003,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2900493992","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.014989652,0.00041720536,0.9798365,0.00019891316,0.000081654114,0.00010946428,0.00023834185,0.003637372,0.00049096165],"genre_scores_gemma":[0.30473566,0.0004766296,0.68457514,0.0004448088,0.00019384355,0.00034547877,0.0022349684,0.0003254908,0.0066679562],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987979,0.000245724,0.000077905745,0.00036527324,0.0003036191,0.00020954903],"domain_scores_gemma":[0.9989262,0.00033462656,0.00005971667,0.0001340727,0.00039686114,0.00014850081],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002113199,0.0013824116,0.002247274,0.00090401684,0.00083814113,0.0017443334,0.003576185,0.0023252491,0.0027803276],"category_scores_gemma":[0.0029635332,0.0007661836,0.0013174954,0.0010430039,0.0005054421,0.0013995556,0.0024615652,0.002420923,0.0019345749],"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.00078866316,0.00068378035,0.0031931903,0.00011834613,0.00023022456,0.00023118692,0.00007425119,0.1996957,0.007053941,0.003284242,0.010330714,0.77431583],"study_design_scores_gemma":[0.000015111203,0.000055939538,0.00023282571,0.000004048357,0.000015508507,0.0000418053,0.000008238556,0.99664366,0.0011317154,0.0014174875,0.00042450355,0.000009207003],"about_ca_topic_score_codex":0.016107747,"about_ca_topic_score_gemma":0.022129215,"teacher_disagreement_score":0.016107747,"about_ca_system_score_codex":0.00081725273,"about_ca_system_score_gemma":0.0027686397,"threshold_uncertainty_score":0.03202796},"labels":[],"label_agreement":null},{"id":"W2945051179","doi":"10.1007/s00607-019-00771-y","title":"On cycling risk and discomfort: urban safety mapping and bike route recommendations","year":2019,"lang":"en","type":"preprint","venue":"Computing","topic":"Urban Transport and Accessibility","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 Waterloo","funders":"University of Leeds","keywords":"Cycling; Transport engineering; Bike sharing; Artifact (error); Business; Computer science; Engineering; Geography","score_opus":0.03172444649453365,"score_gpt":0.31484882983828555,"score_spread":0.2831243833437519,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2945051179","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.9762008,0.0000869172,0.018392703,0.00015549971,0.000012770111,0.0000661073,0.0018641051,0.00040691884,0.0028140787],"genre_scores_gemma":[0.9816009,0.000085751155,0.015556275,0.000012724626,0.000008695053,0.00004438291,0.0017625745,0.00003047261,0.0008983165],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9996356,0.00014607092,0.000020355263,0.000085295986,0.00008428175,0.000028401873],"domain_scores_gemma":[0.9981736,0.001067888,0.00024524535,0.000116827905,0.00031465478,0.00008186652],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053032575,0.00042130693,0.00023359378,0.0017253237,0.00018313751,0.00091000705,0.00027392688,0.00052083016,0.0027341086],"category_scores_gemma":[0.0046990835,0.00013023247,0.00027059522,0.0012556992,0.00015278466,0.0006824115,0.00049769477,0.0003318881,0.0004963585],"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.00076554203,0.0010171486,0.5810911,0.0005549726,0.00026589105,0.00033085278,0.0035612283,0.088755764,0.0058640246,0.0015201386,0.006055615,0.31021756],"study_design_scores_gemma":[0.000037574562,0.000476479,0.5785614,0.00015091384,0.00013709684,0.00024278375,0.0053278347,0.40106222,0.005135379,0.0035483926,0.0052217795,0.00009818007],"about_ca_topic_score_codex":0.009460719,"about_ca_topic_score_gemma":0.014991051,"teacher_disagreement_score":0.009460719,"about_ca_system_score_codex":0.0002813514,"about_ca_system_score_gemma":0.0003024228,"threshold_uncertainty_score":0.018811285},"labels":[],"label_agreement":null},{"id":"W2998920459","doi":"10.1007/s00607-019-00788-3","title":"Special issue on deep learning for natural language processing","year":2020,"lang":"en","type":"article","venue":"Computing","topic":"Educational Technology and Pedagogy","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Natural (archaeology); Artificial intelligence; Natural language; Natural language processing; Deep learning; Cognitive science; Psychology; History; Archaeology","score_opus":0.027636928266905607,"score_gpt":0.3278781083299954,"score_spread":0.3002411800630898,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2998920459","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.0010458892,0.029922333,0.01360982,0.031114947,0.85891306,0.00019386844,0.0019030119,0.0011827501,0.062114213],"genre_scores_gemma":[0.0050437446,0.02180636,0.0051388843,0.0075796084,0.6644075,0.00019340642,0.004784979,0.0014306984,0.28961483],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9984074,0.00019407325,0.00013050504,0.0003492499,0.0007301024,0.00018861436],"domain_scores_gemma":[0.99388677,0.0015157743,0.00033356305,0.0006971135,0.0021157332,0.0014511334],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022207247,0.0018126657,0.002325427,0.0036849317,0.0014296282,0.005645457,0.0023367784,0.003174096,0.16987222],"category_scores_gemma":[0.0051962114,0.0006168996,0.0013731034,0.002391598,0.0008607907,0.00525552,0.00317692,0.0037408704,0.056936342],"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.000041679054,0.000047516747,0.00009549542,0.000280878,0.000025140756,0.000044330918,0.0000065547,0.00016773114,0.00041850802,0.0021861321,0.9541843,0.04250168],"study_design_scores_gemma":[0.000026201089,0.000083666084,0.00051048055,0.00019723008,0.00002824599,0.00017167427,0.000015835636,0.0012397511,0.0004408735,0.008203111,0.9890661,0.000016769689],"about_ca_topic_score_codex":0.0008773027,"about_ca_topic_score_gemma":0.002644052,"teacher_disagreement_score":0.16987222,"about_ca_system_score_codex":0.0014785976,"about_ca_system_score_gemma":0.0024696998,"threshold_uncertainty_score":0.5682792},"labels":[],"label_agreement":null},{"id":"W2999331497","doi":"10.1007/s00607-019-00777-6","title":"Micro-journal mining to understand mood triggers","year":2020,"lang":"en","type":"article","venue":"Computing","topic":"Sentiment Analysis and Opinion Mining","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Multinomial logistic regression; Mood; Trigram; Sentiment analysis; Computer science; Word (group theory); Logistic regression; Psychology; Multinomial distribution; Natural language processing; Cognitive psychology; Artificial intelligence; Machine learning; Linguistics; Data science; Social psychology; Econometrics; Mathematics","score_opus":0.05212175688882666,"score_gpt":0.27568205735296525,"score_spread":0.22356030046413858,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2999331497","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.6296371,0.008833351,0.19485497,0.0035891188,0.0026586435,0.00097635435,0.08533958,0.012618509,0.061492354],"genre_scores_gemma":[0.8940346,0.0016733838,0.06432835,0.0003836098,0.0014438551,0.00039633721,0.025481107,0.00042209917,0.011836597],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999209,0.00011040947,0.000109724875,0.0001846734,0.00027631246,0.00010989096],"domain_scores_gemma":[0.9949969,0.0018066546,0.0009224335,0.00040810017,0.001454655,0.0004111719],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007715512,0.00057800196,0.0005934176,0.007998873,0.00072790816,0.0019842773,0.0005440411,0.00043704436,0.0064167017],"category_scores_gemma":[0.0054500764,0.00021378377,0.0006240386,0.007478167,0.00018367963,0.0015139594,0.0007874431,0.0005732422,0.0041340073],"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.0011695944,0.00058631774,0.19087365,0.0014082253,0.00054075354,0.0010311657,0.0011056269,0.0028187223,0.05253817,0.01229036,0.08957189,0.6460655],"study_design_scores_gemma":[0.00013564754,0.0007984901,0.49890056,0.00037256343,0.0007359954,0.0019450219,0.0033023397,0.2422998,0.04144141,0.053381745,0.15647061,0.00021583847],"about_ca_topic_score_codex":0.0020785104,"about_ca_topic_score_gemma":0.0069496767,"teacher_disagreement_score":0.007998873,"about_ca_system_score_codex":0.0004347175,"about_ca_system_score_gemma":0.000786891,"threshold_uncertainty_score":0.021466017},"labels":[],"label_agreement":null},{"id":"W3005539492","doi":"10.1007/s00607-020-00793-x","title":"Editorial for the special issue on big time series data","year":2020,"lang":"en","type":"article","venue":"Computing","topic":"Time Series Analysis and Forecasting","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"","keywords":"Series (stratigraphy); Big data; Computer science; Time series; Data science; Data mining; Geology; Machine learning","score_opus":0.045722221486386876,"score_gpt":0.25664936828695556,"score_spread":0.21092714680056868,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3005539492","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.00003360463,0.0010786322,0.00012805196,0.014954332,0.983111,0.000015079973,0.00008684466,0.00004588361,0.0005464949],"genre_scores_gemma":[0.00026133296,0.0010923758,0.0001061726,0.009509286,0.9845271,0.000021057882,0.00006844599,0.000055556266,0.0043586227],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9941058,0.00074972113,0.000851231,0.0010941353,0.0027441306,0.00045496068],"domain_scores_gemma":[0.961407,0.014389958,0.003012976,0.0013778723,0.014652233,0.0051599573],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007899384,0.004863167,0.0059715575,0.005515553,0.0034262158,0.010838767,0.003911233,0.01259272,0.032413684],"category_scores_gemma":[0.029846895,0.0015875379,0.004282655,0.0025418897,0.0022995863,0.005368516,0.0021145851,0.01931757,0.01669364],"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.00006431681,0.000021338183,0.00004861875,0.00016706648,0.00003376511,0.00007271235,0.0000060785173,0.00002748618,0.00008091275,0.00016982172,0.9960103,0.0032975525],"study_design_scores_gemma":[0.0001947327,0.00008432445,0.0010947955,0.0005463982,0.00014896198,0.00029192306,0.00006331512,0.00055822346,0.00028404812,0.0019280065,0.9947588,0.00004644867],"about_ca_topic_score_codex":0.001120823,"about_ca_topic_score_gemma":0.0029388377,"teacher_disagreement_score":0.032413684,"about_ca_system_score_codex":0.002183693,"about_ca_system_score_gemma":0.0026641137,"threshold_uncertainty_score":0.10843462},"labels":[],"label_agreement":null},{"id":"W3131825464","doi":"10.1007/s00607-021-00912-2","title":"Adaptive ensembles of autoencoders for unsupervised IoT network intrusion detection","year":2021,"lang":"en","type":"article","venue":"Computing","topic":"Network Security and Intrusion Detection","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Intrusion detection system; Anomaly detection; Scalability; Artificial intelligence; Machine learning; Inference; Cloud computing; Enhanced Data Rates for GSM Evolution; Artificial neural network; Internet of Things; Data mining","score_opus":0.021956507265652916,"score_gpt":0.23997028373647636,"score_spread":0.21801377647082343,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3131825464","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.059003502,0.00043653054,0.9382798,0.00014066961,0.00012564826,0.000025162557,0.00008503952,0.0007338697,0.0011698151],"genre_scores_gemma":[0.83867276,0.00031204594,0.15673052,0.00015098597,0.00013796313,0.00007469987,0.0004055635,0.00013124644,0.0033842404],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994603,0.00014091124,0.000037462243,0.0001389594,0.00013829442,0.00008408908],"domain_scores_gemma":[0.998588,0.00067237177,0.00010997223,0.00020091297,0.00038127234,0.000047416925],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000947101,0.00069646194,0.0008705673,0.00053277746,0.00029152315,0.0005361665,0.0008343084,0.00071732193,0.0007392583],"category_scores_gemma":[0.0031246939,0.00050713215,0.0006878784,0.0005242242,0.00035497875,0.0009967249,0.00084701064,0.00149061,0.00033280253],"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.00020251781,0.00018800168,0.00260203,0.00005518301,0.00024200711,0.00007077433,0.00009184752,0.70184076,0.0114152385,0.0037939572,0.002454773,0.27704287],"study_design_scores_gemma":[0.0000014313316,0.000011049842,0.00027918562,0.0000023540183,0.000007873571,0.000008375595,0.0000037007428,0.998047,0.00084029743,0.0006833636,0.00011294402,0.0000024208803],"about_ca_topic_score_codex":0.0034981475,"about_ca_topic_score_gemma":0.006688836,"teacher_disagreement_score":0.0034981475,"about_ca_system_score_codex":0.00043813058,"about_ca_system_score_gemma":0.0005326998,"threshold_uncertainty_score":0.006955564},"labels":[],"label_agreement":null},{"id":"W3137125111","doi":"10.1007/s00607-020-00899-2","title":"Novel evolutionary-EAC instance-learning-based algorithm for fast data stream mining in assisted living with extreme connectivity","year":2021,"lang":"en","type":"article","venue":"Computing","topic":"Data Stream Mining Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University","funders":"","keywords":"Computer science; Artificial intelligence; Machine learning; Cloud computing; Feature (linguistics); Feature selection; Evolutionary algorithm; Data stream; Extreme learning machine; Genetic algorithm; Process (computing); Data mining; Algorithm","score_opus":0.06716225142728892,"score_gpt":0.28660397415038863,"score_spread":0.2194417227230997,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3137125111","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.025138095,0.00039400446,0.9707089,0.00024454496,0.00013656823,0.00008990337,0.00011047487,0.0008491068,0.0023283926],"genre_scores_gemma":[0.38678363,0.00026344965,0.6067137,0.00033565282,0.000103350736,0.00032105588,0.00056584267,0.00016218344,0.0047509703],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995943,0.00005865146,0.000027018745,0.000114491726,0.00013919688,0.000066426466],"domain_scores_gemma":[0.9994041,0.0002553479,0.000038043694,0.00005259652,0.00019663961,0.000053306012],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007128851,0.0007154751,0.0013916236,0.0009251054,0.00061557454,0.0009632214,0.0025283054,0.0012457714,0.0025334624],"category_scores_gemma":[0.0020420165,0.00033058863,0.0006789517,0.0012131626,0.00037414712,0.0009986807,0.0012542426,0.0013746591,0.00043448614],"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.0002499933,0.00024720308,0.0031053266,0.00009856879,0.00012669574,0.00018065983,0.000078897385,0.50242054,0.0033885597,0.008820261,0.0071954615,0.47408792],"study_design_scores_gemma":[0.0000117620075,0.000017100456,0.00011766007,0.0000028395273,0.000006343718,0.000030048519,0.0000061062,0.99832743,0.0003023074,0.00082173897,0.000353725,0.0000028827312],"about_ca_topic_score_codex":0.0067312955,"about_ca_topic_score_gemma":0.0062747616,"teacher_disagreement_score":0.0067312955,"about_ca_system_score_codex":0.0006069356,"about_ca_system_score_gemma":0.0014782449,"threshold_uncertainty_score":0.013384223},"labels":[],"label_agreement":null},{"id":"W3154426907","doi":"10.1007/s00607-021-00940-y","title":"Fast-MICDTN: a new decentralized control mechanism for content-centric disruption tolerant networks","year":2021,"lang":"en","type":"article","venue":"Computing","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"","keywords":"Decentralised system; Computer science; Distributed computing; Mechanism (biology); Control (management); Computer network; Artificial intelligence","score_opus":0.039549783023194986,"score_gpt":0.255667243213561,"score_spread":0.216117460190366,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3154426907","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.017163334,0.0006232828,0.96766704,0.00050492364,0.0005032456,0.0002719337,0.00036684697,0.007540928,0.0053584836],"genre_scores_gemma":[0.73143595,0.00049754186,0.25554448,0.00061870296,0.00029704793,0.0003440169,0.00078168995,0.00040849973,0.01007202],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988201,0.00019134986,0.00010105214,0.00026648433,0.00046575948,0.0001551389],"domain_scores_gemma":[0.99744844,0.00053479115,0.0003215531,0.00073897885,0.00067052385,0.0002857534],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021045462,0.00070758676,0.00084379537,0.0010886716,0.0012095113,0.0020538012,0.0031510752,0.000979697,0.002583751],"category_scores_gemma":[0.0040381043,0.00035537814,0.0003401904,0.0010995955,0.00082339626,0.0023724807,0.0025990424,0.0013383911,0.0005515779],"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.0016409815,0.00043611665,0.0023624669,0.00048674791,0.00018622485,0.00034787698,0.00042564812,0.32334763,0.056694124,0.10177571,0.0470982,0.46519828],"study_design_scores_gemma":[0.0000700374,0.00013441339,0.00030625644,0.000016825381,0.000034355642,0.00013567836,0.000039100676,0.94785565,0.010691433,0.016982343,0.023682075,0.000051772524],"about_ca_topic_score_codex":0.0037594317,"about_ca_topic_score_gemma":0.0063022794,"teacher_disagreement_score":0.0037594317,"about_ca_system_score_codex":0.0016985607,"about_ca_system_score_gemma":0.0019539376,"threshold_uncertainty_score":0.012323916},"labels":[],"label_agreement":null},{"id":"W3190810079","doi":"10.1007/s00607-021-00985-z","title":"Special issue on ‘‘artificial intelligence in cloud computing’’","year":2021,"lang":"en","type":"article","venue":"Computing","topic":"Brain Tumor Detection and Classification","field":"Neuroscience","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University","funders":"","keywords":"Cloud computing; Computer science; Artificial intelligence; Data science; Operating system","score_opus":0.0738313035886359,"score_gpt":0.31623604499376945,"score_spread":0.24240474140513354,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3190810079","genre_codex":"editorial","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00015563695,0.011296195,0.0008686778,0.026534468,0.9444228,0.000070342605,0.0002961834,0.00015071679,0.016204959],"genre_scores_gemma":[0.0010066422,0.009569679,0.00041118226,0.009260164,0.9500095,0.000054906763,0.00048942247,0.0001935134,0.029004918],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9967878,0.00047231236,0.00033488974,0.0005029966,0.0015317908,0.0003702371],"domain_scores_gemma":[0.9856925,0.0050821975,0.0011979806,0.0009786428,0.0043151495,0.002733496],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036186702,0.0023457645,0.0032337569,0.0042888047,0.0020538275,0.008203938,0.0029366002,0.0067731026,0.09505379],"category_scores_gemma":[0.012269865,0.0006955516,0.0017575275,0.0023320643,0.0017764668,0.004821258,0.0030637297,0.0059768334,0.031254325],"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.000028869692,0.000015698335,0.000059376067,0.0002567764,0.000013243576,0.000052304687,0.0000066201937,0.00005275379,0.00014209632,0.0011387458,0.9862223,0.012011179],"study_design_scores_gemma":[0.000017351536,0.000037411257,0.0005042675,0.00028722847,0.000018521134,0.00016196139,0.0000145860095,0.00026018659,0.00013438461,0.0027352774,0.99581534,0.000013500098],"about_ca_topic_score_codex":0.0012138914,"about_ca_topic_score_gemma":0.0033338733,"teacher_disagreement_score":0.09505379,"about_ca_system_score_codex":0.0020045482,"about_ca_system_score_gemma":0.0028926092,"threshold_uncertainty_score":0.3179866},"labels":[],"label_agreement":null},{"id":"W4317211950","doi":"10.1007/s00607-023-01149-x","title":"Correction to: Special issue on “artificial intelligence in cloud computing”","year":2023,"lang":"en","type":"article","venue":"Computing","topic":"Brain Tumor Detection and Classification","field":"Neuroscience","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":"Lakehead University","funders":"","keywords":"Cloud computing; Computer science; Data science; Artificial intelligence; Operating system","score_opus":0.07439000865109235,"score_gpt":0.3270407649448769,"score_spread":0.25265075629378453,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4317211950","genre_codex":"editorial","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00002936435,0.000758217,0.00023486362,0.031254772,0.96630746,0.000012246546,0.00048269608,0.00014772514,0.0007725907],"genre_scores_gemma":[0.0027577716,0.0050806357,0.0011565816,0.07834284,0.8628482,0.00012950388,0.001473186,0.00068444986,0.047526725],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9932854,0.001111915,0.0012071708,0.001033203,0.002592123,0.0007702561],"domain_scores_gemma":[0.93897027,0.0138345035,0.0036688142,0.0039159292,0.035394244,0.004216301],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0050476547,0.0028906132,0.003271564,0.0062365434,0.00313016,0.0080843875,0.00390114,0.010167143,0.082583435],"category_scores_gemma":[0.083294146,0.001381312,0.002671462,0.004122643,0.0027877607,0.003250833,0.0029331732,0.015062785,0.054362908],"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.00001695723,0.000003006412,0.000030542786,0.000091691785,0.0000069250655,0.00003537205,0.000004615821,0.000017368833,0.00001715949,0.00016444473,0.99768,0.0019319265],"study_design_scores_gemma":[0.000057278852,0.000018077091,0.0007700571,0.00040659303,0.000032854732,0.00023062782,0.000037408343,0.00022771778,0.00019714644,0.0012168651,0.9967771,0.000028133167],"about_ca_topic_score_codex":0.011543189,"about_ca_topic_score_gemma":0.013382345,"teacher_disagreement_score":0.082583435,"about_ca_system_score_codex":0.0039640865,"about_ca_system_score_gemma":0.0070117926,"threshold_uncertainty_score":0.27626908},"labels":[],"label_agreement":null},{"id":"W4322768055","doi":"10.1007/s00607-023-01163-z","title":"Advances of machine learning in IoT-cloud for healthcare","year":2023,"lang":"en","type":"article","venue":"Computing","topic":"Artificial Intelligence in Healthcare","field":"Health Professions","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Cloud computing; Internet of Things; Computer science; Health care; Artificial intelligence; Embedded system; Operating system","score_opus":0.2072215111091151,"score_gpt":0.5270424325630477,"score_spread":0.3198209214539326,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4322768055","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.06558938,0.2548762,0.48319837,0.031989463,0.009659845,0.00022477205,0.0010364876,0.0012435716,0.15218185],"genre_scores_gemma":[0.6616808,0.16037841,0.14470546,0.0036713143,0.0054930425,0.000107118736,0.0012505208,0.00017453144,0.022538817],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991466,0.00019009133,0.000059198253,0.00015876713,0.00032693334,0.00011841215],"domain_scores_gemma":[0.998781,0.00045896487,0.00006168986,0.00014822697,0.00044603177,0.00010405505],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013302021,0.00041131154,0.0005978084,0.0008044047,0.00038150788,0.0021426182,0.0011058283,0.00089362316,0.0043672645],"category_scores_gemma":[0.0019740222,0.00017786602,0.00065871567,0.0015269243,0.00064257585,0.004392522,0.001296331,0.0015067502,0.0010699633],"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.00014587185,0.00025190457,0.008239572,0.0010261155,0.00010679899,0.00021915925,0.00015786773,0.012691703,0.005241845,0.2216067,0.037561443,0.7127509],"study_design_scores_gemma":[0.000033803015,0.00021160883,0.007373871,0.0006767603,0.00012447887,0.0007065268,0.00065387116,0.4171092,0.007985366,0.22532986,0.3397112,0.000083384635],"about_ca_topic_score_codex":0.0015570311,"about_ca_topic_score_gemma":0.0015547703,"teacher_disagreement_score":0.0043672645,"about_ca_system_score_codex":0.00080528134,"about_ca_system_score_gemma":0.0012448628,"threshold_uncertainty_score":0.014609933},"labels":[],"label_agreement":null},{"id":"W4387609398","doi":"10.1007/s00607-023-01225-2","title":"A graphical deep learning technique-based VNF dependencies for multi resource requirements prediction in virtualized environments","year":2023,"lang":"en","type":"article","venue":"Computing","topic":"Cloud Computing and Resource Management","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure","funders":"Fonds Québécois de la Recherche sur la Nature et les Technologies","keywords":"Computer science; Cloud computing; Distributed computing; Workload; Exploit; Resource (disambiguation); Virtual network; Graph; Data mining; Artificial intelligence; Machine learning; Computer network; Theoretical computer science","score_opus":0.03934790051608235,"score_gpt":0.2820110362366872,"score_spread":0.24266313572060488,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387609398","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.053828087,0.00038073285,0.9395883,0.00026886413,0.00011837114,0.00004451525,0.0009499165,0.0023717606,0.0024493493],"genre_scores_gemma":[0.81461334,0.0003530193,0.17682649,0.0002356458,0.00008761137,0.00009683905,0.003155139,0.00026825984,0.0043636383],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995109,0.00010740133,0.00002279434,0.00012174877,0.00013886124,0.00009835362],"domain_scores_gemma":[0.99895644,0.0005457599,0.00008967224,0.00010395529,0.00023701927,0.00006713164],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005936824,0.00085707626,0.0007093073,0.0015223201,0.0004106471,0.0006333143,0.0013602886,0.0008021027,0.0029067504],"category_scores_gemma":[0.00250762,0.00038703645,0.0007759605,0.0014703219,0.00027048922,0.0012936015,0.0008932384,0.0014093408,0.00073439965],"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.00024861356,0.00034164425,0.006447377,0.00009811794,0.0000935203,0.00025340487,0.00007218479,0.6835675,0.0074666776,0.0066279536,0.009599403,0.28518367],"study_design_scores_gemma":[0.0000016312594,0.000006776223,0.00019322679,0.0000027551155,0.00000334691,0.000009518887,0.0000035963853,0.9982053,0.00030997224,0.0010913662,0.00016989776,0.0000025909646],"about_ca_topic_score_codex":0.019824483,"about_ca_topic_score_gemma":0.02702255,"teacher_disagreement_score":0.019824483,"about_ca_system_score_codex":0.0006608256,"about_ca_system_score_gemma":0.0010826684,"threshold_uncertainty_score":0.03941816},"labels":[],"label_agreement":null},{"id":"W4404507082","doi":"10.1007/s00607-024-01356-0","title":"Distributed computing in multi-agent systems: a survey of decentralized machine learning approaches","year":2024,"lang":"en","type":"article","venue":"Computing","topic":"Privacy-Preserving Technologies in Data","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Distributed computing; Multi-agent system; Artificial intelligence; Machine learning; Data science","score_opus":0.14156027526005646,"score_gpt":0.31401811547275466,"score_spread":0.1724578402126982,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404507082","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.0051983176,0.058210075,0.9244169,0.0029764907,0.0002747616,0.00011648282,0.00005534857,0.00023850356,0.008513211],"genre_scores_gemma":[0.49659032,0.11195459,0.38215718,0.0013293361,0.0026097437,0.00046551274,0.00023146132,0.00020274361,0.0044590626],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99603134,0.0016334208,0.00027226147,0.0006978479,0.0011831593,0.00018188557],"domain_scores_gemma":[0.9928449,0.0046808072,0.0003207489,0.0013710838,0.0006147989,0.00016774809],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004724561,0.00079893315,0.002784822,0.001501948,0.0013728125,0.0040696333,0.0028080628,0.0021730298,0.0014227221],"category_scores_gemma":[0.008095633,0.0007579637,0.0010426273,0.0044297045,0.0024863807,0.0047622845,0.0026151948,0.0029689965,0.00046232587],"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.00013919054,0.00023618854,0.0015939012,0.0017562316,0.0001833947,0.0001198621,0.00034657458,0.11030944,0.0014243898,0.5450594,0.006211729,0.33261973],"study_design_scores_gemma":[0.00006461605,0.00013684803,0.00075792416,0.00033610765,0.00008201158,0.00028403747,0.0002462622,0.4469449,0.0022721242,0.5010123,0.047808122,0.000054655873],"about_ca_topic_score_codex":0.0014432941,"about_ca_topic_score_gemma":0.0011213078,"teacher_disagreement_score":0.004724561,"about_ca_system_score_codex":0.0020813697,"about_ca_system_score_gemma":0.0025810846,"threshold_uncertainty_score":0.024986148},"labels":[],"label_agreement":null},{"id":"W4405143323","doi":"10.1007/s00607-024-01385-9","title":"Enhancing POI recommendations on social media: a sequential approach incorporating LSTM and user feedback","year":2024,"lang":"en","type":"article","venue":"Computing","topic":"Recommender Systems and Techniques","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Social media; Computer science; Artificial intelligence; Multimedia; Machine learning; Human–computer interaction; World Wide Web","score_opus":0.0515753249354012,"score_gpt":0.29681454505019295,"score_spread":0.24523922011479174,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405143323","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.10480587,0.0018680417,0.8778342,0.0015736282,0.0009830998,0.00030564764,0.00076511194,0.0054811523,0.00638341],"genre_scores_gemma":[0.7553762,0.0007498187,0.23137143,0.0006661064,0.00063835137,0.00022686571,0.0008784902,0.00026164955,0.009831106],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999006,0.00024865786,0.00007248546,0.00028796523,0.0002727734,0.00011221374],"domain_scores_gemma":[0.9966066,0.0017855911,0.00015568115,0.0002840091,0.0009990553,0.00016910346],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016788482,0.0013918856,0.0017861284,0.0015230573,0.000650894,0.0013884526,0.0017298334,0.0019818905,0.003252091],"category_scores_gemma":[0.0064514885,0.0008521862,0.00086050865,0.0017074512,0.0004418026,0.0030008885,0.0013953488,0.0026499752,0.0019769687],"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.00087403646,0.0015965267,0.0069024074,0.00047833764,0.00044714185,0.00026485557,0.00043492025,0.09104969,0.035197936,0.0024034935,0.011300198,0.8490504],"study_design_scores_gemma":[0.00002059681,0.00019977997,0.0012554686,0.000023512026,0.00009719976,0.00007550019,0.000048103004,0.9898226,0.0051661264,0.0018977225,0.0013680116,0.00002529096],"about_ca_topic_score_codex":0.012964606,"about_ca_topic_score_gemma":0.036602862,"teacher_disagreement_score":0.012964606,"about_ca_system_score_codex":0.0006358884,"about_ca_system_score_gemma":0.0014428837,"threshold_uncertainty_score":0.025778294},"labels":[],"label_agreement":null},{"id":"W4405453640","doi":"10.1007/s00607-024-01391-x","title":"Efficient exploration of indoor localization using genetic algorithm and signal propagation model","year":2024,"lang":"en","type":"article","venue":"Computing","topic":"Indoor and Outdoor Localization Technologies","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"Fundação de Amparo à Pesquisa do Estado do Amazonas; Coordenação de Aperfeiçoamento de Pessoal de Nível Superior","keywords":"Genetic algorithm; Computer science; Algorithm; Radio propagation; SIGNAL (programming language); Telecommunications; Machine learning","score_opus":0.021570172785926375,"score_gpt":0.23830924293507522,"score_spread":0.21673907014914884,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405453640","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.034853835,0.00020430097,0.9616871,0.000084918116,0.00002425261,0.000018481105,0.000027301923,0.00042415631,0.0026756409],"genre_scores_gemma":[0.70696634,0.00025703324,0.28963232,0.00004208713,0.00002531293,0.00009985207,0.00012296783,0.00007854689,0.0027755823],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998221,0.00004490257,0.0000051620345,0.000038141545,0.000058290567,0.0000314658],"domain_scores_gemma":[0.9997689,0.000116224764,0.000023518933,0.000022642218,0.00005548431,0.000013199532],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023871963,0.0006435497,0.0008721884,0.0007124406,0.0005273447,0.0006554174,0.0008684253,0.00071502116,0.0010260068],"category_scores_gemma":[0.0008245383,0.0003291524,0.0006869854,0.001047177,0.00045142722,0.0007612935,0.000626958,0.0005107002,0.00022945288],"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.000040103634,0.000027938837,0.00045670837,0.000027918115,0.000022138714,0.000042094834,0.00003834972,0.9585636,0.0025231445,0.0045812177,0.00039780108,0.03327898],"study_design_scores_gemma":[0.0000033010635,0.00001038984,0.00004994686,0.0000018614778,0.0000036859687,0.000010642447,0.000005925436,0.9985759,0.00031334304,0.0008890597,0.00013347862,0.000002392308],"about_ca_topic_score_codex":0.011322921,"about_ca_topic_score_gemma":0.007823673,"teacher_disagreement_score":0.011322921,"about_ca_system_score_codex":0.00055511977,"about_ca_system_score_gemma":0.0011697152,"threshold_uncertainty_score":0.022514045},"labels":[],"label_agreement":null},{"id":"W4411326007","doi":"10.1007/s00607-025-01505-z","title":"Predictive container orchestration in the cloud using artificial intelligence techniques","year":2025,"lang":"en","type":"article","venue":"Computing","topic":"Cloud Computing and Resource Management","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Orchestration; Container (type theory); Cloud computing; Computer science; Artificial intelligence; Engineering; Operating system; Mechanical engineering","score_opus":0.03760798050484105,"score_gpt":0.3057208766827272,"score_spread":0.26811289617788614,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411326007","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.119684346,0.0005694222,0.8680969,0.0006429714,0.0002444087,0.00010940404,0.00018853688,0.0033351067,0.007128831],"genre_scores_gemma":[0.86017835,0.00018796998,0.1377311,0.0000709803,0.0000537261,0.000035608657,0.00019411404,0.00017894345,0.0013691098],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993407,0.00013901263,0.000039141676,0.00016114277,0.0001976829,0.00012230426],"domain_scores_gemma":[0.99895847,0.00041500488,0.00013232532,0.0002409204,0.00016993129,0.00008334979],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011728498,0.0005658196,0.0009658212,0.0009099841,0.00092938583,0.0023911064,0.0014140637,0.00058656157,0.0018322598],"category_scores_gemma":[0.0023780207,0.00046498296,0.0006531414,0.0013373094,0.00069412414,0.0020195635,0.0009078922,0.0010925632,0.00033321397],"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.00030128614,0.00017996057,0.003625967,0.000059723217,0.00007599298,0.00019549072,0.00008415122,0.8766465,0.008419618,0.013598913,0.0031179148,0.09369442],"study_design_scores_gemma":[0.0000028732995,0.000004202163,0.00007043889,0.0000012130191,0.0000026761338,0.000006458694,0.000007515882,0.99720806,0.0006103066,0.001925997,0.00015820617,0.0000020852606],"about_ca_topic_score_codex":0.0108068455,"about_ca_topic_score_gemma":0.015571406,"teacher_disagreement_score":0.0108068455,"about_ca_system_score_codex":0.0011668047,"about_ca_system_score_gemma":0.0017271389,"threshold_uncertainty_score":0.021487892},"labels":[],"label_agreement":null},{"id":"W4414067394","doi":"10.1007/s00607-025-01547-3","title":"An experience-based classification of quantum bugs in quantum software","year":2025,"lang":"en","type":"article","venue":"Computing","topic":"Quantum Computing Algorithms and Architecture","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 British Columbia","funders":"Bundesministerium für Digitalisierung und Wirtschaftsstandort; Technische Universität München; Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs; European Commission","keywords":"Debugging; Quantum; Software; Quantum computer; Set (abstract data type); Quantum algorithm; Software bug","score_opus":0.018729021149814503,"score_gpt":0.29190807941563596,"score_spread":0.27317905826582145,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414067394","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.968904,0.00048235845,0.024897419,0.0007575765,0.000050532726,0.00011770812,0.00018113559,0.00089378987,0.003715313],"genre_scores_gemma":[0.98845905,0.00015678271,0.010137367,0.00011224434,0.000014058086,0.000041080635,0.00020647472,0.0001836025,0.0006893845],"study_design_codex":"observational","study_design_gemma":"qualitative","domain_scores_codex":[0.98887527,0.0032606933,0.0011524118,0.0012094276,0.0046983706,0.00080383476],"domain_scores_gemma":[0.9095715,0.04383344,0.02030164,0.0067582647,0.016867045,0.0026680469],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007864587,0.0005532886,0.0004773376,0.00862117,0.0012878126,0.002334382,0.0011392838,0.0011183381,0.0015674208],"category_scores_gemma":[0.106204025,0.00042868897,0.00045321963,0.0031601577,0.0024328597,0.0042641,0.0039443295,0.0014463016,0.00032906607],"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.00036737198,0.0003023574,0.72234297,0.0006530979,0.00014731943,0.002740575,0.07627028,0.00257519,0.010282054,0.009647537,0.0054436815,0.16922757],"study_design_scores_gemma":[0.000086529806,0.0019477853,0.74884325,0.0014843923,0.00043735007,0.012403746,0.05725086,0.08581166,0.023357403,0.025875665,0.041842747,0.00065861724],"about_ca_topic_score_codex":0.0030485694,"about_ca_topic_score_gemma":0.0046293642,"teacher_disagreement_score":0.00862117,"about_ca_system_score_codex":0.0013376527,"about_ca_system_score_gemma":0.0011533402,"threshold_uncertainty_score":0.04159236},"labels":[],"label_agreement":null},{"id":"W4415311529","doi":"10.1007/s00607-025-01564-2","title":"Collaborative filtering in the age of AI: foundations, innovations, and emerging trends","year":2025,"lang":"en","type":"article","venue":"Computing","topic":"Recommender Systems and Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Collaborative filtering; Recommender system; Personalization; Baseline (sea); Benchmark (surveying); Field (mathematics); Big data","score_opus":0.019666113079006602,"score_gpt":0.32284719130338724,"score_spread":0.3031810782243806,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415311529","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.022099916,0.5697499,0.26750168,0.095036395,0.0028389678,0.000112798305,0.00027118894,0.0005739143,0.041815206],"genre_scores_gemma":[0.3768055,0.35122707,0.23747717,0.010227056,0.012700335,0.00021483215,0.00031015294,0.00018301867,0.01085486],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9948598,0.0023194377,0.00025461093,0.0008240918,0.0015286144,0.00021346909],"domain_scores_gemma":[0.9520095,0.0383667,0.0013593633,0.0029153177,0.004027457,0.0013215891],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009969074,0.00063498336,0.0014766227,0.0030956254,0.0015129254,0.008019243,0.0022254018,0.004381016,0.0034758877],"category_scores_gemma":[0.022019934,0.00049919233,0.0005945802,0.0054648644,0.0060017663,0.0175059,0.0021219319,0.004874337,0.001498772],"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.00011692275,0.0002052561,0.005966621,0.0022529294,0.00016147699,0.00009847713,0.002084118,0.0030560289,0.0011487755,0.4682041,0.017254604,0.49945074],"study_design_scores_gemma":[0.000028370798,0.00015852689,0.0031723254,0.0013820443,0.00007784144,0.00047808292,0.0020853602,0.023368007,0.001048622,0.7562042,0.21187936,0.00011723805],"about_ca_topic_score_codex":0.004030521,"about_ca_topic_score_gemma":0.004025083,"teacher_disagreement_score":0.009969074,"about_ca_system_score_codex":0.0021983124,"about_ca_system_score_gemma":0.0030728094,"threshold_uncertainty_score":0.052722096},"labels":[],"label_agreement":null},{"id":"W627525495","doi":"10.1007/s00607-015-0463-8","title":"Special issue on contributions of computational intelligence in designing complex information systems","year":2015,"lang":"en","type":"article","venue":"Computing","topic":"Big Data and Business Intelligence","field":"Business, Management and Accounting","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":"Collège de Maisonneuve","funders":"","keywords":"Turnkey; Computer science; Computational intelligence; Artificial intelligence; Machine learning; Artificial neural network; Bayesian network; Fuzzy logic; Computational Science and Engineering; Bayesian probability; Data science","score_opus":0.09605182917915579,"score_gpt":0.3161076946213896,"score_spread":0.22005586544223382,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W627525495","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.00045686512,0.018376796,0.0016570356,0.028648524,0.9050418,0.00008639345,0.0002845056,0.00014298884,0.045305025],"genre_scores_gemma":[0.0029859215,0.016199352,0.00069942506,0.007208407,0.874317,0.000092949995,0.0005490343,0.0003408139,0.097607166],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99734217,0.000381031,0.00021729921,0.00042807465,0.0013304045,0.00030098745],"domain_scores_gemma":[0.99072367,0.0029669625,0.00049214304,0.0009920647,0.0029757924,0.0018494426],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030974199,0.0027617419,0.00269877,0.005434353,0.0027109243,0.008779047,0.0027035433,0.005794769,0.08605546],"category_scores_gemma":[0.008077014,0.0007724723,0.0018218602,0.003218593,0.0015938863,0.0059876055,0.0034466854,0.0055530863,0.02689292],"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.000034750366,0.00004316586,0.00011668517,0.00025877444,0.000019578834,0.00007113644,0.00002135109,0.000108361346,0.00017233705,0.004186637,0.97808343,0.016883751],"study_design_scores_gemma":[0.000017415483,0.000048146165,0.0004941038,0.00025802793,0.00002703734,0.00014302618,0.000034394703,0.0003358496,0.000144785,0.007964532,0.9905199,0.000012729998],"about_ca_topic_score_codex":0.00096204854,"about_ca_topic_score_gemma":0.0026308394,"teacher_disagreement_score":0.08605546,"about_ca_system_score_codex":0.0024900816,"about_ca_system_score_gemma":0.0025772708,"threshold_uncertainty_score":0.28788418},"labels":[],"label_agreement":null}]}