{"meta":{"query_hash":"7121e124400f","filters":{"venue":"International Journal of Communication Networks and Distributed Systems"},"cohort_total":19,"direct_labels_cover":0,"predictions_cover":19,"exported":19,"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/7121e124400f","api":"https://metacan.xera.ac/api/v1/cohort?venue=International+Journal+of+Communication+Networks+and+Distributed+Systems"},"results":[{"id":"W1985838299","doi":"10.1504/ijcnds.2012.044320","title":"A seamless handover scheme for vehicles across heterogeneous networks","year":2011,"lang":"en","type":"article","venue":"International Journal of Communication Networks and Distributed Systems","topic":"IPv6, Mobility, Handover, Networks, Security","field":"Engineering","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":"University of Waterloo","funders":"","keywords":"Computer network; Computer science; Handover; Network packet; Soft handover; Heterogeneous network; Packet loss; Mobility management; Overhead (engineering); Mobile IP; Wireless network; Wireless; Telecommunications","score_opus":0.023039489278254756,"score_gpt":0.25855877206969785,"score_spread":0.2355192827914431,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1985838299","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.18734336,0.02845893,0.78005683,0.00006954752,0.0030866275,0.00045860186,0.0002398186,0.0001047133,0.0001816028],"genre_scores_gemma":[0.99626744,0.0022560249,0.00048489694,0.000043296404,0.0006608885,0.000043803517,0.0001943023,0.00003608264,0.000013249918],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998166,0.00013408386,0.0009130704,0.00014938033,0.0003079874,0.00032944346],"domain_scores_gemma":[0.99786466,0.00028962496,0.00045012226,0.00040587265,0.0008296004,0.00016013233],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009285878,0.00022882261,0.00039813772,0.00006121834,0.00015047206,0.0002437994,0.00084304746,0.00021832842,0.0000116343845],"category_scores_gemma":[0.000043516386,0.00021833429,0.00017973565,0.00012353074,0.00010940807,0.00033779652,0.00015802537,0.000399937,0.0000010166729],"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.0005463717,0.00016772353,0.006669705,0.000051944993,0.00080355944,0.000016379092,0.000577812,0.98099315,0.000036116893,0.0016637614,0.0037923884,0.0046811053],"study_design_scores_gemma":[0.0018538147,0.000075482676,0.0022492693,0.00026115964,0.000050880768,0.00023728004,0.00025498055,0.9827303,0.00004943863,0.00036335323,0.0116144745,0.00025954098],"about_ca_topic_score_codex":0.00004093935,"about_ca_topic_score_gemma":0.000047878188,"teacher_disagreement_score":0.8089241,"about_ca_system_score_codex":0.00015904871,"about_ca_system_score_gemma":0.000020561061,"threshold_uncertainty_score":0.8903414},"labels":[],"label_agreement":null},{"id":"W1996894843","doi":"10.1504/ijcnds.2008.021077","title":"Strategies for fast scanning, ranging and handovers in WiMAX/802.16","year":2008,"lang":"en","type":"article","venue":"International Journal of Communication Networks and Distributed Systems","topic":"Advanced Wireless Network Optimization","field":"Engineering","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs","keywords":"Computer science; Ranging; WiMAX; Handover; Computer network; Base station; Offset (computer science); Real-time computing; Mobile station; Telecommunications; Wireless; Operating system","score_opus":0.010672261707015022,"score_gpt":0.2365594080644354,"score_spread":0.22588714635742038,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1996894843","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.049663402,0.01082774,0.93864524,0.00008123873,0.00036621132,0.00013571432,0.000023302955,0.000025866457,0.00023127715],"genre_scores_gemma":[0.9924068,0.006300188,0.0009968039,0.000011960276,0.00014240784,0.000012981568,0.00010593273,0.0000143986645,0.000008526632],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99917346,0.000043488177,0.00045654527,0.00006516562,0.00014232787,0.00011900476],"domain_scores_gemma":[0.99918395,0.00018359956,0.00021816137,0.00010153527,0.0002626831,0.000050077964],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023932457,0.00010211677,0.0001970667,0.00011803421,0.000079139674,0.0001017899,0.00019918814,0.00006417855,0.0000014232892],"category_scores_gemma":[0.000022068361,0.00010205174,0.00003376947,0.00010415187,0.000058829042,0.00045037852,0.00003181482,0.00015924274,8.51257e-8],"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.000051988252,0.0000100336065,0.0025484448,0.000010653111,0.000053062733,0.0000034978762,0.00018240101,0.99286616,0.000017196651,0.0017351353,0.00097499305,0.0015464353],"study_design_scores_gemma":[0.001327165,0.000026552714,0.0014229978,0.000308398,0.000009270941,0.00017284023,0.0010179305,0.9920064,0.0000052202345,0.00023425893,0.0033596347,0.00010930072],"about_ca_topic_score_codex":0.000015483869,"about_ca_topic_score_gemma":0.000014902273,"teacher_disagreement_score":0.9427434,"about_ca_system_score_codex":0.00011645429,"about_ca_system_score_gemma":0.000021992622,"threshold_uncertainty_score":0.41615492},"labels":[],"label_agreement":null},{"id":"W2006014260","doi":"10.1504/ijcnds.2009.027595","title":"A mesh check-sum ABFT scheme for stream ciphers","year":2009,"lang":"en","type":"article","venue":"International Journal of Communication Networks and Distributed Systems","topic":"Cryptographic Implementations and Security","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":"University of Regina","funders":"","keywords":"Computer science; Checksum; RC4; Stream cipher; Scheme (mathematics); Overhead (engineering); Error detection and correction; Algorithm; Parallel computing; Cryptography; Mathematics","score_opus":0.018645262220896675,"score_gpt":0.3038732293090233,"score_spread":0.2852279670881266,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2006014260","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.012183311,0.0024102533,0.98077834,0.0036702405,0.0005214939,0.00018224932,0.00004529873,0.000024004617,0.0001848252],"genre_scores_gemma":[0.99184346,0.00074201403,0.0069417837,0.0001735427,0.00016224156,0.000009073465,0.000115688636,0.000003518677,0.000008677078],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987429,0.000088354165,0.0006106407,0.000110978515,0.00030500704,0.00014215503],"domain_scores_gemma":[0.9979666,0.0001866324,0.00056743354,0.00031457108,0.00086960616,0.00009517313],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006823644,0.000102550526,0.0001845301,0.00011868634,0.00014485528,0.00043566353,0.0010936842,0.000058547805,0.0000041689564],"category_scores_gemma":[0.000049454287,0.00009188029,0.000111963294,0.00018613134,0.00003458193,0.0004757331,0.00008457425,0.00015078907,2.9451604e-7],"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.00014489354,0.00041800144,0.0044572097,0.0000120263685,0.00044458968,0.000009358731,0.0006125611,0.015288885,0.00012238002,0.9129095,0.030480543,0.035100035],"study_design_scores_gemma":[0.0036152783,0.000443514,0.01607412,0.00029392683,0.00004521514,0.00030815508,0.0011762163,0.869047,0.000030598436,0.013364396,0.095226325,0.0003752591],"about_ca_topic_score_codex":0.000020106007,"about_ca_topic_score_gemma":0.000007420939,"teacher_disagreement_score":0.97966015,"about_ca_system_score_codex":0.000055231052,"about_ca_system_score_gemma":0.000052333722,"threshold_uncertainty_score":0.42011136},"labels":[],"label_agreement":null},{"id":"W2013094895","doi":"10.1504/ijcnds.2012.046357","title":"A continuous-time Markov chain model and analysis for cognitive radio networks","year":2012,"lang":"en","type":"article","venue":"International Journal of Communication Networks and Distributed Systems","topic":"Cognitive Radio Networks and Spectrum Sensing","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":"University of Toronto","funders":"","keywords":"Cognitive radio; Computer science; Markov chain; Throughput; Markov model; Continuous-time Markov chain; Markov process; State space; Mathematical optimization; Telecommunications; Wireless; Markov property; Machine learning; Statistics; Mathematics","score_opus":0.013842682965988024,"score_gpt":0.25645042635075427,"score_spread":0.24260774338476623,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2013094895","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.014381094,0.014365012,0.9699164,0.00055882224,0.00034297723,0.00021153815,0.000054467,0.000022938806,0.00014675914],"genre_scores_gemma":[0.9945433,0.0017197091,0.0029432683,0.00011599486,0.00044626874,0.000010564623,0.00016873087,0.000010734975,0.000041434098],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983387,0.00025685152,0.00066452223,0.00016612755,0.00028585817,0.0002879671],"domain_scores_gemma":[0.9968582,0.0009929334,0.00075723504,0.0002384938,0.0009430167,0.00021014328],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014995995,0.00017508405,0.00046069265,0.00022165567,0.00019040202,0.00046068002,0.0005527921,0.000109777226,0.000002596149],"category_scores_gemma":[0.00010272909,0.0001583308,0.00017557676,0.00031677372,0.00008765592,0.0006446705,0.00019848518,0.00024362227,2.6514985e-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.0003933516,0.00026631576,0.032845885,0.000011595595,0.0041620014,0.000010603713,0.00071848446,0.8851377,0.000025556315,0.034729164,0.002923616,0.038775746],"study_design_scores_gemma":[0.0009081294,0.00004842895,0.008689483,0.00014332008,0.0002347315,0.00018098242,0.00011674612,0.98860055,0.0000012233439,0.00021369013,0.0006959046,0.00016679935],"about_ca_topic_score_codex":0.000014288942,"about_ca_topic_score_gemma":0.000004971928,"teacher_disagreement_score":0.9801622,"about_ca_system_score_codex":0.000076926146,"about_ca_system_score_gemma":0.0000319642,"threshold_uncertainty_score":0.64565426},"labels":[],"label_agreement":null},{"id":"W2027354365","doi":"10.1504/ijcnds.2012.046363","title":"On the throughput performance of cluster-based cognitive radio networks","year":2012,"lang":"en","type":"article","venue":"International Journal of Communication Networks and Distributed Systems","topic":"Cognitive Radio Networks and Spectrum Sensing","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":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Cognitive radio; Throughput; Fusion center; Cluster analysis; Base station; Channel (broadcasting); Cluster (spacecraft); Computer network; Bandwidth (computing); Node (physics); Real-time computing; Wireless; Telecommunications; Artificial intelligence","score_opus":0.017280263601989233,"score_gpt":0.2546513063078612,"score_spread":0.23737104270587198,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2027354365","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.11945339,0.0056300536,0.87208563,0.0012034274,0.0009978873,0.0001583989,0.000010708738,0.000014282488,0.0004462144],"genre_scores_gemma":[0.99799705,0.0010019735,0.00025001625,0.00028439186,0.0004170151,0.00000458804,0.000030485515,0.000008444566,0.000006063068],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981366,0.00044501736,0.0006474963,0.00010429242,0.00044547688,0.00022114276],"domain_scores_gemma":[0.99584055,0.0019941968,0.00092329696,0.00033803505,0.0008051985,0.000098717224],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014433069,0.0001480027,0.0002648114,0.00009211614,0.00017671582,0.00019585852,0.0009346329,0.0000795611,0.0000056327485],"category_scores_gemma":[0.00011714534,0.00010306097,0.00011004705,0.0002461372,0.00013250225,0.00046202866,0.00015542963,0.0003890312,8.4297255e-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.00042272144,0.0003497132,0.013408507,0.000012240505,0.00046410065,0.000005588318,0.00039892056,0.8658215,0.000009405484,0.098160475,0.004230143,0.016716724],"study_design_scores_gemma":[0.00075430697,0.00014236727,0.009088536,0.000664584,0.000027152295,0.00014204309,0.00012696756,0.9877505,0.000023222214,0.00011272194,0.0010491356,0.000118468444],"about_ca_topic_score_codex":0.000012306833,"about_ca_topic_score_gemma":0.0000017578948,"teacher_disagreement_score":0.8785436,"about_ca_system_score_codex":0.00007516963,"about_ca_system_score_gemma":0.00004491472,"threshold_uncertainty_score":0.42027044},"labels":[],"label_agreement":null},{"id":"W2035607164","doi":"10.1504/ijcnds.2008.020258","title":"Low jitter guaranteed-rate communications for cluster computing systems","year":2008,"lang":"en","type":"article","venue":"International Journal of Communication Networks and Distributed Systems","topic":"Interconnection Networks and Systems","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":"McMaster University","funders":"","keywords":"Computer science; Jitter; Cluster (spacecraft); Computer network; Telecommunications; Real-time computing","score_opus":0.0254555375885376,"score_gpt":0.27185076865052865,"score_spread":0.24639523106199104,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2035607164","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.0068101627,0.006413532,0.9799402,0.0025037744,0.0035310574,0.00043561062,0.000042581054,0.00006156318,0.0002615531],"genre_scores_gemma":[0.995033,0.0016303831,0.0019573201,0.00040365386,0.0007273991,0.00003286461,0.00009733011,0.00001886181,0.00009914908],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99685585,0.00072662253,0.0014982605,0.00022494304,0.00041540593,0.00027893667],"domain_scores_gemma":[0.99392945,0.0012562741,0.0014721898,0.001073464,0.0021235703,0.00014506147],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021360759,0.00022578561,0.00048402394,0.0002164769,0.0005434991,0.0006811169,0.0030146674,0.00016216033,0.0000015039939],"category_scores_gemma":[0.00012423725,0.0001979987,0.00020605064,0.00024828027,0.00015754452,0.00067770114,0.00051504927,0.00037703195,0.000003307115],"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.00021591851,0.00037001295,0.0036687476,0.000070268936,0.0008638884,0.00002238158,0.0017995767,0.76075715,0.000082003055,0.17008266,0.059062712,0.0030046839],"study_design_scores_gemma":[0.0012278105,0.00009019601,0.0005577148,0.00050998066,0.00001777179,0.0015303508,0.00034628413,0.928074,0.0000047537947,0.00013726468,0.0672999,0.00020394812],"about_ca_topic_score_codex":0.000069078415,"about_ca_topic_score_gemma":0.000007826802,"teacher_disagreement_score":0.9882229,"about_ca_system_score_codex":0.00016379873,"about_ca_system_score_gemma":0.000086945205,"threshold_uncertainty_score":0.80741525},"labels":[],"label_agreement":null},{"id":"W2045527035","doi":"10.1504/ijcnds.2008.020710","title":"Periodically scheduled burst flows in optical burst switching networks","year":2008,"lang":"en","type":"article","venue":"International Journal of Communication Networks and Distributed Systems","topic":"Advanced Optical Network Technologies","field":"Engineering","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":"Dalhousie University","funders":"","keywords":"Computer science; Optical burst switching; Burst switching; Computer network; Telecommunications; Wavelength-division multiplexing; Optical performance monitoring; Optoelectronics; Transmission delay; Network packet; Physics","score_opus":0.011662536286257139,"score_gpt":0.23608358866246382,"score_spread":0.2244210523762067,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2045527035","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.2222941,0.011675222,0.7642797,0.0004624389,0.0007463441,0.0001338598,0.000009425531,0.00012197106,0.00027691128],"genre_scores_gemma":[0.9862619,0.008520813,0.0047889496,0.000026467349,0.00029988945,0.000012879207,0.000060963757,0.000024199639,0.0000039434913],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981737,0.00008309908,0.0009749969,0.00012640558,0.00036291202,0.00027888067],"domain_scores_gemma":[0.9985727,0.00038538896,0.00024055487,0.00032162367,0.0003453615,0.00013439005],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045711323,0.00019961147,0.00039988387,0.00016580538,0.00011569234,0.00013368273,0.0008439084,0.00023575821,0.0000062146987],"category_scores_gemma":[0.00017798353,0.00018511795,0.00008733205,0.00026375693,0.0001452713,0.00035105608,0.00016712715,0.00093395624,0.0000016242547],"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.00005316408,0.000045423367,0.0050406433,0.0000052720525,0.00009139429,0.0000677475,0.000036725367,0.98805594,0.00002372602,0.0036943099,0.00030338808,0.0025822849],"study_design_scores_gemma":[0.00081159815,0.000039566705,0.007975166,0.00034555414,0.000012888935,0.0004739219,0.0002375238,0.98645484,0.0000019216377,0.00023840564,0.0032178236,0.0001907609],"about_ca_topic_score_codex":0.000009559364,"about_ca_topic_score_gemma":0.00001226688,"teacher_disagreement_score":0.76396775,"about_ca_system_score_codex":0.0002046382,"about_ca_system_score_gemma":0.00002812666,"threshold_uncertainty_score":0.7548891},"labels":[],"label_agreement":null},{"id":"W2055505453","doi":"10.1504/ijcnds.2008.020257","title":"A low complexity selective mapping OFDM using multiple IFFT stages","year":2008,"lang":"en","type":"article","venue":"International Journal of Communication Networks and Distributed Systems","topic":"PAPR reduction in OFDM","field":"Engineering","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":"University of Victoria","funders":"","keywords":"Fast Fourier transform; Orthogonal frequency-division multiplexing; Computational complexity theory; Computer science; Reduction (mathematics); Decimation; Algorithm; Multiplicative function; Multiplexing; Mathematics; Telecommunications","score_opus":0.04595886525795274,"score_gpt":0.26573927129512087,"score_spread":0.21978040603716814,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2055505453","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.44042128,0.004469508,0.5532501,0.0001125006,0.0012242651,0.00012851485,0.00007594126,0.00006709458,0.00025085857],"genre_scores_gemma":[0.9970579,0.0014700079,0.0010150286,0.000012455854,0.00034341612,0.0000043153473,0.000070702576,0.000015639767,0.000010540932],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99874467,0.00012914329,0.0006123296,0.000076330674,0.00029956727,0.00013798963],"domain_scores_gemma":[0.9984951,0.00018571646,0.0003575721,0.00019111526,0.0006806046,0.00008989101],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029106694,0.00012763822,0.00023907497,0.00014034304,0.00016085147,0.000086849395,0.0004097332,0.00008245629,0.0000073188303],"category_scores_gemma":[0.00007086604,0.00012793657,0.00007110841,0.00016693625,0.00012201041,0.00030823282,0.00006554466,0.00034002392,0.0000011045948],"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.000029071985,0.000046279314,0.011106914,0.000014591344,0.00023965792,0.000011510726,0.00028284476,0.98433936,0.00051727035,0.0003376507,0.0026520116,0.00042281632],"study_design_scores_gemma":[0.0008480792,0.000020029127,0.014712622,0.00031554382,0.000016206219,0.0013182223,0.00053342537,0.97696805,0.00011387514,0.000110746885,0.004866001,0.00017720705],"about_ca_topic_score_codex":0.000055325738,"about_ca_topic_score_gemma":0.0000056399367,"teacher_disagreement_score":0.55663663,"about_ca_system_score_codex":0.00024765581,"about_ca_system_score_gemma":0.000035276928,"threshold_uncertainty_score":0.5217102},"labels":[],"label_agreement":null},{"id":"W2094502762","doi":"10.1504/ijcnds.2008.020259","title":"Non-linear test pattern generators for built-in self-test","year":2008,"lang":"en","type":"article","venue":"International Journal of Communication Networks and Distributed Systems","topic":"VLSI and Analog Circuit Testing","field":"Computer Science","cited_by":1,"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 Victoria","funders":"University of Victoria","keywords":"Computer science; Generator (circuit theory); Fault coverage; Benchmark (surveying); Overhead (engineering); Fault (geology); Digital pattern generator; Fault detection and isolation; Automatic test pattern generation; Finite-state machine; Stuck-at fault; Fault Simulator; Computer engineering; Embedded system; Electronic circuit; Algorithm; Power (physics); Engineering; Electrical engineering; Artificial intelligence","score_opus":0.023226783189310884,"score_gpt":0.26657274868709574,"score_spread":0.24334596549778487,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2094502762","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.054959863,0.0016793001,0.9419031,0.00072389806,0.00048592928,0.00013283423,0.000025548132,0.000028571096,0.000060966548],"genre_scores_gemma":[0.99761856,0.00071325863,0.001135024,0.00009554986,0.0003659894,0.000011235416,0.00004617257,0.000007757023,0.0000064549668],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986998,0.00005928122,0.00068272685,0.00012812059,0.00027012653,0.00015994816],"domain_scores_gemma":[0.9975331,0.00080355885,0.000555749,0.0002945765,0.0007215013,0.00009153333],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060994073,0.00011348881,0.00021965001,0.00012373213,0.00014620883,0.00015381952,0.0012210805,0.00006876603,7.8467326e-7],"category_scores_gemma":[0.00020704017,0.0001031513,0.00007496899,0.00018510394,0.000032885117,0.0003797942,0.00013953749,0.00020201136,9.272478e-7],"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.000004327418,0.00073450024,0.7989643,0.000031380438,0.00017599444,0.00012824692,0.0007137816,0.15928194,0.00021449669,0.0016768227,0.006091882,0.03198231],"study_design_scores_gemma":[0.0009599365,0.000090974696,0.021283997,0.00021694019,0.000007619441,0.0005927685,0.00005509334,0.97409487,0.000029504667,0.00010473789,0.0024297377,0.00013380789],"about_ca_topic_score_codex":0.000051848623,"about_ca_topic_score_gemma":0.000013678432,"teacher_disagreement_score":0.9426587,"about_ca_system_score_codex":0.00008564875,"about_ca_system_score_gemma":0.00008392929,"threshold_uncertainty_score":0.4206388},"labels":[],"label_agreement":null},{"id":"W2095529275","doi":"10.1504/ijcnds.2008.017201","title":"Profiling distributed connection chains","year":2008,"lang":"en","type":"article","venue":"International Journal of Communication Networks and Distributed Systems","topic":"Network Security and Intrusion Detection","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":"University of Victoria","funders":"","keywords":"Computer science; Hacker; Network forensics; Profiling (computer programming); Key (lock); Connection (principal bundle); Computer security; Distributed computing; Computer network; Digital forensics; Operating system","score_opus":0.020387473237137757,"score_gpt":0.2513896032557611,"score_spread":0.23100213001862335,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2095529275","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.047819503,0.0032614102,0.945837,0.0010226921,0.001713252,0.00011860196,0.000022489765,0.000057639765,0.00014736787],"genre_scores_gemma":[0.99478674,0.0036540192,0.0009295024,0.000075451346,0.00040668782,0.0000071705344,0.00011744469,0.000006240552,0.000016766906],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99829227,0.0002581013,0.0007112971,0.0001441851,0.00043914927,0.00015498202],"domain_scores_gemma":[0.99747956,0.00021674162,0.00076480774,0.00034971163,0.0010713022,0.00011787187],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068220054,0.0001272093,0.00022835992,0.0001429262,0.00030902633,0.000238526,0.0010117013,0.00011114556,0.0000049958576],"category_scores_gemma":[0.00011014845,0.00011526013,0.00009173679,0.00030647448,0.00008362366,0.0007798167,0.00022061952,0.00034976058,0.0000020488014],"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.0003709266,0.00055079325,0.014745052,0.000024797007,0.0006703445,0.00015372307,0.0007921723,0.64734685,0.00043810118,0.30115026,0.01788995,0.01586704],"study_design_scores_gemma":[0.00095480535,0.00013137494,0.004151122,0.00016755637,0.000013207465,0.002231584,0.00016031133,0.966026,0.00009693402,0.0006547019,0.025222387,0.00019001456],"about_ca_topic_score_codex":0.0000330438,"about_ca_topic_score_gemma":0.0000045393267,"teacher_disagreement_score":0.94696724,"about_ca_system_score_codex":0.000115301154,"about_ca_system_score_gemma":0.000061363775,"threshold_uncertainty_score":0.4700172},"labels":[],"label_agreement":null},{"id":"W2107796859","doi":"10.1504/ijcnds.2009.026558","title":"Cognitive networking of large scale wireless systems","year":2009,"lang":"en","type":"article","venue":"International Journal of Communication Networks and Distributed Systems","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":26,"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 Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Computer network; Wireless WAN; Cognitive radio; Wireless network; Municipal wireless network; Wi-Fi array; Wireless mesh network; Wireless broadband; Wireless; Key distribution in wireless sensor networks; Radio resource management; Cognitive network; Quality of service; Multi-frequency network; Distributed computing; Telecommunications","score_opus":0.017067676532595753,"score_gpt":0.2775984651340733,"score_spread":0.26053078860147755,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2107796859","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.011297555,0.013283667,0.97249943,0.0004774946,0.0015784026,0.00014272536,0.000041393778,0.000025126068,0.00065421016],"genre_scores_gemma":[0.99603415,0.0029516155,0.00028570276,0.00010901112,0.00049836485,0.0000032442854,0.00008997833,0.000006483323,0.00002143906],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977131,0.00029932908,0.0010664538,0.00015280614,0.00054755167,0.00022079905],"domain_scores_gemma":[0.9962781,0.00042109593,0.0013819818,0.00035519485,0.0014120893,0.00015151888],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012053811,0.00015712208,0.00042276763,0.00012669164,0.00012618644,0.00033743464,0.0012384123,0.0001275436,0.000001946735],"category_scores_gemma":[0.000011874797,0.0001390385,0.00010766112,0.00024899165,0.00006750022,0.00046427324,0.00017930723,0.0003061628,7.122507e-7],"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.0011077852,0.0021207312,0.018806329,0.00010410245,0.0019202463,0.0003189824,0.003804843,0.30509624,0.00011075035,0.33154416,0.026124572,0.30894127],"study_design_scores_gemma":[0.0009922271,0.00011650999,0.0012323036,0.0010066206,0.00003207159,0.00034626244,0.0006553287,0.9914076,0.0000025865736,0.00036146006,0.0037025793,0.00014448108],"about_ca_topic_score_codex":0.000021586935,"about_ca_topic_score_gemma":0.0000026958205,"teacher_disagreement_score":0.9847366,"about_ca_system_score_codex":0.000057458426,"about_ca_system_score_gemma":0.00007607086,"threshold_uncertainty_score":0.56698257},"labels":[],"label_agreement":null},{"id":"W2120152839","doi":"10.1504/ijcnds.2009.026876","title":"An algorithm based mesh check-sum fault tolerant scheme for stream ciphers","year":2009,"lang":"en","type":"article","venue":"International Journal of Communication Networks and Distributed Systems","topic":"Cryptographic Implementations and Security","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":"University of Regina","funders":"","keywords":"Computer science; Checksum; Algorithm; RC4; Stream cipher; Scheme (mathematics); Overhead (engineering); Error detection and correction; Parallel computing; Cryptography; Mathematics","score_opus":0.016780186940940137,"score_gpt":0.30889722808543923,"score_spread":0.2921170411444991,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2120152839","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.007692347,0.0010081606,0.9883049,0.0021821659,0.0004473801,0.00019425582,0.0000968888,0.000028239312,0.000045648907],"genre_scores_gemma":[0.9645024,0.00019826675,0.034543846,0.00024109145,0.00017453924,0.000011460865,0.00032112756,0.0000046609653,0.0000026159726],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998516,0.0001427355,0.00066365354,0.0001422723,0.00037336396,0.00016192243],"domain_scores_gemma":[0.9976463,0.00016850464,0.0005722626,0.00040758128,0.0010714085,0.00013399583],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007927031,0.00012456081,0.00021031914,0.00013555503,0.00017761036,0.0005433194,0.0012288196,0.00007022553,0.0000048742218],"category_scores_gemma":[0.000026739224,0.00011188669,0.000113159454,0.00019859665,0.000037382284,0.0006163425,0.000046712048,0.00016742095,1.9178802e-7],"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.0003475264,0.001974187,0.004028518,0.000026135685,0.00072306825,0.00003127671,0.0012770176,0.2506145,0.000482543,0.37736285,0.020776063,0.34235632],"study_design_scores_gemma":[0.0013051574,0.00022247511,0.0022914521,0.000078697914,0.00001369155,0.00004917017,0.00037989614,0.98406816,0.000017075386,0.0011921211,0.010255248,0.0001268445],"about_ca_topic_score_codex":0.000034549204,"about_ca_topic_score_gemma":0.000008939933,"teacher_disagreement_score":0.95681006,"about_ca_system_score_codex":0.000063766056,"about_ca_system_score_gemma":0.00007601222,"threshold_uncertainty_score":0.5239241},"labels":[],"label_agreement":null},{"id":"W2120897117","doi":"10.1504/ijcnds.2009.022330","title":"Performance analysis of the cdma2000 reverse packet data channel","year":2009,"lang":"en","type":"article","venue":"International Journal of Communication Networks and Distributed Systems","topic":"Advanced Wireless Communication Techniques","field":"Engineering","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":"Concordia University","funders":"","keywords":"Computer science; Computer network; CDMA2000; Network packet; Channel (broadcasting); Code division multiple access","score_opus":0.019581837579353428,"score_gpt":0.2652981014556622,"score_spread":0.24571626387630877,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2120897117","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.26519153,0.027399544,0.70000386,0.002566362,0.0011306155,0.00046412172,0.0008024554,0.0001851548,0.0022563802],"genre_scores_gemma":[0.99029046,0.009119511,0.00027044353,0.000032827702,0.00004670846,0.0000020618306,0.00022354671,0.0000060600123,0.000008348538],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99877155,0.00013277328,0.00062635477,0.00006252544,0.00032725028,0.000079550475],"domain_scores_gemma":[0.99769896,0.0001166874,0.0005059326,0.001078617,0.00056119397,0.000038578506],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006883691,0.00009117679,0.00024384704,0.00014674885,0.0000605409,0.000045793444,0.001969109,0.000060766644,0.0000037687964],"category_scores_gemma":[0.00005285475,0.0000708791,0.00007230514,0.00042866185,0.00005960524,0.00034991314,0.0001820764,0.00024020478,1.7192338e-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.000015115833,0.00003097987,0.0014181554,0.0000041369613,0.0004672637,2.8700538e-7,0.00005914074,0.98812306,0.000049496663,0.0005986297,0.002338464,0.006895255],"study_design_scores_gemma":[0.0002052531,0.00001379391,0.018563036,0.00018708862,0.000184952,0.000018404207,0.00010709754,0.9745967,0.00004662783,0.00008754554,0.005914458,0.000075081654],"about_ca_topic_score_codex":0.000012198242,"about_ca_topic_score_gemma":0.000007783724,"teacher_disagreement_score":0.72509897,"about_ca_system_score_codex":0.00007191074,"about_ca_system_score_gemma":0.000017708811,"threshold_uncertainty_score":0.36591274},"labels":[],"label_agreement":null},{"id":"W2123965327","doi":"10.1504/ijcnds.2010.035558","title":"Bluehoc-based simulation study of user data throughput in Bluetooth-enabled devices","year":2010,"lang":"en","type":"article","venue":"International Journal of Communication Networks and Distributed Systems","topic":"Bluetooth and Wireless Communication Technologies","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":"Toronto Metropolitan University","funders":"","keywords":"Bluetooth; Timeout; Computer science; Piconet; Transfer (computing); Throughput; Computer network; ISM band; Key (lock); Real-time computing; Wireless; Telecommunications; Operating system","score_opus":0.03389787088143866,"score_gpt":0.3135846625864153,"score_spread":0.2796867917049767,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2123965327","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.5057353,0.0015981373,0.49046203,0.0011638318,0.0005863982,0.00029025326,0.000027114384,0.00005224094,0.00008472162],"genre_scores_gemma":[0.9970789,0.00022762977,0.0025027085,0.000038913073,0.00005104885,0.000008479051,0.00008268165,0.0000070340857,0.00000262191],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978335,0.00031885869,0.001063005,0.0001863202,0.00046453436,0.00013378495],"domain_scores_gemma":[0.9950951,0.00083669205,0.0012369833,0.0018452241,0.0009305162,0.00005551511],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014380699,0.00013362391,0.0003171633,0.00028065738,0.00008895231,0.0002960202,0.0052833,0.00013224575,0.000002413017],"category_scores_gemma":[0.00028377792,0.00011637849,0.000038584847,0.00042381417,0.000091560105,0.0011153183,0.00093505473,0.00053452794,4.5685132e-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.00011941202,0.0011391349,0.08795853,0.000016095457,0.000157393,0.00000833142,0.00039658323,0.88799167,0.00010828357,0.012313512,0.00048720167,0.009303833],"study_design_scores_gemma":[0.0014722175,0.00011691551,0.040203344,0.00013519703,0.000014061564,0.000014534076,0.0007583813,0.953107,0.000014613125,0.0002301822,0.0038144584,0.000119094155],"about_ca_topic_score_codex":0.00020515473,"about_ca_topic_score_gemma":0.00034355934,"teacher_disagreement_score":0.49134362,"about_ca_system_score_codex":0.00003611407,"about_ca_system_score_gemma":0.00009646719,"threshold_uncertainty_score":0.98177737},"labels":[],"label_agreement":null},{"id":"W2160476942","doi":"10.1504/ijcnds.2008.020261","title":"Adaptive collaborative filtering based on user-genre-item relation","year":2008,"lang":"en","type":"article","venue":"International Journal of Communication Networks and Distributed Systems","topic":"Recommender Systems and Techniques","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":"University of Victoria","funders":"","keywords":"Collaborative filtering; MovieLens; Computer science; Similarity (geometry); Relevance (law); Relation (database); Information retrieval; Recommender system; Preference; Component (thermodynamics); Artificial intelligence; Data mining","score_opus":0.023514633020811124,"score_gpt":0.2588317593858651,"score_spread":0.23531712636505397,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2160476942","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.00453033,0.0013674303,0.99122256,0.0009838607,0.00069249095,0.00016976692,0.000023215347,0.00005149353,0.0009588504],"genre_scores_gemma":[0.9936029,0.00056793174,0.0054901317,0.000103290855,0.00014484033,0.000015502887,0.00003952835,0.000007764095,0.000028109112],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982545,0.00036723458,0.0006717502,0.0001404815,0.0004480058,0.00011805379],"domain_scores_gemma":[0.997152,0.00045902646,0.00087232783,0.00039517938,0.001031747,0.00008972775],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000643096,0.00013553181,0.00024232244,0.00017589616,0.00018848816,0.00022825562,0.00097284996,0.00009238151,0.0000023189343],"category_scores_gemma":[0.00006564094,0.00011632721,0.000073121475,0.00025237066,0.00004623904,0.00060200883,0.00013082792,0.0002568415,0.0000011860851],"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.00052969507,0.00060389243,0.025459606,0.00002367368,0.00069232995,0.00020411832,0.0017610458,0.7237355,0.00017554939,0.1942981,0.03869221,0.013824271],"study_design_scores_gemma":[0.0008521079,0.0002682214,0.012366208,0.00047414418,0.0000082645465,0.0003111762,0.00019836414,0.9666121,0.00006755298,0.0002527472,0.018403683,0.00018543004],"about_ca_topic_score_codex":0.00003610779,"about_ca_topic_score_gemma":0.0000030162266,"teacher_disagreement_score":0.98907256,"about_ca_system_score_codex":0.00014549069,"about_ca_system_score_gemma":0.00008262497,"threshold_uncertainty_score":0.4743686},"labels":[],"label_agreement":null},{"id":"W2294971926","doi":"10.1504/ijcnds.2015.072398","title":"On social networking in intermittently connected networks","year":2015,"lang":"en","type":"article","venue":"International Journal of Communication Networks and Distributed Systems","topic":"Opportunistic and Delay-Tolerant Networks","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":"University of Victoria","funders":"","keywords":"Computer science; Computer network; Overhead (engineering); Routing (electronic design automation); Delay-tolerant networking; Task (project management); Routing protocol; Wireless Routing Protocol","score_opus":0.04511118189151455,"score_gpt":0.2877352204639491,"score_spread":0.24262403857243456,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2294971926","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.008416932,0.003850987,0.9823189,0.0013538229,0.0029350584,0.00013195393,0.0000076188785,0.000037305934,0.0009474585],"genre_scores_gemma":[0.9978775,0.0006252112,0.00025905855,0.0003099718,0.0008046384,0.0000072527405,0.0000851617,0.000011387088,0.000019851888],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975449,0.0004522626,0.0010096546,0.00018979587,0.0005387535,0.00026466683],"domain_scores_gemma":[0.9972008,0.0005151335,0.00089205225,0.00034225374,0.00084230345,0.00020747278],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014776334,0.00018875957,0.00038811067,0.00019708677,0.00010700069,0.0005017907,0.0015332057,0.00017138298,0.0000026267926],"category_scores_gemma":[0.00003750145,0.00017040476,0.00009326086,0.00034358597,0.00008212752,0.0004445901,0.000330765,0.00058450416,0.00000155952],"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.0005364827,0.00034885327,0.006499862,0.000005842054,0.0002805814,0.00026819183,0.0006414641,0.75367886,0.0000013191997,0.09783289,0.049412023,0.090493664],"study_design_scores_gemma":[0.0015301727,0.00009138305,0.0013021247,0.00029847224,0.000010746065,0.00023854866,0.00023641293,0.98766726,1.571666e-7,0.0016354707,0.0068200976,0.00016914037],"about_ca_topic_score_codex":0.000037035767,"about_ca_topic_score_gemma":0.000010652304,"teacher_disagreement_score":0.9894605,"about_ca_system_score_codex":0.00018881715,"about_ca_system_score_gemma":0.00010145405,"threshold_uncertainty_score":0.69489044},"labels":[],"label_agreement":null},{"id":"W2405271895","doi":"10.1504/ijcnds.2016.076655","title":"Multi-objective resource allocation in interference-limited M2M communication networks","year":2016,"lang":"en","type":"article","venue":"International Journal of Communication Networks and Distributed Systems","topic":"IoT Networks and Protocols","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Throughput; Resource allocation; Interference (communication); Controller (irrigation); Convergence (economics); Computer network; Distributed computing; Cluster (spacecraft); Mathematical optimization; Wireless; Channel (broadcasting); Telecommunications","score_opus":0.018392622665290823,"score_gpt":0.2611754266784094,"score_spread":0.24278280401311855,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2405271895","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.014942399,0.01064707,0.9708255,0.0009580232,0.0007156315,0.0011565269,0.000041896652,0.00008985055,0.00062312454],"genre_scores_gemma":[0.99397737,0.00494471,0.00042941776,0.00004187643,0.00023166242,0.00016569419,0.00015252845,0.000026147836,0.00003062097],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979106,0.00044328184,0.0010362039,0.00013195856,0.00025450005,0.00022342878],"domain_scores_gemma":[0.99768645,0.0006097204,0.00051822717,0.00047389878,0.00060647214,0.000105238236],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010899153,0.00020249022,0.00032872416,0.00021129752,0.00008478883,0.0001903873,0.0009261207,0.00020557517,0.000013550151],"category_scores_gemma":[0.00009288349,0.0001590253,0.00007977704,0.00025852266,0.00010036415,0.00045496188,0.00014843702,0.00045980208,0.0000022382503],"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.00021948527,0.00009912087,0.0069222925,0.000012217641,0.00021376411,0.0000058254313,0.00025729512,0.96318394,0.00013558114,0.0014965633,0.0047718524,0.022682074],"study_design_scores_gemma":[0.0023740556,0.00007010755,0.015653223,0.0020361096,0.000022931901,0.00009394015,0.00039942664,0.96088636,0.000025150413,0.00020524624,0.017955903,0.0002775359],"about_ca_topic_score_codex":0.000047348854,"about_ca_topic_score_gemma":0.00007878342,"teacher_disagreement_score":0.97903496,"about_ca_system_score_codex":0.00030382472,"about_ca_system_score_gemma":0.000027042974,"threshold_uncertainty_score":0.6484863},"labels":[],"label_agreement":null},{"id":"W2505795549","doi":"10.1504/ijcnds.2016.077939","title":"Comparative performance analysis of TCP-based congestion control algorithms","year":2016,"lang":"en","type":"article","venue":"International Journal of Communication Networks and Distributed Systems","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":4,"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":"Canadian Centre for Applied Research in Cancer Control","keywords":"Computer science; TCP Friendly Rate Control; TCP global synchronization; TCP Westwood plus; TCP tuning; TCP acceleration; CUBIC TCP; H-TCP; Zeta-TCP; Computer network; Algorithm; Network congestion; Goodput; Throughput; Network packet; Wireless; Telecommunications","score_opus":0.014760107641194021,"score_gpt":0.25890281349794253,"score_spread":0.24414270585674852,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2505795549","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.030846287,0.002205701,0.96464276,0.0016002302,0.00046457277,0.00010403726,0.000051342442,0.000020639518,0.000064409316],"genre_scores_gemma":[0.9986036,0.00055143255,0.0006273661,0.00006520284,0.00009501438,0.000008875928,0.00003105556,0.0000033632473,0.000014101101],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981942,0.00031906547,0.0007999344,0.00012908268,0.0004330326,0.00012467353],"domain_scores_gemma":[0.9959182,0.0008677379,0.0011435513,0.00035710927,0.001618373,0.00009499814],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008348249,0.000121784185,0.00045939922,0.00026941256,0.00007127188,0.00011605811,0.0010288776,0.00007302225,0.0000072249154],"category_scores_gemma":[0.000043153654,0.00008417953,0.00014146262,0.00041464932,0.0001162914,0.00043428142,0.000060368242,0.0001266338,9.1067955e-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.00018918868,0.00011721546,0.013903877,0.0000038207045,0.0017771743,0.0000034368727,0.00007328177,0.9088197,0.0000645453,0.014678485,0.00058415293,0.059785157],"study_design_scores_gemma":[0.0017149625,0.00009879508,0.02496701,0.00019752042,0.00019233904,0.000017954373,0.00003207088,0.97099245,0.000014224218,0.000036887963,0.0016391001,0.000096666736],"about_ca_topic_score_codex":0.0000115309795,"about_ca_topic_score_gemma":0.0000054425186,"teacher_disagreement_score":0.9677573,"about_ca_system_score_codex":0.00007374523,"about_ca_system_score_gemma":0.0000774366,"threshold_uncertainty_score":0.34327418},"labels":[],"label_agreement":null},{"id":"W4396552233","doi":"10.1504/ijcnds.2024.138217","title":"An objective comparison of two prominent virtual actor frameworks: Proto.Actor and Orleans","year":2024,"lang":"en","type":"article","venue":"International Journal of Communication Networks and Distributed Systems","topic":"Digital Games and Media","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":"Sheridan College","funders":"","keywords":"Computer science; Human–computer interaction; Virtual actor; Data science; Cognitive science; Virtual reality","score_opus":0.020829924085007934,"score_gpt":0.36818885924050215,"score_spread":0.3473589351554942,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396552233","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.8106798,0.026246998,0.148456,0.0034285025,0.004176306,0.0013838423,0.00037362977,0.00008960757,0.0051653273],"genre_scores_gemma":[0.9981831,0.001037154,0.00010123961,0.000018211318,0.00047433513,0.000014373252,0.00006365479,0.000007823287,0.000100153215],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985471,0.00024653002,0.0005449368,0.00010085364,0.0004439749,0.000116646326],"domain_scores_gemma":[0.99826795,0.00041227395,0.0004053157,0.00013756963,0.00062231725,0.00015456158],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007561498,0.000093351344,0.00024244322,0.000088437206,0.00006816723,0.00048592704,0.00042326507,0.000121335666,0.00001042639],"category_scores_gemma":[0.00016024485,0.00007622658,0.000058756796,0.00013686575,0.00022805105,0.0005403364,0.000062510095,0.00037547175,4.497137e-7],"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.0007943819,0.0012183044,0.07078183,0.00013307336,0.0016600068,0.00003644376,0.06412831,0.032106098,0.00051471643,0.48760456,0.0069467756,0.3340755],"study_design_scores_gemma":[0.002766171,0.001534508,0.016152684,0.006090258,0.00025268758,0.00012970687,0.08623522,0.29806188,0.00012704241,0.003009161,0.5848935,0.0007471603],"about_ca_topic_score_codex":0.00013719204,"about_ca_topic_score_gemma":0.00012535742,"teacher_disagreement_score":0.5779467,"about_ca_system_score_codex":0.00009891186,"about_ca_system_score_gemma":0.00013650348,"threshold_uncertainty_score":0.46858057},"labels":[],"label_agreement":null}]}