{"meta":{"query_hash":"8539c5f06699","filters":{"venue":"Journal of Communications"},"cohort_total":9,"direct_labels_cover":0,"predictions_cover":9,"exported":9,"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/8539c5f06699","api":"https://metacan.xera.ac/api/v1/cohort?venue=Journal+of+Communications"},"results":[{"id":"W1975686539","doi":"10.4304/jcm.7.1.28-38","title":"Low-Overhead Dynamic Sampling for Redundant Traffic Elimination","year":2012,"lang":"en","type":"article","venue":"Journal of Communications","topic":"Advanced Data Storage Technologies","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Byte; Redundancy (engineering); Network packet; Overhead (engineering); Data redundancy; Throughput; Traverse; Sampling (signal processing); Algorithm; Real-time computing; Computer network; Detector; Computer hardware","score_opus":0.06176264834551478,"score_gpt":0.3605533027415574,"score_spread":0.29879065439604263,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1975686539","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.010088365,0.0024975764,0.9813013,0.0055816905,0.00024219362,0.0001165617,0.0000080378095,0.000084631516,0.00007961074],"genre_scores_gemma":[0.54398215,0.0003540892,0.45558873,0.000033495966,0.000016863396,0.0000065491313,0.0000039720035,0.0000043911828,0.000009787691],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99918324,0.000044109616,0.0003725144,0.00006413495,0.00015273533,0.00018329777],"domain_scores_gemma":[0.997421,0.0004937229,0.00044939635,0.0013410368,0.000241235,0.00005360554],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005907682,0.00007430798,0.0001369719,0.00018826396,0.00021447081,0.000054630786,0.0024412035,0.000048389848,0.0000012190706],"category_scores_gemma":[0.00045768073,0.00006802244,0.00009900044,0.0002538565,0.000083293264,0.0015410384,0.00037360808,0.00023246143,0.000005024647],"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.000016394499,0.0006306295,0.00003759416,0.00003070297,0.00007216523,6.796146e-7,0.0018589064,0.0029667197,0.00808442,0.30600375,0.0013065685,0.6789915],"study_design_scores_gemma":[0.003909892,0.0013405746,0.015772775,0.00089181424,0.00029567478,0.0012175996,0.0038954467,0.48555636,0.011288216,0.12227514,0.35197225,0.0015842582],"about_ca_topic_score_codex":3.8495654e-7,"about_ca_topic_score_gemma":0.000004626624,"teacher_disagreement_score":0.6774072,"about_ca_system_score_codex":0.0001443555,"about_ca_system_score_gemma":0.00006017906,"threshold_uncertainty_score":0.4536404},"labels":[],"label_agreement":null},{"id":"W2005916424","doi":"10.4304/jcm.7.8.587-595","title":"Designing P2P Networks Tolerant to Attacks and Faults Based on Bimodal Degree Distribution","year":2012,"lang":"en","type":"article","venue":"Journal of Communications","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Degree (music); Computer science; Degree distribution; Distribution (mathematics); Distributed computing; Computer network; Mathematics; Complex network; World Wide Web; Physics","score_opus":0.057625452487454425,"score_gpt":0.3063750261670883,"score_spread":0.24874957367963385,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2005916424","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.020393694,0.00058085215,0.95929074,0.019043813,0.00017791378,0.00013270718,0.0000037813434,0.00007677322,0.00029973336],"genre_scores_gemma":[0.76303875,0.000040120063,0.2363296,0.0005071993,0.0000597028,0.000008355592,0.000003056104,0.0000054970114,0.000007735352],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988244,0.0001570662,0.00035928062,0.00010332706,0.0002594316,0.00029645767],"domain_scores_gemma":[0.9975145,0.00049887836,0.00021961787,0.0013324855,0.00021452582,0.00021998596],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00094653934,0.00011744252,0.00018663667,0.00018129086,0.00027416434,0.000098535515,0.0020985256,0.00007780889,0.0000012796954],"category_scores_gemma":[0.00025543416,0.00010281612,0.000056527377,0.0006022158,0.00005696949,0.00040990827,0.00064170314,0.00042386074,0.000009092933],"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.00016744054,0.0011676701,0.039648026,0.0000159708,0.00013787328,0.000015724834,0.0023386343,0.21380654,0.0018898654,0.047139242,0.05122905,0.64244395],"study_design_scores_gemma":[0.0010482878,0.0009800104,0.19706675,0.0005513291,0.000058951093,0.0001710476,0.00018502711,0.72707576,0.0014883461,0.0013511808,0.06941159,0.00061170966],"about_ca_topic_score_codex":0.000005953858,"about_ca_topic_score_gemma":0.000010905332,"teacher_disagreement_score":0.742645,"about_ca_system_score_codex":0.00011631049,"about_ca_system_score_gemma":0.000050502542,"threshold_uncertainty_score":0.41927195},"labels":[],"label_agreement":null},{"id":"W2094782639","doi":"10.4304/jcm.6.3.215-224","title":"A Short-Time Burst degradation Classifier for Real-Time Traffic with Application in MPLS Ingress Nodes","year":2011,"lang":"en","type":"article","venue":"Journal of Communications","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Computer science; Computer network; Burstiness; Quality of service; Real-time computing; Scheduling (production processes); Classifier (UML); Queueing theory; Polling; Network packet; Artificial intelligence","score_opus":0.03889477770260401,"score_gpt":0.2671918485944175,"score_spread":0.2282970708918135,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2094782639","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.10402612,0.0003886949,0.88809615,0.0037669118,0.00007246107,0.0006346506,0.000004790222,0.00009490579,0.002915321],"genre_scores_gemma":[0.8715922,0.00016311981,0.1279316,0.000050971048,0.00003932325,0.000073670824,0.0000075934563,0.000010624726,0.00013090126],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988783,0.00013912613,0.00050354196,0.00013244589,0.00018297677,0.00016358556],"domain_scores_gemma":[0.997908,0.00034791802,0.00036884658,0.00091872766,0.00037716655,0.00007933534],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063680374,0.00010962023,0.00022300039,0.0001977004,0.0001496562,0.00006775896,0.0015428823,0.000063835665,0.000005134979],"category_scores_gemma":[0.000028254179,0.00009173493,0.00007303456,0.00038379323,0.00008547418,0.000561149,0.00007187063,0.0002022562,0.000011736041],"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.0002204578,0.0008573659,0.001717832,0.000013146218,0.000118581585,0.0000036432523,0.002045068,0.0030562298,0.0014389225,0.042546004,0.0010361335,0.9469466],"study_design_scores_gemma":[0.00156996,0.00037203915,0.017029395,0.00018384222,0.00008643969,0.000090244124,0.00013770004,0.97348934,0.00010982399,0.0017596005,0.0048636748,0.00030791608],"about_ca_topic_score_codex":0.000008642517,"about_ca_topic_score_gemma":0.00006179249,"teacher_disagreement_score":0.9704331,"about_ca_system_score_codex":0.00006591461,"about_ca_system_score_gemma":0.00013448416,"threshold_uncertainty_score":0.3740842},"labels":[],"label_agreement":null},{"id":"W2107308768","doi":"10.4304/jcm.5.2.152-163","title":"Preventing Unauthorized Messages and Achieving End-to-End Security in Delay Tolerant Heterogeneous Wireless Networks","year":2010,"lang":"en","type":"article","venue":"Journal of Communications","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Computer network; Roaming; Node (physics); Wireless network; Heterogeneous network; Wireless ad hoc network; Distributed computing; Computer security; Wireless; Telecommunications","score_opus":0.017930174717161865,"score_gpt":0.27868297436511685,"score_spread":0.260752799647955,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2107308768","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.4805295,0.0014172668,0.513403,0.003143434,0.00044234088,0.0001728119,0.0000021434996,0.000029580919,0.00085993245],"genre_scores_gemma":[0.95667124,0.00057660305,0.04241814,0.00019302375,0.00010175949,0.0000062901927,0.0000018745039,0.000010993083,0.00002009149],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982385,0.00031150115,0.00074903946,0.00017040962,0.00024839197,0.0002821547],"domain_scores_gemma":[0.9973702,0.00065364945,0.00045838216,0.0011008945,0.00017717706,0.0002396901],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00165258,0.00015020058,0.00035053087,0.0001891956,0.00029089616,0.00022808235,0.0018402885,0.00011534735,0.000012143382],"category_scores_gemma":[0.00003272732,0.0001375505,0.00009594587,0.0003624815,0.00010301463,0.00040323156,0.0008117314,0.0011042478,0.0000012741483],"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.000103252314,0.0009277792,0.016584244,0.000044279113,0.00022502098,0.000296351,0.008590142,0.005800876,0.002862249,0.042354498,0.00060150377,0.9216098],"study_design_scores_gemma":[0.00063609774,0.00009656624,0.0028862094,0.00021045614,0.000035196244,0.0008132525,0.00008444376,0.9884898,0.00004182839,0.0027472817,0.00371656,0.00024230426],"about_ca_topic_score_codex":0.000023166369,"about_ca_topic_score_gemma":0.00024451205,"teacher_disagreement_score":0.9826889,"about_ca_system_score_codex":0.000025202926,"about_ca_system_score_gemma":0.000114398965,"threshold_uncertainty_score":0.56091464},"labels":[],"label_agreement":null},{"id":"W2129923823","doi":"10.4304/jcm.7.5.400-408","title":"Downstream-based Scheduling for Energy Conservation in Green EPONs","year":2012,"lang":"en","type":"article","venue":"Journal of Communications","topic":"Advanced Optical Network Technologies","field":"Engineering","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Kootenay Association for Science & Technology; University of Waterloo","funders":"","keywords":"Computer science; Environmental science; Energy conservation; Scheduling (production processes); Ecology; Mathematics; Mathematical optimization; Biology","score_opus":0.03436517072594063,"score_gpt":0.2809146160056933,"score_spread":0.24654944527975264,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2129923823","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.07544874,0.0068543195,0.90940785,0.005963607,0.00019931038,0.00014185694,0.000007793351,0.00017302918,0.0018035016],"genre_scores_gemma":[0.67799795,0.00026722468,0.32161757,0.0000557713,0.000031231342,0.000013114417,0.0000037781217,0.000009199264,0.000004134043],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994167,0.000022994922,0.00032422898,0.000024035395,0.000061116945,0.00015089191],"domain_scores_gemma":[0.9988394,0.0005478811,0.00009361673,0.00038796428,0.00009058131,0.00004059877],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021697867,0.00006258382,0.00012754567,0.00014738712,0.000046214765,0.00000792571,0.0003821887,0.000065269865,0.0000026926618],"category_scores_gemma":[0.00017473793,0.00006083409,0.000051003477,0.00021098579,0.000060066424,0.00023791123,0.000035564033,0.00020379444,9.599262e-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.00006373641,0.00049101585,0.020913552,0.000081763355,0.00014095652,0.0000016505394,0.00026701798,0.5154485,0.0068434207,0.3356344,0.0010201214,0.11909381],"study_design_scores_gemma":[0.0016569617,0.00011977536,0.00884604,0.00031357093,0.000072211355,0.000031255226,0.00045958202,0.85850626,0.0037265099,0.03755045,0.0883405,0.00037685645],"about_ca_topic_score_codex":0.0000054936145,"about_ca_topic_score_gemma":0.00004930087,"teacher_disagreement_score":0.60254925,"about_ca_system_score_codex":0.00007894742,"about_ca_system_score_gemma":0.000021110383,"threshold_uncertainty_score":0.24807422},"labels":[],"label_agreement":null},{"id":"W2150175170","doi":"10.4304/jcm.2.2.1-9","title":"HealthGear: Automatic Sleep Apnea Detection and Monitoring with a Mobile Phone","year":2007,"lang":"en","type":"article","venue":"Journal of Communications","topic":"Obstructive Sleep Apnea Research","field":"Medicine","cited_by":84,"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":"Mobile phone; Computer science; Sleep apnea; Sleep (system call); Apnea; Medicine; Telecommunications; Internal medicine; Operating system","score_opus":0.029843366439013634,"score_gpt":0.355923899585083,"score_spread":0.3260805331460694,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2150175170","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.9837079,0.0020084442,0.0122441,0.0009372404,0.000068338115,0.0002484113,6.017303e-7,0.000020533991,0.0007644164],"genre_scores_gemma":[0.9688698,0.0001893427,0.030779006,0.000020661604,0.00010086629,0.00000822249,4.942478e-7,0.000014343305,0.00001723441],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9990205,0.00007616832,0.00035933318,0.000058436886,0.00032139898,0.00016416637],"domain_scores_gemma":[0.9983312,0.0002935685,0.00023624292,0.00052726443,0.00041607185,0.00019567416],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00085568795,0.000070155365,0.00019495947,0.00026795032,0.00018807178,0.000021179805,0.000187649,0.000042258413,0.0000131680035],"category_scores_gemma":[0.0001152701,0.000054488315,0.00003997376,0.0003251418,0.00015470157,0.00014763493,0.00007570684,0.0005338922,0.000005447998],"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.00043834574,0.0005535993,0.0689478,0.00015260433,0.00032317726,0.000040010542,0.0023488465,0.000024018264,0.06490853,0.000067056026,0.000008564285,0.86218745],"study_design_scores_gemma":[0.0065825274,0.00374904,0.9115677,0.000452423,0.00040162218,0.005734859,0.009745313,0.015476242,0.041850775,0.00021104384,0.0039577545,0.00027069682],"about_ca_topic_score_codex":0.000020328602,"about_ca_topic_score_gemma":0.000025866511,"teacher_disagreement_score":0.8619168,"about_ca_system_score_codex":0.00016022091,"about_ca_system_score_gemma":0.000038789844,"threshold_uncertainty_score":0.23195255},"labels":[],"label_agreement":null},{"id":"W2159049494","doi":"10.4304/jcm.1.2.48-56","title":"Round-trip Time Variation in SmoothTCP in the Face of Spurious Errors","year":2006,"lang":"en","type":"article","venue":"Journal of Communications","topic":"Network Traffic and Congestion Control","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":"Western University","funders":"","keywords":"Spurious relationship; Variation (astronomy); Computer science; Face (sociological concept); Statistics; Geodesy; Mathematics; Geology; Machine learning; Physics","score_opus":0.013109954193308288,"score_gpt":0.24643153402519163,"score_spread":0.23332157983188334,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2159049494","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.32894817,0.0063781533,0.5589679,0.090285614,0.00035713342,0.0006039407,0.0000037914938,0.00004525118,0.01441009],"genre_scores_gemma":[0.9919743,0.00009466645,0.0076696174,0.00013829707,0.000030757557,0.0000039521983,8.215959e-7,0.0000025662398,0.00008503068],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987206,0.00037955714,0.00053781917,0.00005404396,0.00021268438,0.000095327516],"domain_scores_gemma":[0.99821967,0.00050405413,0.00040788692,0.00073064264,0.000121299796,0.000016430287],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010773474,0.000055977598,0.000148116,0.0001734002,0.000055317116,0.00004629694,0.0019047097,0.000037725342,0.000004658302],"category_scores_gemma":[0.00004929724,0.00004288657,0.000059391466,0.000571102,0.000043875556,0.0002859673,0.00007849703,0.0002715843,0.0000062855],"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.00008667328,0.0034352702,0.01237742,0.000017676552,0.00009434998,0.00003571417,0.017904997,0.17634411,0.002322956,0.5768834,0.008825846,0.20167157],"study_design_scores_gemma":[0.0027402008,0.0002226291,0.345706,0.00017100236,0.000041384148,0.00013451578,0.00041285777,0.5963804,0.000034406105,0.031751685,0.022154573,0.00025034897],"about_ca_topic_score_codex":0.00009592876,"about_ca_topic_score_gemma":0.0002618154,"teacher_disagreement_score":0.66302615,"about_ca_system_score_codex":0.000046111392,"about_ca_system_score_gemma":0.00010838553,"threshold_uncertainty_score":0.35394564},"labels":[],"label_agreement":null},{"id":"W2371742128","doi":"","title":"Adaptive joint source-channel coding and MAP decoding of error correction arithmetic codes","year":2007,"lang":"en","type":"article","venue":"Journal of Communications","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Advanced Micro Devices (Canada)","funders":"","keywords":"Variable-length code; Decoding methods; Computer science; Algorithm; Arithmetic coding; Shannon–Fano coding; Coding gain; Adaptive coding; List decoding; Coding (social sciences); Channel (broadcasting); Source code; Theoretical computer science; Context-adaptive binary arithmetic coding; Concatenated error correction code; Mathematics; Block code; Telecommunications; Data compression; Statistics","score_opus":0.07945490248697054,"score_gpt":0.3163771763641999,"score_spread":0.23692227387722933,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2371742128","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.0062304484,0.0012026684,0.99100983,0.0007352438,0.0003393838,0.000056632125,0.0000020181703,0.000014650614,0.00040913266],"genre_scores_gemma":[0.78614354,0.00032116144,0.21341892,0.000031035743,0.000035202862,6.843198e-7,0.000001009057,0.000004358826,0.000044069195],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990056,0.000093839015,0.0004959431,0.00008099825,0.00020407344,0.0001195258],"domain_scores_gemma":[0.99784404,0.00055760774,0.000601327,0.00059374346,0.00031569635,0.00008756186],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011569704,0.00007571948,0.00019477971,0.00023321263,0.00024289012,0.000056169636,0.0007952291,0.000041477047,0.0000025030472],"category_scores_gemma":[0.00013406316,0.0000652595,0.000061384366,0.00019946386,0.00009979698,0.0004918868,0.00052851613,0.0002730651,0.0000013175901],"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.00019116054,0.0013677557,0.002386333,0.00010323864,0.00038886833,0.00002911114,0.02268216,0.004097448,0.022233194,0.07020907,0.008755331,0.86755633],"study_design_scores_gemma":[0.0007574857,0.0004292575,0.01181943,0.0007094016,0.000057079003,0.0004763176,0.003156018,0.96514744,0.0051336437,0.006543988,0.005533046,0.00023688638],"about_ca_topic_score_codex":0.000034344324,"about_ca_topic_score_gemma":0.000024404248,"teacher_disagreement_score":0.96105,"about_ca_system_score_codex":0.000042095027,"about_ca_system_score_gemma":0.000047556026,"threshold_uncertainty_score":0.2661205},"labels":[],"label_agreement":null},{"id":"W2381569823","doi":"","title":"Evaluation model for topology partition base on simulation run time","year":2013,"lang":"en","type":"article","venue":"Journal of Communications","topic":"Network Security and Intrusion Detection","field":"Computer Science","cited_by":0,"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":"Partition (number theory); Computer science; Subnet; Topology (electrical circuits); Algorithm; Mathematics","score_opus":0.09010810095060073,"score_gpt":0.3494173123101519,"score_spread":0.25930921135955115,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2381569823","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.01878928,0.00013869234,0.9705143,0.008956753,0.00017415639,0.0003634253,0.0000014104875,0.0000249008,0.0010370687],"genre_scores_gemma":[0.9548919,0.00005802836,0.04445222,0.00040042918,0.000076503326,0.00004167407,0.000005218918,0.0000042823194,0.000069714864],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99893844,0.0002608203,0.0003559711,0.000075362885,0.00027517334,0.00009420725],"domain_scores_gemma":[0.9973925,0.00044006467,0.00034627228,0.00066584145,0.0011044133,0.00005093497],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012182555,0.0000589989,0.000102650156,0.00013882565,0.00024252951,0.0000750061,0.00064951467,0.000058284215,0.00007248353],"category_scores_gemma":[0.0002680596,0.000053815926,0.000080466336,0.00015259563,0.000032981105,0.0008105361,0.00007815574,0.00015467449,0.00006121025],"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.000018843131,0.000251568,0.000006410092,0.0000032761063,0.000028070066,7.099316e-8,0.0006337985,0.8055987,0.0017048984,0.037289277,0.005070966,0.14939417],"study_design_scores_gemma":[0.00030195183,0.00018555223,0.00013891235,0.000016801447,0.000021039015,0.0000042493007,0.0000074942677,0.8995035,0.00024362521,0.097912535,0.0016155628,0.000048733556],"about_ca_topic_score_codex":0.000003811518,"about_ca_topic_score_gemma":0.000006085479,"teacher_disagreement_score":0.9361026,"about_ca_system_score_codex":0.000090066525,"about_ca_system_score_gemma":0.00009342285,"threshold_uncertainty_score":0.21945497},"labels":[],"label_agreement":null}]}