{"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":"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.14720406,0.0003476314,0.84718174,0.000110368295,0.00007423137,0.000078493584,0.00006510314,0.0029038033,0.0020345207],"genre_scores_gemma":[0.78868693,0.00006678577,0.20950568,0.00007038668,0.000043772372,0.000052365092,0.0001306844,0.00013716207,0.0013061799],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992393,0.00015225058,0.00004786676,0.00012130374,0.00034582528,0.00009350583],"domain_scores_gemma":[0.9982395,0.0006118772,0.00021614449,0.00045769222,0.0004039944,0.00007086094],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005811767,0.0004943779,0.00045146662,0.0010342445,0.00053827564,0.00052384887,0.00111087,0.00029821764,0.0013027436],"category_scores_gemma":[0.0023761787,0.0002451784,0.00018912555,0.0006921276,0.00036721848,0.0008408501,0.00058643497,0.0003523961,0.0003345014],"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.0013932396,0.0003772502,0.005790938,0.00014839582,0.00005849904,0.00027045555,0.00018133143,0.060510732,0.24616992,0.009305882,0.0046761152,0.6711172],"study_design_scores_gemma":[0.00003694458,0.00021501619,0.0014873886,0.000009775113,0.000022446135,0.00030721715,0.00002968184,0.8357922,0.15676719,0.0019388772,0.0033678003,0.000025538444],"about_ca_topic_score_codex":0.00077298994,"about_ca_topic_score_gemma":0.00094770215,"teacher_disagreement_score":0.0013027436,"about_ca_system_score_codex":0.00053480244,"about_ca_system_score_gemma":0.00049940794,"threshold_uncertainty_score":0.004358113},"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":"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.12026336,0.00030146659,0.8749192,0.00029132777,0.000045562636,0.00009719222,0.000041629355,0.00058996887,0.0034503376],"genre_scores_gemma":[0.94438154,0.00020292425,0.05401833,0.000055495027,0.000027486629,0.00009331102,0.00004114188,0.000026886697,0.0011529413],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996216,0.00012688953,0.000018183879,0.00007605668,0.000099550685,0.00005767439],"domain_scores_gemma":[0.99922943,0.00032529462,0.000109245135,0.00011150631,0.00014628853,0.00007827064],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049741636,0.0003746415,0.0003973144,0.00062233396,0.00066244707,0.00068434153,0.0007541792,0.0005542646,0.000879294],"category_scores_gemma":[0.0020477634,0.00019203148,0.00018303747,0.0006261566,0.00058361824,0.0012379722,0.0010262732,0.00044219318,0.00022141194],"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.00031477588,0.00014904424,0.0037917565,0.00020470886,0.000061386665,0.00048690947,0.00031346007,0.7610535,0.06998929,0.04433279,0.0029209557,0.116381384],"study_design_scores_gemma":[0.000022140635,0.00008966565,0.00041805772,0.000007632607,0.00001337157,0.00016126463,0.00006869039,0.9806583,0.005448363,0.010766161,0.0023354432,0.0000108780405],"about_ca_topic_score_codex":0.0008443732,"about_ca_topic_score_gemma":0.0008419332,"teacher_disagreement_score":0.000879294,"about_ca_system_score_codex":0.00055633456,"about_ca_system_score_gemma":0.0004329502,"threshold_uncertainty_score":0.004036486},"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":"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.11626222,0.0008265321,0.8787425,0.0002570589,0.00019429116,0.00022774743,0.00008595659,0.0024732454,0.0009304123],"genre_scores_gemma":[0.756778,0.0004020821,0.24094948,0.00019863286,0.000166264,0.000119013705,0.00024314315,0.000092462746,0.0010509224],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991285,0.00009960629,0.00005137836,0.00015473002,0.0004641606,0.00010165284],"domain_scores_gemma":[0.99773514,0.0004759024,0.000330565,0.00034815838,0.0009394388,0.00017081699],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011824465,0.0005706847,0.00084121997,0.0010959802,0.00066451635,0.00093268044,0.0013304233,0.0006191886,0.00042687205],"category_scores_gemma":[0.0021782035,0.00024340847,0.00033044998,0.0006328971,0.0004599289,0.0011216577,0.0003659403,0.00096812355,0.00022402727],"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.001356823,0.0007394779,0.021209342,0.00027381055,0.000117952324,0.0004331709,0.00028440965,0.13872083,0.30308005,0.008387766,0.004989732,0.5204066],"study_design_scores_gemma":[0.00003526995,0.00040141863,0.0026123363,0.000010657914,0.000035453002,0.00030824626,0.00002733481,0.93855834,0.05374231,0.000934076,0.0032915524,0.000043043165],"about_ca_topic_score_codex":0.0025889643,"about_ca_topic_score_gemma":0.0028247489,"teacher_disagreement_score":0.0025889643,"about_ca_system_score_codex":0.0014838334,"about_ca_system_score_gemma":0.0016868118,"threshold_uncertainty_score":0.01076597},"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":"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.17704456,0.00053450256,0.81899875,0.0002945823,0.000070277354,0.00009755017,0.000032990774,0.00031657476,0.0026101149],"genre_scores_gemma":[0.9647563,0.00017760698,0.03426981,0.000049777464,0.00003067572,0.000032047687,0.000032130192,0.000011097144,0.00064060243],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991855,0.0002667769,0.00007222095,0.00009797117,0.00025341872,0.00012404125],"domain_scores_gemma":[0.9979096,0.00086706236,0.00037204838,0.0004199056,0.000315462,0.0001158567],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011469583,0.00044591495,0.00038157045,0.0005812315,0.0007424,0.0010503598,0.0009149262,0.00070148584,0.0005996787],"category_scores_gemma":[0.0024191616,0.00015175235,0.00021441434,0.00047666987,0.00075097533,0.0020634483,0.0014412359,0.00061650045,0.00015208972],"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.0013800693,0.0003854247,0.006080056,0.00043761687,0.00016229933,0.0014365115,0.0007942308,0.48035392,0.1935718,0.14269793,0.0033045863,0.16939554],"study_design_scores_gemma":[0.00003352644,0.0003034588,0.00050837325,0.000016640472,0.00003740637,0.00028001535,0.00018186242,0.93488616,0.038965985,0.021158349,0.003605541,0.000022785534],"about_ca_topic_score_codex":0.0005105318,"about_ca_topic_score_gemma":0.00034370474,"teacher_disagreement_score":0.0011469583,"about_ca_system_score_codex":0.0004985492,"about_ca_system_score_gemma":0.00040240007,"threshold_uncertainty_score":0.006065786},"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":"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.24897084,0.00020107575,0.7445007,0.0002215498,0.000070950686,0.000042622265,0.00004493509,0.00019875872,0.005748508],"genre_scores_gemma":[0.98123723,0.000047868394,0.01741021,0.000034847988,0.000016954928,0.000017445884,0.00001316686,0.000015788331,0.0012064755],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997576,0.000058294092,0.000009925804,0.000049059712,0.000076635784,0.000048554048],"domain_scores_gemma":[0.99959,0.00016675383,0.00006278055,0.000057847185,0.00009471393,0.000027903743],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005750089,0.00032219928,0.00035296718,0.00019793022,0.0005105683,0.00045184314,0.00071975344,0.0002863161,0.0009010406],"category_scores_gemma":[0.0011054429,0.0001839122,0.0001762559,0.0002158148,0.0003955309,0.0006193618,0.00060272537,0.00045155268,0.00010312238],"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.00044355248,0.00021838027,0.002727569,0.00012487287,0.00004023224,0.00038361893,0.00038410508,0.68954194,0.11460124,0.12721898,0.0021888393,0.06212669],"study_design_scores_gemma":[0.000008163234,0.00003109638,0.00014826922,0.000003348779,0.0000050078384,0.000028275314,0.00001442569,0.9887832,0.0040762573,0.0064499658,0.0004464692,0.0000055355654],"about_ca_topic_score_codex":0.0014768007,"about_ca_topic_score_gemma":0.0023759175,"teacher_disagreement_score":0.0014768007,"about_ca_system_score_codex":0.00067974115,"about_ca_system_score_gemma":0.00095635495,"threshold_uncertainty_score":0.0049319267},"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":"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.37553197,0.005162126,0.55579525,0.0008831709,0.0006853046,0.0010829095,0.0043532974,0.049186725,0.0073192143],"genre_scores_gemma":[0.5741925,0.0013303824,0.4090911,0.0011050546,0.00047620933,0.00061046705,0.0025339995,0.00045391158,0.010206356],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9997234,0.00006753611,0.0000171411,0.000088736866,0.000075492215,0.00002777026],"domain_scores_gemma":[0.99972564,0.00011460662,0.000044030163,0.0000373543,0.000041194966,0.000037134618],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003426776,0.00073935377,0.0005989904,0.00091480755,0.00020211478,0.00047304307,0.00062035996,0.0010185451,0.004216681],"category_scores_gemma":[0.00069935917,0.00028819096,0.0002973313,0.00027069304,0.00018705275,0.0005545523,0.00063506776,0.0002904739,0.001693759],"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.0027003381,0.00040350988,0.023632312,0.0005658406,0.00026551567,0.0012208882,0.00033865016,0.0020484526,0.19753677,0.00087071105,0.023381671,0.74703544],"study_design_scores_gemma":[0.0019568685,0.008674414,0.21768442,0.00033343738,0.0008301405,0.018721627,0.00039274324,0.29301336,0.35846773,0.0033741046,0.09592063,0.000630556],"about_ca_topic_score_codex":0.0005125158,"about_ca_topic_score_gemma":0.001034409,"teacher_disagreement_score":0.004216681,"about_ca_system_score_codex":0.00010402509,"about_ca_system_score_gemma":0.00014985354,"threshold_uncertainty_score":0.014106154},"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":"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.93476933,0.00093200215,0.060450688,0.00019801126,0.00009556871,0.000059666534,0.00018367494,0.0006539443,0.0026570396],"genre_scores_gemma":[0.99745876,0.000056162186,0.0022419982,0.000018267845,0.000013665657,0.00001121423,0.000060186554,0.000021810434,0.00011789643],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99773324,0.0006283931,0.00010852632,0.00031514768,0.0010032122,0.0002115285],"domain_scores_gemma":[0.9874686,0.0070796874,0.0018216532,0.001143044,0.002127938,0.00035912855],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00232282,0.00038362664,0.0004400048,0.0007034912,0.00041151588,0.0010775314,0.00083404494,0.000523063,0.00048282277],"category_scores_gemma":[0.019130705,0.00022843677,0.00017948929,0.00096432195,0.0007787414,0.0008325902,0.0006816734,0.000793843,0.00011431734],"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.0022385232,0.00029779048,0.067023434,0.00024871112,0.0002852718,0.001446963,0.0005497266,0.79901016,0.04517309,0.007840693,0.002704144,0.073181495],"study_design_scores_gemma":[0.000030963827,0.0006160244,0.022943474,0.000024408915,0.000080816535,0.00064296264,0.00010435741,0.9570387,0.013924178,0.0026610314,0.0018730061,0.000060046405],"about_ca_topic_score_codex":0.0022715686,"about_ca_topic_score_gemma":0.0015648364,"teacher_disagreement_score":0.00232282,"about_ca_system_score_codex":0.0009125281,"about_ca_system_score_gemma":0.00058061525,"threshold_uncertainty_score":0.012284398},"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":"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.01620629,0.0002317053,0.98155516,0.00007078942,0.000045922934,0.00005584444,0.000029174891,0.00027124642,0.0015338779],"genre_scores_gemma":[0.55331904,0.0003779165,0.4410181,0.000086639644,0.00008351345,0.00016935419,0.00012824235,0.00004917126,0.004767997],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99901366,0.00030208618,0.000039829523,0.00013071409,0.00042309467,0.000090568836],"domain_scores_gemma":[0.9988236,0.00049268076,0.00010900329,0.00017140318,0.0003694135,0.00003391106],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00085563114,0.0006697505,0.0006603244,0.00080527365,0.0004681368,0.0006179455,0.00080995384,0.00073450635,0.0010305626],"category_scores_gemma":[0.0030974066,0.00026936972,0.00039627324,0.0011009586,0.0006119731,0.0010506581,0.0010287836,0.00083945674,0.00037987967],"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.00073637307,0.00012406509,0.001370435,0.0002663088,0.00017372215,0.00044234938,0.00037314938,0.33554628,0.07285572,0.10827668,0.0025224371,0.4773125],"study_design_scores_gemma":[0.000030054622,0.00010161026,0.00024728515,0.0000128041665,0.000029083441,0.0002529908,0.000017557675,0.953876,0.032869034,0.009962661,0.0025707986,0.000030174551],"about_ca_topic_score_codex":0.0021367802,"about_ca_topic_score_gemma":0.0022454283,"teacher_disagreement_score":0.0021367802,"about_ca_system_score_codex":0.0004297241,"about_ca_system_score_gemma":0.0011754737,"threshold_uncertainty_score":0.004525006},"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":"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.09221713,0.0003898547,0.8967985,0.00024033511,0.00006494926,0.00041548326,0.00035658773,0.002358872,0.0071582105],"genre_scores_gemma":[0.9143428,0.0004577232,0.08066711,0.000046738456,0.00002529409,0.0006745255,0.0007627567,0.00022496139,0.0027980593],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974878,0.0005850858,0.00014520252,0.00046603757,0.0010317746,0.0002840602],"domain_scores_gemma":[0.99645954,0.001487327,0.00036916864,0.00041576117,0.0011633253,0.00010493379],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025917792,0.0015456001,0.00072778953,0.0019021635,0.00057460484,0.0016615062,0.0012266412,0.00062125956,0.0025151835],"category_scores_gemma":[0.009171503,0.00035779394,0.00068140845,0.0010448776,0.00049834605,0.002582724,0.00078540016,0.0008162989,0.0004963242],"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.00028536734,0.00009508222,0.0060854247,0.00011917171,0.000052016705,0.000066157336,0.00013939202,0.9333028,0.006614621,0.007301719,0.0012023705,0.04473592],"study_design_scores_gemma":[0.000010018179,0.00007123786,0.00058577466,0.000006812039,0.0000203153,0.000029403896,0.000020551064,0.9954111,0.002266032,0.0010360447,0.00053285284,0.000009904843],"about_ca_topic_score_codex":0.005477269,"about_ca_topic_score_gemma":0.0027095207,"teacher_disagreement_score":0.005477269,"about_ca_system_score_codex":0.0016682103,"about_ca_system_score_gemma":0.0015647656,"threshold_uncertainty_score":0.013706803},"labels":[],"label_agreement":null}]}