{"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":"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.12833847,0.0014089238,0.8626674,0.00029278517,0.00027488105,0.00034672546,0.00012177328,0.001536439,0.0050127087],"genre_scores_gemma":[0.8663014,0.00047265503,0.12868106,0.000102409576,0.000084657804,0.000104736326,0.0002406404,0.00003879718,0.003973631],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99960154,0.0000726824,0.0000345837,0.000046539986,0.00015650262,0.00008827089],"domain_scores_gemma":[0.99963236,0.00005000361,0.000054676108,0.00010170671,0.00009504704,0.000066064975],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005613827,0.00030442924,0.00033899804,0.0006070611,0.0007458033,0.000616479,0.00095192774,0.0007122712,0.0005749355],"category_scores_gemma":[0.00092429575,0.00014995561,0.00030855008,0.00039038906,0.0003738122,0.001023765,0.0013737581,0.0006378687,0.00032725593],"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.0007470217,0.0002162708,0.0029175517,0.00033838558,0.00024587923,0.0012769831,0.00093152246,0.05915798,0.2483418,0.043698404,0.006485946,0.6356423],"study_design_scores_gemma":[0.00027091007,0.00258137,0.007621912,0.000071869435,0.0003655952,0.003261403,0.0007149022,0.7393039,0.12285827,0.026863987,0.09578403,0.00030187776],"about_ca_topic_score_codex":0.0014294384,"about_ca_topic_score_gemma":0.0015402641,"teacher_disagreement_score":0.0014294384,"about_ca_system_score_codex":0.0004837824,"about_ca_system_score_gemma":0.0003347145,"threshold_uncertainty_score":0.0035101175},"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":"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.2487226,0.00085420604,0.74371475,0.00043678656,0.000034479635,0.00017862202,0.000034418,0.00037474092,0.005649388],"genre_scores_gemma":[0.94201547,0.00015951885,0.056419484,0.000049960443,0.00000982182,0.00011691392,0.000016753045,0.000015616064,0.0011965615],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995963,0.00017029782,0.000015830636,0.000048356487,0.00009250062,0.00007671833],"domain_scores_gemma":[0.99911636,0.0005239597,0.00016531214,0.00007261152,0.00007947649,0.00004231722],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00085470424,0.0006896017,0.0005421974,0.00048765997,0.00047614242,0.0005420966,0.0011481182,0.0007057989,0.0010975647],"category_scores_gemma":[0.002351428,0.0003715804,0.00027325234,0.00029106103,0.0008863718,0.0009808415,0.0007469769,0.00040133848,0.0001535971],"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.00023502654,0.00017320963,0.0012409798,0.00007604623,0.000030161962,0.00025970864,0.00027452895,0.8809505,0.018517658,0.03228353,0.00095253444,0.065006085],"study_design_scores_gemma":[0.000065390035,0.00024762508,0.00051952846,0.000010627438,0.000025522993,0.00013076879,0.000106295825,0.98339754,0.004112869,0.010373051,0.0009830293,0.000027841887],"about_ca_topic_score_codex":0.0028290004,"about_ca_topic_score_gemma":0.0027012085,"teacher_disagreement_score":0.0028290004,"about_ca_system_score_codex":0.0005144932,"about_ca_system_score_gemma":0.0007865112,"threshold_uncertainty_score":0.005625069},"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":"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.108398125,0.00088542106,0.8794739,0.00026829125,0.00027584532,0.00017997695,0.00017870907,0.00089961285,0.009440052],"genre_scores_gemma":[0.72285116,0.00052801357,0.26721016,0.00015579624,0.000113730726,0.00015254512,0.00019121169,0.00005207513,0.008745368],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99957365,0.00008889509,0.0000425398,0.00005017732,0.00018689189,0.000057943354],"domain_scores_gemma":[0.999358,0.00017520817,0.000090985275,0.00018375763,0.00015088859,0.00004112852],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003622501,0.00039883857,0.0004315406,0.0007253799,0.0005297551,0.00059595297,0.0006352097,0.0004362321,0.0029821086],"category_scores_gemma":[0.001394168,0.00014052996,0.00033797507,0.0006497161,0.00048931554,0.0013223366,0.0009399233,0.0005007739,0.0006469872],"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.0018673881,0.00012626544,0.0011007214,0.00044279845,0.00006554583,0.0006766186,0.00035214334,0.048934497,0.2952581,0.1940363,0.005671894,0.45146757],"study_design_scores_gemma":[0.00027194805,0.0012617424,0.00096998987,0.00010836525,0.000100356236,0.0016021037,0.00010234359,0.5751275,0.3098155,0.06699885,0.04351523,0.00012610285],"about_ca_topic_score_codex":0.0004446834,"about_ca_topic_score_gemma":0.0005233794,"teacher_disagreement_score":0.0029821086,"about_ca_system_score_codex":0.0005758988,"about_ca_system_score_gemma":0.0005875276,"threshold_uncertainty_score":0.009976149},"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":"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.004989666,0.00062730385,0.99076337,0.00020501758,0.000054062217,0.00003613285,0.00015901381,0.00013360062,0.0030319057],"genre_scores_gemma":[0.7932377,0.0050104735,0.1879439,0.00025252346,0.000305812,0.00064222224,0.00097238953,0.00010967418,0.011525457],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99933285,0.00019364829,0.000033335637,0.0001291161,0.00020946162,0.0001015953],"domain_scores_gemma":[0.99803096,0.0013862516,0.00018325582,0.00008793683,0.0002646376,0.000046995592],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010781828,0.000978922,0.00085929595,0.0009275528,0.0005376104,0.0013015827,0.0012229641,0.0011458615,0.0030560873],"category_scores_gemma":[0.003910471,0.00047695896,0.0010206647,0.0013288517,0.00085150107,0.0015493968,0.00058531365,0.0018211899,0.00069222995],"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.000028536575,0.000039513234,0.00066203874,0.00009093848,0.000032468375,0.00018060321,0.00008341229,0.86740535,0.001267926,0.11865639,0.00108818,0.010464616],"study_design_scores_gemma":[0.0000034186567,0.0000099579665,0.000101909885,0.000009235269,0.0000073358037,0.000028944962,0.000007537521,0.982196,0.00014155386,0.016872656,0.0006134434,0.0000080095815],"about_ca_topic_score_codex":0.015754284,"about_ca_topic_score_gemma":0.008102597,"teacher_disagreement_score":0.015754284,"about_ca_system_score_codex":0.0017202843,"about_ca_system_score_gemma":0.0020972097,"threshold_uncertainty_score":0.03132516},"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":"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.6475914,0.006330959,0.32396844,0.0011738167,0.00019213039,0.000064992935,0.0002762193,0.0009844336,0.01941759],"genre_scores_gemma":[0.9955871,0.0006534014,0.0031193572,0.000036313722,0.000032558397,0.000016387416,0.000037544633,0.00003268608,0.00048465442],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986387,0.0005095218,0.000033882414,0.00015694226,0.0004168445,0.00024402178],"domain_scores_gemma":[0.98731333,0.010331783,0.00063242536,0.00054924743,0.0010547029,0.00011860453],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002590155,0.00070105045,0.0006809917,0.0008776263,0.00064901187,0.0011270344,0.0007624007,0.00083005935,0.0008795731],"category_scores_gemma":[0.014169955,0.00030270085,0.00023818875,0.0010716098,0.0009826542,0.001278282,0.0008289677,0.0005619764,0.00027452954],"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.0006150391,0.000060837065,0.0020648376,0.00013491669,0.00007254738,0.0001795082,0.00019933993,0.94354,0.009491705,0.017100213,0.0009272507,0.025613924],"study_design_scores_gemma":[0.000013168588,0.00014869326,0.0012382903,0.000022754497,0.000040978528,0.00011523529,0.00006599457,0.98201764,0.005935302,0.009965027,0.00041732975,0.000019456975],"about_ca_topic_score_codex":0.0025837547,"about_ca_topic_score_gemma":0.0012179067,"teacher_disagreement_score":0.002590155,"about_ca_system_score_codex":0.0014078867,"about_ca_system_score_gemma":0.0006128025,"threshold_uncertainty_score":0.013698161},"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":"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.0088546835,0.0054499237,0.9658974,0.001161911,0.0006546891,0.00013011556,0.000099788194,0.0026316375,0.015119833],"genre_scores_gemma":[0.52186996,0.0068349247,0.44541815,0.00052152557,0.0011030209,0.0005084152,0.0004986332,0.000734935,0.022510363],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991844,0.0002445161,0.000037180656,0.000071876086,0.00039339252,0.00006854762],"domain_scores_gemma":[0.9987552,0.0005286997,0.0000935224,0.00026768504,0.00028995037,0.00006489918],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009058405,0.0006420886,0.00048319757,0.00056952535,0.0010373208,0.0019786356,0.0010903002,0.00086407247,0.004574485],"category_scores_gemma":[0.004615308,0.0002548414,0.00022205932,0.0010911407,0.0006124761,0.0011509313,0.00093996094,0.0013352055,0.0016702716],"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.00031391083,0.000058316426,0.00059805263,0.00049493526,0.000034590375,0.0002590177,0.00024746242,0.18480867,0.0141061125,0.49394065,0.037343413,0.2677949],"study_design_scores_gemma":[0.00004775916,0.00008884216,0.00024881776,0.0000823134,0.000022719907,0.00017577533,0.000043213025,0.80842286,0.0068771555,0.109327376,0.07462369,0.000039518814],"about_ca_topic_score_codex":0.0017633598,"about_ca_topic_score_gemma":0.0022408757,"teacher_disagreement_score":0.004574485,"about_ca_system_score_codex":0.0013837947,"about_ca_system_score_gemma":0.0015257413,"threshold_uncertainty_score":0.015303135},"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":"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.16643563,0.0041917437,0.8212001,0.00076517975,0.0006707212,0.00014729546,0.000091180365,0.00063518505,0.0058631087],"genre_scores_gemma":[0.8212994,0.0026313402,0.17088144,0.00023705729,0.00054501,0.00013023568,0.00012360713,0.000058874328,0.004092982],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99970704,0.00011242794,0.000014827747,0.000027910417,0.0001123002,0.000025585621],"domain_scores_gemma":[0.99955076,0.00024017747,0.000071016235,0.000051403065,0.00006345464,0.000023066152],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007448821,0.00030181214,0.00025075657,0.00035708706,0.00044157717,0.0005543433,0.00038111766,0.00047828676,0.00057532685],"category_scores_gemma":[0.0014977333,0.00021531557,0.00015570864,0.00037371193,0.0004016108,0.00069389964,0.00030526947,0.0005958357,0.000108143366],"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.00047415376,0.00013984716,0.0032329038,0.0002769674,0.00003908368,0.0007679098,0.0004450541,0.23916249,0.05172132,0.45807382,0.0054524,0.24021405],"study_design_scores_gemma":[0.000062689534,0.00014655283,0.0006017945,0.000034446493,0.00002865634,0.00033013345,0.000055790413,0.8780716,0.006202891,0.103741825,0.010695325,0.000028300934],"about_ca_topic_score_codex":0.0010056994,"about_ca_topic_score_gemma":0.0010670496,"teacher_disagreement_score":0.0010056994,"about_ca_system_score_codex":0.0003539857,"about_ca_system_score_gemma":0.0005061272,"threshold_uncertainty_score":0.0039393306},"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":"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.026190428,0.00039116864,0.96899384,0.00012809441,0.0001028516,0.00008569291,0.00003546932,0.00058113725,0.0034913544],"genre_scores_gemma":[0.20857145,0.00041023002,0.7860959,0.00012144697,0.00013554735,0.000086646534,0.00009007553,0.00002978003,0.004458935],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99978477,0.000034709592,0.000013165146,0.000036547917,0.000110793946,0.000020030158],"domain_scores_gemma":[0.99983776,0.00004953323,0.000027529091,0.00003373102,0.000040684467,0.000010763063],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001648806,0.00045713285,0.00036173713,0.00035201432,0.00028591236,0.00036706324,0.00055026746,0.00046183626,0.001995911],"category_scores_gemma":[0.0004398899,0.00019610036,0.00033352352,0.00042303343,0.00019382041,0.0005818687,0.00029568607,0.00045267798,0.00080238405],"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.00020401101,0.000114193084,0.0009084744,0.00022217171,0.000040148323,0.0003986643,0.000084516716,0.007789038,0.51983017,0.009980061,0.001726335,0.45870224],"study_design_scores_gemma":[0.000198501,0.0019782493,0.0036537962,0.00006420919,0.00014514945,0.006110548,0.000053597956,0.41861194,0.5139147,0.0037539552,0.051422253,0.000093127965],"about_ca_topic_score_codex":0.00028663673,"about_ca_topic_score_gemma":0.0006307088,"teacher_disagreement_score":0.001995911,"about_ca_system_score_codex":0.00020095108,"about_ca_system_score_gemma":0.00038949764,"threshold_uncertainty_score":0.0066770315},"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":"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.027003793,0.00032212367,0.9681008,0.00015286851,0.00006630145,0.00013905593,0.00006382019,0.001976341,0.0021749],"genre_scores_gemma":[0.6120369,0.00019702036,0.38329703,0.00025978364,0.00006865844,0.00033512787,0.00027113897,0.00019700869,0.0033374433],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99924004,0.00029361423,0.000054452525,0.00010245383,0.00025886687,0.00005062713],"domain_scores_gemma":[0.9980102,0.0009643414,0.0002729726,0.00038917255,0.0003157006,0.000047672755],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005841578,0.00048474837,0.00027380727,0.0005558154,0.00018688713,0.00033484984,0.00094675226,0.0004755759,0.0031684237],"category_scores_gemma":[0.003017496,0.00015525214,0.00024628922,0.00040950443,0.0005125524,0.0008367151,0.00038808092,0.00063118746,0.00062937575],"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.00061369874,0.0002203241,0.0024254923,0.0007114734,0.000058353577,0.00071324105,0.00016205217,0.06706816,0.16798176,0.10882809,0.0061884425,0.64502895],"study_design_scores_gemma":[0.0002337978,0.0017065036,0.0024774522,0.00009950449,0.000064891916,0.002425767,0.000039683753,0.57893145,0.32106045,0.0586319,0.034253698,0.000074940785],"about_ca_topic_score_codex":0.0001315497,"about_ca_topic_score_gemma":0.0002413163,"teacher_disagreement_score":0.0031684237,"about_ca_system_score_codex":0.00029341786,"about_ca_system_score_gemma":0.00027592367,"threshold_uncertainty_score":0.010599494},"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":"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.40966728,0.00045211118,0.5783625,0.00037069365,0.000087773056,0.00029021862,0.00081892917,0.0033604042,0.0065900087],"genre_scores_gemma":[0.923036,0.00023640375,0.07403258,0.000035482233,0.00003154856,0.00008914083,0.00075449195,0.00010437035,0.0016799306],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99821186,0.00045298762,0.00010659666,0.00045360666,0.00060283917,0.0001721324],"domain_scores_gemma":[0.9936865,0.0019853257,0.0010667837,0.0019514461,0.0009815565,0.00032834566],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010407532,0.00067334675,0.0006895468,0.0030885963,0.0007972057,0.0017212059,0.0007698921,0.00092858175,0.0018405636],"category_scores_gemma":[0.009028552,0.00034078475,0.0003324147,0.0024654076,0.00046360787,0.0033158232,0.0015515042,0.0009827014,0.0009140443],"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.0007743846,0.00047643256,0.1292162,0.00033826166,0.00018718888,0.0012714976,0.0016114907,0.30476052,0.044477645,0.031658016,0.007082332,0.47814614],"study_design_scores_gemma":[0.000020040172,0.00013761414,0.011401076,0.000050937102,0.00003493002,0.0010910365,0.0003357325,0.94053024,0.015610087,0.023602074,0.0071333456,0.000052896892],"about_ca_topic_score_codex":0.0011366312,"about_ca_topic_score_gemma":0.0013861444,"teacher_disagreement_score":0.0030885963,"about_ca_system_score_codex":0.0005084305,"about_ca_system_score_gemma":0.00058702636,"threshold_uncertainty_score":0.006157279},"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":"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.03317521,0.0054400815,0.93650323,0.0011880882,0.0005391647,0.000061862134,0.000033052213,0.00031132807,0.022747885],"genre_scores_gemma":[0.9205982,0.004645718,0.06814769,0.00035257096,0.0005860571,0.0001431865,0.000033580032,0.00003010749,0.0054629236],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99972266,0.000074134805,0.000007608385,0.000036439433,0.0001124046,0.000046710957],"domain_scores_gemma":[0.99933666,0.0004060337,0.000064617765,0.000066013825,0.000077829296,0.00004893595],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000513104,0.00037816662,0.00035799626,0.00038439137,0.00052039104,0.0012297502,0.00074420194,0.0005386388,0.0011277249],"category_scores_gemma":[0.0017967382,0.00016691646,0.00020401883,0.00046560925,0.0010932913,0.0015737759,0.0010491702,0.0007705479,0.00015870959],"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.00007668469,0.00005969249,0.0008619973,0.00026849777,0.00007903311,0.00061599026,0.00033801753,0.24476163,0.00925294,0.6463489,0.0053287297,0.09200783],"study_design_scores_gemma":[0.000030350167,0.00006472369,0.00045344353,0.00003271461,0.000027255732,0.00027658598,0.000103649734,0.62645555,0.0013691849,0.3526934,0.018463878,0.000029288494],"about_ca_topic_score_codex":0.0011306949,"about_ca_topic_score_gemma":0.0009213506,"teacher_disagreement_score":0.0012297502,"about_ca_system_score_codex":0.00050088606,"about_ca_system_score_gemma":0.00036547624,"threshold_uncertainty_score":0.0037726164},"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":"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.08308923,0.0005652465,0.90874857,0.00027149008,0.0002393708,0.00019281698,0.00014603266,0.0011941997,0.0055530337],"genre_scores_gemma":[0.6972011,0.00033650032,0.29501626,0.00017153799,0.0000921005,0.00018851428,0.00023924439,0.000053386553,0.006701445],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99947387,0.00010972727,0.00006060952,0.00006496893,0.0002258871,0.00006494402],"domain_scores_gemma":[0.999263,0.00017431723,0.000120038305,0.00020616008,0.00019354299,0.00004291157],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041753764,0.00040973502,0.00050163525,0.0009005539,0.0006433673,0.0007149098,0.00083969755,0.0005116491,0.0023088842],"category_scores_gemma":[0.001423443,0.00013180159,0.00035114455,0.00071223144,0.0005197003,0.0014079082,0.00097392086,0.0005163156,0.00049266085],"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.0021368312,0.00017162478,0.0015608257,0.00041602194,0.00011560139,0.00058147137,0.00046810886,0.10628273,0.19513385,0.19038449,0.008031807,0.4947166],"study_design_scores_gemma":[0.00026205898,0.0008568128,0.0007402609,0.000063601066,0.00009546758,0.000917198,0.00007446547,0.7801059,0.14606468,0.045574155,0.02514985,0.000095494725],"about_ca_topic_score_codex":0.000582158,"about_ca_topic_score_gemma":0.0006877256,"teacher_disagreement_score":0.0023088842,"about_ca_system_score_codex":0.0007421595,"about_ca_system_score_gemma":0.00076024735,"threshold_uncertainty_score":0.007723987},"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":"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.8206865,0.0027579737,0.1535658,0.0005792945,0.000091536975,0.000060315073,0.00034362412,0.00046409437,0.021450734],"genre_scores_gemma":[0.9946754,0.0004019106,0.003271991,0.00003827631,0.000020996202,0.000012929181,0.00008740129,0.000021517515,0.0014696667],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984933,0.00037017977,0.000031629184,0.00013927223,0.00066785683,0.00029763253],"domain_scores_gemma":[0.9939884,0.0038973107,0.0004590473,0.00026302887,0.0012812141,0.000110948844],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015340464,0.00070718897,0.0004947348,0.0008415005,0.00052962056,0.0010011814,0.00054796087,0.0006908295,0.0021074254],"category_scores_gemma":[0.0054419404,0.00024384238,0.00027941464,0.0008030771,0.0010098774,0.0007235524,0.0006950142,0.00071310764,0.00036375943],"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.0010770732,0.00013415077,0.0051422105,0.00016722328,0.00007748443,0.0003927529,0.00018461482,0.90947735,0.039283615,0.020147245,0.0010657621,0.022850532],"study_design_scores_gemma":[0.000008688841,0.00013202656,0.0012948707,0.00000820947,0.000015092342,0.000106187035,0.000031332358,0.9903349,0.0069600185,0.000853282,0.0002338851,0.000021488318],"about_ca_topic_score_codex":0.00746455,"about_ca_topic_score_gemma":0.0036068284,"teacher_disagreement_score":0.00746455,"about_ca_system_score_codex":0.0017362136,"about_ca_system_score_gemma":0.0011798958,"threshold_uncertainty_score":0.014842212},"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":"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.96957046,0.00015003284,0.018565407,0.00014778656,0.000033639688,0.000062754494,0.0004331576,0.00041839422,0.010618387],"genre_scores_gemma":[0.996498,0.0000663798,0.0021148836,0.00001673029,0.000003212586,0.000038551054,0.00012916501,0.0000139678195,0.0011190225],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997452,0.000094667674,0.000009908647,0.0000275812,0.000053576063,0.000069084024],"domain_scores_gemma":[0.99808574,0.0014100701,0.00010486145,0.000096716736,0.00022596306,0.00007669377],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004202093,0.0003876409,0.0005286623,0.00043088783,0.00037901185,0.00038761226,0.0006890085,0.00058173446,0.0017022516],"category_scores_gemma":[0.0016759409,0.00017601793,0.00036739654,0.00061570155,0.00039242223,0.0005404565,0.00034634507,0.0004329182,0.00015679807],"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.00015285435,0.00009894011,0.0029557785,0.000056467627,0.00001943429,0.00011731033,0.0001033177,0.9899997,0.0020109667,0.0012494995,0.00043280472,0.0028028232],"study_design_scores_gemma":[0.000008721897,0.000074733114,0.00067649875,0.0000032245796,0.0000062017675,0.00001874573,0.00002759833,0.99786204,0.0009896975,0.00011822146,0.00020902393,0.0000051867346],"about_ca_topic_score_codex":0.007442178,"about_ca_topic_score_gemma":0.0038510202,"teacher_disagreement_score":0.007442178,"about_ca_system_score_codex":0.0005370337,"about_ca_system_score_gemma":0.00045971063,"threshold_uncertainty_score":0.0147976875},"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":"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.06563527,0.0022083288,0.92549723,0.00037270473,0.000253212,0.0002174044,0.00032904503,0.0013833023,0.0041035484],"genre_scores_gemma":[0.7409982,0.001398885,0.25091773,0.00026602193,0.0006165725,0.00020546054,0.00075282896,0.00009121205,0.0047531817],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959538,0.0011572181,0.0002960494,0.0011150604,0.0012788974,0.00019894174],"domain_scores_gemma":[0.989599,0.006415411,0.0006275225,0.0014523338,0.0016493706,0.0002564607],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039805984,0.0011735231,0.0026887166,0.004010211,0.0010803348,0.001614903,0.0024906618,0.0017127801,0.001570671],"category_scores_gemma":[0.015500403,0.0006183756,0.0015532604,0.0038614096,0.0006727374,0.0025604835,0.0009373641,0.0013593407,0.0010236786],"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.0009772326,0.0008384802,0.027645893,0.0004929652,0.0010282247,0.0006111363,0.0008360344,0.1659081,0.021218121,0.01293954,0.0102938,0.75721055],"study_design_scores_gemma":[0.000049061582,0.00015234537,0.005216959,0.00002290868,0.00019960917,0.00042666355,0.000047887104,0.9821133,0.0029193377,0.006267985,0.0025167537,0.00006717989],"about_ca_topic_score_codex":0.011198066,"about_ca_topic_score_gemma":0.012577443,"teacher_disagreement_score":0.011198066,"about_ca_system_score_codex":0.0011152086,"about_ca_system_score_gemma":0.00077533076,"threshold_uncertainty_score":0.022265792},"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":"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.04192923,0.061991714,0.8223409,0.011312137,0.002045374,0.00042592472,0.0005002335,0.00031596093,0.059138585],"genre_scores_gemma":[0.7603332,0.08952418,0.122244135,0.0024353452,0.0069721797,0.0014944769,0.00070740137,0.00016388569,0.01612517],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99713564,0.0015852543,0.00011330728,0.00039846046,0.0005649421,0.00020237982],"domain_scores_gemma":[0.9860275,0.01191115,0.00082643493,0.00042562085,0.00048730287,0.0003219524],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002636847,0.0015062992,0.0017116603,0.0036223256,0.0018690395,0.0031180691,0.001740876,0.0025106526,0.003134152],"category_scores_gemma":[0.010964778,0.0006127032,0.0010559849,0.0044021397,0.00390225,0.005836908,0.0027824328,0.0029082114,0.00048407813],"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.00006233586,0.00007738781,0.0016290417,0.0006114403,0.00012407504,0.00056427607,0.00051431014,0.097396225,0.000925549,0.85748214,0.006729738,0.03388349],"study_design_scores_gemma":[0.000032111864,0.000110388704,0.0010135296,0.00025028727,0.000055212065,0.000493369,0.00020048567,0.26153386,0.0003070558,0.7075079,0.028428782,0.0000669662],"about_ca_topic_score_codex":0.0021376263,"about_ca_topic_score_gemma":0.001698348,"teacher_disagreement_score":0.0036223256,"about_ca_system_score_codex":0.0025070237,"about_ca_system_score_gemma":0.00081891584,"threshold_uncertainty_score":0.018189847},"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":"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.019055197,0.0006279163,0.9768454,0.00020347147,0.000038177855,0.00005329138,0.00003629522,0.000095655814,0.0030444935],"genre_scores_gemma":[0.77611905,0.00051397295,0.21829423,0.00021085472,0.00009149522,0.00027289882,0.00009380576,0.00008109235,0.004322668],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992207,0.0004125456,0.00002324311,0.000094317824,0.00016671067,0.0000824274],"domain_scores_gemma":[0.99909854,0.0006301991,0.00012077428,0.000032143435,0.00008214974,0.00003614742],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013732989,0.0010295552,0.0013329948,0.0006128933,0.00048396323,0.00092939514,0.0013639488,0.0013134361,0.001332699],"category_scores_gemma":[0.0021604092,0.0004955539,0.00055353396,0.0007916579,0.0007745646,0.00089618156,0.0010304035,0.00070890423,0.00021180314],"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.000023367444,0.000020832747,0.00010925264,0.000046357418,0.00002321376,0.000038458304,0.000014789685,0.9900474,0.00042302522,0.0023113822,0.00022876641,0.006713186],"study_design_scores_gemma":[0.000006539223,0.000020624191,0.000051616786,0.000003598623,0.000003497381,0.000010288633,0.0000058208884,0.99790657,0.00011791325,0.0016643713,0.00020664246,0.0000026235498],"about_ca_topic_score_codex":0.002547612,"about_ca_topic_score_gemma":0.0019205359,"teacher_disagreement_score":0.002547612,"about_ca_system_score_codex":0.0008173851,"about_ca_system_score_gemma":0.00080438436,"threshold_uncertainty_score":0.007262826},"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":"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.77652985,0.021916647,0.16821906,0.0010546979,0.0012372709,0.00046598315,0.0012329328,0.003315436,0.026028093],"genre_scores_gemma":[0.983549,0.0013810594,0.013638525,0.000042360767,0.00010309882,0.00010166076,0.00049942394,0.00008162184,0.00060337014],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99280435,0.0023326762,0.000618248,0.00064642745,0.002824154,0.0007741555],"domain_scores_gemma":[0.9772495,0.013646669,0.0011374839,0.0014505677,0.006034141,0.00048166714],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007468617,0.0012000981,0.0014841569,0.004933271,0.001106925,0.0018679315,0.0017685994,0.0014347279,0.0012291061],"category_scores_gemma":[0.022980861,0.00028212255,0.00066141057,0.0037174341,0.0008173723,0.002410748,0.000923054,0.0008860902,0.00021689263],"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.0021848644,0.00061948074,0.011559872,0.00083981844,0.0005390931,0.00018912257,0.00025294826,0.80447274,0.0076357536,0.01626477,0.005501926,0.14993967],"study_design_scores_gemma":[0.000060988754,0.0005802934,0.0043272777,0.00003638195,0.000108122425,0.00014366659,0.00009675519,0.9861537,0.0046666367,0.0024941287,0.0012858193,0.000046265683],"about_ca_topic_score_codex":0.0030105524,"about_ca_topic_score_gemma":0.00134632,"teacher_disagreement_score":0.007468617,"about_ca_system_score_codex":0.0025508397,"about_ca_system_score_gemma":0.0014736784,"threshold_uncertainty_score":0.03949827},"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":"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.72598743,0.008310422,0.14713377,0.0015949392,0.0009695176,0.0012784062,0.0016226543,0.017287225,0.095815614],"genre_scores_gemma":[0.85685533,0.0018764924,0.1275226,0.00032167253,0.00007505358,0.0004953782,0.002140336,0.002087146,0.008625928],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99607,0.0015004154,0.00024624742,0.000476116,0.0012239588,0.0004832122],"domain_scores_gemma":[0.9913195,0.0045745363,0.00060425786,0.0011682516,0.0016131855,0.0007202897],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0067541064,0.0009020984,0.00058649224,0.0012479775,0.00094126124,0.0020250413,0.001743202,0.00072940567,0.002848807],"category_scores_gemma":[0.014600124,0.00045756187,0.0006452663,0.0009843174,0.00101336,0.0037991686,0.001975841,0.0013457328,0.00073191413],"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.015668293,0.0031038106,0.033783622,0.005252823,0.0005969515,0.00035907124,0.0047520627,0.10721211,0.023860577,0.14621887,0.046063974,0.613128],"study_design_scores_gemma":[0.0023304163,0.008373745,0.04991969,0.0011859812,0.00074530597,0.00097486534,0.0037851417,0.59869236,0.03383684,0.053740706,0.24593626,0.0004786531],"about_ca_topic_score_codex":0.007754066,"about_ca_topic_score_gemma":0.009468364,"teacher_disagreement_score":0.007754066,"about_ca_system_score_codex":0.0015448314,"about_ca_system_score_gemma":0.0020811677,"threshold_uncertainty_score":0.035719514},"labels":[],"label_agreement":null}]}