{"meta":{"query_hash":"16b60319ff0c","filters":{"venue":"Journal of Computers"},"cohort_total":6,"direct_labels_cover":0,"predictions_cover":6,"exported":6,"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/16b60319ff0c","api":"https://metacan.xera.ac/api/v1/cohort?venue=Journal+of+Computers"},"results":[{"id":"W1990108762","doi":"10.4304/jcp.6.11.2255-2266","title":"Adaptive Decision Making Strategy for Handoff triggering and Network Selection","year":2011,"lang":"en","type":"article","venue":"Journal of Computers","topic":"IPv6, Mobility, Handover, Networks, Security","field":"Engineering","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":"Handover; RSS; Computer science; Context (archaeology); Selection (genetic algorithm); Computer network; Wireless network; Wireless; Artificial intelligence; Telecommunications; World Wide Web","score_opus":0.025875878004107254,"score_gpt":0.23951265581454803,"score_spread":0.21363677781044077,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1990108762","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.054023266,0.00020540216,0.94000345,0.00031674866,0.000090714624,0.00025783162,0.00003915293,0.0002599998,0.004803442],"genre_scores_gemma":[0.9207287,0.00012097116,0.07646884,0.00013042707,0.000062090934,0.00023639647,0.00006073364,0.000015658437,0.002176195],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99795556,0.0006477723,0.00013018012,0.00035683054,0.0006098032,0.00029989798],"domain_scores_gemma":[0.9979062,0.0010914487,0.00020520702,0.000084920866,0.00050009345,0.00021213877],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022265553,0.0010465019,0.0011665457,0.00085859373,0.00068725355,0.0014205897,0.001463691,0.0012508694,0.002348605],"category_scores_gemma":[0.004243668,0.0002781585,0.00064432237,0.00061255664,0.00060964795,0.0009919594,0.0010368846,0.0010842284,0.00035438064],"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.0007944957,0.0006892414,0.0049128914,0.00017510138,0.00031498566,0.0008644698,0.0005850969,0.65964055,0.018036393,0.030695144,0.00276804,0.28052363],"study_design_scores_gemma":[0.00004060449,0.00014948165,0.0004642375,0.000008054066,0.000044272365,0.0000677748,0.00003814635,0.9933375,0.001602028,0.003740732,0.0004888771,0.000018231933],"about_ca_topic_score_codex":0.0026831322,"about_ca_topic_score_gemma":0.0023868561,"teacher_disagreement_score":0.0026831322,"about_ca_system_score_codex":0.0009655857,"about_ca_system_score_gemma":0.0014228399,"threshold_uncertainty_score":0.011775315},"labels":[],"label_agreement":null},{"id":"W2066159339","doi":"10.4304/jcp.7.6.1289-1296","title":"A Novel Discrete Particle Swarm Optimization for FRM FIR Digital Filters","year":2012,"lang":"en","type":"article","venue":"Journal of Computers","topic":"Digital Filter Design and Implementation","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Particle swarm optimization; Finite impulse response; Digital filter; Computer science; Mathematics; Algorithm; Filter (signal processing); Computer vision","score_opus":0.03555435339319439,"score_gpt":0.28018042942629046,"score_spread":0.24462607603309605,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2066159339","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.0072829584,0.00017264501,0.989997,0.00010462515,0.000071685354,0.00003680251,0.000016773341,0.00013313365,0.0021844679],"genre_scores_gemma":[0.34954864,0.00030911385,0.64362293,0.00017735611,0.000108116896,0.00031662104,0.00011002591,0.000049502734,0.0057576713],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997482,0.00007191155,0.000014686887,0.00004765527,0.00009640557,0.000021232905],"domain_scores_gemma":[0.9997731,0.00010223697,0.000029691033,0.00001715554,0.0000624962,0.000015388352],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054780813,0.0006069862,0.00066533155,0.00031938622,0.00030044274,0.0005328676,0.00071421143,0.0012161222,0.0014850228],"category_scores_gemma":[0.0010765633,0.0002929399,0.00052886864,0.0002992983,0.00041522493,0.00038358528,0.00047449212,0.0005732526,0.00033352352],"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.00008687368,0.00006365623,0.00059201,0.00013704084,0.00005957778,0.000100813304,0.00008343389,0.89660436,0.007748907,0.010435769,0.0014602065,0.08262726],"study_design_scores_gemma":[0.000012317419,0.00003052061,0.0000579706,0.0000035420449,0.0000038411845,0.000010503784,0.0000027057213,0.99854076,0.0003245958,0.00040614067,0.000604275,0.000002818871],"about_ca_topic_score_codex":0.0024517446,"about_ca_topic_score_gemma":0.0020206028,"teacher_disagreement_score":0.0024517446,"about_ca_system_score_codex":0.0003882563,"about_ca_system_score_gemma":0.00062600203,"threshold_uncertainty_score":0.0049678683},"labels":[],"label_agreement":null},{"id":"W2081762242","doi":"10.4304/jcp.2.2.84-93","title":"A Psychological Profile of Defender Personality Traits","year":2007,"lang":"en","type":"article","venue":"Journal of Computers","topic":"Information and Cyber Security","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Big Five personality traits; Psychology; Personality; Personality profile; Social psychology","score_opus":0.029494508377907642,"score_gpt":0.2974128120539166,"score_spread":0.267918303676009,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2081762242","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.99899083,0.00004196194,0.00010783662,0.00005047289,0.0000041791905,0.0000034260927,0.000043148942,0.0000034558664,0.0007546666],"genre_scores_gemma":[0.99955183,0.000028592387,0.00011522721,0.000011764052,0.0000037027826,0.0000025597574,0.000052328,9.984435e-7,0.00023295035],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9997111,0.000081362385,0.000023529172,0.000038536004,0.00009494028,0.000050530187],"domain_scores_gemma":[0.99705493,0.0006729783,0.001106093,0.0001800426,0.00034317438,0.0006428589],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066007744,0.00022948984,0.00019597064,0.0010103484,0.00034936765,0.0007324147,0.0001472393,0.00030329073,0.002602767],"category_scores_gemma":[0.0035464126,0.00010969148,0.0001853436,0.00043150646,0.0002511614,0.0003833601,0.00039324857,0.00062417693,0.0005845652],"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.00005426712,0.00007688656,0.99060154,0.000008184676,0.000019899244,0.00012325928,0.0008511228,0.00007540712,0.0013520934,0.00008034883,0.00021072914,0.0065463544],"study_design_scores_gemma":[0.000002917022,0.00014464345,0.99707484,0.000007955193,0.0000068087206,0.0006081688,0.0011215368,0.0003265776,0.00020453785,0.00012797589,0.00036837766,0.000005634495],"about_ca_topic_score_codex":0.0004973294,"about_ca_topic_score_gemma":0.0004419671,"teacher_disagreement_score":0.002602767,"about_ca_system_score_codex":0.00012644431,"about_ca_system_score_gemma":0.00010391118,"threshold_uncertainty_score":0.008707106},"labels":[],"label_agreement":null},{"id":"W2099521612","doi":"10.4304/jcp.4.4.330-337","title":"SSWP: A Social Semantic Web Portal for Effective Communication in Construction","year":2009,"lang":"en","type":"article","venue":"Journal of Computers","topic":"Semantic Web and Ontologies","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; World Wide Web; Social Semantic Web; Semantic Web","score_opus":0.010355833788995992,"score_gpt":0.2678627095279444,"score_spread":0.25750687573894837,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2099521612","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.03568766,0.00042486927,0.806963,0.0059704892,0.00045700866,0.0015010138,0.0044314526,0.063241735,0.081322804],"genre_scores_gemma":[0.28443903,0.0010463473,0.6533675,0.00131146,0.000357953,0.0028048102,0.012149591,0.003412175,0.04111114],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985531,0.0007436545,0.0001403691,0.000084337065,0.00039460327,0.000083960294],"domain_scores_gemma":[0.9980185,0.00091542833,0.00009634237,0.00043881554,0.0002005712,0.0003302763],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003167612,0.0003766973,0.00045865925,0.0017833071,0.0015148938,0.0032742445,0.00097443315,0.0022907516,0.018811177],"category_scores_gemma":[0.004303728,0.00030857214,0.0005443798,0.002276477,0.0008972662,0.0068389927,0.0047647664,0.001297235,0.0057000103],"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.000766506,0.0012616203,0.003664642,0.001052774,0.00010432408,0.0018188221,0.0040622153,0.010751888,0.014384357,0.26640666,0.23021466,0.46551153],"study_design_scores_gemma":[0.0003122269,0.00023773458,0.0020110314,0.00026209766,0.000045581393,0.00058225484,0.0012181189,0.07858477,0.0065105488,0.13840021,0.77173626,0.00009918004],"about_ca_topic_score_codex":0.0011121024,"about_ca_topic_score_gemma":0.001321829,"teacher_disagreement_score":0.018811177,"about_ca_system_score_codex":0.00068222295,"about_ca_system_score_gemma":0.0018855231,"threshold_uncertainty_score":0.06292963},"labels":[],"label_agreement":null},{"id":"W2141050197","doi":"10.4304/jcp.2.1.12-19","title":"Noisy K Best-Paths for Approximate Dynamic Programming with Application to Portfolio Optimization","year":2007,"lang":"en","type":"article","venue":"Journal of Computers","topic":"Reinforcement Learning in Robotics","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Dynamic programming; Computer science; Sharpe ratio; Reinforcement learning; Mathematical optimization; Portfolio; Markov decision process; Kernel (algebra); Controller (irrigation); Artificial intelligence; Markov process; Mathematics; Algorithm; Finance","score_opus":0.007554112725446023,"score_gpt":0.26092508528742103,"score_spread":0.253370972561975,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2141050197","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.006583329,0.000092936985,0.9924873,0.00012417677,0.0000129442315,0.000016932025,0.000011635768,0.00017081425,0.0004999828],"genre_scores_gemma":[0.50016,0.00017241485,0.4971606,0.00012170825,0.000034210036,0.00022706024,0.00007843102,0.00012556666,0.001920046],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991547,0.00043032892,0.00004329907,0.0001399672,0.0001879551,0.000043758777],"domain_scores_gemma":[0.9976115,0.0017774298,0.00016422594,0.00016174217,0.000216577,0.00006854233],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019507117,0.0008842945,0.0012730543,0.00045026644,0.0004555154,0.0008147105,0.00096146745,0.0014266995,0.002285657],"category_scores_gemma":[0.0072349347,0.00069598056,0.00055158156,0.00068842666,0.0013309891,0.0012997375,0.0014274231,0.0017246389,0.0003067717],"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.000058743124,0.00003795115,0.0002163721,0.00003573561,0.000022375809,0.000028074734,0.000031137515,0.9559172,0.000730832,0.016054893,0.00034411452,0.026522698],"study_design_scores_gemma":[0.000003463382,0.000007925673,0.000013667433,0.00000159269,9.4158526e-7,0.000002775082,9.341144e-7,0.9953969,0.0001493464,0.0043464643,0.00007444484,0.0000014961267],"about_ca_topic_score_codex":0.0027638006,"about_ca_topic_score_gemma":0.0020720924,"teacher_disagreement_score":0.0027638006,"about_ca_system_score_codex":0.0011256459,"about_ca_system_score_gemma":0.0011737574,"threshold_uncertainty_score":0.010316491},"labels":[],"label_agreement":null},{"id":"W2995930425","doi":"","title":"A Hybrid Recommendation Method Based on Feature for Offline Book Personalization","year":2019,"lang":"en","type":"article","venue":"Journal of Computers","topic":"Customer churn and segmentation","field":"Business, Management and Accounting","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":"Toronto Metropolitan University","funders":"","keywords":"Collaborative filtering; Computer science; Word2vec; Personalization; Preference; Similarity (geometry); Recommender system; Feature (linguistics); Information retrieval; Order (exchange); Artificial intelligence; Data mining; World Wide Web; Statistics; Mathematics; Business; Embedding","score_opus":0.014462384838611505,"score_gpt":0.26567819418692773,"score_spread":0.2512158093483162,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2995930425","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.10568932,0.0030313376,0.8707047,0.00038490334,0.00047118883,0.00030699585,0.0022129558,0.010263125,0.006935496],"genre_scores_gemma":[0.5552816,0.0013482387,0.41419822,0.00033200165,0.00043741005,0.00027109773,0.0035531982,0.00028306138,0.024295185],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99903935,0.0000782892,0.00007424235,0.00035668802,0.0003678414,0.000083586914],"domain_scores_gemma":[0.9992774,0.00012362347,0.00003912241,0.0001279479,0.00039291472,0.00003907893],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044911055,0.0009593921,0.0015301659,0.0025801482,0.000610268,0.000772582,0.0011664307,0.0008457982,0.0034354792],"category_scores_gemma":[0.0011235201,0.0004113545,0.0011914099,0.0028444445,0.0001889327,0.0015913016,0.00040889412,0.0006106773,0.002586546],"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.00040170626,0.00032945487,0.007996384,0.00018348556,0.000309354,0.0002049768,0.00011009749,0.01100205,0.027407216,0.00087362016,0.014840019,0.93634164],"study_design_scores_gemma":[0.00013138764,0.00042543703,0.01873828,0.00003410685,0.00036270058,0.0015276995,0.00010271255,0.93863076,0.025133088,0.0012711728,0.013443744,0.00019886355],"about_ca_topic_score_codex":0.01911062,"about_ca_topic_score_gemma":0.029852785,"teacher_disagreement_score":0.01911062,"about_ca_system_score_codex":0.00039116858,"about_ca_system_score_gemma":0.00058796816,"threshold_uncertainty_score":0.037998796},"labels":[],"label_agreement":null}]}