{"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":"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.2805482,0.0010286322,0.7164867,0.0000028073152,0.0015842542,0.00014943919,8.09989e-7,0.000041082196,0.00015813299],"genre_scores_gemma":[0.9463806,0.00007098168,0.05270198,0.00001920616,0.0007993358,0.0000024547023,2.4735192e-7,0.00002304915,0.0000021023297],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990546,0.000032139884,0.0004070749,0.00010945684,0.00014219072,0.0002545007],"domain_scores_gemma":[0.9993304,0.000242207,0.00015964275,0.0000729213,0.00011562591,0.00007920732],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004900003,0.00014425148,0.00029342616,0.000097174656,0.00007706817,0.000054172047,0.000108813445,0.0000839968,0.00000773536],"category_scores_gemma":[0.00001316153,0.00013633283,0.0001069125,0.00013982858,0.000021996562,0.00028868916,0.000027246624,0.00024358049,5.5784636e-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.00079819787,0.000043319014,0.00083923596,0.000070714705,0.00022362979,0.000015146362,0.0008414103,0.76646245,0.00006196432,0.0004055653,0.0029893443,0.22724906],"study_design_scores_gemma":[0.0018894416,0.0007107699,0.011976969,0.00045275033,0.00008359541,0.00017770602,0.00006194343,0.97420245,0.00022510407,0.009087695,0.000876705,0.0002548752],"about_ca_topic_score_codex":0.0000019020811,"about_ca_topic_score_gemma":0.000014925635,"teacher_disagreement_score":0.66583246,"about_ca_system_score_codex":0.00009409524,"about_ca_system_score_gemma":0.000020125935,"threshold_uncertainty_score":0.55594915},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017148871,0.00002060617,0.98099285,0.00059929397,0.0009742633,0.00012977367,0.000010582199,0.000025092271,0.0000986727],"genre_scores_gemma":[0.6882921,0.0000022497577,0.31111115,0.00036153823,0.00018207048,0.000002252199,0.0000055740156,0.000007534156,0.000035510842],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99897474,0.000014249676,0.00038840773,0.00009981764,0.00024723107,0.0002755237],"domain_scores_gemma":[0.99907154,0.00017787747,0.0002911611,0.00014354174,0.00013764785,0.00017821371],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021296988,0.00010482464,0.00014558558,0.000084111016,0.000055315384,0.0006940004,0.00037595097,0.000022054497,0.000003181037],"category_scores_gemma":[0.00004679831,0.000089184294,0.00013445757,0.00016386491,0.000018897761,0.0061798804,0.00007905278,0.00005376807,0.0000037440363],"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.00057168945,0.002267265,0.013781918,0.00017153755,0.000876312,0.000027342528,0.011014647,0.26872307,0.011887892,0.102953784,0.07170255,0.516022],"study_design_scores_gemma":[0.0028661804,0.0009992247,0.00414063,0.00009274269,0.00003503523,0.00026867527,0.00008111168,0.97194105,0.005578311,0.0011414528,0.012444215,0.00041136655],"about_ca_topic_score_codex":8.9576804e-7,"about_ca_topic_score_gemma":8.472294e-8,"teacher_disagreement_score":0.703218,"about_ca_system_score_codex":0.00004955852,"about_ca_system_score_gemma":0.00003340972,"threshold_uncertainty_score":0.6692262},"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":"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.28339043,0.0000343895,0.7110393,0.00040187486,0.00045790456,0.000038961327,5.9276573e-7,0.00001385526,0.004622671],"genre_scores_gemma":[0.9104241,0.0000025224085,0.08875423,0.00072331366,0.0000819774,1.2844693e-7,1.7667618e-7,0.0000016532672,0.0000118795815],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99880064,0.00004400289,0.0005273428,0.000076086435,0.00039130027,0.00016064086],"domain_scores_gemma":[0.99902743,0.00007973567,0.00042176092,0.00012004934,0.0002403773,0.000110623696],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010688641,0.00007381308,0.00017897847,0.00012728528,0.000034543064,0.000035888053,0.00060100574,0.00005090612,0.000026937496],"category_scores_gemma":[0.000019788915,0.00005614874,0.00019605253,0.00022510088,0.000043584292,0.00045270345,0.000055582597,0.00019085489,0.0000071209956],"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.00034744863,0.001541337,0.0046107923,0.000131919,0.00028448974,0.00019543417,0.03148076,0.00033314162,0.0014395664,0.35202226,0.04365896,0.5639539],"study_design_scores_gemma":[0.0036949858,0.0015934048,0.9430159,0.00014502415,0.00002781691,0.001857502,0.00049813616,0.017643614,0.00410762,0.0075051263,0.019406864,0.000504012],"about_ca_topic_score_codex":0.0000014276688,"about_ca_topic_score_gemma":6.735449e-7,"teacher_disagreement_score":0.9384051,"about_ca_system_score_codex":0.000025265843,"about_ca_system_score_gemma":0.000039685012,"threshold_uncertainty_score":0.22896792},"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":"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.41125926,0.00017729812,0.5823924,0.0050147814,0.00067862554,0.00019619457,3.8771404e-7,0.000029954057,0.00025112292],"genre_scores_gemma":[0.9055191,0.000017168326,0.09409344,0.0002607,0.000103551174,0.0000014306407,4.1231175e-7,0.0000021842952,0.0000020104715],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99916285,0.00009344833,0.0003450165,0.00009672586,0.00015700373,0.00014493617],"domain_scores_gemma":[0.9991249,0.00023221284,0.0003410417,0.00013839519,0.0001320692,0.00003141789],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045919165,0.00008227353,0.0002380445,0.00020204933,0.00007734418,0.0000808368,0.0005169292,0.00005214751,6.136825e-7],"category_scores_gemma":[0.000043110245,0.000072556155,0.00011986903,0.00018982057,0.000045416687,0.00041925017,0.000038827784,0.00015016696,8.4421606e-7],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019497478,0.00034559367,0.0047591636,0.000046042158,0.00011267079,0.00010838887,0.004797927,0.0009724083,0.0018254152,0.12517673,0.00818042,0.8534803],"study_design_scores_gemma":[0.009878599,0.0027429091,0.56863207,0.0005806147,0.00008475759,0.0023227104,0.000993185,0.26594943,0.002124141,0.14301965,0.0029507726,0.00072113855],"about_ca_topic_score_codex":0.0000028696656,"about_ca_topic_score_gemma":0.0000066138814,"teacher_disagreement_score":0.8527591,"about_ca_system_score_codex":0.000048261965,"about_ca_system_score_gemma":0.00007108602,"threshold_uncertainty_score":0.2958754},"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":"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.0018746416,0.000015372952,0.99678856,0.00035860424,0.0003375121,0.0004915721,1.7277402e-7,0.000047985173,0.0000855879],"genre_scores_gemma":[0.14120418,0.0000037033121,0.8584443,0.00019633694,0.00008789266,0.0000062287863,0.0000023925188,0.000014385401,0.000040634433],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99861336,0.000015102686,0.0004990953,0.00017892533,0.00040316713,0.00029035824],"domain_scores_gemma":[0.9984619,0.00009822647,0.00060683466,0.00025540587,0.00041900197,0.00015860384],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007874601,0.00013138729,0.00019376993,0.00031165496,0.00009142764,0.00018553279,0.00064480305,0.00004413921,5.8687834e-7],"category_scores_gemma":[0.000025791169,0.00011064209,0.00007191102,0.00045676844,0.000019573175,0.00046646097,0.000075622855,0.00012991115,0.0000024839196],"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.000038993483,0.000033896173,0.00015866989,0.000019101883,0.000024454448,0.000008661911,0.0002492124,0.92359316,0.000070635084,0.0009410754,0.00007381345,0.074788325],"study_design_scores_gemma":[0.00052266865,0.00089756784,0.00022084684,0.00007888707,0.000018203957,0.00012256391,0.000037832866,0.9949246,0.00014718204,0.000041815994,0.0028452245,0.0001425778],"about_ca_topic_score_codex":0.0000014454464,"about_ca_topic_score_gemma":8.166475e-7,"teacher_disagreement_score":0.13932954,"about_ca_system_score_codex":0.00012700599,"about_ca_system_score_gemma":0.00007467023,"threshold_uncertainty_score":0.45118535},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018761221,0.000028286024,0.96504194,0.012316726,0.0019120503,0.00034355477,0.0000030412998,0.000024281495,0.0015689201],"genre_scores_gemma":[0.7768691,0.000018958219,0.12002881,0.093816444,0.0067395056,0.000011011543,0.00055605813,0.00009306687,0.0018670256],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994061,0.000015343681,0.00021222002,0.00009412252,0.00017981428,0.00009242227],"domain_scores_gemma":[0.9991567,0.000096985386,0.00045051795,0.000057986308,0.00022778254,0.000009985923],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043006116,0.000088244575,0.00015281273,0.00029489832,0.0000484396,0.00012619629,0.00009075129,0.000025261907,0.00017434907],"category_scores_gemma":[0.000024354265,0.000075426906,0.00012369691,0.00011076975,0.0000040668274,0.0006677812,0.0000109165085,0.00008741648,0.000023525794],"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.0015968055,0.0003568264,0.003091799,0.00063757837,0.00014554041,0.000008618992,0.00017310589,0.03775791,0.002631483,0.0029618382,0.7759952,0.17464326],"study_design_scores_gemma":[0.0020570022,0.0000943844,0.0010854515,0.00010257606,0.00004806218,0.000005812127,0.00004753379,0.68255615,0.00017174646,0.00021358763,0.31351328,0.00010439056],"about_ca_topic_score_codex":0.0000026526197,"about_ca_topic_score_gemma":4.834617e-7,"teacher_disagreement_score":0.8450131,"about_ca_system_score_codex":0.000052402585,"about_ca_system_score_gemma":0.00001961899,"threshold_uncertainty_score":0.307582},"labels":[],"label_agreement":null}]}