{"meta":{"query_hash":"67470e2de812","filters":{"venue":"Journal of Computer Science"},"cohort_total":21,"direct_labels_cover":0,"predictions_cover":21,"exported":21,"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/67470e2de812","api":"https://metacan.xera.ac/api/v1/cohort?venue=Journal+of+Computer+Science"},"results":[{"id":"W1982951122","doi":"10.3844/jcssp.2008.967.975","title":"A Novel Approach to Modeling and Flooding in Ad-hoc Wireless Networks","year":2008,"lang":"en","type":"article","venue":"Journal of Computer Science","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Computer science; Wireless ad hoc network; Mobile ad hoc network; Flooding (psychology); Ad hoc wireless distribution service; Computer network; Wireless; Vehicular ad hoc network; Distributed computing; Optimized Link State Routing Protocol; Telecommunications","score_opus":0.028785381404187703,"score_gpt":0.2364272562488866,"score_spread":0.2076418748446989,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1982951122","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28205058,0.00030854114,0.7168103,0.00013382988,0.0005102057,0.000093337396,5.985318e-8,0.000018153436,0.00007501575],"genre_scores_gemma":[0.6005292,0.00007047501,0.39894512,0.0002836524,0.00016224077,0.0000016789436,2.3380062e-8,0.0000050203807,0.0000025880688],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997611,0.000041510986,0.00058718864,0.0004735565,0.0007529564,0.00053380383],"domain_scores_gemma":[0.99864686,0.00008002247,0.00021889128,0.00040775354,0.00027725974,0.0003692188],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017204325,0.00017035664,0.0003403931,0.0005069663,0.00024193448,0.00030791244,0.0021648319,0.00005582807,2.8612664e-7],"category_scores_gemma":[0.000020579131,0.00014872495,0.000059130154,0.0019382832,0.00016084673,0.0016902079,0.0008567282,0.0004168454,0.000001125797],"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.000008367244,0.00008938348,0.0002420465,0.0000040006257,0.0000036645872,0.000041796768,0.001514844,0.9459704,0.0003345435,0.0016664747,0.000057446483,0.050066993],"study_design_scores_gemma":[0.00042839823,0.00014531774,0.0015704369,0.00009923322,0.0000017072091,0.0016051249,0.000011328507,0.9957556,0.000033326123,0.0001313764,0.000046972586,0.00017115995],"about_ca_topic_score_codex":0.0000046787723,"about_ca_topic_score_gemma":0.000002189318,"teacher_disagreement_score":0.3184786,"about_ca_system_score_codex":0.00010699087,"about_ca_system_score_gemma":0.0002665943,"threshold_uncertainty_score":0.6064828},"labels":[],"label_agreement":null},{"id":"W2006782943","doi":"10.3844/jcssp.2007.533.539","title":"Proximity Aware Routing in Ad Hoc Networks","year":2007,"lang":"en","type":"article","venue":"Journal of Computer Science","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Computer science; Wireless ad hoc network; Computer network; Mobile ad hoc network; Routing (electronic design automation); Ad hoc On-Demand Distance Vector Routing; Ad hoc wireless distribution service; Optimized Link State Routing Protocol; Routing protocol; Telecommunications; Wireless; Network packet","score_opus":0.012351878398194698,"score_gpt":0.25582226087696663,"score_spread":0.24347038247877192,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2006782943","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.073064625,0.0004093743,0.9237252,0.00030654948,0.0021736384,0.00012012132,5.740182e-8,0.000037207396,0.00016324263],"genre_scores_gemma":[0.82169247,0.00004043962,0.17736432,0.00043009542,0.0004576413,6.151471e-7,4.3099384e-8,0.000006049423,0.000008313065],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967826,0.000074996264,0.0008823815,0.00041831753,0.0010311182,0.00081055885],"domain_scores_gemma":[0.99775106,0.0002568919,0.00063040847,0.0005750269,0.00045963313,0.00032700878],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0072862483,0.00017665768,0.0003195285,0.00048659468,0.0001915097,0.0004342188,0.0034538538,0.00007761897,0.0000028743093],"category_scores_gemma":[0.00005897905,0.00014984688,0.00010833228,0.0026348853,0.00023158394,0.0027777094,0.0007988296,0.000660337,0.000004583083],"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.000023509217,0.00014823933,0.007949659,0.0000069594826,0.000007779866,0.0005479926,0.0009889354,0.060556255,0.00014680918,0.0068469406,0.00037541921,0.9224015],"study_design_scores_gemma":[0.00045837992,0.00026910342,0.055154473,0.00015576453,0.000002332171,0.0004980718,0.000013691045,0.9413801,0.00027931525,0.0008987612,0.0006853458,0.00020465927],"about_ca_topic_score_codex":0.0000022355782,"about_ca_topic_score_gemma":0.000019505142,"teacher_disagreement_score":0.92219687,"about_ca_system_score_codex":0.0002497716,"about_ca_system_score_gemma":0.00039787884,"threshold_uncertainty_score":0.6418177},"labels":[],"label_agreement":null},{"id":"W2038084444","doi":"10.3844/jcssp.2006.1.6","title":"Home Agent Architecture and Algorithms for Mobility Management in Mobile IP Networks","year":2006,"lang":"en","type":"article","venue":"Journal of Computer Science","topic":"IPv6, Mobility, Handover, Networks, Security","field":"Engineering","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Computer science; Mobility management; Mobile IP; Computer network; Architecture; Distributed computing; Mobile agent; Algorithm; Mobile computing","score_opus":0.006454356896940957,"score_gpt":0.22175444543732317,"score_spread":0.2153000885403822,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2038084444","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39078194,0.0013771272,0.60624754,0.000022982531,0.0011796727,0.0003215021,0.0000014880302,0.000023474877,0.00004429062],"genre_scores_gemma":[0.9457755,0.00010915336,0.053481378,0.000044408767,0.00055433257,0.000016710377,5.5631233e-7,0.0000111110285,0.0000068227796],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984859,0.000029836952,0.0004778406,0.00024224164,0.00035592308,0.00040823626],"domain_scores_gemma":[0.9993648,0.00009145572,0.00010502195,0.0002330749,0.00009505748,0.00011060733],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015095026,0.00015773014,0.00027932535,0.00021954106,0.000076406766,0.00013390784,0.00043924438,0.00005284769,0.0000026215178],"category_scores_gemma":[0.0000037072327,0.00013794731,0.00008171954,0.00046187406,0.00018179767,0.00028664607,0.00014114626,0.0002763205,3.639404e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016688817,0.00007945057,0.0007074043,0.00006100793,0.000010385223,0.000020530904,0.00013407358,0.86886895,0.00002563482,0.00009837904,0.00024328099,0.12973422],"study_design_scores_gemma":[0.0008373674,0.0001741533,0.05901512,0.00006437361,0.000013746433,0.00006683086,0.000010881412,0.9337369,0.000077864126,0.0037366527,0.002087166,0.00017892075],"about_ca_topic_score_codex":0.0000051277966,"about_ca_topic_score_gemma":0.000017677326,"teacher_disagreement_score":0.55499357,"about_ca_system_score_codex":0.0001726824,"about_ca_system_score_gemma":0.000022251748,"threshold_uncertainty_score":0.56253284},"labels":[],"label_agreement":null},{"id":"W2055601244","doi":"10.3844/jcssp.2008.1071.1075","title":"Virtual Mobility to Improve Cooperation in Mobile Ad hoc Networks","year":2008,"lang":"en","type":"article","venue":"Journal of Computer Science","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Computer science; Mobile ad hoc network; Wireless ad hoc network; Computer network; Telecommunications; Wireless; Network packet","score_opus":0.009943451600926924,"score_gpt":0.2411849716657474,"score_spread":0.2312415200648205,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2055601244","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34515968,0.00046939088,0.65215945,0.00014826345,0.0017813885,0.000231389,2.2587659e-7,0.000024142102,0.00002605549],"genre_scores_gemma":[0.89412785,0.00019392547,0.10449206,0.0007450384,0.00039444456,0.000013787568,1.2875563e-7,0.00000714357,0.000025601092],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99703044,0.0001211896,0.00082575716,0.000555217,0.00090163155,0.00056576484],"domain_scores_gemma":[0.9976779,0.00016349946,0.00033607188,0.0007526608,0.00066522456,0.00040463224],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002363381,0.00019502439,0.00036822393,0.00041648504,0.00024917288,0.00029538927,0.0027907297,0.00007423567,0.000006645987],"category_scores_gemma":[0.000062768464,0.00016774792,0.00009864635,0.0024503807,0.00028516335,0.0023934937,0.00073444145,0.0004639808,0.000016888385],"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.000028953506,0.0002268081,0.0006599612,0.0000023258897,0.0000047854805,0.0001350668,0.0013723857,0.5998825,0.001255641,0.0008125667,0.0009503984,0.3946686],"study_design_scores_gemma":[0.00065092416,0.002144539,0.014469019,0.00005913915,0.000002222608,0.00049028953,0.000010774584,0.9773873,0.001033853,0.00014008844,0.0033377842,0.0002740312],"about_ca_topic_score_codex":0.0000022264935,"about_ca_topic_score_gemma":0.000009871475,"teacher_disagreement_score":0.5489682,"about_ca_system_score_codex":0.00027092313,"about_ca_system_score_gemma":0.000650064,"threshold_uncertainty_score":0.68405616},"labels":[],"label_agreement":null},{"id":"W2102083229","doi":"10.3844/jcssp.2007.965.979","title":"Jitter Characterization in Admission Control and Pricing Issues in Integrated Multiservice Networks","year":2007,"lang":"en","type":"article","venue":"Journal of Computer Science","topic":"Wireless Communication Networks Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Computer science; Jitter; Computer network; Control (management); Admission control; Telecommunications; Quality of service; Artificial intelligence","score_opus":0.012904264766518488,"score_gpt":0.29637699045307675,"score_spread":0.28347272568655824,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2102083229","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33602566,0.00017402883,0.66211355,0.0013837733,0.0001943758,0.00008887188,7.864988e-8,0.000009587987,0.000010082358],"genre_scores_gemma":[0.93637395,0.000159348,0.062888235,0.00046531553,0.00010191923,8.308615e-7,3.761525e-7,0.000004427818,0.0000055946443],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979993,0.00018169232,0.0006352068,0.00023991856,0.00055864756,0.00038525302],"domain_scores_gemma":[0.99842304,0.00028620876,0.00031807373,0.00036111198,0.00042958336,0.00018196614],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0048405468,0.00010960434,0.00023559039,0.0008796418,0.000095049516,0.0003514591,0.0017532617,0.000058185797,0.0000015691353],"category_scores_gemma":[0.00007512414,0.00008954383,0.000023696446,0.0023093855,0.00012106104,0.0019398248,0.0004442897,0.0004949555,0.0000010021953],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009836711,0.00021926052,0.10643107,0.000017946,0.0000065941003,0.00016015253,0.003242425,0.035818145,0.027464654,0.0010533312,0.000040952575,0.8254471],"study_design_scores_gemma":[0.000485361,0.000055567776,0.36138758,0.00016952239,4.3250034e-7,0.000040497718,0.000009227236,0.63727045,0.0002866518,0.000041487394,0.00019167249,0.000061541716],"about_ca_topic_score_codex":0.000024287345,"about_ca_topic_score_gemma":0.000033253335,"teacher_disagreement_score":0.8253856,"about_ca_system_score_codex":0.00014244711,"about_ca_system_score_gemma":0.00016686834,"threshold_uncertainty_score":0.3651491},"labels":[],"label_agreement":null},{"id":"W2122110587","doi":"10.3844/jcssp.2006.815.823","title":"Separation of the Control Plane and Forwarding Plane in Next-Generation Routers","year":2006,"lang":"en","type":"article","venue":"Journal of Computer Science","topic":"Network Packet Processing and Optimization","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Computer science; Forwarding plane; Separation (statistics); Plane (geometry); Control (management); Computer network; Routing control plane; Artificial intelligence; Network packet; Machine learning; Geometry","score_opus":0.014444177103104071,"score_gpt":0.23632652640385343,"score_spread":0.22188234930074935,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2122110587","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27478045,0.00009736292,0.7241731,0.00041401244,0.00045106022,0.00004060673,1.7319634e-7,0.0000042788406,0.000038905055],"genre_scores_gemma":[0.9445819,0.0000075289377,0.055096585,0.000110834786,0.00019489859,3.1856746e-7,2.0718738e-7,0.0000015842188,0.000006138219],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989722,0.000052684023,0.00034359595,0.00013056093,0.00037065928,0.00013034797],"domain_scores_gemma":[0.99924695,0.00005240222,0.00038160154,0.00012901289,0.0001579292,0.000032080985],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009116674,0.000063307234,0.00013101424,0.00016860916,0.00011886365,0.00028692512,0.0004989483,0.000023512266,2.3810452e-7],"category_scores_gemma":[0.000014302857,0.000043281034,0.000026154912,0.00058201863,0.00009970047,0.0013799493,0.00006249155,0.0000878229,1.6016715e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001817152,0.00006281003,0.0153442435,0.00001552387,0.000006067265,0.000008317533,0.0008707223,0.90667385,0.022362147,0.0055966154,0.00063969387,0.048401847],"study_design_scores_gemma":[0.00042497186,0.0000749023,0.016844098,0.000059326616,0.000003389191,0.00008566429,0.000003337022,0.9784233,0.003336513,0.00065245916,0.000038910366,0.000053114603],"about_ca_topic_score_codex":0.000008331618,"about_ca_topic_score_gemma":0.000009361055,"teacher_disagreement_score":0.6698014,"about_ca_system_score_codex":0.00003687037,"about_ca_system_score_gemma":0.00012932114,"threshold_uncertainty_score":0.27668256},"labels":[],"label_agreement":null},{"id":"W2127216938","doi":"10.3844/jcssp.2007.666.672","title":"A Novel Service Mobility Architecture for SIP Environments","year":2007,"lang":"en","type":"article","venue":"Journal of Computer Science","topic":"Mobile Agent-Based Network Management","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Computer science; Architecture; Computer network; Service (business)","score_opus":0.015977122134215534,"score_gpt":0.2479316319953225,"score_spread":0.23195450986110697,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2127216938","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042848386,0.00004730819,0.9542995,0.0011033318,0.0012734693,0.0003351888,9.068789e-7,0.000023316743,0.00006860847],"genre_scores_gemma":[0.30682847,0.0000033341796,0.690038,0.0027263795,0.00037435675,0.0000037825398,1.960049e-7,0.0000069462167,0.000018487848],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972115,0.000028393817,0.0006221959,0.00046178247,0.0010906192,0.00058547995],"domain_scores_gemma":[0.99790466,0.00026710282,0.0005412098,0.0007464046,0.00022605028,0.00031456538],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004597228,0.00017905925,0.00024037046,0.0003589988,0.00022169661,0.00025958652,0.0033959583,0.000039046703,0.0000034551235],"category_scores_gemma":[0.000037070968,0.00014702708,0.00013867379,0.0011431111,0.00015925342,0.00088305754,0.00075125316,0.00021501596,0.000007223915],"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.00010973331,0.0008724635,0.0004334173,0.000088931716,0.000068416164,0.000082949766,0.0017402943,0.20264268,0.030269835,0.009247272,0.0016675991,0.7527764],"study_design_scores_gemma":[0.002993064,0.0015826246,0.038836174,0.0001703274,0.000038170285,0.0005396639,0.000030449908,0.8414251,0.017013634,0.0062052594,0.090445325,0.0007202178],"about_ca_topic_score_codex":0.000005349864,"about_ca_topic_score_gemma":0.00000869474,"teacher_disagreement_score":0.7520562,"about_ca_system_score_codex":0.00025614756,"about_ca_system_score_gemma":0.00022228324,"threshold_uncertainty_score":0.6310592},"labels":[],"label_agreement":null},{"id":"W2134972025","doi":"10.3844/jcssp.2007.658.665","title":"An Improved Resource Reservation Protocol","year":2007,"lang":"en","type":"article","venue":"Journal of Computer Science","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Computer science; Protocol (science); Reservation; Computer network; Resource (disambiguation); Distributed computing","score_opus":0.012423591394073532,"score_gpt":0.28715954422499307,"score_spread":0.27473595283091956,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2134972025","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01167885,0.000005424927,0.9837714,0.0007868231,0.00050344935,0.0029461395,6.153161e-8,0.000056937242,0.00025095593],"genre_scores_gemma":[0.6431691,2.9589148e-7,0.35451055,0.00110191,0.0010449387,0.00013845638,7.495104e-8,0.0000060485186,0.00002860847],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979023,0.00006665521,0.0005659136,0.0002773903,0.0008105881,0.00037717522],"domain_scores_gemma":[0.9978021,0.00011282458,0.0005012873,0.0005191985,0.00074968615,0.00031492242],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005351972,0.000110227484,0.00016373253,0.0003397025,0.00023208153,0.0004716629,0.0026398723,0.000041580148,0.0000030286583],"category_scores_gemma":[0.000044109252,0.00008640045,0.00006478031,0.0011738726,0.00016473286,0.0025337297,0.00015733147,0.00023700693,0.000004165193],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007475243,0.000110771856,0.00027135896,0.000004155738,0.000004740652,0.000036146706,0.00027413236,0.0026023732,0.004046255,0.010508132,0.00070671696,0.98136044],"study_design_scores_gemma":[0.000982045,0.001314432,0.008019723,0.000040314688,0.000002912864,0.00020738208,0.00001020106,0.9617045,0.0019284564,0.001039926,0.024585119,0.00016499143],"about_ca_topic_score_codex":0.0000019090976,"about_ca_topic_score_gemma":0.00000239362,"teacher_disagreement_score":0.98119545,"about_ca_system_score_codex":0.00007523412,"about_ca_system_score_gemma":0.00038423354,"threshold_uncertainty_score":0.49055836},"labels":[],"label_agreement":null},{"id":"W2137343359","doi":"10.3844/jcssp.2006.33.47","title":"Redundancy Schemes for High Availability Computer Clusters","year":2006,"lang":"en","type":"article","venue":"Journal of Computer Science","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Computer science; Redundancy (engineering); Data mining; Operating system","score_opus":0.00988911195403122,"score_gpt":0.24155163656874493,"score_spread":0.2316625246147137,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2137343359","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.056474023,0.0001446289,0.93801457,0.0011045461,0.003886646,0.00020147051,0.000006762691,0.000053363678,0.00011397203],"genre_scores_gemma":[0.58934814,0.0000019187949,0.4094641,0.0002464993,0.00088198035,0.0000027491512,7.55297e-7,0.000005540922,0.000048332593],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969979,0.00006011874,0.0009630495,0.0005139848,0.00092447695,0.000540471],"domain_scores_gemma":[0.9970029,0.00012989536,0.0007297725,0.0006662448,0.0012702738,0.00020092016],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020951473,0.0002129431,0.00043399964,0.00026969635,0.00034034043,0.00080574176,0.002806339,0.00006288027,0.000003157106],"category_scores_gemma":[0.000033271695,0.00017172411,0.00018186202,0.0010908945,0.0003567215,0.0020771914,0.00036432935,0.00019457497,0.000009565947],"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.000113435315,0.0011993732,0.0043192357,0.0002585522,0.0000893913,0.00014546614,0.00077158416,0.023034677,0.005820396,0.30218974,0.11103094,0.5510272],"study_design_scores_gemma":[0.0027682164,0.0013066615,0.026453106,0.00031715666,0.000019639187,0.0006743727,0.000008747827,0.8615613,0.0054703928,0.017109996,0.08355696,0.0007534433],"about_ca_topic_score_codex":0.000020587033,"about_ca_topic_score_gemma":0.0000023413822,"teacher_disagreement_score":0.8385266,"about_ca_system_score_codex":0.00014927368,"about_ca_system_score_gemma":0.00049463124,"threshold_uncertainty_score":0.7769787},"labels":[],"label_agreement":null},{"id":"W2140113450","doi":"10.3844/jcssp.2008.571.577","title":"An Empirical Validation of Object-Oriented Design Metrics for Fault Prediction","year":2008,"lang":"en","type":"article","venue":"Journal of Computer Science","topic":"Software Engineering Research","field":"Computer Science","cited_by":63,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Computer science; Empirical research; Fault (geology); Data mining; Artificial intelligence; Statistics","score_opus":0.06229142806206331,"score_gpt":0.33621341128855825,"score_spread":0.27392198322649497,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2140113450","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2638017,0.000026102836,0.7351302,0.00006891516,0.00082174805,0.000112052985,8.827154e-7,0.000036434823,0.000001972978],"genre_scores_gemma":[0.5309095,0.0000061204714,0.46894208,0.000018335491,0.00011682836,0.0000014267309,1.9284302e-7,0.0000033323859,0.0000021881895],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975807,0.00008281378,0.0004737635,0.0002515803,0.0013372202,0.00027388582],"domain_scores_gemma":[0.99665856,0.00081752136,0.0002858017,0.00038265777,0.0016460116,0.000209454],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027030073,0.00009484985,0.00019905293,0.0009549527,0.00017171173,0.000099562654,0.0015740569,0.00004444864,8.8418017e-7],"category_scores_gemma":[0.000944291,0.00008004979,0.000079945625,0.0026786674,0.00017509317,0.0018939021,0.00012565339,0.00016332524,0.000001074064],"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.00014297951,0.0010673141,0.07090112,0.000077054414,0.000069926056,0.00009148943,0.0071790717,0.7879832,0.03572567,0.0013765938,0.005583616,0.089802004],"study_design_scores_gemma":[0.00044049165,0.0016357219,0.0405188,0.000023482637,0.000004223946,0.00030261875,0.0000040541117,0.8936471,0.06294198,0.00021575055,0.00018062729,0.0000851562],"about_ca_topic_score_codex":0.0000013133573,"about_ca_topic_score_gemma":2.6865038e-8,"teacher_disagreement_score":0.2671078,"about_ca_system_score_codex":0.00012815774,"about_ca_system_score_gemma":0.00067352253,"threshold_uncertainty_score":0.32643357},"labels":[],"label_agreement":null},{"id":"W2149581646","doi":"10.3844/jcssp.2010.808.812","title":"Dominant Factors in National Information Security Policies","year":2010,"lang":"en","type":"article","venue":"Journal of Computer Science","topic":"Information and Cyber Security","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"China; National security; Order (exchange); Security policy; Computer science; European union; Computer security; Political science; Business; International trade; Finance","score_opus":0.00812372854012392,"score_gpt":0.25173990291591625,"score_spread":0.24361617437579233,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2149581646","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7225875,0.000003312518,0.27129966,0.001116621,0.0023517997,0.000060946015,0.0000012958533,0.000016701222,0.0025621213],"genre_scores_gemma":[0.9766748,0.0000023143828,0.022618575,0.00060260115,0.00009812138,4.216617e-7,2.1544835e-7,9.620821e-7,0.0000019762683],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99803984,0.000021155183,0.000554667,0.00008345842,0.0010718569,0.00022903166],"domain_scores_gemma":[0.9983465,0.000061124505,0.00041629764,0.00018398536,0.0008616708,0.00013043493],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018836476,0.00009073451,0.00013666968,0.00078841957,0.00014116043,0.00052988506,0.0015673271,0.00004229719,0.00000847099],"category_scores_gemma":[0.00013429196,0.00006938294,0.0000603236,0.0010100545,0.00016470841,0.009403893,0.00024593167,0.0003647717,0.000012875316],"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.000011131368,0.00011677644,0.0075640357,0.000017481185,0.0000066013627,0.000007734667,0.041032523,0.0007276328,0.0033713572,0.9291131,0.0024065734,0.015625063],"study_design_scores_gemma":[0.0017939409,0.00032315557,0.32398164,0.000068542904,0.0000032120033,0.0007350035,0.00026953075,0.5385788,0.04883335,0.044528347,0.040301647,0.00058281416],"about_ca_topic_score_codex":0.000018552795,"about_ca_topic_score_gemma":0.000017767765,"teacher_disagreement_score":0.8845847,"about_ca_system_score_codex":0.00007801033,"about_ca_system_score_gemma":0.00065129256,"threshold_uncertainty_score":0.6817595},"labels":[],"label_agreement":null},{"id":"W2152598042","doi":"10.3844/jcssp.2007.35.42","title":"A Secure Protocol Based on a Sedentary Agent for Mobile Agent Environments","year":2007,"lang":"en","type":"article","venue":"Journal of Computer Science","topic":"Mobile Agent-Based Network Management","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Computer science; Protocol (science); Mobile agent; Computer network; Human–computer interaction; Computer security; Distributed computing","score_opus":0.014118435386693254,"score_gpt":0.2788078005175027,"score_spread":0.26468936513080943,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2152598042","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0041164747,0.00001077518,0.9753474,0.00029587123,0.0012564121,0.018800601,0.0000012445528,0.000032286232,0.00013892361],"genre_scores_gemma":[0.2247421,0.0000035709925,0.7588554,0.008271542,0.0009776753,0.0070090042,0.0000011138576,0.000031311298,0.00010828837],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959657,0.00007418954,0.00081613875,0.0005956923,0.0018252339,0.0007230167],"domain_scores_gemma":[0.99769586,0.00020780924,0.00072731957,0.0008518958,0.00014662599,0.00037051333],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041550878,0.00026652604,0.0002940065,0.00061952876,0.00029818557,0.0003586954,0.0030197483,0.00004727012,0.000019404039],"category_scores_gemma":[0.000017889259,0.0002172358,0.00024605897,0.00087371486,0.00017265511,0.0008030351,0.00050754123,0.00023704745,0.00002125006],"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.0003493282,0.0016108055,0.0005784566,0.00012734339,0.00006294392,0.0006265278,0.00064487616,0.3742735,0.0015185885,0.0021512718,0.020655466,0.5974009],"study_design_scores_gemma":[0.002730557,0.004052036,0.003165652,0.00020477867,0.000016900081,0.000060548897,0.000014551103,0.77981704,0.0064976737,0.0004155335,0.20264706,0.00037770037],"about_ca_topic_score_codex":0.0000017593695,"about_ca_topic_score_gemma":0.0000012784468,"teacher_disagreement_score":0.5970232,"about_ca_system_score_codex":0.000640726,"about_ca_system_score_gemma":0.00031797227,"threshold_uncertainty_score":0.88586193},"labels":[],"label_agreement":null},{"id":"W2303634517","doi":"10.3844/jcssp.2015.957.970","title":"Segmentation Methods of Echocardiography Images for Left Ventricle Boundary Detection","year":2015,"lang":"en","type":"article","venue":"Journal of Computer Science","topic":"Cardiac Valve Diseases and Treatments","field":"Medicine","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Innovation Cluster (Canada)","funders":"","keywords":"Segmentation; Computer science; Artificial intelligence; Image segmentation; Cardiac Ultrasound; Ventricle; Computer vision; Ultrasound; Pattern recognition (psychology); Radiology; Medicine; Cardiology","score_opus":0.025502770872664705,"score_gpt":0.4136369587897326,"score_spread":0.3881341879170679,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2303634517","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4151177,0.00046326203,0.5836301,0.000043539476,0.0006083546,0.00010110392,0.000002181128,0.0000035764967,0.000030187333],"genre_scores_gemma":[0.81852007,0.00001785224,0.18126772,0.000042798998,0.00014459115,8.2249556e-7,4.7651287e-7,0.000002952227,0.000002726017],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9992191,0.00003357092,0.00020904788,0.000084932064,0.0003584046,0.000094910894],"domain_scores_gemma":[0.9988597,0.000042080675,0.00020244092,0.00009426617,0.0006467679,0.00015476142],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00088492123,0.000050204122,0.00018071801,0.00026974335,0.000049936578,0.000034882476,0.00007248041,0.000013043586,0.0000010586417],"category_scores_gemma":[0.000051098792,0.00003824359,0.0004841276,0.00031676728,0.00009967645,0.00027049694,0.000021858026,0.000037419217,4.1368688e-7],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006046855,0.00036895677,0.15763198,0.00006998392,0.00053896935,0.000017762031,0.00048629122,0.00074761116,0.04455697,0.000013309401,0.0009758715,0.79398763],"study_design_scores_gemma":[0.004147226,0.002726827,0.7799721,0.00008566768,0.000679499,0.00025269092,0.00012519429,0.0039121765,0.20611362,0.0011594788,0.00073253317,0.00009298783],"about_ca_topic_score_codex":0.00000273992,"about_ca_topic_score_gemma":2.5025688e-8,"teacher_disagreement_score":0.79389465,"about_ca_system_score_codex":0.00007299076,"about_ca_system_score_gemma":0.0002262616,"threshold_uncertainty_score":0.15595283},"labels":[],"label_agreement":null},{"id":"W2766253199","doi":"10.3844/jcssp.2017.460.469","title":"Using MVCA to Improve Architecture Modularity of Smart Spaces","year":2017,"lang":"en","type":"article","venue":"Journal of Computer Science","topic":"Context-Aware Activity Recognition Systems","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":"École de Technologie Supérieure","funders":"École de technologie supérieure","keywords":"Computer science; Architecture; Reference architecture; Applications architecture; Modular design; Maintainability; Space-based architecture; Reusability; Software engineering; Adapter (computing); Solution architecture; Human–computer interaction; Software architecture; Distributed computing; Embedded system; Operating system; Software","score_opus":0.04902678096218353,"score_gpt":0.31388428318696554,"score_spread":0.264857502224782,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2766253199","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35103372,0.000018313229,0.64597225,0.0009861508,0.0017954097,0.00008889223,0.0000013037306,0.000010167455,0.00009378283],"genre_scores_gemma":[0.77815133,8.8729087e-7,0.2214537,0.00013427553,0.00024487457,4.587218e-7,1.14067795e-8,0.0000038751464,0.0000106034995],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99772596,0.00007989213,0.0005013679,0.00035243854,0.0010228015,0.00031753158],"domain_scores_gemma":[0.9963543,0.000105314444,0.0011871695,0.0010725264,0.000991854,0.00028884373],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0020543428,0.00014734046,0.00039234094,0.00045935306,0.00045043076,0.0011309554,0.004056588,0.000044322787,0.0000021816147],"category_scores_gemma":[0.00023835161,0.00012122566,0.00015084188,0.0004150063,0.00031649315,0.0024590474,0.0011939262,0.00025048215,0.0000048882134],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050053477,0.0002281846,0.0070251646,0.00006427392,0.00006212468,0.000105709776,0.0032311894,0.0038906815,0.19493374,0.0017535246,0.00023247852,0.7884229],"study_design_scores_gemma":[0.002072591,0.0025393462,0.11105548,0.0011970046,0.000044110602,0.0026603672,0.00006100949,0.6302547,0.23484384,0.010231384,0.00396623,0.0010739244],"about_ca_topic_score_codex":0.000075070115,"about_ca_topic_score_gemma":0.00001664036,"teacher_disagreement_score":0.7873489,"about_ca_system_score_codex":0.00008425352,"about_ca_system_score_gemma":0.0005200112,"threshold_uncertainty_score":0.99990594},"labels":[],"label_agreement":null},{"id":"W2898643486","doi":"10.3844/jcssp.2018.1420.1430","title":"VERBO: Voice Emotion Recognition dataBase in Portuguese Language","year":2018,"lang":"en","type":"article","venue":"Journal of Computer Science","topic":"Emotion and Mood Recognition","field":"Psychology","cited_by":15,"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 Ottawa","funders":"Coordenação de Aperfeiçoamento de Pessoal de Nível Superior; Universidade de São Paulo; Fundação de Amparo à Pesquisa do Estado de São Paulo; University of Ottawa","keywords":"Disgust; Surprise; Computer science; Feeling; Portuguese; Context (archaeology); Emotion classification; Happiness; Speech recognition; Anger; Natural language processing; Database; Artificial intelligence; Psychology; Linguistics; Social psychology","score_opus":0.04197741028063174,"score_gpt":0.3425317907586801,"score_spread":0.3005543804780484,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2898643486","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9418657,0.00006534023,0.049675226,0.00026448895,0.0037310761,0.00006536549,0.0000035919954,0.000014333275,0.004314892],"genre_scores_gemma":[0.9888343,0.000013923611,0.009391256,0.0006260348,0.0010189798,6.482529e-7,0.0000043882633,0.0000049855644,0.00010548973],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9989126,0.000092149465,0.00033018514,0.00016786768,0.00030975023,0.00018747471],"domain_scores_gemma":[0.9990799,0.00003697612,0.0002581959,0.00015605068,0.00036342346,0.000105451465],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013981315,0.000067444875,0.00010871257,0.0004601555,0.000060547383,0.000040300703,0.00025279415,0.000037288715,0.00031452716],"category_scores_gemma":[0.000062537925,0.000058460097,0.000039579067,0.0005711479,0.00019781907,0.0006730603,0.00004497055,0.00017582759,0.00036678536],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000096888965,0.00039839325,0.00092364114,0.000009795479,0.000010651962,0.00018091373,0.0061589666,0.0000035923188,0.01293461,0.0002007126,0.004049513,0.9750323],"study_design_scores_gemma":[0.007997475,0.004543789,0.9314388,0.0013063897,0.00007150332,0.005304231,0.0029377064,0.010780116,0.024666922,0.0028824925,0.007195296,0.0008752947],"about_ca_topic_score_codex":0.00002609118,"about_ca_topic_score_gemma":0.000023692188,"teacher_disagreement_score":0.97415704,"about_ca_system_score_codex":0.000047847785,"about_ca_system_score_gemma":0.000077359546,"threshold_uncertainty_score":0.47144058},"labels":[],"label_agreement":null},{"id":"W3184397450","doi":"10.3844/jcssp.2023.1.10","title":"Anonymous and Distributed Authentication for Peer-to-Peer Networks","year":2023,"lang":"en","type":"article","venue":"Journal of Computer Science","topic":"Internet Traffic Analysis and Secure E-voting","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Waterloo","keywords":"Computer science; Computer security; Authentication protocol; Anonymity; Authentication (law); Public key infrastructure; Challenge-Handshake Authentication Protocol; Soundness; Protocol (science); Resilience (materials science); Public-key cryptography; Computer network; Encryption","score_opus":0.015204246187679356,"score_gpt":0.2706254351685638,"score_spread":0.25542118898088445,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3184397450","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.084501505,0.000019933357,0.9098789,0.0045062643,0.00096541457,0.00007827513,0.0000013240723,0.000040146802,0.000008202565],"genre_scores_gemma":[0.9278407,0.0000027581334,0.071485385,0.0002572688,0.00030054268,0.0000015277066,0.000001466209,0.000003971674,0.0001063863],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981439,0.00002754045,0.0003981391,0.00027845168,0.00081621157,0.0003357401],"domain_scores_gemma":[0.9978703,0.0001532536,0.0002441543,0.00016977859,0.00135763,0.00020488688],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029366212,0.00010020094,0.00019864409,0.00036118604,0.00022185643,0.0006254669,0.0012543736,0.000032242562,0.0000012395849],"category_scores_gemma":[0.00018533162,0.00007922915,0.00009401028,0.0014728449,0.00009147187,0.000613086,0.0003125255,0.000121647,0.000006997852],"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.000027764878,0.00011324782,0.00042241643,0.00002257543,0.000078591176,0.00005803764,0.0061282567,0.5820442,0.0006605271,0.17135327,0.04203981,0.1970513],"study_design_scores_gemma":[0.00016994953,0.00018264739,0.0038093578,0.000028385914,0.000009510837,0.000060917766,0.00002034086,0.99255997,0.00007424484,0.00013678851,0.0028522513,0.000095622534],"about_ca_topic_score_codex":7.685311e-7,"about_ca_topic_score_gemma":0.0000013092556,"teacher_disagreement_score":0.8433392,"about_ca_system_score_codex":0.000043073465,"about_ca_system_score_gemma":0.000104071354,"threshold_uncertainty_score":0.6031392},"labels":[],"label_agreement":null},{"id":"W4245698541","doi":"10.3844/jcssp.2006.646.659","title":"A Network Management Framework Using Mobile Agents","year":2006,"lang":"en","type":"article","venue":"Journal of Computer Science","topic":"Mobile Agent-Based Network Management","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Computer science","score_opus":0.01589707596280289,"score_gpt":0.26008572495511967,"score_spread":0.2441886489923168,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4245698541","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04179756,0.00031703254,0.95338744,0.00015559328,0.0032922684,0.0002915529,1.9001651e-7,0.000058507412,0.00069985876],"genre_scores_gemma":[0.3621362,0.000019185749,0.63594365,0.00084179663,0.0010046542,0.000004714288,1.1686448e-7,0.000009188803,0.000040511415],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99622834,0.00009940486,0.00080215523,0.00051295786,0.0015755487,0.00078157807],"domain_scores_gemma":[0.9977593,0.00009329715,0.00072274375,0.0009109755,0.00029623727,0.00021748633],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002145918,0.0002355641,0.00031891358,0.0004789306,0.00038780537,0.0007795375,0.0037970024,0.000047740745,0.000017600827],"category_scores_gemma":[0.000006263249,0.00020723307,0.00016367492,0.00265534,0.00020450486,0.0014034172,0.0014041042,0.00027411687,0.000023653145],"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.00000695848,0.0001305844,0.0007486749,0.00001869715,0.00002777998,0.0004011264,0.0000744295,0.8738212,0.000031366108,0.051961504,0.010597603,0.06218007],"study_design_scores_gemma":[0.0005063863,0.000342128,0.007417958,0.0003252554,0.00003500058,0.00021317773,0.00000800892,0.9348547,0.00014784493,0.034996305,0.020770974,0.0003822863],"about_ca_topic_score_codex":0.000008753743,"about_ca_topic_score_gemma":6.5026506e-7,"teacher_disagreement_score":0.3203386,"about_ca_system_score_codex":0.00036508573,"about_ca_system_score_gemma":0.00018005083,"threshold_uncertainty_score":0.8450719},"labels":[],"label_agreement":null},{"id":"W4378651670","doi":"10.3844/jcssp.2023.554.568","title":"Artificial Intelligence in COVID-19 Management: A Systematic Review","year":2023,"lang":"en","type":"review","venue":"Journal of Computer Science","topic":"COVID-19 diagnosis using AI","field":"Medicine","cited_by":33,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Fakultet Medicinskih Nauka, Univerziteta U Kragujevcu; Khalkhal University of Medical Sciences; Tehran University of Medical Sciences and Health Services","keywords":"Computer science; Scopus; Coronavirus disease 2019 (COVID-19); Artificial intelligence; Systematic review; Health care; Inclusion (mineral); MEDLINE; Logistic regression; Field (mathematics); Data science; Machine learning; Medicine; Disease; Psychology; Pathology","score_opus":0.17960504911644493,"score_gpt":0.4601520842531396,"score_spread":0.28054703513669466,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4378651670","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[2.1697811e-7,0.9514798,0.042127457,0.0034431317,0.0009375086,0.001964107,0.0000014659905,0.00003567488,0.000010670984],"genre_scores_gemma":[0.0000012358851,0.9834314,0.005860935,0.010335704,0.00027495046,0.00004068669,0.0000010701503,0.000028874523,0.000025165156],"study_design_codex":"systematic_review","study_design_gemma":"systematic_review","domain_scores_codex":[0.9941715,0.00031127583,0.0029955253,0.0005026728,0.001594734,0.00042430247],"domain_scores_gemma":[0.9953547,0.0011035568,0.0019689922,0.0007721741,0.00029266105,0.00050788146],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.008490977,0.0003546765,0.0036610814,0.0023303614,0.000093534065,0.00019703164,0.0016095428,0.000096962685,0.00001734171],"category_scores_gemma":[0.0022076042,0.00024753975,0.000672315,0.005350488,0.0002732109,0.00028096169,0.00044372265,0.00066432793,0.00018288217],"study_design_candidate":"systematic_review","study_design_consensus":"systematic_review","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000022954487,0.000075241056,2.0804272e-7,0.7632636,0.00006382376,0.001462392,0.000049928116,0.000032301108,2.3212666e-8,0.0002185397,0.0013834985,0.23344818],"study_design_scores_gemma":[0.000053642925,0.00012837221,8.116391e-7,0.87825465,0.0017389021,0.0014416815,0.0000071976583,0.0006371216,1.9499902e-7,0.00022825372,0.11732228,0.00018688208],"about_ca_topic_score_codex":0.0000052832866,"about_ca_topic_score_gemma":0.0000025984536,"teacher_disagreement_score":0.23326129,"about_ca_system_score_codex":0.0014085872,"about_ca_system_score_gemma":0.0031142724,"threshold_uncertainty_score":0.9999977},"labels":[],"label_agreement":null},{"id":"W4388828740","doi":"10.3844/jcssp.2023.1438.1449","title":"Crop Disease Detection Using Deep Learning Techniques on Images","year":2023,"lang":"en","type":"article","venue":"Journal of Computer Science","topic":"Smart Agriculture and AI","field":"Agricultural and Biological Sciences","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Laurentian University","funders":"","keywords":"Computer science; Artificial intelligence; Deep learning; Grayscale; Transfer of learning; Machine learning; Pattern recognition (psychology); Food security; Agriculture; Computer vision; Image (mathematics)","score_opus":0.017305542536169987,"score_gpt":0.24358796267092847,"score_spread":0.2262824201347585,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388828740","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9970214,0.00002914898,0.0019107461,0.00052080053,0.00036836535,0.00004009074,4.094535e-7,0.00006263622,0.00004640244],"genre_scores_gemma":[0.99770665,0.000023186094,0.001145541,0.00014331011,0.00095220027,4.6976623e-7,3.837462e-7,4.3027163e-7,0.000027838598],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.9990627,0.000039083236,0.00016694891,0.00014005664,0.00040002944,0.00019115818],"domain_scores_gemma":[0.9994244,0.00007168339,0.00015573064,0.00002740899,0.00018451121,0.00013626191],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053490413,0.00007419858,0.000096464144,0.000058962167,0.00037541904,0.00018478633,0.00031853866,0.000021761465,0.000009610872],"category_scores_gemma":[0.00004992723,0.000024347508,0.00007981789,0.0010686863,0.00008605328,0.00038725126,0.000080359845,0.000151254,0.000012483913],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015690308,0.000026673048,0.002642435,0.0000019830675,0.0000025397562,0.000038020647,0.00004410541,0.0010351714,0.647323,0.000012340558,0.00013007889,0.3487279],"study_design_scores_gemma":[0.00009005724,0.0010019477,0.8061346,0.00012999789,0.000014708992,0.000105335246,0.000074340845,0.015269019,0.16725568,0.00048139217,0.009206831,0.00023611457],"about_ca_topic_score_codex":0.0000059201116,"about_ca_topic_score_gemma":0.0000030005247,"teacher_disagreement_score":0.8034921,"about_ca_system_score_codex":0.000031328327,"about_ca_system_score_gemma":0.000013516912,"threshold_uncertainty_score":0.28874576},"labels":[],"label_agreement":null},{"id":"W7125715213","doi":"10.3844/jcssp.2025.2951.2964","title":"Fake News Detection Using Weighted Fine-Tuned BERT and Sparse Recurrent Neural Network","year":2025,"lang":"en","type":"article","venue":"Journal of Computer Science","topic":"Misinformation and Its Impacts","field":"Social Sciences","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Artificial Intelligence in Medicine (Canada)","funders":"","keywords":"Misinformation; Fake news; Preprocessor; Recurrent neural network; Feature (linguistics); Flagging; Deep learning; Artificial neural network; Word (group theory)","score_opus":0.03296609498041849,"score_gpt":0.32433257024546214,"score_spread":0.29136647526504367,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7125715213","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.89664197,0.00011005225,0.09782654,0.0012707671,0.0029080128,0.00007464918,1.6972045e-7,0.000011903439,0.0011559534],"genre_scores_gemma":[0.98951924,0.0000534924,0.009333586,0.0005754564,0.0004628451,6.2594964e-8,4.927917e-8,0.000001430389,0.000053862062],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99883145,0.00007807845,0.00031261516,0.00008690026,0.00045110725,0.00023982924],"domain_scores_gemma":[0.99916035,0.00006031329,0.00026396365,0.00007602435,0.00026842995,0.0001709282],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012677774,0.00006428538,0.00012529404,0.00022065328,0.00062502857,0.00037114663,0.00027252053,0.00003227248,0.000011260862],"category_scores_gemma":[0.00010649822,0.00005148428,0.00004040979,0.001030956,0.00024690034,0.0011523303,0.000066454806,0.00013697686,0.0000012892181],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000046856738,0.000038456583,0.003157758,0.000012480907,0.000013155105,0.0000057938882,0.01015238,0.0042878524,0.0004805399,0.0026369307,0.002302473,0.97686535],"study_design_scores_gemma":[0.0015121773,0.00045139238,0.09628648,0.00055396924,0.00005219838,0.00012981413,0.001640629,0.8379667,0.00096844614,0.0038953756,0.05613874,0.0004040663],"about_ca_topic_score_codex":0.000057813966,"about_ca_topic_score_gemma":0.0001047648,"teacher_disagreement_score":0.97646123,"about_ca_system_score_codex":0.0000961423,"about_ca_system_score_gemma":0.00040503658,"threshold_uncertainty_score":0.48072776},"labels":[],"label_agreement":null},{"id":"W92676756","doi":"10.3844/jcssp.2015.127.136","title":"Image Analysis with Legendre Moment Descriptors","year":2015,"lang":"en","type":"article","venue":"Journal of Computer Science","topic":"Image Retrieval and Classification Techniques","field":"Computer Science","cited_by":12,"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 Winnipeg","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Legendre polynomials; Legendre wavelet; Moment (physics); Velocity Moments; Computation; Image (mathematics); Computer science; Applied mathematics; Set (abstract data type); Method of moments (probability theory); Associated Legendre polynomials; Legendre transformation; Legendre function; Mathematics; Algorithm; Mathematical analysis; Zernike polynomials; Artificial intelligence; Physics; Orthogonal polynomials; Statistics; Optics; Gegenbauer polynomials; Classical orthogonal polynomials; Classical mechanics","score_opus":0.02534627983536598,"score_gpt":0.26549112513240086,"score_spread":0.2401448452970349,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W92676756","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010966499,0.000070835835,0.9871466,0.0010937817,0.0003247448,0.000048998838,2.7465515e-7,0.000050698418,0.0002975766],"genre_scores_gemma":[0.38173822,0.000006185657,0.6179751,0.00016122688,0.00007590556,6.7744816e-7,8.073086e-8,0.0000025425459,0.000040051946],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99787784,0.00004795166,0.00035879627,0.00024691,0.001224073,0.00024446036],"domain_scores_gemma":[0.9973877,0.000020853768,0.00039892946,0.00044680916,0.0014088993,0.0003368148],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015960142,0.00011148166,0.00023581434,0.000723575,0.0001071173,0.0005639108,0.0020066607,0.000021139776,0.0000031287714],"category_scores_gemma":[0.000019200023,0.000073202,0.00010548951,0.003772405,0.00027967183,0.0023348883,0.00023050228,0.00013908022,0.000008064682],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028467935,0.0022042969,0.02810836,0.00007408343,0.0015697666,0.0015164088,0.01888601,0.0034336054,0.0905778,0.13837898,0.018774733,0.69619125],"study_design_scores_gemma":[0.0017454884,0.0039267763,0.034624886,0.00010869139,0.0002974212,0.0014925227,0.00022474783,0.6473538,0.28632513,0.0050406167,0.01785954,0.0010003805],"about_ca_topic_score_codex":0.0000041720523,"about_ca_topic_score_gemma":5.775284e-7,"teacher_disagreement_score":0.6951909,"about_ca_system_score_codex":0.00015672435,"about_ca_system_score_gemma":0.00061271555,"threshold_uncertainty_score":0.5437805},"labels":[],"label_agreement":null}]}